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

Abstract

Full Citation:

Thomas Depian, Simon D. Fink, Alexander Firbas, Robert Ganian, Martin Nöllenburg, Marie Diana Sieper. 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

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.