Search Results

Documents authored by Röder, Sebastian

Document
Poster Abstract
DOI: 10.4230/LIPIcs.GD.2024.43
Minimizing Switches in Cased Graph Drawings (Poster Abstract)

Authors: Robert Ganian, Martin Nöllenburg, and Sebastian Röder

Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)

Abstract
In cased drawings of graphs, edges are drawn in front of others in order to decrease the negative impact of crossings on readability. In this context, a switch on an edge is defined as two consecutive crossings, where the edge is drawn in the front at one crossing and behind another edge at the next crossing. We investigate the problem of minimizing the maximum number of switches on any edge - both in a fixed drawing as well as for non-embedded graphs. We resolve an open question by Eppstein, van Kreveld, Mumford, and Speckmann (2009) by establishing the NP-hardness of minimizing the number of switches in a fixed drawing, provide a fixed-parameter algorithm for this problem, and obtain a full characterization of the problem for non-embedded graphs.
Cite as

Robert Ganian, Martin Nöllenburg, and Sebastian Röder. Minimizing Switches in Cased Graph Drawings (Poster Abstract). In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 43:1-43:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@InProceedings{ganian_et_al:LIPIcs.GD.2024.43,
  author =	{Ganian, Robert and N\"{o}llenburg, Martin and R\"{o}der, Sebastian},
  title =	{{Minimizing Switches in Cased Graph Drawings}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{43:1--43:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-343-0},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{320},
  editor =	{Felsner, Stefan and Klein, Karsten},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2024.43},
  URN =		{urn:nbn:de:0030-drops-213271},
  doi =		{10.4230/LIPIcs.GD.2024.43},
  annote =	{Keywords: beyond planarity, complexity theory, non-planar drawings, crossings}
}
Document
Poster Abstract
DOI: 10.4230/LIPIcs.GD.2024.45
GdMetriX - A NetworkX Extension For Graph Drawing Metrics (Poster Abstract)

Authors: Martin Nöllenburg, Sebastian Röder, and Markus Wallinger

Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)

Abstract
networkX is a well-established Python library for network analysis. With gdMetriX, we aim to extend the functionality of networkX and provide common quality metrics used in the field of graph drawing, such as the number of crossings or the angular resolution. In addition, the package provides easy-to-use access to the graph datasets provided by the ’Graph Layout Benchmark Datasets’ project from the Northeastern University Visualization Lab.
Cite as

Martin Nöllenburg, Sebastian Röder, and Markus Wallinger. GdMetriX - A NetworkX Extension For Graph Drawing Metrics (Poster Abstract). In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 45:1-45:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@InProceedings{nollenburg_et_al:LIPIcs.GD.2024.45,
  author =	{N\"{o}llenburg, Martin and R\"{o}der, Sebastian and Wallinger, Markus},
  title =	{{GdMetriX - A NetworkX Extension For Graph Drawing Metrics}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{45:1--45:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-343-0},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{320},
  editor =	{Felsner, Stefan and Klein, Karsten},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2024.45},
  URN =		{urn:nbn:de:0030-drops-213294},
  doi =		{10.4230/LIPIcs.GD.2024.45},
  annote =	{Keywords: Graph Drawing Metrics}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact