Published in: LIPIcs, Volume 398, 21st International Symposium on Parameterized and Exact Computation (IPEC 2026)
László Kozma and Junqi Tan. Exact Algorithms for Optimal Discretization. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 8:1-8:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{kozma_et_al:LIPIcs.IPEC.2026.8,
author = {Kozma, L\'{a}szl\'{o} and Tan, Junqi},
title = {{Exact Algorithms for Optimal Discretization}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {8:1--8:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-456-7},
ISSN = {1868-8969},
year = {2026},
volume = {398},
editor = {Korhonen, Tuukka and Lampis, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2026.8},
URN = {urn:nbn:de:0030-drops-281815},
doi = {10.4230/LIPIcs.IPEC.2026.8},
annote = {Keywords: discretization, point set, separation, exponential time}
}
Published in: LIPIcs, Volume 351, 33rd Annual European Symposium on Algorithms (ESA 2025)
László Kozma and Junqi Tan. Faster Exponential Algorithms for Cut Problems via Geometric Data Structures. In 33rd Annual European Symposium on Algorithms (ESA 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 351, pp. 110:1-110:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{kozma_et_al:LIPIcs.ESA.2025.110,
author = {Kozma, L\'{a}szl\'{o} and Tan, Junqi},
title = {{Faster Exponential Algorithms for Cut Problems via Geometric Data Structures}},
booktitle = {33rd Annual European Symposium on Algorithms (ESA 2025)},
pages = {110:1--110:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-395-9},
ISSN = {1868-8969},
year = {2025},
volume = {351},
editor = {Benoit, Anne and Kaplan, Haim and Wild, Sebastian 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.2025.110},
URN = {urn:nbn:de:0030-drops-245796},
doi = {10.4230/LIPIcs.ESA.2025.110},
annote = {Keywords: graph algorithms, cuts, exponential time, data structures}
}