@InProceedings{ducoffe:LIPIcs.IPEC.2021.15,
author = {Ducoffe, Guillaume},
title = {{Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width}},
booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)},
pages = {15:1--15:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-216-7},
ISSN = {1868-8969},
year = {2021},
volume = {214},
editor = {Golovach, Petr A. and Zehavi, Meirav},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.15},
URN = {urn:nbn:de:0030-drops-153987},
doi = {10.4230/LIPIcs.IPEC.2021.15},
annote = {Keywords: Maximum Matching, Maximum b-matching, Clique-width, Tree-width, Courcelle’s theorem, FPT in P}
}