Dániel Marx

Dániel Marx

On 1 July Dániel Marx takes up his new position as faculty at CISPA. Born in Hungary, he moves from the Max Planck Institute for Informatics in Saarbrücken to the federal government’s major research institution based in the Saarland state capital.

He has been working at the MPI since 2019 as Senior Researcher and Head of the Parameterized Algorithms & Complexity Group. Prior to this, he worked for in Berlin and Tel Aviv as postdoc and visiting researcher and from 2012 - 2019 at the Institute for Computer Science and Control at the Hungarian Academy of Sciences (MTA SZTAKI). The renowned scientist was awarded the ERC Starting Grant and the ERC Consolidator Grant, among others.

His research focuses on reaching the ultimate limits of algorithmic techniques for solving hard computational problems. Marx is equally interested in working on algorithm design problems and in using computational complexity to discover the fundamental limits of efficient algorithms.

Much of his work uses the framework of parameterized complexity to obtain a finer understanding of problem complexity. He has reportedly worked on a wide range of combinatorial problems originating from algorithmic graph theory, combinatorial optimization, constraint satisfaction problems (CSP), and other areas.

Dániel Marx

Dániel Marx