Michael Drmota, Lander Ramos, Clément Requilé, Juanjo Rué. Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes. In James Allen Fill, Mark Daniel Ward, editors, 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2018, June 25-29, 2018, Uppsala, Sweden. Volume 110 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]
@inproceedings{DrmotaRRR18,
title = {Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes},
author = {Michael Drmota and Lander Ramos and Clément Requilé and Juanjo Rué},
year = {2018},
doi = {10.4230/LIPIcs.AofA.2018.18},
url = {https://doi.org/10.4230/LIPIcs.AofA.2018.18},
researchr = {https://researchr.org/publication/DrmotaRRR18},
cites = {0},
citedby = {0},
booktitle = {29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2018, June 25-29, 2018, Uppsala, Sweden},
editor = {James Allen Fill and Mark Daniel Ward},
volume = {110},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-078-1},
}