@InProceedings{charikar_et_al:LIPIcs.ICALP.2018.33,
author = {Charikar, Moses and Solomon, Shay},
title = {{Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {33:1--33:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-076-7},
ISSN = {1868-8969},
year = {2018},
volume = {107},
editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.33},
URN = {urn:nbn:de:0030-drops-90370},
doi = {10.4230/LIPIcs.ICALP.2018.33},
annote = {Keywords: dynamic graph algorithms, maximum matching, worst-case bounds}
}