Table of Contents

• Reconfiguring Triangulations with Edge Flips and Point MovesGreg Aloupis, Prosenjit Bose, Pat Morin. 1-11 [doi]
• Drawing Power Law GraphsReid Andersen, Fan R. K. Chung, Lincoln Lu. 12-17 [doi]
• Hexagonal Grid Drawings: Algorithms and Lower BoundsShabnam Aziza, Therese C. Biedl. 18-24 [doi]
• Improved Bounds for the Number of (<=k)-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of K::n::József Balogh, Gelasio Salazar. 25-35 [doi]
• On the Realizable Weaving Patterns of Polynomial Curves in R:::3:::Saugata Basu, Raghavan Dhandapani, Richard Pollack. 36-42 [doi]
• Drawing the AS Graph in 2.5 DimensionsMichael Baur, Ulrik Brandes, Marco Gaertler, Dorothea Wagner. 43-48 [doi]
• Boundary Labeling: Models and Efficient Algorithms for Rectangular MapsMichael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff. 49-59 [doi]
• Convex Drawings of 3-Connected Plane GraphsNicolas Bonichon, Stefan Felsner, Mohamed Mosbah. 60-70 [doi]
• Partitions of Complete Geometric Graphs into Plane TreesProsenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood. 71-81 [doi]
• Additional PC-Tree Planarity ConditionsJohn M. Boyer. 82-88 [doi]
• GraphML TransformationUlrik Brandes, Christian Pich. 89-99 [doi]
• Clustering Cycles into Cycles of ClustersPier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia. 100-110 [doi]
• Unit Bar-Visibility Layouts of Triangulated PolygonsAlice M. Dean, Ellen Gethner, Joan P. Hutchinson. 111-121 [doi]
• Really Straight Graph DrawingsVida Dujmovic, Matthew Suderman, David R. Wood. 122-132 [doi]
• Layouts of Graph SubdivisionsVida Dujmovic, David R. Wood. 133-143 [doi]
• Label Number Maximization in the Slider ModelDietmar Ebner, Gunnar W. Klau, René Weiskircher. 144-154 [doi]
• An Efficient Implementation of Sugiyama s Algorithm for Layered Graph DrawingMarkus Eiglsperger, Martin Siebenhaller, Michael Kaufmann. 155-166 [doi]
• Random Geometric Graph Diameter in the Unit Disk with l::p:: MetricRobert B. Ellis, Jeremy L. Martin, Catherine H. Yan. 167-172 [doi]
• Algorithms for Drawing MediaDavid Eppstein. 173-183 [doi]
• Confluent Layered DrawingsDavid Eppstein, Michael T. Goodrich, Jeremy Yu Meng. 184-194 [doi]
• Simultaneous Embedding of Planar Graphs with Few BendsCesim Erten, Stephen G. Kobourov. 195-205 [doi]
• A Fast and Simple Heuristic for Constrained Two-Level Crossing ReductionMichael Forster. 206-216 [doi]
• Contact and Intersection RepresentationsHubert de Fraysseix, Patrice Ossona de Mendez. 217-227 [doi]
• Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical GraphsCarsten Görg, Peter Birke, Mathias Pohl, Stephan Diehl. 228-238 [doi]
• Graph Drawing by Stress MajorizationEmden R. Gansner, Yehuda Koren, Stephen C. North. 239-250 [doi]
• Computing Radial Drawings on the Minimum Number of CirclesEmilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer. 251-261 [doi]
• Hamiltonian-with-Handles Graphs and the k-Spine Drawability ProblemEmilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman. 262-272 [doi]
• Distributed Graph Layout for Sensor NetworksCraig Gotsman, Yehuda Koren. 273-284 [doi]
• Drawing Large Graphs with a Potential-Field-Based Multilevel AlgorithmStefan Hachul, Michael Jünger. 285-295 [doi]
• Building Blocks of Upward Planar DigraphsPatrick Healy, Karol Lynch. 296-306 [doi]
• A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar GraphsSeok-Hee Hong, Peter Eades. 307-317 [doi]
• Train Tracks and Confluent DrawingsPeter Hui, Marcus Schaefer, Daniel Stefankovic. 318-328 [doi]
• The Three Dimensional Logic EngineMatthew Kitching, Sue Whitesides. 329-339 [doi]
• Long Alternating Paths in Bicolored Point SetsJan Kyncl, János Pach, Géza Tóth. 340-348 [doi]
• Intersection Reverse Sequences and Geometric ApplicationsAdam Marcus, Gábor Tardos. 349-359 [doi]
• New Exact Results and Bounds for Bipartite Crossing Numbers of MeshesMatthew Newton, Ondrej Sýkora, Martin Uzovic, Imrich Vrto. 360-370 [doi]
• Drawing Pfaffian GraphsSerguei Norine. 371-376 [doi]
• 3D Visualization of Semantic Metadata Models and OntologiesCharalampos Papamanthou, Ioannis G. Tollis, Martin Doerr. 377-388 [doi]
• A Note on the Self-similarity of Some Orthogonal DrawingsMaurizio Patrignani. 389-394 [doi]
• No-Three-in-Line-in-3DAttila Pór, David R. Wood. 395-402 [doi]
• Visual Navigation of Compound GraphsMarcus Raitner. 403-413 [doi]
• Layout Volumes of the HypercubeLubomir Torok, Imrich Vrto. 414-424 [doi]
• New Theoretical Bounds of Visibility Representation of Plane GraphsHuaming Zhang, Xin He. 425-430 [doi]
• Visualizing Large Graphs with Compound-Fisheye Views and TreemapsJames Abello, Stephen G. Kobourov, Roman Yusufov. 431-441 [doi]
• A Compound Graph Layout Algorithm for Biological PathwaysUgur Dogrusöz, Erhan Giral, Ahmet Cetintas, Ali Civril, Emek Demir. 442-447 [doi]
• Curvilinear Graph Drawing Using the Force-Directed MethodBenjamin Finkel, Roberto Tamassia. 448-453 [doi]
• Graphael: A System for Generalized Force-Directed LayoutsDavid Forrester, Stephen G. Kobourov, Armand Navabi, Kevin Wampler, Gary V. Yee. 454-464 [doi]
• QUOGGLES: Query On Graphs - A Graphical Largely Extensible SystemPaul Holleis, Franz-Josef Brandenburg. 465-470 [doi]
• Visualisation of Large and Complex Networks Using PolyPlaneSeok-Hee Hong, Tom Murtagh. 471-481 [doi]
• The Metro Map Layout ProblemSeok-Hee Hong, Damian Merrick, Hugo A. D. do Nascimento. 482-491 [doi]
• An Interactive Multi-user System for Simultaneous Graph DrawingStephen G. Kobourov, Chandan Pitta. 492-501 [doi]
• Gravisto: Graph Visualization ToolkitChristian Bachmaier, Franz-Josef Brandenburg, Michael Forster, Paul Holleis, Marcus Raitner. 502-503 [doi]
• DNA Secondary Structures for Probe DesignYanga Byun, Kyungsook Han. 504-507 [doi]
• Open Problems WikiMarcus Raitner. 508-509 [doi]
• Visualization and ILOG CPLEXGeorg Sander, Adrian Vasiliu. 510-511 [doi]
• Graph-Drawing Contest ReportFranz-Josef Brandenburg, Christian A. Duncan, Emden R. Gansner, Stephen G. Kobourov. 512-516 [doi]
• Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local TreewidthErik D. Demaine, Mohammad Taghi Hajiaghayi. 517-533 [doi]