Send email Copy Email Address
© Tobias Ebelshäuser
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

Philipp Schepper

Jacob Focke
Placeholder

Fionn Mc Inerney
Placeholder

Ariel Kulik

Baris Can Esmer
Placeholder

Shaohua Li
Placeholder

Florian Hörsch
Placeholder

Tim Hartmann

Most Recent Publications

Year 2023

2023-01-01

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs

Conference / Medium

SODA
ACM-SIAM Symposium on Discrete Algorithms (SODA 2023)ACM-SIAM Symposium on Discrete Algorithms (SODA 2023)

Tags
Algorithmic Foundations and Cryptography
Authors
Download Visit Detail Page
2023-01-01

Computing Square Colorings on Bounded-Treewidth and Planar Graphs

Conference / Medium

SODA
ACM-SIAM Symposium on Discrete Algorithms (SODA 2023)ACM-SIAM Symposium on Discrete Algorithms (SODA 2023)

Tags
Algorithmic Foundations and Cryptography
Authors
Download Visit Detail Page

Year 2022

2022-12

Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)

Conference / Medium

IPEC
17th International Symposium on Parameterized and Exact Computation (IPEC 2022)17th International Symposium on Parameterized and Exact Computation (IPEC 2022)

Tags
Algorithmic Foundations and Cryptography
Authors
Download Visit Detail Page
2022-12

Domination and Cut Problems on Chordal Graphs with Bounded Leafage

Conference / Medium

IPEC
17th International Symposium on Parameterized and Exact Computation (IPEC 2022)17th International Symposium on Parameterized and Exact Computation (IPEC 2022)

Tags
Algorithmic Foundations and Cryptography
Authors
Download Visit Detail Page
2022-12

Computing Generalized Convolutions Faster Than Brute Force

Conference / Medium

IPEC
17th International Symposium on Parameterized and Exact Computation (IPEC 2022)17th International Symposium on Parameterized and Exact Computation (IPEC 2022)

Tags
Algorithmic Foundations and Cryptography
Authors
Download Visit Detail Page