@InProceedings{knop_et_al:LIPIcs.STACS.2019.44,
author = {Knop, Du\v{s}an and Pilipczuk, Micha{\l} and Wrochna, Marcin},
title = {{Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints}},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
pages = {44:1--44:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-100-9},
ISSN = {1868-8969},
year = {2019},
volume = {126},
editor = {Niedermeier, Rolf and Paul, Christophe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.44},
URN = {urn:nbn:de:0030-drops-102831},
doi = {10.4230/LIPIcs.STACS.2019.44},
annote = {Keywords: integer linear programming, fixed-parameter tractability, ETH}
}