Daniel Mock

Room: 4106, Erweiterungsbau E1 of the Computer Science Center (2353|106)
Office hours:Tuesdays from 14:00 to 15:00 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.

My CV.

Publications and Talks

Most of my publications can be found on my dblp page.
  1. Online Unbounded Knapsack.
    Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic, Ralf Klasing, Dennis Komm, Henri Lotze, Daniel Mock, Peter Rossmanith, Moritz Stocker.
    Conference Paper at Theory of Computing Systems
  2. Solving Partial Dominating Set and Related Problems Using Twin-Width.
    Jakub Balabán, Daniel Mock, Peter Rossmanith. Published at MFCS 2025.
  3. Solving a Family of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion.
    Daniel Mock, Peter Rossmanith. Published at SWAT 2024.
  4. Delaying Decisions and Reservation Costs.
    Elisabet Burjons, Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith. Published at COCOON 2023.
  5. Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond.
    Jan Dreier, Daniel Mock and Peter Rossmanith. Published at ESA 2023.
  6. The Online Simple Knapsack Problem with Reservation and Removability.
    Elisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith. Published at MFCS 2023.
  7. The Secretary Problem with Reservation Costs
    Elisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith. Published at COCOON 2021.

Research Visits

Teaching

Advanced Lectures

Seminars/Labs

Basic Lectures