Christoph Grüne

According to our database, Christoph Grüne authored at least 9 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

The Complexity of Blocking All Solutions.

Christoph Grüne, Lasse Wulf

CoRR, February, 2025

The Complexity of Graph Exploration Games.

Janosch Fuchs, Christoph Grüne, Tom Janßen

Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025

On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy.

Christoph Grüne, Lasse Wulf

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

Completeness in the Polynomial Hierarchy for Many Natural Problems in Bilevel and Robust Optimization.

Christoph Grüne, Lasse Wulf

Proceedings of the Integer Programming and Combinatorial Optimization, 2025

2024

The Complexity of Online Graph Games.

Janosch Fuchs, Christoph Grüne, Tom Janßen

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

The Complexity Classes of Hamming Distance Recoverable Robust Problems.

Christoph Grüne

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023

A large and natural Class of Σ^p₂- and Σ^p₃-complete Problems in Bilevel and Robust Optimization.

Christoph Grüne, Lasse Wulf

CoRR, 2023

2022

Demand-responsive Scheduling in Railway Transportation.

Christoph Grüne, Stephan Zieger

Proceedings of the 8th International Conference on Vehicle Technology and Intelligent Transport Systems, 2022

Solving the Dial-a-Ride Problem for Railway Traffic by Means of Heuristics.

Christoph Grüne, Stephan Zieger

Proceedings of the Smart Cities, Green Technologies, and Intelligent Transport Systems, 2022