BibTeX records: Kenjiro Takazawa

download as .bib file

@article{DBLP:journals/jsiaml/HatajimaT24,
  author       = {Yukiya Hatajima and
                  Kenjiro Takazawa},
  title        = {A note on upgrading the min-max weight of a base of a matroid},
  journal      = {{JSIAM} Lett.},
  volume       = {16},
  pages        = {1--4},
  year         = {2024},
  url          = {https://doi.org/10.14495/jsiaml.16.1},
  doi          = {10.14495/JSIAML.16.1},
  timestamp    = {Sun, 18 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jsiaml/HatajimaT24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-03861,
  author       = {Kenjiro Takazawa},
  title        = {Pure Nash Equilibria in Weighted Congestion Games with Complementarities
                  and Beyond},
  journal      = {CoRR},
  volume       = {abs/2401.03861},
  year         = {2024},
  url          = {https://doi.org/10.48550/arXiv.2401.03861},
  doi          = {10.48550/ARXIV.2401.03861},
  eprinttype    = {arXiv},
  eprint       = {2401.03861},
  timestamp    = {Wed, 24 Jan 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2401-03861.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Takazawa23,
  author       = {Kenjiro Takazawa},
  title        = {An efficient algorithm for minimizing M-convex functions under a color-induced
                  budget constraint},
  journal      = {Oper. Res. Lett.},
  volume       = {51},
  number       = {2},
  pages        = {128--132},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.orl.2023.01.003},
  doi          = {10.1016/J.ORL.2023.01.003},
  timestamp    = {Sat, 11 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/orl/Takazawa23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NatsuiT23,
  author       = {Kei Natsui and
                  Kenjiro Takazawa},
  title        = {Finding popular branchings in vertex-weighted directed graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {953},
  pages        = {113799},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.tcs.2023.113799},
  doi          = {10.1016/J.TCS.2023.113799},
  timestamp    = {Sat, 25 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/NatsuiT23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-02592,
  author       = {Yuga Kanaya and
                  Kenjiro Takazawa},
  title        = {A Faster Deterministic Approximation Algorithm for {TTP-2}},
  journal      = {CoRR},
  volume       = {abs/2310.02592},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2310.02592},
  doi          = {10.48550/ARXIV.2310.02592},
  eprinttype    = {arXiv},
  eprint       = {2310.02592},
  timestamp    = {Thu, 19 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2310-02592.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-20245,
  author       = {Yuni Iwamasa and
                  Yusuke Kobayashi and
                  Kenjiro Takazawa},
  title        = {Finding a Maximum Restricted t-Matching via Boolean Edge-CSP},
  journal      = {CoRR},
  volume       = {abs/2310.20245},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2310.20245},
  doi          = {10.48550/ARXIV.2310.20245},
  eprinttype    = {arXiv},
  eprint       = {2310.20245},
  timestamp    = {Fri, 03 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2310-20245.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HalldorssonIMT22,
  author       = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
                  Toshimasa Ishii and
                  Kazuhisa Makino and
                  Kenjiro Takazawa},
  title        = {Posimodular Function Optimization},
  journal      = {Algorithmica},
  volume       = {84},
  number       = {4},
  pages        = {1107--1131},
  year         = {2022},
  url          = {https://doi.org/10.1007/s00453-021-00910-y},
  doi          = {10.1007/S00453-021-00910-Y},
  timestamp    = {Fri, 01 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/HalldorssonIMT22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/Takazawa22,
  author       = {Kenjiro Takazawa},
  title        = {Notes on Equitable Partitions into Matching Forests in Mixed Graphs
                  and into {\textdollar}b{\textdollar}-branchings in Digraphs},
  journal      = {Discret. Math. Theor. Comput. Sci.},
  volume       = {24},
  number       = {1},
  year         = {2022},
  url          = {https://doi.org/10.46298/dmtcs.8719},
  doi          = {10.46298/DMTCS.8719},
  timestamp    = {Tue, 24 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dmtcs/Takazawa22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/FujishigeKMTT22,
  author       = {Satoru Fujishige and
                  Tam{\'{a}}s Kir{\'{a}}ly and
                  Kazuhisa Makino and
                  Kenjiro Takazawa and
                  Shin{-}ichi Tanigawa},
  title        = {Minimizing submodular functions on diamonds via generalized fractional
                  matroid matchings},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {157},
  pages        = {294--345},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.jctb.2022.07.005},
  doi          = {10.1016/J.JCTB.2022.07.005},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jctb/FujishigeKMTT22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/IwamasaT22,
  author       = {Yuni Iwamasa and
                  Kenjiro Takazawa},
  title        = {Optimal matroid bases with intersection constraints: valuated matroids,
                  M-convex functions, and their applications},
  journal      = {Math. Program.},
  volume       = {194},
  number       = {1},
  pages        = {229--256},
  year         = {2022},
  url          = {https://doi.org/10.1007/s10107-021-01625-2},
  doi          = {10.1007/S10107-021-01625-2},
  timestamp    = {Mon, 25 Jul 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/IwamasaT22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Takazawa22,
  author       = {Kenjiro Takazawa},
  title        = {The b-bibranching problem: {TDI} system, packing, and discrete convexity},
  journal      = {Networks},
  volume       = {79},
  number       = {1},
  pages        = {32--46},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22035},
  doi          = {10.1002/NET.22035},
  timestamp    = {Fri, 21 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/networks/Takazawa22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/MatsuuraT22,
  author       = {Shiori Matsuura and
                  Kenjiro Takazawa},
  title        = {An improved heuristic algorithm for the maximum benefit Chinese postman
                  problem},
  journal      = {{RAIRO} Oper. Res.},
  volume       = {56},
  number       = {3},
  pages        = {1283--1291},
  year         = {2022},
  url          = {https://doi.org/10.1051/ro/2022044},
  doi          = {10.1051/RO/2022044},
  timestamp    = {Thu, 22 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rairo/MatsuuraT22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Takazawa22,
  author       = {Kenjiro Takazawa},
  title        = {Excluded {\textdollar}t{\textdollar}-Factors in Bipartite Graphs:
                  Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings,
                  and Matroids},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {36},
  number       = {1},
  pages        = {702--727},
  year         = {2022},
  url          = {https://doi.org/10.1137/18m1176737},
  doi          = {10.1137/18M1176737},
  timestamp    = {Mon, 25 Jul 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/Takazawa22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/KiyosueT22,
  author       = {Fuga Kiyosue and
                  Kenjiro Takazawa},
  editor       = {Panagiotis Kanellopoulos and
                  Maria Kyropoulou and
                  Alexandros A. Voudouris},
  title        = {A Common Generalization of Budget Games and Congestion Games},
  booktitle    = {Algorithmic Game Theory - 15th International Symposium, {SAGT} 2022,
                  Colchester, UK, September 12-15, 2022, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {13584},
  pages        = {258--274},
  publisher    = {Springer},
  year         = {2022},
  url          = {https://doi.org/10.1007/978-3-031-15714-1\_15},
  doi          = {10.1007/978-3-031-15714-1\_15},
  timestamp    = {Thu, 22 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sagt/KiyosueT22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/NatsuiT22,
  author       = {Kei Natsui and
                  Kenjiro Takazawa},
  editor       = {Petra Mutzel and
                  Md. Saidur Rahman and
                  Slamin},
  title        = {Finding Popular Branchings in Vertex-Weighted Digraphs},
  booktitle    = {{WALCOM:} Algorithms and Computation - 16th International Conference
                  and Workshops, {WALCOM} 2022, Jember, Indonesia, March 24-26, 2022,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {13174},
  pages        = {303--314},
  publisher    = {Springer},
  year         = {2022},
  url          = {https://doi.org/10.1007/978-3-030-96731-4\_25},
  doi          = {10.1007/978-3-030-96731-4\_25},
  timestamp    = {Tue, 22 Mar 2022 13:01:32 +0100},
  biburl       = {https://dblp.org/rec/conf/walcom/NatsuiT22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-03460,
  author       = {Kei Natsui and
                  Kenjiro Takazawa},
  title        = {Finding popular branchings in vertex-weighted digraphs},
  journal      = {CoRR},
  volume       = {abs/2110.03460},
  year         = {2021},
  url          = {https://arxiv.org/abs/2110.03460},
  eprinttype    = {arXiv},
  eprint       = {2110.03460},
  timestamp    = {Mon, 25 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2110-03460.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KakimuraKT20,
  author       = {Naonori Kakimura and
                  Naoyuki Kamiyama and
                  Kenjiro Takazawa},
  title        = {The b-branching problem in digraphs},
  journal      = {Discret. Appl. Math.},
  volume       = {283},
  pages        = {565--576},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.dam.2020.02.005},
  doi          = {10.1016/J.DAM.2020.02.005},
  timestamp    = {Thu, 16 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/KakimuraKT20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/Takazawa20,
  author       = {Kenjiro Takazawa},
  editor       = {Mourad Ba{\"{\i}}ou and
                  Bernard Gendron and
                  Oktay G{\"{u}}nl{\"{u}}k and
                  Ali Ridha Mahjoub},
  title        = {Notes on Equitable Partitions into Matching Forests in Mixed Graphs
                  and b-branchings in Digraphs},
  booktitle    = {Combinatorial Optimization - 6th International Symposium, {ISCO} 2020,
                  Montreal, QC, Canada, May 4-6, 2020, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {12176},
  pages        = {214--224},
  publisher    = {Springer},
  year         = {2020},
  url          = {https://doi.org/10.1007/978-3-030-53262-8\_18},
  doi          = {10.1007/978-3-030-53262-8\_18},
  timestamp    = {Fri, 24 Jul 2020 12:52:45 +0200},
  biburl       = {https://dblp.org/rec/conf/iscopt/Takazawa20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/IwamasaT20,
  author       = {Yuni Iwamasa and
                  Kenjiro Takazawa},
  editor       = {Jianer Chen and
                  Qilong Feng and
                  Jinhui Xu},
  title        = {Optimal Matroid Bases with Intersection Constraints: Valuated Matroids,
                  M-convex Functions, and Their Applications},
  booktitle    = {Theory and Applications of Models of Computation, 16th International
                  Conference, {TAMC} 2020, Changsha, China, October 18-20, 2020, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12337},
  pages        = {156--167},
  publisher    = {Springer},
  year         = {2020},
  url          = {https://doi.org/10.1007/978-3-030-59267-7\_14},
  doi          = {10.1007/978-3-030-59267-7\_14},
  timestamp    = {Sat, 14 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/tamc/IwamasaT20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-02424,
  author       = {Yuni Iwamasa and
                  Kenjiro Takazawa},
  title        = {Optimal matroid bases with intersection constraints: Valuated matroids,
                  M-convex functions, and their applications},
  journal      = {CoRR},
  volume       = {abs/2003.02424},
  year         = {2020},
  url          = {https://arxiv.org/abs/2003.02424},
  eprinttype    = {arXiv},
  eprint       = {2003.02424},
  timestamp    = {Tue, 10 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2003-02424.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-10774,
  author       = {Kenjiro Takazawa},
  title        = {Notes on Equitable Partition into Matching Forests in Mixed Graphs
                  and into b-branchings in Digraphs},
  journal      = {CoRR},
  volume       = {abs/2003.10774},
  year         = {2020},
  url          = {https://arxiv.org/abs/2003.10774},
  eprinttype    = {arXiv},
  eprint       = {2003.10774},
  timestamp    = {Thu, 02 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2003-10774.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/TakazawaY19,
  author       = {Kenjiro Takazawa and
                  Yu Yokoi},
  title        = {A generalized-polymatroid approach to disjoint common independent
                  sets in two matroids},
  journal      = {Discret. Math.},
  volume       = {342},
  number       = {7},
  pages        = {2002--2011},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.disc.2019.03.009},
  doi          = {10.1016/J.DISC.2019.03.009},
  timestamp    = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/TakazawaY19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Takazawa19,
  author       = {Kenjiro Takazawa},
  title        = {Generalizations of weighted matroid congestion games: pure Nash equilibrium,
                  sensitivity analysis, and discrete convex function},
  journal      = {J. Comb. Optim.},
  volume       = {38},
  number       = {4},
  pages        = {1043--1065},
  year         = {2019},
  url          = {https://doi.org/10.1007/s10878-019-00435-9},
  doi          = {10.1007/S10878-019-00435-9},
  timestamp    = {Thu, 07 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jco/Takazawa19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/Takazawa19,
  author       = {Kenjiro Takazawa},
  editor       = {T. V. Gopal and
                  Junzo Watada},
  title        = {Generalizations of Weighted Matroid Congestion Games: Pure Nash Equilibrium,
                  Sensitivity Analysis, and Discrete Convex Function},
  booktitle    = {Theory and Applications of Models of Computation - 15th Annual Conference,
                  {TAMC} 2019, Kitakyushu, Japan, April 13-16, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11436},
  pages        = {594--614},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-14812-6\_37},
  doi          = {10.1007/978-3-030-14812-6\_37},
  timestamp    = {Fri, 31 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/tamc/Takazawa19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-13261,
  author       = {Satoru Fujishige and
                  Kenjiro Takazawa and
                  Yu Yokoi},
  title        = {A Note on a Nearly Uniform Partition into Common Independent Sets
                  of Two Matroids},
  journal      = {CoRR},
  volume       = {abs/1909.13261},
  year         = {2019},
  url          = {http://arxiv.org/abs/1909.13261},
  eprinttype    = {arXiv},
  eprint       = {1909.13261},
  timestamp    = {Wed, 02 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1909-13261.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KakimuraKT18,
  author       = {Naonori Kakimura and
                  Naoyuki Kamiyama and
                  Kenjiro Takazawa},
  editor       = {Igor Potapov and
                  Paul G. Spirakis and
                  James Worrell},
  title        = {The b-Branching Problem in Digraphs},
  booktitle    = {43rd International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series       = {LIPIcs},
  volume       = {117},
  pages        = {12:1--12:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2018.12},
  doi          = {10.4230/LIPICS.MFCS.2018.12},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/mfcs/KakimuraKT18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-02381,
  author       = {Naonori Kakimura and
                  Naoyuki Kamiyama and
                  Kenjiro Takazawa},
  title        = {The b-branching problem in digraphs},
  journal      = {CoRR},
  volume       = {abs/1802.02381},
  year         = {2018},
  url          = {http://arxiv.org/abs/1802.02381},
  eprinttype    = {arXiv},
  eprint       = {1802.02381},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1802-02381.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-03235,
  author       = {Kenjiro Takazawa},
  title        = {The b-bibranching Problem: {TDI} System, Packing, and Discrete Convexity},
  journal      = {CoRR},
  volume       = {abs/1802.03235},
  year         = {2018},
  url          = {http://arxiv.org/abs/1802.03235},
  eprinttype    = {arXiv},
  eprint       = {1802.03235},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1802-03235.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-08381,
  author       = {Kenjiro Takazawa},
  title        = {M-convexity of the minimum-cost packings of arborescences},
  journal      = {CoRR},
  volume       = {abs/1805.08381},
  year         = {2018},
  url          = {http://arxiv.org/abs/1805.08381},
  eprinttype    = {arXiv},
  eprint       = {1805.08381},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1805-08381.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Takazawa17,
  author       = {Kenjiro Takazawa},
  title        = {Decomposition theorems for square-free 2-matchings in bipartite graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {233},
  pages        = {215--223},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2017.07.035},
  doi          = {10.1016/J.DAM.2017.07.035},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/Takazawa17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/Takazawa17,
  author       = {Kenjiro Takazawa},
  title        = {Finding a maximum 2-matching excluding prescribed cycles in bipartite
                  graphs},
  journal      = {Discret. Optim.},
  volume       = {26},
  pages        = {26--40},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.disopt.2017.05.003},
  doi          = {10.1016/J.DISOPT.2017.05.003},
  timestamp    = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/Takazawa17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KobayashiT17,
  author       = {Yusuke Kobayashi and
                  Kenjiro Takazawa},
  title        = {Randomized strategies for cardinality robustness in the knapsack problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {699},
  pages        = {53--62},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.tcs.2016.12.019},
  doi          = {10.1016/J.TCS.2016.12.019},
  timestamp    = {Thu, 28 Dec 2017 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KobayashiT17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Takazawa17,
  author       = {Kenjiro Takazawa},
  editor       = {Friedrich Eisenbrand and
                  Jochen K{\"{o}}nemann},
  title        = {Excluded t-Factors in Bipartite Graphs: {A} Unified Framework for
                  Nonbipartite Matchings and Restricted 2-Matchings},
  booktitle    = {Integer Programming and Combinatorial Optimization - 19th International
                  Conference, {IPCO} 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10328},
  pages        = {430--441},
  publisher    = {Springer},
  year         = {2017},
  url          = {https://doi.org/10.1007/978-3-319-59250-3\_35},
  doi          = {10.1007/978-3-319-59250-3\_35},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/ipco/Takazawa17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/HalldorssonIMT17,
  author       = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
                  Toshimasa Ishii and
                  Kazuhisa Makino and
                  Kenjiro Takazawa},
  editor       = {Faith Ellen and
                  Antonina Kolokolova and
                  J{\"{o}}rg{-}R{\"{u}}diger Sack},
  title        = {Posimodular Function Optimization},
  booktitle    = {Algorithms and Data Structures - 15th International Symposium, {WADS}
                  2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10389},
  pages        = {437--448},
  publisher    = {Springer},
  year         = {2017},
  url          = {https://doi.org/10.1007/978-3-319-62127-2\_37},
  doi          = {10.1007/978-3-319-62127-2\_37},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/wads/HalldorssonIMT17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MurotaT17,
  author       = {Kazuo Murota and
                  Kenjiro Takazawa},
  title        = {Relationship of Two Formulations for Shortest Bibranchings},
  journal      = {CoRR},
  volume       = {abs/1706.02029},
  year         = {2017},
  url          = {http://arxiv.org/abs/1706.02029},
  eprinttype    = {arXiv},
  eprint       = {1706.02029},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/MurotaT17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-00582,
  author       = {Kenjiro Takazawa},
  title        = {Excluded t-factors in Bipartite Graphs: Unified Framework for Nonbipartite
                  Matchings, Restricted 2-matchings, and Matroids},
  journal      = {CoRR},
  volume       = {abs/1708.00582},
  year         = {2017},
  url          = {http://arxiv.org/abs/1708.00582},
  eprinttype    = {arXiv},
  eprint       = {1708.00582},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1708-00582.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Takazawa16,
  author       = {Kenjiro Takazawa},
  title        = {A 7/6-approximation algorithm for the minimum 2-edge connected subgraph
                  problem in bipartite cubic graphs},
  journal      = {Inf. Process. Lett.},
  volume       = {116},
  number       = {9},
  pages        = {550--553},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.ipl.2016.04.011},
  doi          = {10.1016/J.IPL.2016.04.011},
  timestamp    = {Thu, 28 Dec 2017 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ipl/Takazawa16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/0001T16,
  author       = {Yusuke Kobayashi and
                  Kenjiro Takazawa},
  editor       = {James Allen Fill and
                  Mark Daniel Ward},
  title        = {Randomized Strategies for Cardinality Robustness in the Knapsack Problem},
  booktitle    = {Proceedings of the Thirteenth Workshop on Analytic Algorithmics and
                  Combinatorics, {ANALCO} 2016, Arlington, Virginia, USA, January 11,
                  2016},
  pages        = {25--33},
  publisher    = {{SIAM}},
  year         = {2016},
  url          = {https://doi.org/10.1137/1.9781611974324.3},
  doi          = {10.1137/1.9781611974324.3},
  timestamp    = {Tue, 23 May 2017 01:10:31 +0200},
  biburl       = {https://dblp.org/rec/conf/analco/0001T16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Takazawa16,
  author       = {Kenjiro Takazawa},
  editor       = {Piotr Faliszewski and
                  Anca Muscholl and
                  Rolf Niedermeier},
  title        = {Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite
                  Graphs},
  booktitle    = {41st International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland},
  series       = {LIPIcs},
  volume       = {58},
  pages        = {87:1--87:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2016.87},
  doi          = {10.4230/LIPICS.MFCS.2016.87},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/mfcs/Takazawa16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Takazawa15,
  author       = {Kenjiro Takazawa},
  editor       = {Ernst W. Mayr},
  title        = {Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs},
  booktitle    = {Graph-Theoretic Concepts in Computer Science - 41st International
                  Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {9224},
  pages        = {373--387},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-53174-7\_27},
  doi          = {10.1007/978-3-662-53174-7\_27},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/Takazawa15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Takazawa14,
  author       = {Kenjiro Takazawa},
  title        = {Optimal Matching Forests and Valuated Delta-Matroids},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {28},
  number       = {1},
  pages        = {445--467},
  year         = {2014},
  url          = {https://doi.org/10.1137/110827661},
  doi          = {10.1137/110827661},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/Takazawa14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BoydIT13,
  author       = {Sylvia C. Boyd and
                  Satoru Iwata and
                  Kenjiro Takazawa},
  title        = {Finding 2-Factors Closer to {TSP} Tours in Cubic Graphs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {27},
  number       = {2},
  pages        = {918--939},
  year         = {2013},
  url          = {https://doi.org/10.1137/110843514},
  doi          = {10.1137/110843514},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/BoydIT13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KobayashiST12,
  author       = {Yusuke Kobayashi and
                  J{\'{a}}cint Szab{\'{o}} and
                  Kenjiro Takazawa},
  title        = {A proof of Cunningham's conjecture on restricted subgraphs and jump
                  systems},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {102},
  number       = {4},
  pages        = {948--966},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.jctb.2012.03.003},
  doi          = {10.1016/J.JCTB.2012.03.003},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/KobayashiST12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Takazawa12,
  author       = {Kenjiro Takazawa},
  title        = {A weighted independent even factor algorithm},
  journal      = {Math. Program.},
  volume       = {132},
  number       = {1-2},
  pages        = {261--276},
  year         = {2012},
  url          = {https://doi.org/10.1007/s10107-010-0397-z},
  doi          = {10.1007/S10107-010-0397-Z},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Takazawa12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Takazawa11,
  author       = {Kenjiro Takazawa},
  editor       = {Oktay G{\"{u}}nl{\"{u}}k and
                  Gerhard J. Woeginger},
  title        = {Optimal Matching Forests and Valuated Delta-Matroids},
  booktitle    = {Integer Programming and Combinatoral Optimization - 15th International
                  Conference, {IPCO} 2011, New York, NY, USA, June 15-17, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6655},
  pages        = {404--416},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-20807-2\_32},
  doi          = {10.1007/978-3-642-20807-2\_32},
  timestamp    = {Tue, 29 Dec 2020 18:40:14 +0100},
  biburl       = {https://dblp.org/rec/conf/ipco/Takazawa11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KobayashiT09,
  author       = {Yusuke Kobayashi and
                  Kenjiro Takazawa},
  title        = {Even factors, jump systems, and discrete convexity},
  journal      = {J. Comb. Theory, Ser. {B}},
  volume       = {99},
  number       = {1},
  pages        = {139--161},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.jctb.2008.05.001},
  doi          = {10.1016/J.JCTB.2008.05.001},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/KobayashiT09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Takazawa09,
  author       = {Kenjiro Takazawa},
  title        = {A Weighted \emph{k\({}_{\mbox{t, t}}\)}-Free \emph{t}-Factor Algorithm
                  for Bipartite Graphs},
  journal      = {Math. Oper. Res.},
  volume       = {34},
  number       = {2},
  pages        = {351--362},
  year         = {2009},
  url          = {https://doi.org/10.1287/moor.1080.0365},
  doi          = {10.1287/MOOR.1080.0365},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mor/Takazawa09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Takazawa08,
  author       = {Kenjiro Takazawa},
  title        = {A weighted even factor algorithm},
  journal      = {Math. Program.},
  volume       = {115},
  number       = {2},
  pages        = {223--237},
  year         = {2008},
  url          = {https://doi.org/10.1007/s10107-007-0154-0},
  doi          = {10.1007/S10107-007-0154-0},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mp/Takazawa08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/IwataT08,
  author       = {Satoru Iwata and
                  Kenjiro Takazawa},
  title        = {The Independent Even Factor Problem},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {22},
  number       = {4},
  pages        = {1411--1427},
  year         = {2008},
  url          = {https://doi.org/10.1137/060657066},
  doi          = {10.1137/060657066},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/IwataT08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Takazawa08,
  author       = {Kenjiro Takazawa},
  editor       = {Andrea Lodi and
                  Alessandro Panconesi and
                  Giovanni Rinaldi},
  title        = {A Weighted Kt, t-Free t-Factor Algorithm for Bipartite Graphs},
  booktitle    = {Integer Programming and Combinatorial Optimization, 13th International
                  Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5035},
  pages        = {62--76},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-68891-4\_5},
  doi          = {10.1007/978-3-540-68891-4\_5},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/ipco/Takazawa08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/IwataT07,
  author       = {Satoru Iwata and
                  Kenjiro Takazawa},
  editor       = {Nikhil Bansal and
                  Kirk Pruhs and
                  Clifford Stein},
  title        = {The independent even factor problem},
  booktitle    = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
                  2007},
  pages        = {1171--1180},
  publisher    = {{SIAM}},
  year         = {2007},
  url          = {http://dl.acm.org/citation.cfm?id=1283383.1283509},
  timestamp    = {Tue, 15 Feb 2022 07:54:27 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/IwataT07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics