Christoph Grüne

17 papers B 3C 1Journal 10Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP.
CoRR
Christoph Grüne, Berit Johannes, James B. Orlin, Lasse Wulf
2026 J jnl
The complexity of blocking all solutions.
Theor. Comput. Sci.
Christoph Grüne, Lasse Wulf
2025 J jnl
A Compendium of Reductions: reductions.network.
CoRR
Christoph Grüne, Femke Pfaue
2025 B conf
Completeness in the Polynomial Hierarchy for Many Natural Problems in Bilevel and Robust Optimization.
IPCO
Christoph Grüne, Lasse Wulf
2025 B conf
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy.
MFCS
Christoph Grüne, Lasse Wulf
2025 J jnl
The Complexity of Blocking All Solutions.
CoRR
Christoph Grüne, Lasse Wulf
2025 — conf
The Complexity of Graph Exploration Games.
SOFSEM (2)
Janosch Fuchs, Christoph Grüne, Tom Janßen
2025 J jnl
The Complexity of Stackelberg Pricing Games.
CoRR
Christoph Grüne, Dorothee Henke, Eva Rotenberg, Lasse Wulf
2024 J jnl
On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy.
CoRR
Christoph Grüne, Lasse Wulf
2024 — conf
The Complexity Classes of Hamming Distance Recoverable Robust Problems.
LATIN (1)
Christoph Grüne
2024 B conf
The Complexity of Online Graph Games.
SOFSEM
Janosch Fuchs, Christoph Grüne, Tom Janßen
2023 J jnl
A large and natural Class of Σ
CoRR
Christoph Grüne, Lasse Wulf
2023 J jnl
The Complexity of Graph Exploration Games.
CoRR
Janosch Fuchs, Christoph Grüne, Tom Janßen
2022 C conf
Demand-responsive Scheduling in Railway Transportation.
VEHITS
Christoph Grüne, Stephan Zieger
2022 — conf
Solving the Dial-a-Ride Problem for Railway Traffic by Means of Heuristics.
SMARTGREENS/VEHITS (Selected Papers)
Christoph Grüne, Stephan Zieger
2022 J jnl
The Complexity Classes of Hamming Distance Recoverable Robust Problems.
CoRR
Christoph Grüne
2022 J jnl
The Complexity of Online Graph Games.
CoRR
Janosch Fuchs, Christoph Grüne, Tom Janßen