2026-07-22T00:09:44Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:24987 2026-02-09T07:52:29Z ddc:004 open_access

A Sketch of Parameterized Complexity (Invited Talk) Bodlaender, Hans L. Parameterized complexity XNLP XALP In the field of parameterized complexity, we study algorithms for and the complexity of problems where one part of the input is a parameter that is assumed to be small. In this talk, a survey will be given of several central notions from parameterized complexity, and discuss some recent developments, including the classes XNLP and XALP. These topics will be illustrated with examples from results on graph layout and graph drawing. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Hans L. Bodlaender 2025 Is Part Of LIPIcs, Volume 357, 33rd International Symposium on Graph Drawing and Network Visualization (GD 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.GD.2025.1 urn:nbn:de:0030-drops-249877 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2025.1 eng https://creativecommons.org/licenses/by/4.0/legalcode