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

Abstract

Full Citation:

Depian, Thomas, Fink, Simon D., Firbas, Alexander, Ganian, Robert, Nöllenburg, Martin, Sieper, Marie Diana. The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern. Parameterized and Exact Computation (IPEC'26) (Tuukka Korhonen and Michael Lampis), 2026, Schloss Dagstuhl – Leibniz-Zentrum für Informatik. (Note: To appear.)

Thomas Depian

Thomas Depian is a University Assistant at the Algorithms and Complexity Group.

Simon Dominik Fink

Simon Dominik Fink was a Project Assistant at the Algorithms and Complexity Group.

Alexander Firbas

Alexander Firbas is a Project Assistant at the Algorithms and Complexity Group.

Robert Ganian

Robert Ganian is a Professor at the Algorithms and Complexity Group.

Martin Nöllenburg

Martin Nöllenburg is a Professor at the Algorithms and Complexity Group.