Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Michael Kaufmann, Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder, and Torsten Ueckerdt. The Density Formula: One Lemma to Bound Them All. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 7:1-7:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@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} }
Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Petr Hliněný and Lili Ködmön. Note on Min- k-Planar Drawings of Graphs. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 8:1-8:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@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} }
Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Thomas Depian, Simon D. Fink, Robert Ganian, and Martin Nöllenburg. The Parameterized Complexity Of Extending Stack Layouts. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 12:1-12:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@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} }
Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, and Alexander Wolff. The Price of Upwardness. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 13:1-13:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@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} }
Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Henry Förster, Felix Klesen, Tim Dwyer, Peter Eades, Seok-Hee Hong, Stephen G. Kobourov, Giuseppe Liotta, Kazuo Misue, Fabrizio Montecchiani, Alexander Pastukhov, and Falk Schreiber. GraphTrials: Visual Proofs of Graph Properties. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 16:1-16:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@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} }
Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, and Ioannis G. Tollis. Weakly Leveled Planarity with Bounded Span. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 19:1-19:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@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} }
Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Carlos Alegría, Susanna Caroppo, Giordano Da Lozzo, Marco D'Elia, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, and Maurizio Patrignani. Upward Pointset Embeddings of Planar st-Graphs. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 24:1-24:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@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} }
Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Miriam Münch and Ignaz Rutter. Parameterized Algorithms for Beyond-Planar Crossing Numbers. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 25:1-25:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@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} }
Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Tim Hegemann and Alexander Wolff. Storylines with a Protagonist. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 26:1-26:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@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} }
Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Aaron Büngener and Maximilian Pfister. On the Edge Density of Bipartite 3-Planar and Bipartite Gap-Planar Graphs. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 28:1-28:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@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} }
Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Aaron Büngener and Michael Kaufmann. Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 29:1-29:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@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} }
Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Alexander Dobler, Michael Jünger, Paul J. Jünger, Julian Meffert, Petra Mutzel, and Martin Nöllenburg. Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 31:1-31:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@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} }
Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Michael A. Bekos, Giuseppe Di Battista, Emilio Di Giacomo, Walter Didimo, Michael Kaufmann, and Fabrizio Montecchiani. On the Complexity of Recognizing k^+-Real Face Graphs. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 32:1-32:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@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} }
Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Markus Chimani, Torben Donzelmann, Nick Kloster, Melissa Koch, Jan-Jakob Völlering, and Mirko H. Wagner. Crossing Numbers of Beyond Planar Graphs Re-Revisited: A Framework Approach. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 33:1-33:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@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} }
Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Julia Katheder, Philipp Kindermann, Fabian Klute, Irene Parada, and Ignaz Rutter. On k-Plane Insertion into Plane Drawings. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 35:1-35:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@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} }
Feedback for Dagstuhl Publishing