@Proceedings{felsner_et_al:LIPIcs.GD.2024,
  title =	{{LIPIcs, Volume 320, GD 2024, Complete Volume}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{1--754},
  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},
  URN =		{urn:nbn:de:0030-drops-220891},
  doi =		{10.4230/LIPIcs.GD.2024},
  annote =	{Keywords: LIPIcs, Volume 320, GD 2024, Complete Volume}
}
@InProceedings{felsner_et_al:LIPIcs.GD.2024.0,
  author =	{Felsner, Stefan and Klein, Karsten},
  title =	{{Front Matter, Table of Contents, Preface, Conference Organization}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{0:i--0:xiv},
  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.0},
  URN =		{urn:nbn:de:0030-drops-220882},
  doi =		{10.4230/LIPIcs.GD.2024.0},
  annote =	{Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{cheong:LIPIcs.GD.2024.1,
  author =	{Cheong, Otfried},
  title =	{{How Can Biclique Covers Help in Matching Problems}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{1:1--1:1},
  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.1},
  URN =		{urn:nbn:de:0030-drops-212853},
  doi =		{10.4230/LIPIcs.GD.2024.1},
  annote =	{Keywords: Matching problems}
}
@InProceedings{henzinger:LIPIcs.GD.2024.2,
  author =	{Henzinger, Monika},
  title =	{{How Can Algorithms Help in Protecting Our Privacy}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{2:1--2:1},
  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.2},
  URN =		{urn:nbn:de:0030-drops-212864},
  doi =		{10.4230/LIPIcs.GD.2024.2},
  annote =	{Keywords: Matching problems}
}
@InProceedings{cultreradimontesano_et_al:LIPIcs.GD.2024.3,
  author =	{Cultrera di Montesano, Sebastiano and Draganov, Ond\v{r}ej and Edelsbrunner, Herbert and Saghafian, Morteza},
  title =	{{The Euclidean MST-Ratio for Bi-Colored Lattices}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{3:1--3:23},
  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.3},
  URN =		{urn:nbn:de:0030-drops-212878},
  doi =		{10.4230/LIPIcs.GD.2024.3},
  annote =	{Keywords: Minimum spanning Trees, Steiner Ratio, Lattices, Partitions}
}
@InProceedings{fox_et_al:LIPIcs.GD.2024.4,
  author =	{Fox, Jacob and Pach, J\'{a}nos and Suk, Andrew},
  title =	{{Enumeration of Intersection Graphs of x-Monotone Curves}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{4:1--4:12},
  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.4},
  URN =		{urn:nbn:de:0030-drops-212887},
  doi =		{10.4230/LIPIcs.GD.2024.4},
  annote =	{Keywords: Enumeration, intersection graphs, pseudo-segments, x-monotone}
}
@InProceedings{bergold_et_al:LIPIcs.GD.2024.5,
  author =	{Bergold, Helena and Orthaber, Joachim and Scheucher, Manfred and Schr\"{o}der, Felix},
  title =	{{Holes in Convex and Simple Drawings}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{5:1--5:9},
  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.5},
  URN =		{urn:nbn:de:0030-drops-212895},
  doi =		{10.4230/LIPIcs.GD.2024.5},
  annote =	{Keywords: simple topological graph, convexity hierarchy, k-gon, k-hole, empty k-cycle, Erd\H{o}s-Szekeres theorem, Empty Hexagon theorem, planar point set, pseudolinear drawing}
}
@InProceedings{geher_et_al:LIPIcs.GD.2024.6,
  author =	{Geh\'{e}r, Panna and T\'{o}th, G\'{e}za},
  title =	{{1-Planar Unit Distance Graphs}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{6:1--6:9},
  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.6},
  URN =		{urn:nbn:de:0030-drops-212900},
  doi =		{10.4230/LIPIcs.GD.2024.6},
  annote =	{Keywords: unit distance graph, 1-planar, matchstick graph}
}
@InProceedings{kaufmann_et_al:LIPIcs.GD.2024.7,
  author =	{Kaufmann, Michael and Klemz, Boris and Knorr, Kristin and M. Reddy, Meghana and Schr\"{o}der, Felix and Ueckerdt, Torsten},
  title =	{{The Density Formula: One Lemma to Bound Them All}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{7:1--7:17},
  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.7},
  URN =		{urn:nbn:de:0030-drops-212913},
  doi =		{10.4230/LIPIcs.GD.2024.7},
  annote =	{Keywords: beyond-planar, density, fan-planar, fan-crossing, right-angle crossing, quasiplanar}
}
@InProceedings{hlineny_et_al:LIPIcs.GD.2024.8,
  author =	{Hlin\v{e}n\'{y}, Petr and K\"{o}dm\"{o}n, Lili},
  title =	{{Note on Min- k-Planar Drawings of Graphs}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{8:1--8:10},
  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.8},
  URN =		{urn:nbn:de:0030-drops-212924},
  doi =		{10.4230/LIPIcs.GD.2024.8},
  annote =	{Keywords: Crossing Number, Planarity, k-Planar Graph, Min-k-Planar Graph}
}
@InProceedings{dumitrescu_et_al:LIPIcs.GD.2024.9,
  author =	{Dumitrescu, Adrian and Pach, J\'{a}nos},
  title =	{{Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{9:1--9:10},
  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.9},
  URN =		{urn:nbn:de:0030-drops-212939},
  doi =		{10.4230/LIPIcs.GD.2024.9},
  annote =	{Keywords: Convexity, complete geometric Graph, crossing Family, plane Subgraph}
}
@InProceedings{biedl_et_al:LIPIcs.GD.2024.10,
  author =	{Biedl, Therese and Cornelsen, Sabine and Kratochv{\'\i}l, Jan and Rutter, Ignaz},
  title =	{{Constrained Outer-String Representations}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{10:1--10:18},
  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.10},
  URN =		{urn:nbn:de:0030-drops-212942},
  doi =		{10.4230/LIPIcs.GD.2024.10},
  annote =	{Keywords: String representation, outer-string, outer-1-string, chordal graphs, trees, polynomial-time algorithms, computational complexity}
}
@InProceedings{chaplick_et_al:LIPIcs.GD.2024.11,
  author =	{Chaplick, Steven and F\"{o}rster, Henry and Hoffmann, Michael and Kaufmann, Michael},
  title =	{{Monotone Arc Diagrams with Few Biarcs}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{11:1--11:16},
  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.11},
  URN =		{urn:nbn:de:0030-drops-212955},
  doi =		{10.4230/LIPIcs.GD.2024.11},
  annote =	{Keywords: planar graph, topological book embedding, monotone drawing, linear layout}
}
@InProceedings{depian_et_al:LIPIcs.GD.2024.12,
  author =	{Depian, Thomas and Fink, Simon D. and Ganian, Robert and N\"{o}llenburg, Martin},
  title =	{{The Parameterized Complexity Of Extending Stack Layouts}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{12:1--12:17},
  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.12},
  URN =		{urn:nbn:de:0030-drops-212960},
  doi =		{10.4230/LIPIcs.GD.2024.12},
  annote =	{Keywords: Stack Layout, Drawing Extension, Parameterized Complexity, Book Embedding}
}
@InProceedings{angelini_et_al:LIPIcs.GD.2024.13,
  author =	{Angelini, Patrizio and Biedl, Therese and Chimani, Markus and Cornelsen, Sabine and Da Lozzo, Giordano and Hong, Seok-Hee and Liotta, Giuseppe and Patrignani, Maurizio and Pupyrev, Sergey and Rutter, Ignaz and Wolff, Alexander},
  title =	{{The Price of Upwardness}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{13:1--13:20},
  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.13},
  URN =		{urn:nbn:de:0030-drops-212977},
  doi =		{10.4230/LIPIcs.GD.2024.13},
  annote =	{Keywords: upward drawings, beyond planarity, upward k-planarity, upward outer-1-planarity}
}
@InProceedings{firman_et_al:LIPIcs.GD.2024.14,
  author =	{Firman, Oksana and Gutowski, Grzegorz and Kryven, Myroslav and Okada, Yuto and Wolff, Alexander},
  title =	{{Bounding the Treewidth of Outer k-Planar Graphs via Triangulations}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{14:1--14:17},
  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.14},
  URN =		{urn:nbn:de:0030-drops-212988},
  doi =		{10.4230/LIPIcs.GD.2024.14},
  annote =	{Keywords: treewidth, outerplanar graphs, outer k-planar graphs, outer min-k-planar graphs, cop number, separation number}
}
@InProceedings{archambault_et_al:LIPIcs.GD.2024.15,
  author =	{Archambault, Daniel and Liotta, Giuseppe and N\"{o}llenburg, Martin and Piselli, Tommaso and Tappini, Alessandra and Wallinger, Markus},
  title =	{{Bundling-Aware Graph Drawing}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{15:1--15:19},
  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.15},
  URN =		{urn:nbn:de:0030-drops-212995},
  doi =		{10.4230/LIPIcs.GD.2024.15},
  annote =	{Keywords: Edge Bundling, Experimental Comparison, Graph Sparsification}
}
@InProceedings{forster_et_al:LIPIcs.GD.2024.16,
  author =	{F\"{o}rster, Henry and Klesen, Felix and Dwyer, Tim and Eades, Peter and Hong, Seok-Hee and Kobourov, Stephen G. and Liotta, Giuseppe and Misue, Kazuo and Montecchiani, Fabrizio and Pastukhov, Alexander and Schreiber, Falk},
  title =	{{GraphTrials: Visual Proofs of Graph Properties}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{16:1--16:18},
  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.16},
  URN =		{urn:nbn:de:0030-drops-213005},
  doi =		{10.4230/LIPIcs.GD.2024.16},
  annote =	{Keywords: Graph Visualization, Theory of Visualization, Visual Proof}
}
@InProceedings{meidiana_et_al:LIPIcs.GD.2024.17,
  author =	{Meidiana, Amyra and Hong, Seok-Hee and Jing, Yongcheng},
  title =	{{Connectivity-Faithful Graph Drawing}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{17:1--17:17},
  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.17},
  URN =		{urn:nbn:de:0030-drops-213015},
  doi =		{10.4230/LIPIcs.GD.2024.17},
  annote =	{Keywords: Graph connectivity, Faithful graph drawing, Graph sparsification}
}
@InProceedings{balko_et_al:LIPIcs.GD.2024.18,
  author =	{Balko, Martin and Hlin\v{e}n\'{y}, Petr and Masa\v{r}{\'\i}k, Tom\'{a}\v{s} and Orthaber, Joachim and Vogtenhuber, Birgit and Wagner, Mirko H.},
  title =	{{On the Uncrossed Number of Graphs}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{18:1--18:13},
  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.18},
  URN =		{urn:nbn:de:0030-drops-213028},
  doi =		{10.4230/LIPIcs.GD.2024.18},
  annote =	{Keywords: Uncrossed Number, Crossing Number, Planarity, Thickness}
}
@InProceedings{bekos_et_al:LIPIcs.GD.2024.19,
  author =	{Bekos, Michael A. and Da Lozzo, Giordano and Frati, Fabrizio and Gupta, Siddharth and Kindermann, Philipp and Liotta, Giuseppe and Rutter, Ignaz and Tollis, Ioannis G.},
  title =	{{Weakly Leveled Planarity with Bounded Span}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{19:1--19:19},
  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.19},
  URN =		{urn:nbn:de:0030-drops-213035},
  doi =		{10.4230/LIPIcs.GD.2024.19},
  annote =	{Keywords: Leveled planar graphs, edge span, graph drawing, edge-length ratio}
}
@InProceedings{caroppo_et_al:LIPIcs.GD.2024.20,
  author =	{Caroppo, Susanna and Da Lozzo, Giordano and Di Battista, Giuseppe},
  title =	{{Quantum Algorithms for One-Sided Crossing Minimization}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{20:1--20:9},
  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.20},
  URN =		{urn:nbn:de:0030-drops-213045},
  doi =		{10.4230/LIPIcs.GD.2024.20},
  annote =	{Keywords: One-sided crossing minimization, quantum graph drawing, quantum dynamic programming, quantum divide and conquer, exact exponential algorithms}
}
@InProceedings{mooney_et_al:LIPIcs.GD.2024.21,
  author =	{Mooney, Gavin J. and Purchase, Helen C. and Wybrow, Michael and Kobourov, Stephen G. and Miller, Jacob},
  title =	{{The Perception of Stress in Graph Drawings}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{21:1--21:17},
  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.21},
  URN =		{urn:nbn:de:0030-drops-213051},
  doi =		{10.4230/LIPIcs.GD.2024.21},
  annote =	{Keywords: Stress, Graph Drawing, Visual Perception}
}
@InProceedings{bonerath_et_al:LIPIcs.GD.2024.22,
  author =	{Bonerath, Annika and N\"{o}llenburg, Martin and Terziadis, Soeren and Wallinger, Markus and Wulms, Jules},
  title =	{{Boundary Labeling in a Circular Orbit}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{22:1--22:17},
  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.22},
  URN =		{urn:nbn:de:0030-drops-213060},
  doi =		{10.4230/LIPIcs.GD.2024.22},
  annote =	{Keywords: External labeling, Orthoradial drawing, NP-hardness, Polynomial algorithms}
}
@InProceedings{merker_et_al:LIPIcs.GD.2024.23,
  author =	{Merker, Laura and Scherzer, Lena and Schneider, Samuel and Ueckerdt, Torsten},
  title =	{{Intersection Graphs with and Without Product Structure}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{23:1--23:19},
  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.23},
  URN =		{urn:nbn:de:0030-drops-213070},
  doi =		{10.4230/LIPIcs.GD.2024.23},
  annote =	{Keywords: Product structure, intersection graphs, linear local treewidth}
}
@InProceedings{alegria_et_al:LIPIcs.GD.2024.24,
  author =	{Alegr{\'\i}a, Carlos and Caroppo, Susanna and Da Lozzo, Giordano and D'Elia, Marco and Di Battista, Giuseppe and Frati, Fabrizio and Grosso, Fabrizio and Patrignani, Maurizio},
  title =	{{Upward Pointset Embeddings of Planar st-Graphs}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{24:1--24:18},
  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.24},
  URN =		{urn:nbn:de:0030-drops-213082},
  doi =		{10.4230/LIPIcs.GD.2024.24},
  annote =	{Keywords: Upward pointset embeddings, planar st-graphs, st-cutset, non-crossing monotone Hamiltonian cycles, graph drawing enumeration}
}
@InProceedings{munch_et_al:LIPIcs.GD.2024.25,
  author =	{M\"{u}nch, Miriam and Rutter, Ignaz},
  title =	{{Parameterized Algorithms for Beyond-Planar Crossing Numbers}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{25:1--25:16},
  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.25},
  URN =		{urn:nbn:de:0030-drops-213096},
  doi =		{10.4230/LIPIcs.GD.2024.25},
  annote =	{Keywords: FPT, Beyond-planarity, Crossing-number, Crossing Patterns}
}
@InProceedings{hegemann_et_al:LIPIcs.GD.2024.26,
  author =	{Hegemann, Tim and Wolff, Alexander},
  title =	{{Storylines with a Protagonist}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{26:1--26:22},
  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.26},
  URN =		{urn:nbn:de:0030-drops-213109},
  doi =		{10.4230/LIPIcs.GD.2024.26},
  annote =	{Keywords: Storyline visualization, storyline with a protagonist, crossing minimization, block crossings}
}
@InProceedings{bekos_et_al:LIPIcs.GD.2024.27,
  author =	{Bekos, Michael A. and Bose, Prosenjit and B\"{u}ngener, Aaron and Dujmovi\'{c}, Vida and Hoffmann, Michael and Kaufmann, Michael and Morin, Pat and Odak, Saeed and Weinberger, Alexandra},
  title =	{{On k-Planar Graphs Without Short Cycles}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{27:1--27:17},
  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.27},
  URN =		{urn:nbn:de:0030-drops-213117},
  doi =		{10.4230/LIPIcs.GD.2024.27},
  annote =	{Keywords: Beyond-planar Graphs, k-planar Graphs, Local Crossing Number, Crossing Number, Discharging Method, Crossing Lemma}
}
@InProceedings{bungener_et_al:LIPIcs.GD.2024.28,
  author =	{B\"{u}ngener, Aaron and Pfister, Maximilian},
  title =	{{On the Edge Density of Bipartite 3-Planar and Bipartite Gap-Planar Graphs}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{28:1--28:21},
  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.28},
  URN =		{urn:nbn:de:0030-drops-213123},
  doi =		{10.4230/LIPIcs.GD.2024.28},
  annote =	{Keywords: Edge Density, Beyond Planarity, bipartite Graphs, Discharging Method}
}
@InProceedings{bungener_et_al:LIPIcs.GD.2024.29,
  author =	{B\"{u}ngener, Aaron and Kaufmann, Michael},
  title =	{{Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{29:1--29:22},
  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.29},
  URN =		{urn:nbn:de:0030-drops-213136},
  doi =		{10.4230/LIPIcs.GD.2024.29},
  annote =	{Keywords: Crossing Lemma, k-planar graphs, discharging method}
}
@InProceedings{acharya_et_al:LIPIcs.GD.2024.30,
  author =	{Acharya, Rohan and M\"{u}tze, Torsten and Verciani, Francesco},
  title =	{{Flips in Colorful Triangulations}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{30:1--30:20},
  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.30},
  URN =		{urn:nbn:de:0030-drops-213143},
  doi =		{10.4230/LIPIcs.GD.2024.30},
  annote =	{Keywords: Flip graph, associahedron, triangulation, binary tree, vertex coloring, Hamilton cycle, Gray code}
}
@InProceedings{dobler_et_al:LIPIcs.GD.2024.31,
  author =	{Dobler, Alexander and J\"{u}nger, Michael and J\"{u}nger, Paul J. and Meffert, Julian and Mutzel, Petra and N\"{o}llenburg, Martin},
  title =	{{Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{31:1--31:19},
  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.31},
  URN =		{urn:nbn:de:0030-drops-213159},
  doi =		{10.4230/LIPIcs.GD.2024.31},
  annote =	{Keywords: Storyline drawing, crossing minimization, integer linear programming, algorithm engineering, computational experiments}
}
@InProceedings{bekos_et_al:LIPIcs.GD.2024.32,
  author =	{Bekos, Michael A. and Di Battista, Giuseppe and Di Giacomo, Emilio and Didimo, Walter and Kaufmann, Michael and Montecchiani, Fabrizio},
  title =	{{On the Complexity of Recognizing k^+-Real Face Graphs}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{32:1--32:22},
  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.32},
  URN =		{urn:nbn:de:0030-drops-213167},
  doi =		{10.4230/LIPIcs.GD.2024.32},
  annote =	{Keywords: Beyond planarity, k^+-real face drawings, 2-layer drawings, recognition algorithm, NP-hardness}
}
@InProceedings{chimani_et_al:LIPIcs.GD.2024.33,
  author =	{Chimani, Markus and Donzelmann, Torben and Kloster, Nick and Koch, Melissa and V\"{o}llering, Jan-Jakob and Wagner, Mirko H.},
  title =	{{Crossing Numbers of Beyond Planar Graphs Re-Revisited: A Framework Approach}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{33:1--33:17},
  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.33},
  URN =		{urn:nbn:de:0030-drops-213175},
  doi =		{10.4230/LIPIcs.GD.2024.33},
  annote =	{Keywords: Beyond planarity, crossing number, crossing ratio, proof framework}
}
@InProceedings{aichholzer_et_al:LIPIcs.GD.2024.34,
  author =	{Aichholzer, Oswin and Orthaber, Joachim and Vogtenhuber, Birgit},
  title =	{{Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{34:1--34:17},
  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.34},
  URN =		{urn:nbn:de:0030-drops-213187},
  doi =		{10.4230/LIPIcs.GD.2024.34},
  annote =	{Keywords: Simple drawings, Pseudospherical drawings, Generalized convex drawings, Plane Hamiltonicity, Extendability of drawings, Recognition of drawing classes}
}
@InProceedings{katheder_et_al:LIPIcs.GD.2024.35,
  author =	{Katheder, Julia and Kindermann, Philipp and Klute, Fabian and Parada, Irene and Rutter, Ignaz},
  title =	{{On k-Plane Insertion into Plane Drawings}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{35:1--35:11},
  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.35},
  URN =		{urn:nbn:de:0030-drops-213190},
  doi =		{10.4230/LIPIcs.GD.2024.35},
  annote =	{Keywords: Graph drawing, edge insertion, k-planarity}
}
@InProceedings{aloupis_et_al:LIPIcs.GD.2024.36,
  author =	{Aloupis, Greg and Biniaz, Ahmad and Bose, Prosenjit and De Carufel, Jean-Lou and Eppstein, David and Maheshwari, Anil and Odak, Saeed and Smid, Michiel and T\'{o}th, Csaba D. and Valtr, Pavel},
  title =	{{Noncrossing Longest Paths and Cycles}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{36:1--36:17},
  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.36},
  URN =		{urn:nbn:de:0030-drops-213203},
  doi =		{10.4230/LIPIcs.GD.2024.36},
  annote =	{Keywords: Longest Paths, Longest Cycles, Noncrossing Paths, Noncrossing Cycles}
}
@InProceedings{dujmovic_et_al:LIPIcs.GD.2024.37,
  author =	{Dujmovi\'{c}, Vida and La Rose, Camille},
  title =	{{Rectilinear Crossing Number of Graphs Excluding a Single-Crossing Graph as a Minor}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{37:1--37:18},
  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.37},
  URN =		{urn:nbn:de:0030-drops-213219},
  doi =		{10.4230/LIPIcs.GD.2024.37},
  annote =	{Keywords: (rectilinear) crossing number, graph minors, maximum degree, clique-sums}
}
@InProceedings{chang_et_al:LIPIcs.GD.2024.38,
  author =	{Chang, Daniel J. and Sun, Timothy},
  title =	{{Harborth’s Conjecture for 4-Regular Planar Graphs}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{38:1--38:9},
  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.38},
  URN =		{urn:nbn:de:0030-drops-213227},
  doi =		{10.4230/LIPIcs.GD.2024.38},
  annote =	{Keywords: Planar graph, straight-line embedding, Diophantine equation}
}
@InProceedings{eppstein_et_al:LIPIcs.GD.2024.39,
  author =	{Eppstein, David and Goodrich, Michael T. and Illickan, Abraham M.},
  title =	{{Drawing Planar Graphs and 1-Planar Graphs Using Cubic B\'{e}zier Curves with Bounded Curvature}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{39:1--39:17},
  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.39},
  URN =		{urn:nbn:de:0030-drops-213237},
  doi =		{10.4230/LIPIcs.GD.2024.39},
  annote =	{Keywords: graph drawing, planar graphs, B\'{e}zier curves, and RAC drawings}
}
@InProceedings{biedl_et_al:LIPIcs.GD.2024.40,
  author =	{Biedl, Therese and Lubiw, Anna and Spalding-Jamieson, Jack},
  title =	{{Morphing Planar Graph Drawings via Orthogonal Box Drawings}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{40:1--40:16},
  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.40},
  URN =		{urn:nbn:de:0030-drops-213242},
  doi =		{10.4230/LIPIcs.GD.2024.40},
  annote =	{Keywords: morphing, graph morphing, linear morph, planar graph drawing, orthogonal box drawing, orthogonal drawing, algorithm}
}
@InProceedings{dibartolomeo_et_al:LIPIcs.GD.2024.41,
  author =	{Di Bartolomeo, Sara and Klute, Fabian and Mondal, Debajyoti and Wulms, Jules},
  title =	{{Graph Drawing Contest Report}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{41:1--41:13},
  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.41},
  URN =		{urn:nbn:de:0030-drops-213256},
  doi =		{10.4230/LIPIcs.GD.2024.41},
  annote =	{Keywords: Information Visualization, Graph Drawing Contest}
}
@InProceedings{geis_et_al:LIPIcs.GD.2024.42,
  author =	{Geis, Joshua and Zink, Johannes},
  title =	{{From Planar via Outerplanar to Outerpath – Engineering NP-Hardness Constructions}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{42:1--42: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.42},
  URN =		{urn:nbn:de:0030-drops-213263},
  doi =		{10.4230/LIPIcs.GD.2024.42},
  annote =	{Keywords: NP-hardness, outerplanar, outerpath}
}
@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}
}
@InProceedings{chimani_et_al:LIPIcs.GD.2024.44,
  author =	{Chimani, Markus and Kr\"{o}ger, Lea and Liedtke, Juliane and Mevert, Jonah and Shani, Maor and van Zalk, Maarten},
  title =	{{Graph-Drawing Supported Identification of Influential Students at Schools}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{44:1--44: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.44},
  URN =		{urn:nbn:de:0030-drops-213282},
  doi =		{10.4230/LIPIcs.GD.2024.44},
  annote =	{Keywords: social network tool, force-directed graph drawing, group centrality}
}
@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}
}
@InProceedings{herl_et_al:LIPIcs.GD.2024.46,
  author =	{Herl, Nikolaus-Mathias and Filipov, Velitchko},
  title =	{{AdMaTilE: Visualizing Event-Based Adjacency Matrices in a Multiple-Coordinated-Views System}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{46:1--46: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.46},
  URN =		{urn:nbn:de:0030-drops-213307},
  doi =		{10.4230/LIPIcs.GD.2024.46},
  annote =	{Keywords: Event-based, Temporal Graphs, Adjacency Matrix, Network Visualization}
}
@InProceedings{loffler:LIPIcs.GD.2024.47,
  author =	{L\"{o}ffler, Maarten},
  title =	{{Strict Upward Planar Grid Drawings of Binary Trees with Minimal Area}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{47:1--47: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.47},
  URN =		{urn:nbn:de:0030-drops-213311},
  doi =		{10.4230/LIPIcs.GD.2024.47},
  annote =	{Keywords: Upward drawings, grid drawings, minimal area}
}
@InProceedings{domros_et_al:LIPIcs.GD.2024.48,
  author =	{Domr\"{o}s, S\"{o}ren and von Hanxleden, Reinhard},
  title =	{{Determining Sugiyama Topology with Model Order}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{48:1--48: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.48},
  URN =		{urn:nbn:de:0030-drops-213322},
  doi =		{10.4230/LIPIcs.GD.2024.48},
  annote =	{Keywords: Automatic Layout, Model Order, Layered Layout}
}
@InProceedings{hong_et_al:LIPIcs.GD.2024.49,
  author =	{Hong, Seok-Hee and Liotta, Giuseppe and Montecchiani, Fabrizio and N\"{o}llenburg, Martin and Piselli, Tommaso},
  title =	{{Introducing Fairness in Graph Visualization}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{49:1--49: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.49},
  URN =		{urn:nbn:de:0030-drops-213338},
  doi =		{10.4230/LIPIcs.GD.2024.49},
  annote =	{Keywords: Network visualization, Fairness, Stress minimization}
}
@InProceedings{fink_et_al:LIPIcs.GD.2024.50,
  author =	{Fink, Simon D. and Pfretzschner, Matthias and Rutter, Ignaz and Stumpf, Peter},
  title =	{{Level Planarity Is More Difficult Than We Thought}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{50:1--50: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.50},
  URN =		{urn:nbn:de:0030-drops-213341},
  doi =		{10.4230/LIPIcs.GD.2024.50},
  annote =	{Keywords: level planarity, 2-SAT, simple algorithm, counterexample}
}
@InProceedings{baumann_et_al:LIPIcs.GD.2024.51,
  author =	{Baumann, Jakob and Rutter, Ignaz and Sudholt, Dirk},
  title =	{{Evolutionary Algorithms for One-Sided Bipartite Crossing Minimisation}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{51:1--51: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.51},
  URN =		{urn:nbn:de:0030-drops-213353},
  doi =		{10.4230/LIPIcs.GD.2024.51},
  annote =	{Keywords: Mutation Operator, Layered Graphs, Crossing Minimisation}
}
@InProceedings{chiu_et_al:LIPIcs.GD.2024.52,
  author =	{Chiu, Alvin and Eldawy, Ahmed and Goodrich, Michael T.},
  title =	{{Polygonally Anchored Graph Drawing}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{52:1--52: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.52},
  URN =		{urn:nbn:de:0030-drops-213369},
  doi =		{10.4230/LIPIcs.GD.2024.52},
  annote =	{Keywords: polygonal anchors, force-directed}
}
@InProceedings{durocher_et_al:LIPIcs.GD.2024.53,
  author =	{Durocher, Stephane and Kryven, Myroslav and L\"{o}ffler, Maarten},
  title =	{{String Graph with Cop Number 4}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{53:1--53: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.53},
  URN =		{urn:nbn:de:0030-drops-213376},
  doi =		{10.4230/LIPIcs.GD.2024.53},
  annote =	{Keywords: point set embedding, upward planar path embedding, dynamic programming}
}
@InProceedings{solepi:LIPIcs.GD.2024.54,
  author =	{Sol\'{e} Pi, Oriol},
  title =	{{Approximating the Crossing Number of Dense Graphs}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{54:1--54: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.54},
  URN =		{urn:nbn:de:0030-drops-213387},
  doi =		{10.4230/LIPIcs.GD.2024.54},
  annote =	{Keywords: Crossing numbers, Approximation algorithms, Geometric graph theory}
}
@InProceedings{argyriou_et_al:LIPIcs.GD.2024.55,
  author =	{Argyriou, Evmorfia and Niedermann, Benjamin},
  title =	{{yFiles - From Data to Meaningful Visualizations}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{55:1--55: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.55},
  URN =		{urn:nbn:de:0030-drops-213398},
  doi =		{10.4230/LIPIcs.GD.2024.55},
  annote =	{Keywords: diagramming SDK, layout algorithms, interactive graph visualization}
}
@InProceedings{kasperowski_et_al:LIPIcs.GD.2024.56,
  author =	{Kasperowski, Maximilian and Domr\"{o}s, S\"{o}ren and von Hanxleden, Reinhard},
  title =	{{The Eclipse Layout Kernel}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{56:1--56:2},
  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.56},
  URN =		{urn:nbn:de:0030-drops-213401},
  doi =		{10.4230/LIPIcs.GD.2024.56},
  annote =	{Keywords: Automatic Layout, Layered Layout, Layout Library}
}
@InProceedings{feyer_et_al:LIPIcs.GD.2024.57,
  author =	{Feyer, Stefan P. and Kerle-Malcharek, Wilhelm and Zhang, Ying and Schreiber, Falk and Klein, Karsten},
  title =	{{Immersive Analytics of Graphs in Virtual Reality with GAV-VR}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{57:1--57: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.57},
  URN =		{urn:nbn:de:0030-drops-213413},
  doi =		{10.4230/LIPIcs.GD.2024.57},
  annote =	{Keywords: Networks, Immersive Analytics, Software}
}
@InProceedings{deynet_et_al:LIPIcs.GD.2024.58,
  author =	{Deynet, Julius and Hegemann, Tim and Kempf, Sebastian and Wolff, Alexander},
  title =	{{Graph Harvester}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{58:1--58: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.58},
  URN =		{urn:nbn:de:0030-drops-213427},
  doi =		{10.4230/LIPIcs.GD.2024.58},
  annote =	{Keywords: House of Graphs, Graph recognition, Information extraction}
}
@InProceedings{jindal_et_al:LIPIcs.GD.2024.59,
  author =	{Jindal, Garima and Karlapalem, Kamalakar},
  title =	{{CentralityViz: Comprehending Node-Centrality in Large Networks}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{59:1--59: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.59},
  URN =		{urn:nbn:de:0030-drops-213439},
  doi =		{10.4230/LIPIcs.GD.2024.59},
  annote =	{Keywords: Visual Analytics, Graph Drawing, Community Detection, Node Centrality}
}
@InProceedings{meier_et_al:LIPIcs.GD.2024.60,
  author =	{Meier, Harald and Ceni, Arber},
  title =	{{NodeXL - A few Clicks to Network Insights}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{60:1--60:2},
  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.60},
  URN =		{urn:nbn:de:0030-drops-213440},
  doi =		{10.4230/LIPIcs.GD.2024.60},
  annote =	{Keywords: Network Analysis, NodeXL, Social Networks}
}
@InProceedings{kollegger_et_al:LIPIcs.GD.2024.61,
  author =	{Kollegger, Andreas Benno and Erdl, Alexander and Hunger, Michael},
  title =	{{Knowledge Graph Builder - Constructing a Graph from Arbitrary Text Using an LLM}},
  booktitle =	{32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
  pages =	{61:1--61:2},
  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.61},
  URN =		{urn:nbn:de:0030-drops-213451},
  doi =		{10.4230/LIPIcs.GD.2024.61},
  annote =	{Keywords: Knowledge Graph, Lexical Graph}
}