Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Jacob Fox, János Pach, and Andrew Suk. Enumeration of Intersection Graphs of x-Monotone Curves. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 4:1-4:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@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} }
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)
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)
Oksana Firman, Grzegorz Gutowski, Myroslav Kryven, Yuto Okada, and Alexander Wolff. Bounding the Treewidth of Outer k-Planar Graphs via Triangulations. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 14:1-14:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@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} }
Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Daniel Archambault, Giuseppe Liotta, Martin Nöllenburg, Tommaso Piselli, Alessandra Tappini, and Markus Wallinger. Bundling-Aware Graph Drawing. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 15:1-15:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@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} }
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)
Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmović, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, and Alexandra Weinberger. On k-Planar Graphs Without Short Cycles. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 27:1-27:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@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} }
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)
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)
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} }
Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
David Eppstein, Michael T. Goodrich, and Abraham M. Illickan. Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 39:1-39:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@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} }
Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Therese Biedl, Anna Lubiw, and Jack Spalding-Jamieson. Morphing Planar Graph Drawings via Orthogonal Box Drawings. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 40:1-40:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@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} }
Feedback for Dagstuhl Publishing