@InProceedings{albers_et_al:LIPIcs.ESA.2022.4,
author = {Albers, Susanne and Schubert, Sebastian},
title = {{Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities}},
booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)},
pages = {4:1--4:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-247-1},
ISSN = {1868-8969},
year = {2022},
volume = {244},
editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.4},
URN = {urn:nbn:de:0030-drops-169420},
doi = {10.4230/LIPIcs.ESA.2022.4},
annote = {Keywords: online algorithms, deterministic algorithms, primal-dual analysis, b-matching, bounded-degree graph, variable vertex capacities, unweighted matching, vertex-weighted matching}
}