Daniel Mock
| Room: | 4106, Erweiterungsbau E1 of the Computer Science Center (2353|106) |
| Office hours: | Thursdays from 12:00 to noon or when my door is open |
| Phone: | +49-241-80-21134 |
| Email: | mock@cs.rwth-aachen.de |
I am a doctoral researcher and PhD candidate in the Theoretical Computer Science Group at the RWTH Aachen University headed by Prof. Dr. Peter Rossmanith.
My research interests lie in the area of parameterized algorithms, structural graph theory, logic and online algorithms.Publications and Talks
Most of my publications can be found on my dblp page.-
Solving a Family of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion.
Daniel Mock, Peter Rossmanith. Published at SWAT 2024.- Conference Paper tba | Full version tba
- My talk at LoGAlg 2023 | My talk at an AlgoOpt seminar
-
Delaying Decisions and Reservation Costs.
Elisabet Burjons, Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith. Published at COCOON 2023. -
Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond.
Jan Dreier, Daniel Mock and Peter Rossmanith. Published at ESA 2023. -
The Online Simple Knapsack Problem with Reservation and Removability.
Elisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith. Published at MFCS 2023. - The Secretary Problem with Reservation Costs Elisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith. Published at COCOON 2021.
Research Visits
- Jan 2024, ETH Zürich, Switzerland
Research topic: Online Algorithms with Untrusted Predications
Duration: 1 Week, Host: Prof. Dennis Komm at Algorithms and Didactics - Feb - Mar 2024, ETH Zürich, Switzerland
Research topic: Online Algorithms
Duration: 2 Weeks Host: Prof. Dennis Komm at Algorithms and Didactics
Teaching
Advanced Lectures
Seminars/Labs
Basic Lectures
- Formale Systeme, Automaten und Prozesse (FoSAP, formal language and automata theory)
- Datenstrukturen und Algorithmen (DSAL, datastructures and algorithms) in SS2024