@InProceedings{datta_et_al:LIPIcs.MFCS.2016.28,
author = {Datta, Samir and Kulkarni, Raghav and Mukherjee, Anish},
title = {{Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs}},
booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
pages = {28:1--28:12},
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.28},
URN = {urn:nbn:de:0030-drops-64436},
doi = {10.4230/LIPIcs.MFCS.2016.28},
annote = {Keywords: maximum matching, approximation scheme, logspace, planar graphs}
}