@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}
}