@InProceedings{ducoffe_et_al:LIPIcs.ISAAC.2018.6,
author = {Ducoffe, Guillaume and Popa, Alexandru},
title = {{The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes}},
booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)},
pages = {6:1--6:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-094-1},
ISSN = {1868-8969},
year = {2018},
volume = {123},
editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.6},
URN = {urn:nbn:de:0030-drops-99549},
doi = {10.4230/LIPIcs.ISAAC.2018.6},
annote = {Keywords: maximum matching, FPT in P, modular decomposition, pruned graphs, one-vertex extensions, P\underline4-structure}
}