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)

Members

Placeholder

Florian Hörsch
Placeholder

Tim Hartmann
Placeholder

Ahmed Ghazy

Marta Piecyk
Placeholder

Ameet Gadekar

Jakob Greilhuber

Abhiruk Lahiri

Most Recent Publications

Year 2026

2026-04-02

Diameter of the inversion graph

Article

Innovations in Graph Theory Diameter of the inversion graph

Tags
Algorithmic Foundations and Cryptography
Authors
Full Paper Visit Detail Page
2026-02

On the Minimum Number of Inversions to Make a Digraph k‐(Arc‐)Strong

Article

Journal of Graph Theory On the Minimum Number of Inversions to Make a Digraph k‐(Arc‐)Strong

Tags
Algorithmic Foundations and Cryptography
Authors
Full Paper Visit Detail Page

Year 2025

2025-12-05

Robust Contraction Decomposition for Minor-Free Graphs and its Applications

Conference / Medium

International Colloquium on Automata Languages and Programming (ICALP)
Robust Contraction Decomposition for Minor-Free Graphs and its Applications

Tags
Algorithmic Foundations and Cryptography
Authors
  • Sayan Bandyapadhyay
  • William Lochet
  • Daniel Lokshtanov
  • Dániel Marx
  • Pranabendu Misra
  • Daniel Neuen
  • Saket Saurabh
  • Prafullkumar Tale
  • Jie Xue
Full Paper Visit Detail Page
2025-02-24

Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering

Conference / Medium

Symposium on Theoretical Aspects of Computer Science (STACS)
Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering

Tags
Algorithmic Foundations and Cryptography
Authors
Full Paper Visit Detail Page
2025-02-24

Residue Domination in Bounded-Treewidth Graphs

Conference / Medium

Symposium on Theoretical Aspects of Computer Science (STACS)
Residue Domination in Bounded-Treewidth Graphs

Tags
Algorithmic Foundations and Cryptography
Authors
Full Paper Visit Detail Page