Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
IPCO
/
Paper
On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs.
Max Glser
,
Marc E. Pfetsch
Venue
B
IPCO
Year
2022
Proceedings
IPCO
DBLP record
conf/ipco/GlaserP22 ↗
Browse the full
IPCO paper archive
.