default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKenjiro Takazawa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Fuga Kiyosue, Kenjiro Takazawa:
A common generalization of budget games and congestion games. J. Comb. Optim. 48(3): 24 (2024)- [j25]Yukiya Hatajima, Kenjiro Takazawa:
A note on upgrading the min-max weight of a base of a matroid. JSIAM Lett. 16: 1-4 (2024) - [c16]Kenjiro Takazawa:
Pure Nash Equilibria in Weighted Congestion Games with Complementarities and Beyond. AAMAS 2024: 2495-2497 - [c15]Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa:
Finding a Maximum Restricted t-Matching via Boolean Edge-CSP. ESA 2024: 75:1-75:15 - [i14]Kenjiro Takazawa:
Pure Nash Equilibria in Weighted Congestion Games with Complementarities and Beyond. CoRR abs/2401.03861 (2024) - [i13]Gergely Csáji, Tamás Király, Kenjiro Takazawa, Yu Yokoi:
Popular Maximum-Utility Matchings with Matroid Constraints. CoRR abs/2407.09798 (2024) - [i12]Kenjiro Takazawa:
A Unified Model of Congestion Games with Priorities: Two-Sided Markets with Ties, Finite and Non-Affine Delay Functions, and Pure Nash Equilibria. CoRR abs/2407.12300 (2024) - 2023
- [j24]Kenjiro Takazawa
:
An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint. Oper. Res. Lett. 51(2): 128-132 (2023) - [j23]Kei Natsui, Kenjiro Takazawa:
Finding popular branchings in vertex-weighted directed graphs. Theor. Comput. Sci. 953: 113799 (2023) - [i11]Yuga Kanaya, Kenjiro Takazawa:
A Faster Deterministic Approximation Algorithm for TTP-2. CoRR abs/2310.02592 (2023) - [i10]Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa:
Finding a Maximum Restricted t-Matching via Boolean Edge-CSP. CoRR abs/2310.20245 (2023) - 2022
- [j22]Magnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa:
Posimodular Function Optimization. Algorithmica 84(4): 1107-1131 (2022) - [j21]Kenjiro Takazawa:
Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [j20]Satoru Fujishige, Tamás Király, Kazuhisa Makino, Kenjiro Takazawa, Shin-ichi Tanigawa:
Minimizing submodular functions on diamonds via generalized fractional matroid matchings. J. Comb. Theory B 157: 294-345 (2022) - [j19]Yuni Iwamasa, Kenjiro Takazawa:
Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications. Math. Program. 194(1): 229-256 (2022) - [j18]Kenjiro Takazawa:
The b-bibranching problem: TDI system, packing, and discrete convexity. Networks 79(1): 32-46 (2022) - [j17]Shiori Matsuura, Kenjiro Takazawa:
An improved heuristic algorithm for the maximum benefit Chinese postman problem. RAIRO Oper. Res. 56(3): 1283-1291 (2022) - [j16]Kenjiro Takazawa:
Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids. SIAM J. Discret. Math. 36(1): 702-727 (2022) - [c14]Fuga Kiyosue, Kenjiro Takazawa:
A Common Generalization of Budget Games and Congestion Games. SAGT 2022: 258-274 - [c13]Kei Natsui, Kenjiro Takazawa:
Finding Popular Branchings in Vertex-Weighted Digraphs. WALCOM 2022: 303-314 - 2021
- [i9]Kei Natsui, Kenjiro Takazawa:
Finding popular branchings in vertex-weighted digraphs. CoRR abs/2110.03460 (2021) - 2020
- [j15]Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa:
The b-branching problem in digraphs. Discret. Appl. Math. 283: 565-576 (2020) - [c12]Kenjiro Takazawa:
Notes on Equitable Partitions into Matching Forests in Mixed Graphs and b-branchings in Digraphs. ISCO 2020: 214-224 - [c11]Yuni Iwamasa, Kenjiro Takazawa:
Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications. TAMC 2020: 156-167 - [i8]Yuni Iwamasa, Kenjiro Takazawa:
Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications. CoRR abs/2003.02424 (2020) - [i7]Kenjiro Takazawa:
Notes on Equitable Partition into Matching Forests in Mixed Graphs and into b-branchings in Digraphs. CoRR abs/2003.10774 (2020)
2010 – 2019
- 2019
- [j14]Kenjiro Takazawa, Yu Yokoi:
A generalized-polymatroid approach to disjoint common independent sets in two matroids. Discret. Math. 342(7): 2002-2011 (2019) - [j13]Kenjiro Takazawa:
Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function. J. Comb. Optim. 38(4): 1043-1065 (2019) - [c10]Kenjiro Takazawa:
Generalizations of Weighted Matroid Congestion Games: Pure Nash Equilibrium, Sensitivity Analysis, and Discrete Convex Function. TAMC 2019: 594-614 - [i6]Satoru Fujishige, Kenjiro Takazawa, Yu Yokoi:
A Note on a Nearly Uniform Partition into Common Independent Sets of Two Matroids. CoRR abs/1909.13261 (2019) - 2018
- [c9]Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa:
The b-Branching Problem in Digraphs. MFCS 2018: 12:1-12:15 - [i5]Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa:
The b-branching problem in digraphs. CoRR abs/1802.02381 (2018) - [i4]Kenjiro Takazawa:
The b-bibranching Problem: TDI System, Packing, and Discrete Convexity. CoRR abs/1802.03235 (2018) - [i3]Kenjiro Takazawa:
M-convexity of the minimum-cost packings of arborescences. CoRR abs/1805.08381 (2018) - 2017
- [j12]Kenjiro Takazawa:
Decomposition theorems for square-free 2-matchings in bipartite graphs. Discret. Appl. Math. 233: 215-223 (2017) - [j11]Kenjiro Takazawa:
Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs. Discret. Optim. 26: 26-40 (2017) - [j10]Yusuke Kobayashi, Kenjiro Takazawa:
Randomized strategies for cardinality robustness in the knapsack problem. Theor. Comput. Sci. 699: 53-62 (2017) - [c8]Kenjiro Takazawa:
Excluded t-Factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-Matchings. IPCO 2017: 430-441 - [c7]Magnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa:
Posimodular Function Optimization. WADS 2017: 437-448 - [i2]Kazuo Murota, Kenjiro Takazawa:
Relationship of Two Formulations for Shortest Bibranchings. CoRR abs/1706.02029 (2017) - [i1]Kenjiro Takazawa:
Excluded t-factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-matchings, and Matroids. CoRR abs/1708.00582 (2017) - 2016
- [j9]Kenjiro Takazawa:
A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs. Inf. Process. Lett. 116(9): 550-553 (2016) - [c6]Yusuke Kobayashi, Kenjiro Takazawa:
Randomized Strategies for Cardinality Robustness in the Knapsack Problem. ANALCO 2016: 25-33 - [c5]Kenjiro Takazawa:
Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs. MFCS 2016: 87:1-87:14 - 2015
- [c4]Kenjiro Takazawa:
Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs. WG 2015: 373-387 - 2014
- [j8]Kenjiro Takazawa:
Optimal Matching Forests and Valuated Delta-Matroids. SIAM J. Discret. Math. 28(1): 445-467 (2014) - 2013
- [j7]Sylvia C. Boyd, Satoru Iwata, Kenjiro Takazawa:
Finding 2-Factors Closer to TSP Tours in Cubic Graphs. SIAM J. Discret. Math. 27(2): 918-939 (2013) - 2012
- [j6]Yusuke Kobayashi, Jácint Szabó, Kenjiro Takazawa:
A proof of Cunningham's conjecture on restricted subgraphs and jump systems. J. Comb. Theory B 102(4): 948-966 (2012) - [j5]Kenjiro Takazawa:
A weighted independent even factor algorithm. Math. Program. 132(1-2): 261-276 (2012) - 2011
- [c3]Kenjiro Takazawa:
Optimal Matching Forests and Valuated Delta-Matroids. IPCO 2011: 404-416
2000 – 2009
- 2009
- [j4]Yusuke Kobayashi, Kenjiro Takazawa:
Even factors, jump systems, and discrete convexity. J. Comb. Theory B 99(1): 139-161 (2009) - [j3]Kenjiro Takazawa:
A Weighted kt, t-Free t-Factor Algorithm for Bipartite Graphs. Math. Oper. Res. 34(2): 351-362 (2009) - 2008
- [j2]Kenjiro Takazawa:
A weighted even factor algorithm. Math. Program. 115(2): 223-237 (2008) - [j1]Satoru Iwata, Kenjiro Takazawa:
The Independent Even Factor Problem. SIAM J. Discret. Math. 22(4): 1411-1427 (2008) - [c2]Kenjiro Takazawa:
A Weighted Kt, t-Free t-Factor Algorithm for Bipartite Graphs. IPCO 2008: 62-76 - 2007
- [c1]Satoru Iwata, Kenjiro Takazawa:
The independent even factor problem. SODA 2007: 1171-1180
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 20:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
