Dusan Knop, Michal Pilipczuk, Marcin Wrochna. Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. In Rolf Niedermeier, Christophe Paul, editors, 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany. Volume 126 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. [doi]
@inproceedings{KnopPW19,
title = {Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints},
author = {Dusan Knop and Michal Pilipczuk and Marcin Wrochna},
year = {2019},
doi = {10.4230/LIPIcs.STACS.2019.44},
url = {https://doi.org/10.4230/LIPIcs.STACS.2019.44},
researchr = {https://researchr.org/publication/KnopPW19},
cites = {0},
citedby = {0},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany},
editor = {Rolf Niedermeier and Christophe Paul},
volume = {126},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-100-9},
}