A Aralex Aachen research explorer

Search

From

To

Institution

Field

Type

Topic: Complexity and Algorithms in Graphs ×

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Papers matching “integer programming” in Complexity and Algorithms in Graphs 4

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Completeness in the Polynomial Hierarchy for many natural Problems in Bilevel and Robust Optimization
2023 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne, Lasse Wulf

0

citations
Branch-and-price strikes back for the k-vertex cut problem
2026 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Fabio Ciccarelli, Fabio Furini, Christopher Hojny, Marco E. Lübbecke

0

citations
Optimal Refinement in Dynamic Discretisation Discovery for Continuous-Time Service Network Design
2026 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Alexander Helber, Oliver Bachtler, Tom Wüllner

0

citations
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
2024 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Christoph Grüne, Lasse Wulf

0

citations

4 results