Parameterized analysis and crossing minimization problems

Meirav Zehavi

doi:10.1016/j.cosrev.2022.100490

Parameterized analysis and crossing minimization problems

Meirav Zehavi

Department of Computer Science

Research output: Contribution to journal › Review article › peer-review

7 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 language	English
Article number	100490
Journal	Computer Science Review
Volume	45
DOIs	https://doi.org/10.1016/j.cosrev.2022.100490
State	Published - 1 Aug 2022

Keywords

Crossing minimization
Graph Drawing
Kernelization
Parameterized Complexity
Parameterized algorithms

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1016/j.cosrev.2022.100490

Cite this

@article{09dffb8084ae4823b02edc102c352a00,

title = "Parameterized analysis and crossing minimization problems",

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.",

keywords = "Crossing minimization, Graph Drawing, Kernelization, Parameterized Complexity, Parameterized algorithms",

author = "Meirav Zehavi",

note = "Publisher Copyright: {\textcopyright} 2022 Elsevier Inc.",

year = "2022",

month = aug,

day = "1",

doi = "10.1016/j.cosrev.2022.100490",

language = "English",

volume = "45",

journal = "Computer Science Review",

issn = "1574-0137",

publisher = "Elsevier Ireland Ltd",

}

TY - JOUR

T1 - Parameterized analysis and crossing minimization problems

AU - Zehavi, Meirav

PY - 2022/8/1

Y1 - 2022/8/1

N2 - 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.

AB - 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.

KW - Crossing minimization

KW - Graph Drawing

KW - Kernelization

KW - Parameterized Complexity

KW - Parameterized algorithms

UR - http://www.scopus.com/inward/record.url?scp=85137101403&partnerID=8YFLogxK

U2 - 10.1016/j.cosrev.2022.100490

DO - 10.1016/j.cosrev.2022.100490

M3 - Review article

AN - SCOPUS:85137101403

SN - 1574-0137

VL - 45

JO - Computer Science Review

JF - Computer Science Review

M1 - 100490

ER -

Parameterized analysis and crossing minimization problems

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this