Abstract is missing.
- Why Are String Graphs So Beautiful?János Pach. 1 [doi]
- The Art of Cheating When Drawing a GraphMartin Wattenberg. 2 [doi]
- Drawing Hamiltonian Cycles with No Large AnglesAdrian Dumitrescu, János Pach, Géza Tóth. 3-14 [doi]
- Area, Curve Complexity, and Crossing Resolution of Non-planar Graph DrawingsEmilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer. 15-20 [doi]
- On the Perspectives Opened by Right Angle Crossing DrawingsPatrizio Angelini, Luca Cittadini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Michael Kaufmann, Antonios Symvonis. 21-32 [doi]
- Drawing 3-Polytopes with Good Vertex ResolutionAndré Schulz. 33-44 [doi]
- Planar Drawings of Higher-Genus GraphsChristian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov. 45-56 [doi]
- Splitting Clusters to Get C-PlanarityPatrizio Angelini, Fabrizio Frati, Maurizio Patrignani. 57-68 [doi]
- On the Characterization of Level Planar Trees by Minimal PatternsAlejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov. 69-80 [doi]
- Characterization of Unlabeled Radial Level Planar GraphsJ. Joseph Fowler. 81-93 [doi]
- Upward Planarization LayoutMarkus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong. 94-106 [doi]
- More Flexible Radial LayoutUlrik Brandes, Christian Pich. 107-118 [doi]
- WiGis: A Framework for Scalable Web-Based Interactive Graph VisualizationsBrynjar Gretarsson, Svetlin Bostandjiev, John O Donovan, Tobias Höllerer. 119-134 [doi]
- Port Constraints in Hierarchical Layout of Data Flow DiagramsMiro Spönemann, Hauke Fuhrmann, Reinhard von Hanxleden, Petra Mutzel. 135-146 [doi]
- Fast Edge-Routing for Large GraphsTim Dwyer, Lev Nachmanson. 147-158 [doi]
- Leftist Canonical OrderingMelanie Badent, Michael Baur, Ulrik Brandes, Sabine Cornelsen. 159-170 [doi]
- Succinct Greedy Drawings Do Not Always ExistPatrizio Angelini, Giuseppe Di Battista, Fabrizio Frati. 171-182 [doi]
- Geometric Simultaneous Embeddings of a Graph and a MatchingSergio Cabello, Marc J. van Kreveld, Giuseppe Liotta, Henk Meijer, Bettina Speckmann, Kevin Verbeek. 183-194 [doi]
- Algebraic Methods for Counting Euclidean Embeddings of Rigid GraphsIoannis Z. Emiris, Elias P. Tsigaridas, Antonios Varvitsiotis. 195-200 [doi]
- Removing Independently Even CrossingsMichael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic. 201-206 [doi]
- Manhattan-Geodesic Embedding of Planar GraphsBastian Katz, Marcus Krug, Ignaz Rutter, Alexander Wolff. 207-218 [doi]
- Orthogonal Connector RoutingMichael Wybrow, Kim Marriott, Peter J. Stuckey. 219-231 [doi]
- On Rectilinear Drawing of GraphsPeter Eades, Seok-Hee Hong, Sheung-Hung Poon. 232-243 [doi]
- Semi-bipartite Graph Visualization for Gene Ontology NetworksKai Xu 0003, Rohan Williams, Seok-Hee Hong, Qing Liu, Ji Zhang. 244-255 [doi]
- On Open Problems in Biological Network VisualizationMario Albrecht, Andreas Kerren, Karsten Klein, Oliver Kohlbacher, Petra Mutzel, Wolfgang Paul, Falk Schreiber, Michael Wybrow. 256-267 [doi]
- A Novel Grid-Based Visualization Approach for Metabolic Networks with Advanced Focus&Context ViewMarkus Rohrschneider, Christian Heine, André Reichenbach, Andreas Kerren, Gerik Scheuermann. 268-279 [doi]
- Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar GraphsTherese C. Biedl. 280-291 [doi]
- Drawing Trees in a Streaming ModelCarla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig. 292-303 [doi]
- The Planar Slope Number of Planar Partial 3-Trees of Bounded DegreeVít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesar, Tomás Vyskocil. 304-315 [doi]
- Drawing Planar 3-Trees with Given Face-AreasTherese C. Biedl, Lesvia Elena Ruiz Velázquez. 316-322 [doi]
- 3D Visibility Representations by Regular PolygonsJan Stola. 323-333 [doi]
- Complexity of Some Geometric and Topological ProblemsMarcus Schaefer. 334-344 [doi]
- On Planar Supports for HypergraphsKevin Buchin, Marc J. van Kreveld, Henk Meijer, Bettina Speckmann, Kevin Verbeek. 345-356 [doi]
- DAGmaps and ::::epsilon::::-Visibility Representations of DAGsVassilis Tsiaras, Ioannis G. Tollis. 357-368 [doi]
- Drawing Directed Graphs ClockwiseChristian Pich. 369-380 [doi]
- An Improved Algorithm for the Metro-line Crossing Minimization ProblemMartin Nöllenburg. 381-392 [doi]
- Layout with Circular and Other Non-linear Constraints Using Procrustes ProjectionTim Dwyer, George G. Robertson. 393-404 [doi]
- GMap: Drawing Graphs as MapsEmden R. Gansner, Yifan Hu, Stephen G. Kobourov. 405-407 [doi]
- Using High Dimensions to Compare Drawings of GraphsStina S. Bridgeman. 408-410 [doi]
- On ::::rho::::-Constrained Upward Topological Book EmbeddingsTamara Mchedlidze, Antonios Symvonis. 411-412 [doi]
- 4-Labelings and Grid Embeddings of Plane QuadrangulationsLali Barrière, Clemens Huemer. 413-414 [doi]
- IBM ILOG Graph Layout for EclipseJerome Joubert, Stephane Lizeray, Romain Raugi, Georg Sander. 415-416 [doi]
- Layout Techniques Coupled with Web2.0-Based Business Process ModelingPhilip Effinger, Gero Decker. 417-418 [doi]
- Proving or Disproving Planar Straight-Line Embeddability onto Given RectanglesMichael Kaufmann, Stephan Kottler. 419-420 [doi]
- Visualization of Complex BPEL ModelsBenjamin Albrecht, Philip Effinger, Markus Held, Michael Kaufmann, Stephan Kottler. 421-423 [doi]
- DAGmaps and Dominance RelationshipsVassilis Tsiaras, Ioannis G. Tollis. 424-425 [doi]
- Scaffold Hunter - Interactive Exploration of Chemical SpaceKarsten Klein, Nils Kriege, Petra Mutzel, Herbert Waldmann, Stefan Wetzel. 426-427 [doi]
- Graph Drawing Contest ReportChristian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander. 428-433 [doi]