Matthias Gehnen

According to our database, Matthias Gehnen authored at least 16 papers between 2021 and 2026.

Collaborative distances:

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

2026

Fog of War Chess.

Matthias Gehnen, Julius Stannat

CoRR, January, 2026

Tree coloring with predictions.

Fabian Frei, Matthias Gehnen, Dennis Komm, Rastislav Královic, Richard Královic, Peter Rossmanith, Moritz Stocker

Discret. Appl. Math., 2026

Stealing from the Dragon's Hoard: Online Unbounded Knapsack With Removal.

Matthias Gehnen, Moritz Stocker

Proceedings of the 43rd International Symposium on Theoretical Aspects of Computer Science, 2026

Endgames in Fog of War Chess.

Matthias Gehnen, Julius Stannat

Proceedings of the 13th International Conference on Fun with Algorithms, 2026

2025

Online Bin Packing with Item Size Estimates.

Matthias Gehnen, Andreas Usdenski

CoRR, May, 2025

Online Unbounded Knapsack.

Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic, Ralf Klasing, Dennis Komm, Henri Lotze, Daniel Mock, Peter Rossmanith, Moritz Stocker

Theory Comput. Syst., March, 2025

Graph Exploration with Edge Weight Estimates.

Matthias Gehnen, Ralf Klasing, Émile Naquin

CoRR, January, 2025

Online General Knapsack with Reservation Costs.

Elisabet Burjons, Matthias Gehnen

Proceedings of the Approximation and Online Algorithms - 23rd International Workshop, 2025

Online Knapsack Problems with Estimates.

Jakub Balabán, Matthias Gehnen, Henri Lotze, Finn Seesemann, Moritz Stocker

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

2024

Tree Coloring: Random Order and Predictions.

Fabian Frei, Matthias Gehnen, Dennis Komm, Rastislav Královic, Richard Královic, Peter Rossmanith, Moritz Stocker

CoRR, 2024

Online Simple Knapsack with Bounded Predictions.

Matthias Gehnen, Henri Lotze, Peter Rossmanith

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Tetris Is Not Competitive.

Matthias Gehnen, Luca Venier

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

2023

The Online Simple Knapsack Problem with Reservation and Removability.

Elisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Delaying Decisions and Reservation Costs.

Elisabet Burjons, Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2021

Transitive Avoidance Games on Boards of Odd Size.

Matthias Gehnen, Eberhard Triesch

Electron. J. Comb., 2021

The Secretary Problem with Reservation Costs.

Elisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021