Search Results

Abstract

Cite as

Akanksha Agrawal, Maria Chudnovsky, Daniël Paulusma, Oliver Schaudt, and Julien Codsi. Solving Problems on Graphs: From Structure to Algorithms (Dagstuhl Seminar 25041). In Dagstuhl Reports, Volume 15, Issue 1, pp. 105-121, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

@Article{agrawal_et_al:DagRep.15.1.105,
  author =	{Agrawal, Akanksha and Chudnovsky, Maria and Paulusma, Dani\"{e}l and Schaudt, Oliver and Codsi, Julien},
  title =	{{Solving Problems on Graphs: From Structure to Algorithms (Dagstuhl Seminar 25041)}},
  pages =	{105--121},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2025},
  volume =	{15},
  number =	{1},
  editor =	{Agrawal, Akanksha and Chudnovsky, Maria and Paulusma, Dani\"{e}l and Schaudt, Oliver and Codsi, Julien},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.1.105},
  URN =		{urn:nbn:de:0030-drops-236749},
  doi =		{10.4230/DagRep.15.1.105},
  annote =	{Keywords: computational complexity, graph algorithms, graph classes, graph containment relations, graph width parameters}
}