Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STACS
/
Paper
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints.
Dusan Knop
,
Michal Pilipczuk
,
Marcin Wrochna
Venue
A
STACS
Year
2019
Proceedings
STACS
DBLP record
conf/stacs/KnopPW19 ↗
Browse the full
STACS paper archive
.