Остановите войну!
for scientists:
default search action
Kenjiro Takazawa
- > Home > Persons > Kenjiro Takazawa
Publications
- 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) - [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, Ser. 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) - 2020
- [j15]Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa:
The b-branching problem in digraphs. Discret. Appl. Math. 283: 565-576 (2020) - [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) - 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) - [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) - 2017
- [j10]Yusuke Kobayashi, Kenjiro Takazawa:
Randomized strategies for cardinality robustness in the knapsack problem. Theor. Comput. Sci. 699: 53-62 (2017) - [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) - 2016
- [c6]Yusuke Kobayashi, Kenjiro Takazawa:
Randomized Strategies for Cardinality Robustness in the Knapsack Problem. ANALCO 2016: 25-33 - 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, Ser. B 102(4): 948-966 (2012) - 2009
- [j4]Yusuke Kobayashi, Kenjiro Takazawa:
Even factors, jump systems, and discrete convexity. J. Comb. Theory, Ser. B 99(1): 139-161 (2009) - 2008
- [j1]Satoru Iwata, Kenjiro Takazawa:
The Independent Even Factor Problem. SIAM J. Discret. Math. 22(4): 1411-1427 (2008) - 2007
- [c1]Satoru Iwata, Kenjiro Takazawa:
The independent even factor problem. SODA 2007: 1171-1180
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-02-19 20:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint