ParAI

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem

Algorithmica, volume 88, number 1, pages 8, 2026.

Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider

Gateways to Tractability for Satisfiability in Pearl’s Causal Hierarchy

Proceedings of the 43rd International Conference on Machine Learning, ICML 2026, 2026, PMLR.
Note: to appear

Robert Ganian, Marlene Gründel, Simon Wietheger

Makespan Minimization in Split Learning: From Theory to Practice

IEEE INFOCOM 2026 - IEEE Conference on Computer Communications, Tokyo, Japan, May 18-21, 2026, pages 1-10, 2026, IEEE.

Robert Ganian, Fionn Mc Inerney, Dimitra Tsigkari

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity

Fortieth AAAI Conference on Artificial Intelligence, Thirty-Eighth Conference on Innovative Applications of Artificial Intelligence, Sixteenth Symposium on Educational Advances in Artificial Intelligence, AAAI 2026, Singapore, January 20-27, 2026 (Sven Koenig and Chad Jenkins and Matthew E. Taylor), pages 19108-19116, 2026, AAAI Press.

Robert Ganian, Phuc Hung Hoang, Simon Wietheger

Not All Degree Constraints Are Created Equal when Computing Spanning Trees

21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear

Narek Bojikian, Alexander Firbas, Robert Ganian, Phuc Hung Hoang, Krisztina Szilagyi

Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy

ACM Transactions on Algorithms, 2026.
Note: to appear

Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, M. S. Ramanujan

Parameterized Complexity of Efficient Sortation

51st International Symposium on Mathematical Foundations of Computer Science (MFCS 2026), 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear

Robert Ganian, Phuc Hung Hoang, Simon Wietheger

Routing few robots in a crowded network

J. Comput. Syst. Sci., volume 157, pages 103753, 2026.

Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj, Dominik Leko, M. S. Ramanujan

The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern

21st International Symposium on Parameterized and Exact Computation, IPEC 2026, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Note: to appear

Thomas Depian, Simon Dominik Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper

The Complexity of Envy-Free Graph Cutting

Artificial Intelligence, 2026.
Note: to appear

Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak