מירב זהבי

אקדמי בכיר

Parameterized analysis and crossing minimization problems

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.

שפת פרסום אנגלית
כתב עת Computer Science Review
כרך 45
סטטוס פרסום פורסם - 01.08.2022
100490

Keywords

Crossing minimization
Graph Drawing
Kernelization
Parameterized Complexity
Parameterized algorithms

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science
גישה למסמך
10.1016/j.cosrev.2022.100490
קבצים וקישורים אחרים
Link to publication in Scopus