People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
ParAI
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy
Robert Ganian
PDF
Cite
Project
Project
DOI
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover
Liana Khazaliya
PDF
Cite
Project
Project
DOI
Revisiting Causal Discovery from a Complexity-Theoretic Perspective
Robert Ganian
,
Viktoriia Korchemna
,
Stefan Szeider
Cite
Project
Project
Project
Project
DOI
Slim Tree-Cut Width
Robert Ganian
PDF
Cite
Project
DOI
Smash and grab: The 0*6 scoring game on graphs
Éric Duchêne and Valentin Gledel and Sylvain Gravier and Fionn Mc Inerney and Mehdi Mhalla and Aline Parreau
PDF
Cite
Project
DOI
The Complexity of Fair Division of Indivisible Items with Externalities
Argyrios Deligkas and Eduard Eiben and Viktoriia Korchemna and Simon Schierreich
PDF
Cite
Project
DOI
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width
Robert Ganian
PDF
Cite
Project
Project
DOI
The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k \(≥\) 5
Phuc Hung Hoang
PDF
Cite
Project
DOI
The Parameterized Complexity Landscape of the Unsplittable Flow Problem
Mathis Teva Rocton
PDF
Cite
Project
Project
DOI
The Parameterized Complexity of Extending Stack Layouts
Thomas Depian
,
Simon Dominik Fink
,
Robert Ganian
,
Martin Nöllenburg
PDF
Cite
Project
Project
DOI
«
»
Cite
×