Moritz Stocker

According to our database, Moritz Stocker authored at least 8 papers between 2023 and 2026.

Collaborative distances:

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

2026

A survey of online knapsack problems.

Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Peter Rossmanith, Moritz Stocker

Discret. Appl. Math., 2026

2025

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

Matthias Gehnen, Moritz Stocker

CoRR, September, 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

Time-Optimal <i>k</i>-Server.

Fabian Frei, Dennis Komm, Moritz Stocker, Philip Whittington

CoRR, March, 2025

Forbidden Subgraph Problems with Predictions.

Hans-Joachim Böckenhauer, Melvin Jahn, Dennis Komm, Moritz Stocker

CoRR, January, 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

2023

Online Knapsack with Removal and Recourse.

Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023