Solving the Dial-a-Ride Problem for Railway Traffic by Means of Heuristics. - Christoph Grüne; Stephan Zieger (SMARTGREENS/VEHITS (Selected Papers), 2022)

Demand-responsive Scheduling in Railway Transportation. - Christoph Grüne; Stephan Zieger (VEHITS, 2022)

A large and natural Class of Σp2- and Σp3-complete Problems in Bilevel and Robust Optimization. - Christoph Grüne; Lasse Wulf (CoRR, 2023)

The Complexity Classes of Hamming Distance Recoverable Robust Problems. - Christoph Grüne (LATIN (1), 2024)

The Complexity of Online Graph Games. - Janosch Fuchs; Christoph Grüne; Tom Janßen (SOFSEM, 2024)

Completeness in the Polynomial Hierarchy for Many Natural Problems in Bilevel and Robust Optimization. - Christoph Grüne; Lasse Wulf (IPCO, 2025)

On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy. - Christoph Grüne; Lasse Wulf (MFCS, 2025)

The Complexity of Graph Exploration Games. - Janosch Fuchs; Christoph Grüne; Tom Janßen (SOFSEM (2), 2025)

The Complexity of Blocking All Solutions. - Christoph Grüne; Lasse Wulf (CoRR, 2025)