Send email Copy Email Address
Research Group

Marx

The main focus of our research group is reaching the ultimate limits of algorithmic techniques for solving hard computational problems. We are working on problems of algorithm design and using computational complexity to discover the fundamental limitations of efficient algorithms. A large part of the work uses the framework of parameterized complexity to obtain a more fine-grained understanding of problem complexity.

Head of Group

Dániel Marx

Email

Address

Kaiserstraße 21
66386 St. Ingbert (Germany)

Most Recent Publications

Year 2026

Article

SIAM Journal on Discrete Mathematics From Chinese Postman to Salesman and Beyond II: Inapproximability and Parameterized Complexity

Conference / Medium

MFCS International Symposium on Mathematical Foundations of Computer Science (MFCS) A Dividing Line for Structural Kernelization of Component Order Connectivity via Distance to Bounded Pathwidth

Conference / Medium

European Symposium on Algorithms (ESA) Where Treewidth and Pathwidth Diverge: Towards a Uniform Kernel for Pathwidth-eta Deletion

Conference / Medium

European Symposium on Algorithms (ESA) Faster Exponential Algorithms For Multi-Machine Scheduling Problems

Conference / Medium

STOC '26: 58th Annual ACM Symposium on Theory of Computing Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs