Magyarul
Research Group for Parameterized Algorithms and Complexity
This department is part of the Informatics Laboratory.Head of department
- Dániel Marx
- Address: 1111 Budapest, Lágymányosi u. 11.
Room number: L 410
Phone: +36 1 279 6167
E-mail: dmarx@sztaki.mta.hu
Homepage: http://www.cs.bme.hu/~dmarx/
Description
Parameterized complexity studies algorithmic problems in a multivariate framework that is finer than traditional complexity measures. This more detailed analysis allows us to discover efficient algorithms and reveal structures in algorithmic problems that are hidden from classical approaches. Our research group explores all aspects of parameterized complexity, including algorithms, preprocessing of combinatorial optimization problems (kernelization), and lower bounds (complexity results). Our work involves several problem domains such as graph algorithms, combinatorial optimization problems, constraint satisfaction problems, logic, and the theory of databases.
Research areas
parameterized algorithms
complexity theory
graph algorithms
constraint satisfaction
Results
ERC Starting Grant 2012-2016
More information:
Staff
- Yixin Cao
- Address: 1111 Budapest, Lágymányosi u. 11.
Room number: L411
Phone: +36 1 2796169
E-mail: yixin@sztaki.hu
Homepage: http://sites.google.com/site/yixincaoresearch/home
- László Egri
- Address: 1111 Budapest, Lágymányosi u. 11
Room number: L 411
Phone: +36 1 279 6169
E-mail: egri.laszlo@sztaki.mta.hu
- Sylvain Guillemot
- Address: 1111 Budapest, Lágymányosi u. 11.
Room number: L 411
Phone: +36 1 279 6169
E-mail: Guillemot.Sylvain@sztaki.mta.hu