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

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

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

Reference:

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

Bibtex Entry:

@inproceedings{dffgns-pcogwafp-26,
	Author = {Depian, Thomas and Fink, Simon D. and Firbas, Alexander and Ganian, Robert and Nöllenburg, Martin and Sieper, Marie Diana},
	Title = {The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern},
	Booktitle = {Parameterized and Exact Computation (IPEC'26)},
	Year = {2026},
    Editor = {Tuukka Korhonen and Michael Lampis},
    Series = {LIPIcs},
    Publisher = {Schloss Dagstuhl -- Leibniz-Zentrum für Informatik},
    Note = {To appear.},
	keywords = {PGD}	
}