2026-07-22T10:53:45Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:17838 2026-04-20T13:16:04Z ddc:004 open_access

Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481) Chudnovsky, Maria Misra, Neeldhara Paulusma, Daniel Schaudt, Oliver Agrawal, Akanksha computational complexity hereditary graph classes parameterized algorithms polynomial-time algorithms vertex partitioning This report documents the program and the outcomes of Dagstuhl Seminar 22481 "Vertex Partitioning in Graphs: From Structure to Algorithms", which was held from 27 November to 2 December 2023. The report contains abstracts for presentations about recent structural and algorithmic developments for a variety of vertex partitioning problems. It also contains a collection of open problems which were posed during the seminar. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Maria Chudnovsky and Neeldhara Misra and Daniel Paulusma and Oliver Schaudt and Akanksha Agrawal 2023 Is Part Of Dagstuhl Reports, Volume 12, Issue 11 (2023) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.12.11.109 urn:nbn:de:0030-drops-178384 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.12.11.109 eng https://creativecommons.org/licenses/by/4.0/legalcode