1 | -- | 26 | Sándor P. Fekete, Winfried Hellmann, Michael Hemmer, Arne Schmidt, Julian Troegel. Computing maxmin edge length triangulations |
27 | -- | 73 | Moritz Baum, Thomas Bläsius, Andreas Gemsa, Ignaz Rutter, Franziska Wegner. Scalable exact visualization of isocontours in road networks via minimum-link paths |
74 | -- | 93 | Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara. Flat foldings of plane graphs with prescribed angles and edge lengths |
94 | -- | 130 | Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli. Drawing planar graphs with many collinear vertices |
131 | -- | 190 | Haitao Wang 0001. On the geodesic centers of polygonal domains |
191 | -- | 212 | Bahareh Banyassady, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein. Improved time-space trade-offs for computing Voronoi diagrams |
213 | -- | 246 | Jean Cardinal, Stefan Felsner. Topological drawings of complete bipartite graphs |
247 | -- | 289 | Luca Castelli Aleardi, Olivier Devillers. Array-based compact data structures for triangulations: Practical solutions with theoretical guarantees |
290 | -- | 311 | Linda Kleist. Drawing planar graphs with prescribed face areas |
312 | -- | 327 | Helmut Alt, Kevin Buchin, Steven Chaplick, Otfried Cheong, Philipp Kindermann, Christian Knauer, Fabian Stehn. Placing your coins on a shelf |
328 | -- | 355 | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg. Planar and poly-arc Lombardi drawings |
356 | -- | 386 | Vida Dujmovic, David R. Wood. Thickness and antithickness of graphs |
387 | -- | 390 | János Pach, Peter Frankl. A stability theorem on cube tessellations |
391 | -- | 429 | Luca Castelli Aleardi, Olivier Devillers, Éric Fusy. Canonical ordering for graphs on the cylinder, with applications to periodic straight-line drawings on the flat cyclinder and torus |
430 | -- | 453 | Prosenjit Bose, Matias Korman, Sander Verdonschot, André van Renssen. Routing on the visibility graph |