default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGD 1999: Stirín Castle, Czech Republic
- Jan Kratochvíl
:
Graph Drawing, 7th International Symposium, GD'99, Stirín Castle, Czech Republic, September 1999, Proceedings. Lecture Notes in Computer Science 1731, Springer 1999, ISBN 3-540-66904-3 - Jirí Matousek:
The Anatomy of a Geometric Algorithm. 1-7 - Stina S. Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara:
Turn-Regularity and Planar Orthogonal Drawings. 8-26 - Gunnar W. Klau, Petra Mutzel:
Combining Graph Labeling and Compaction. 27-37 - Ashim Garg, Giuseppe Liotta:
Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time. 38-48 - Michael Closson, Shane Gartshore, John R. Johansen, Stephen K. Wismath:
Fully Dynamic 3-Dimensional Orthogonal Graph Drawing. 49-58 - Vance E. Waddle, Ashok Malhotra:
An E log E Line Crossing Algorithm for Levelled Graphs. 59-71 - Michael Jünger, Sebastian Leipert:
Level Planar Embedding in Linear Time. 72-81 - Ivan A. Lisitsyn, Victor N. Kasyanov:
Higres - Visualization System for Clustered Graphs and Graph Algorithms. 82-89 - Vladimir Batagelj, Andrej Mrvar, Matjaz Zaversnik:
Partitioning Approach to Visualization of Large Graphs. 90-97 - Jubin Edachery, Arunabha Sen, Franz-Josef Brandenburg:
Graph Clustering Using Distance-k Cliques. 98-106 - Janet M. Six, Ioannis G. Tollis:
A Framework for Circular Drawings of Networks. 107-116 - C. C. Cheng, Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov:
Drawing Planar Graphs with Circular Arcs. 117-126 - Bojan Mohar:
Drawing Graphs in the Hyperbolic Plane. 127-136 - Robin Thomas:
Graph Planarity and Related Topics. 137-144 - Kazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki:
Grid Drawings of Four-Connected Plane Graphs. 145-154 - Christoph Dornheim:
Graph Embedding with Topological Cycle-Constraints. 155-164 - Michael Kaufmann, Roland Wiese:
Embedding Vertices at Points: Few Bends Suffice for Planar Graphs. 165-174 - Petra Mutzel, Thomas Ziegler:
The Constrained Crossing Minimization Problem. 175-185 - Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov:
Planarity-Preserving Clustering and Embedding for Large Planar Graphs. 186-196 - François Bertault, Mirka Miller:
An Algorithm for Drawing Compound Graphs. 197-204 - Patrick Healy, Ago Kuusik:
The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation. 205-216 - Christian Matuszewski, Robby Schönfeld, Paul Molitor:
Using Sifting for k -Layer Straightline Crossing Minimization. 217-224 - Farhad Shahrokhi, Imrich Vrto:
On 3-Layer Crossings and Pseudo Arrangements. 225-231 - Ala Eddine Barouni, Ali Jaoua, Nejib Zaguia:
Visualizing Algorithms for the Design and Analysis of Survivable Networks. 232-241 - Lila Behzadi:
LayoutShow: A Signed Applet/Application for Graph Drawing and Experimentation. 242-249 - Ulrik Brandes, Patrick Kenis, Dorothea Wagner:
Centrality in Policy Network Drawings. 250-258 - Wojciech Basalaj, Karen Eilbeck:
Straight-Line Drawings of Protein Interactions. 259-266 - Jaroslav Nesetril:
Art of Drawing. 267-275 - Hubert de Fraysseix:
An Heuristic for Graph Symmetry Detection. 276-285 - Sabine Bachl:
Isomorphic Subgraphs. 286-296 - Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia:
Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size. 297-310 - David R. Wood:
Multi-dimensional Orthogonal Graph Drawing with Small Boxes. 311-322 - Patrice Ossona de Mendez:
Geometric Realization of Simplicial Complexes. 323-332 - Robert Babilon, Helena Nyklová, Ondrej Pangrác, Jan Vondrák:
Visibility Representations of Complete Graphs. 333-340 - Natalia de Castro, Francisco Javier Cobos, Juan Carlos Dana, Alberto Márquez, Marc Noy:
Triangle-Free Planar Graphs as Segments Intersection Graphs. 341-358 - François Bertault:
A Force-Directed Algorithm that Preserves Edge Crossing Properties. 351-358 - Therese Biedl, Anna Bretscher, Henk Meijer:
Rectangle of Influence Drawings of Graphs without Filled 3-Cycles. 359-368 - Giuseppe Liotta, Henk Meijer:
Voronoi Drawings of Trees. 369-378 - Camil Demetrescu, Giuseppe Di Battista, Irene Finocchi, Giuseppe Liotta, Maurizio Patrignani, Maurizio Pizzonia:
Infinite Trees and the Future. 379-391 - Ivan Herman, Guy Melançon, Maurice M. de Ruiter, Maylis Delest:
Latour - A Tree Visualisation System. 392-399 - Franz-Josef Brandenburg, Michael Jünger, Joe Marks, Petra Mutzel, Falk Schreiber:
Graph-Drawing Contest Report. 400-409 - Ulrik Brandes:
Hunting Down Graph B. 410-415 - Ho-Lin Chen, Hsu-Chun Yen:
Orthogonal and Straight-Line Drawings of Graphs with Succinct Representations. 416-417 - Carl-Christian Kanne, Falk Schreiber, Dietrich Trümbach:
Electronic Biochemical Pathways. 418-419
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.
last updated on 2024-09-30 00:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
