Team
Research
Courses
News
Jobs
Contact
Internal
Light
Dark
Automatic
1
A Denoising Diffusion Adaptive Search for the Alpha-Domination Problem on Social Graphs
Evolutionary Computation in Combinatorial Optimization
(Krejca, Martin S. and Pillay, Nelishia), volume 16522 of
LNCS
, pages 133-149, 2026, Springer.
Wustinger, Martin
,
Enrico Iurlano
,
Günther Raidl
PDF
Cite
DOI
A Parameterized-Complexity Framework for Finding Local Optima
17th Innovations in Theoretical Computer Science Conference, ITCS 2026
, 2026.
Note: to appear
Phuc Hung Hoang
Cite
Project
Project
A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs (Best Paper Award)
2026 Symposium on Simplicity in Algorithms, SOSA 2026
, 2026, SIAM.
Note: to appear
Ajaykrishnan E S
,
Robert Ganian
,
Daniel Lokshtanov
,
Vaishali Surianarayanan
Cite
Project
Project
Project
Bilateral Treewidth for QBF: Where Strategies and Resolution Meet
29th International Conference on Theory and Applications of Satisfiability Testing, SAT 2026
, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
Robert Ganian
,
Marlene Gründel
Cite
Project
Project
Clarity and Computational Efficiency of Orbital Boundary Labeling
Pacific Visualization Symposium (PacificVis'26)
, 2026.
Note: To appear.
Wallinger, Markus
,
Bonerath, Annika
,
Terziadis, Soeren
,
Wulms, Jules
,
Martin Nöllenburg
Cite
Project
Complexity of Positive Influence Domination on Partial Grids
Fundamentals of Computation Theory—25th International Symposium
(Jeż, Artur and Otop, Jan), volume 16106 of
LNCS
, pages 267-280, 2026, Springer.
Enrico Iurlano
,
Günther Raidl
PDF
Cite
DOI
Computing Probabilistic Explanations for ML Models: Fixed-Parameter Algorithms
The 40th Annual AAAI Conference on Artificial Intelligence, AAAI-2026
, 2026.
Note: To appear
Ordyniak, Sebastian
,
Rychlicki, Mateusz
,
Stefan Szeider
Cite
Project
Project
Computing Twin-Width via Treedepth and Vertex Integrity
43rd International Symposium on Theoretical Aspects of Computer Science, STACS 2026
, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
Robert Ganian
,
Mathis Teva Rocton
Cite
Project
Coordinated Motion Planning is FPT on Discretized Simple Polygons
53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026
, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
Narek Bojikian
,
Alexander Firbas
,
Robert Ganian
,
Phuc Hung Hoang
,
Krisztina Szilagyi
Cite
Project
Project
Coordinated Motion Planning is FPT on Discretized Simple Polygons
53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026
, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear
Argyrios Deligkas
,
Eduard Eiben
,
Robert Ganian
,
Iyad Kanj
Cite
Project
Project
»
Cite
×