Published in: LIPIcs, Volume 308, 32nd Annual European Symposium on Algorithms (ESA 2024)
Yuni Iwamasa, Yusuke Kobayashi, and Kenjiro Takazawa. Finding a Maximum Restricted t-Matching via Boolean Edge-CSP. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 75:1-75:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{iwamasa_et_al:LIPIcs.ESA.2024.75, author = {Iwamasa, Yuni and Kobayashi, Yusuke and Takazawa, Kenjiro}, title = {{Finding a Maximum Restricted t-Matching via Boolean Edge-CSP}}, booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)}, pages = {75:1--75:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-338-6}, ISSN = {1868-8969}, year = {2024}, volume = {308}, editor = {Chan, Timothy and Fischer, Johannes and Iacono, John and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.75}, URN = {urn:nbn:de:0030-drops-211463}, doi = {10.4230/LIPIcs.ESA.2024.75}, annote = {Keywords: Polynomial algorithm, C\underlinek-free 2-matching, Jump system, Boolean edge-CSP} }
Published in: LIPIcs, Volume 117, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)
Naonori Kakimura, Naoyuki Kamiyama, and Kenjiro Takazawa. The b-Branching Problem in Digraphs. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 12:1-12:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{kakimura_et_al:LIPIcs.MFCS.2018.12, author = {Kakimura, Naonori and Kamiyama, Naoyuki and Takazawa, Kenjiro}, title = {{The b-Branching Problem in Digraphs}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {12:1--12:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.12}, URN = {urn:nbn:de:0030-drops-95948}, doi = {10.4230/LIPIcs.MFCS.2018.12}, annote = {Keywords: Greedy Algorithm, Packing, Matroid Intersection, Sparsity Matroid, Arborescence} }
Published in: LIPIcs, Volume 58, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Kenjiro Takazawa. Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 87:1-87:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{takazawa:LIPIcs.MFCS.2016.87, author = {Takazawa, Kenjiro}, title = {{Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {87:1--87:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.87}, URN = {urn:nbn:de:0030-drops-64950}, doi = {10.4230/LIPIcs.MFCS.2016.87}, annote = {Keywords: optimization algorithms, matching theory, traveling salesman problem, restricted 2-matchings, Hamilton-laceable graphs} }
Feedback for Dagstuhl Publishing