A Sketch of Parameterized Complexity (Invited Talk)

Bodlaender, Hans L.

doi:10.4230/LIPIcs.GD.2025.1

Document

A Sketch of Parameterized Complexity (Invited Talk)

Author Hans L. Bodlaender

Part of: Volume: 33rd International Symposium on Graph Drawing and Network Visualization (GD 2025)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: Graph Drawing and Network Visualization (GD)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2025-11-26

PDF

File

PDF

LIPIcs.GD.2025.1.pdf

Filesize: 327 kB
1 pages

Document Identifiers

DOI: 10.4230/LIPIcs.GD.2025.1
URN: urn:nbn:de:0030-drops-249877

Subject Classification

ACM Subject Classification

Mathematics of computing → Graph algorithms
Theory of computation → Fixed parameter tractability

Keywords

Parameterized complexity
XNLP
XALP

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

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.

Cite As Get BibTex

Hans L. Bodlaender. A Sketch of Parameterized Complexity (Invited Talk). In 33rd International Symposium on Graph Drawing and Network Visualization (GD 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 357, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.GD.2025.1

Author Details

Hans L. Bodlaender

Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands

Any Issues?

Feedback on the Current Page

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail