Parameterized analysis and crossing minimization problems

Research output: Contribution to journalReview articlepeer-review

3 Scopus citations

Abstract

In this survey/introductory article, we first present the basics of the field of Parameterized Complexity, made accessible to readers without background on the subject. Afterwards, we survey some central questions in Graph Drawing that concern the analysis of crossing minimization problems from the viewpoint of parameterized analysis, as well as put forward some of the remaining challenges. This article originated from an invited talk given at the 29th International Symposium on Graph Drawing and Network Visualization.

Original languageEnglish
Article number100490
JournalComputer Science Review
Volume45
DOIs
StatePublished - 1 Aug 2022

Keywords

  • Crossing minimization
  • Graph Drawing
  • Kernelization
  • Parameterized Complexity
  • Parameterized algorithms

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Parameterized analysis and crossing minimization problems'. Together they form a unique fingerprint.

Cite this