![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
31st GD 2023: Palermo, Italy - Part II
- Michael A. Bekos
, Markus Chimani
:
Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part II. Lecture Notes in Computer Science 14466, Springer 2023, ISBN 978-3-031-49274-7
Topological Aspects
- Stephane Durocher, Shahin Kamali, Myroslav Kryven
, Fengyi Liu, Amirhossein Mashghdoust, Avery Miller
, Pouria Zamani Nezhad, Ikaro Penha Costa, Timothy Zapp:
Cops and Robbers on 1-Planar Graphs. 3-17 - Phoebe de Nooijer, Soeren Terziadis
, Alexandra Weinberger
, Zuzana Masárová
, Tamara Mchedlidze
, Maarten Löffler
, Günter Rote
:
Removing Popular Faces in Curve Arrangements. 18-33 - Oswin Aichholzer
, Birgit Vogtenhuber
, Alexandra Weinberger
:
Different Types of Isomorphisms of Drawings of Complete Multipartite Graphs. 34-50
Parameterized Complexity for Drawings
- Emilio Di Giacomo
, Walter Didimo
, Giuseppe Liotta
, Fabrizio Montecchiani
, Giacomo Ortali
:
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity. 53-65 - Cornelius Brand
, Robert Ganian
, Sebastian Röder, Florian Schager:
Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs. 66-81 - Simon D. Fink
, Matthias Pfretzschner
, Ignaz Rutter
:
Parameterized Complexity of Simultaneous Planarity. 82-96 - Sabine Cornelsen
, Giordano Da Lozzo
, Luca Grilli
, Siddharth Gupta
, Jan Kratochvíl
, Alexander Wolff
:
The Parametrized Complexity of the Segment Number. 97-113
Planar Graphs
- Olivier Bernardi
, Éric Fusy
, Shizhe Liang
:
A Schnyder-Type Drawing Algorithm for 5-Connected Triangulations. 117-132 - Raphael Steiner
:
A Logarithmic Bound for Simultaneous Embeddings of Planar Graphs. 133-140 - Alvin Chiu
, David Eppstein, Michael T. Goodrich
:
Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs. 141-149
Frameworks
- Martin Nöllenburg
, Markus Wallinger
:
Computing Hive Plots: A Combinatorial Framework. 153-169 - Tim Hegemann
, Alexander Wolff
:
A Simple Pipeline for Orthogonal Graph Drawing. 170-186
Algorithmics
- Walter Didimo
, Fedor V. Fomin
, Petr A. Golovach
, Tanmay Inamdar
, Stephen G. Kobourov
, Marie Diana Sieper
:
Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem. 189-202 - Bart M. P. Jansen
, Liana Khazaliya
, Philipp Kindermann
, Giuseppe Liotta
, Fabrizio Montecchiani
, Kirill Simonov
:
Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth. 203-217 - Matt DeVos, Danielle Rogers, Alexandra Wesolek
:
On Minimizing the Energy of a Spherical Graph Representation. 218-231
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.