Kenjiro Takazawa. Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs. In Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, editors, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland. Volume 58 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]
@inproceedings{Takazawa16-0,
title = {Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs},
author = {Kenjiro Takazawa},
year = {2016},
doi = {10.4230/LIPIcs.MFCS.2016.87},
url = {http://dx.doi.org/10.4230/LIPIcs.MFCS.2016.87},
researchr = {https://researchr.org/publication/Takazawa16-0},
cites = {0},
citedby = {0},
booktitle = {41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland},
editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier},
volume = {58},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-016-3},
}