Daniel Mock

According to our database, Daniel Mock authored at least 6 papers between 2021 and 2024.

Collaborative distances:

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

2024

Online Unbounded Knapsack.

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

CoRR, 2024

Solving a Family Of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion.

Daniel Mock, Peter Rossmanith

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 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

Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond.

Jan Dreier, Daniel Mock, Peter Rossmanith

Proceedings of the 31st Annual European Symposium on Algorithms, 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

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