@InProceedings{lassota_et_al:LIPIcs.ICALP.2022.87,
author = {Lassota, Alexandra and {\L}ukasiewicz, Aleksander and Polak, Adam},
title = {{Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs}},
booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)},
pages = {87:1--87:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-235-8},
ISSN = {1868-8969},
year = {2022},
volume = {229},
editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.87},
URN = {urn:nbn:de:0030-drops-164286},
doi = {10.4230/LIPIcs.ICALP.2022.87},
annote = {Keywords: Bin Packing, Vector Bin Packing, Parameterized Complexity, Matching}
}