@InProceedings{cheong:LIPIcs.GD.2024.1,
author = {Cheong, Otfried},
title = {{How Can Biclique Covers Help in Matching Problems}},
booktitle = {32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-343-0},
ISSN = {1868-8969},
year = {2024},
volume = {320},
editor = {Felsner, Stefan and Klein, Karsten},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2024.1},
URN = {urn:nbn:de:0030-drops-212853},
doi = {10.4230/LIPIcs.GD.2024.1},
annote = {Keywords: Matching problems}
}