BibTeX record conf/stacs/KnopPW19

download as .bib file

@inproceedings{DBLP:conf/stacs/KnopPW19,
  author       = {Dusan Knop and
                  Michal Pilipczuk and
                  Marcin Wrochna},
  editor       = {Rolf Niedermeier and
                  Christophe Paul},
  title        = {Tight Complexity Lower Bounds for Integer Linear Programming with
                  Few Constraints},
  booktitle    = {36th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2019, March 13-16, 2019, Berlin, Germany},
  series       = {LIPIcs},
  volume       = {126},
  pages        = {44:1--44:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2019.44},
  doi          = {10.4230/LIPICS.STACS.2019.44},
  timestamp    = {Mon, 03 Jan 2022 22:38:15 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/KnopPW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.