Abstract is missing.
- Networks in Biology - From Identification, Analysis to InterpretationJesper Tegnér. 1 [doi]
- Graph Drawing for Security VisualizationRoberto Tamassia, Bernardo Palazzi, Charalampos Papamanthou. 2-13 [doi]
- Succinct Greedy Graph Drawing in the Hyperbolic PlaneDavid Eppstein, Michael T. Goodrich. 14-25 [doi]
- An Algorithm to Construct Greedy Drawings of TriangulationsPatrizio Angelini, Fabrizio Frati, Luca Grilli. 26-37 [doi]
- Crossing and Weighted Crossing Number of Near-Planar GraphsSergio Cabello, Bojan Mohar. 38-49 [doi]
- Cubic Graphs Have Bounded Slope ParameterBalázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth. 50-60 [doi]
- Unimaximal Sequences of Pairs in Rectangle Visibility DrawingJan Stola. 61-66 [doi]
- Visibility Representations of Four-Connected Plane Graphs with Near Optimal HeightsChieh-Yu Chen, Ya-Fei Hung, Hsueh-I Lu. 67-77 [doi]
- The Topology of Bendless Three-Dimensional Orthogonal Graph DrawingDavid Eppstein. 78-89 [doi]
- Rapid Multipole Graph Drawing on the GPUApeksha Godiyal, Jared Hoberock, Michael Garland, John C. Hart. 90-101 [doi]
- Clustered Planarity: Clusters with Few Outgoing EdgesVít Jelínek, Ondrej Suchý, Marek Tesar, Tomás Vyskocil. 102-113 [doi]
- Computing Maximum C-Planar SubgraphsMarkus Chimani, Carsten Gutwenger, Mathias Jansen, Karsten Klein, Petra Mutzel. 114-120 [doi]
- Clustered Planarity: Embedded Clustered Graphs with Two-Component ClustersVít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický. 121-132 [doi]
- Visual Analysis of One-to-Many Matched GraphsEmilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Pietro Palladino. 133-144 [doi]
- Topological Morphing of Planar GraphsPatrizio Angelini, Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani. 145-156 [doi]
- An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed EdgesJ. Joseph Fowler, Carsten Gutwenger, Michael Jünger, Petra Mutzel, Michael Schulz. 157-168 [doi]
- Graph Simultaneous Embedding Tool, GraphSETAlejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov. 169-180 [doi]
- Hamiltonian Alternating Paths on Bicolored Double-ChainsJosef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr. 181-192 [doi]
- The Binary Stress Model for Graph DrawingYehuda Koren, Ali Civril. 193-205 [doi]
- Efficient Node Overlap Removal Using a Proximity Stress ModelEmden R. Gansner, Yifan Hu. 206-217 [doi]
- An Experimental Study on Distance-Based Graph DrawingUlrik Brandes, Christian Pich. 218-229 [doi]
- Topology Preserving Constrained Graph LayoutTim Dwyer, Kim Marriott, Michael Wybrow. 230-241 [doi]
- Embeddability Problems for Upward Planar DigraphsFrancesco Giordano, Giuseppe Liotta, Sue Whitesides. 242-253 [doi]
- A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded DigraphsAimal Rextin, Patrick Healy. 254-265 [doi]
- On the Hardness of Orthogonal-Order Preserving Graph DrawingUlrik Brandes, Barbara Pampel. 266-277 [doi]
- Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility ConstraintsSeok-Hee Hong, Martin Mader. 278-283 [doi]
- Placing Text Boxes on GraphsSjoerd van Hagen, Marc J. van Kreveld. 284-295 [doi]
- Removing Node Overlaps Using Multi-sphere SchemeTakashi Imamichi, Yohei Arahori, Jaeseong Gim, Seok-Hee Hong, Hiroshi Nagamochi. 296-301 [doi]
- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity TestingVladimir P. Korzhik, Bojan Mohar. 302-312 [doi]
- Connected Rectilinear Graphs on Point SetsMaarten Löffler, Elena Mumford. 313-318 [doi]
- 3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable SurfacesMartin Kochol. 319-323 [doi]
- Drawing (Complete) Binary TanglegramsKevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin Nöllenburg, Yoshio Okamoto, Rodrigo I. Silveira, Alexander Wolff. 324-335 [doi]
- Two Polynomial Time Algorithms for the Metro-line Crossing Minimization ProblemEvmorfia Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis. 336-347 [doi]
- Cyclic Leveling of Directed GraphsChristian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Gergö Lovász. 348-359 [doi]
- Constrained Point-Set Embeddability of Planar GraphsEmilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath. 360-371 [doi]
- Tree Drawings on the Hexagonal GridChristian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Andreas Hofmeier, Marco Matzeder, Thomas Unfried. 372-383 [doi]
- Isometric Diamond SubgraphsDavid Eppstein. 384-389 [doi]
- Non-convex Representations of GraphsGiuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani. 390-395 [doi]
- Subdivision Drawings of HypergraphsMichael Kaufmann, Marc J. van Kreveld, Bettina Speckmann. 396-407 [doi]
- Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree ThreeMd. Abul Hassan Samee, Md. Jawaherul Alam, Muhammad Abdullah Adnan, Md. Saidur Rahman. 408-419 [doi]
- Dunnart: A Constraint-Based Network Diagram Authoring ToolTim Dwyer, Kim Marriott, Michael Wybrow. 420-431 [doi]
- Approximating the Crossing Number of Apex GraphsMarkus Chimani, Petr Hlinený, Petra Mutzel. 432-434 [doi]
- Policy-Aware Visualization of Internet DynamicsLuca Cittadini, Tiziana Refice, Alessio Campisano, Giuseppe Di Battista, Claudio Sasso. 435-436 [doi]
- Enhancing Visualizations of Business ProcessesPhilip Effinger, Michael Kaufmann, Martin Siebenhaller. 437-438 [doi]
- A Robust Biclustering Method Based on Crossing Minimization in Bipartite GraphsCesim Erten, Melih Sözdinler. 439-440 [doi]
- Visualizing the Results of Metabolic Pathway QueriesAllison P. Heath, George N. Bennett, Lydia E. Kavraki. 441-442 [doi]
- Visual Specification of LayoutSonja Maier, Steffen Mazanek, Mark Minas. 443-444 [doi]
- Spine Crossing Minimization in Upward Topological Book EmbeddingsTamara Mchedlidze, Antonios Symvonis. 445-446 [doi]
- ILOG ElixirGeorg Sander. 447-448 [doi]
- DAGmap ViewVassilis Tsiaras, Ioannis G. Tollis. 449-450 [doi]
- Brain Network AnalyzerVassilis Tsiaras, Ioannis G. Tollis, Vangelis Sakkalis. 451-452 [doi]
- Graph Drawing Contest ReportUgur Dogrusoz, Christian A. Duncan, Carsten Gutwenger, Georg Sander. 453-458 [doi]