10 Reasons to Get Interested in Graph Drawing

This is an invitation to the research area of graph drawing. It encompasses basic research such as graph theory, complexity theory, data structures, and graph algorithms as well as applied research such as software libraries, implementations, and applications. Application domains include areas within computer science (e. g., information visualization, software engineering, model-based design, automated cartography) as well as outside (e. g., molecular biology and the social sciences). A selection of results demonstrates the influence of graph drawing on other areas and vice versa.

[1]  M. Chrobak,et al.  Convex Grid Drawings of 3-Connected Planar Graphs , 1997, Int. J. Comput. Geom. Appl..

[2]  Walter Didimo,et al.  Computing Quasi-Upward Planar Drawings of Mixed Graphs , 2015, Comput. J..

[3]  Jirí Matousek,et al.  Intersection graphs of segments and $\exists\mathbb{R}$ , 2014, ArXiv.

[4]  Ben Shneiderman,et al.  Tree visualization with tree-maps: 2-d space-filling approach , 1992, TOGS.

[5]  Jens M. Schmidt.  The Mondshein Sequence , 2013, ICALP.

[6]  Bettina Speckmann,et al.  On rectilinear duals for vertex-weighted plane graphs , 2009, Discret. Math..

[7]  Jana Koehler,et al.  The refined process structure tree , 2009, Data Knowl. Eng..

[8]  A. von Manteuffel,et al.  Reduze 2 - Distributed Feynman Integral Reduction , 2012, 1201.4330.

[9]  Alexei Pozdnoukhov,et al.  User-Centric Time-Distance Representation of Road Networks , 2010, GIScience.

[10]  Goos Kant,et al.  Drawing planar graphs using the canonical ordering , 1996, Algorithmica.

[11]  Yi-Ting Chiang,et al.  Orderly spanning trees with applications to graph encoding and graph drawing , 2001, SODA '01.

[12]  Daniel Bienstock.  Some provably hard crossing number problems , 1991, Discret. Comput. Geom..

[13]  János Pach,et al.  How to draw a planar graph on a grid , 1990, Comb..

[14]  T. Bernhardsen.  Geographic Information Systems: An Introduction , 1999 .

[15]  Falk Schreiber,et al.  High quality visualization of biochemical pathways in BioPath , 2002, Silico Biol..

[16]  Ulrik Brandes,et al.  Using Graph Layout to Visualize Train Interconnection Data , 1998, Graph Drawing.

[17]  Bettina Speckmann,et al.  Strict Confluent Drawing , 2013 .

[18]  Hai Zhou,et al.  Layout decomposition with pairwise coloring for multiple patterning lithography , 2013, 2013 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[19]  Bettina Speckmann,et al.  Evolution Strategies for Optimizing Rectangular Cartograms , 2012, GIScience.

[20]  Walter Schnyder,et al.  Embedding planar graphs on the grid , 1990, SODA '90.

[21]  Marc J. van Kreveld,et al.  Time-Space Maps from Triangulations , 2012, GD.

[22]  Michael Jünger,et al.  Advances in C-Planarity Testing of Clustered Graphs , 2002, Graph Drawing.

[23]  Carlo Batini,et al.  A layout algorithm for data flow diagrams , 1986, IEEE Transactions on Software Engineering.

[24]  Carlo Batini,et al.  Computer aided layout of entity relationship diagrams , 1984, J. Syst. Softw..

[25]  David Eppstein,et al.  Selected Open Problems in Graph Drawing , 2003, Graph Drawing.

[26]  Matthew O. Ward,et al.  Multivariate Networks in the Life Sciences , 2013, Multivariate Network Visualization.

[27]  Edoardo M. Airoldi,et al.  A Survey of Statistical Network Models , 2009, Found. Trends Mach. Learn..

[28]  J. Kratochvil,et al.  Intersection Graphs of Segments , 1994, J. Comb. Theory, Ser. B.

[29]  Roberto Tamassia,et al.  On Embedding a Graph in the Grid with the Minimum Number of Bends , 1987, SIAM J. Comput..

[30]  Mark de Berg,et al.  Schematization of networks , 2005, Comput. Geom..

[31]  Wohl.  Die neueren Ansichten ber den chemischen Verlauf der Grung , 1907 .

[32]  Michael Jünger,et al.  A new approach for visualizing UML class diagrams , 2003, SoftVis '03.

[33]  Walter Didimo,et al.  Drawing Graphs with Right Angle Crossings , 2009, WADS.

[34]  Ulrik Brandes,et al.  Studying Social Networks - A Guide to Empirical Research , 2013 .

[35]  Falk Schreiber,et al.  Analysis of Biological Networks , 2008 .

[36]  Walter Didimo,et al.  Upward and quasi-upward planarity testing of embedded mixed graphs , 2014, Theor. Comput. Sci..

[37]  Clyde L. Monma,et al.  On the complexity of embedding planar graphs to minimize certain distance measures , 2005, Algorithmica.

[38]  Karlheinz Ochs,et al.  Generation of wave digital structures for networks containing multiport elements , 2005, IEEE Transactions on Circuits and Systems I: Regular Papers.

[39]  Marian Petre,et al.  Why looking isn't always seeing: readership skills and graphical programming , 1995, CACM.

[40]  Christophe Hurter,et al.  Towards Unambiguous Edge Bundling: Investigating Confluent Drawings for Network Visualization , 2017, IEEE Transactions on Visualization and Computer Graphics.

[41]  Petra Mutzel,et al.  A Linear Time Implementation of SPQR-Trees , 2000, GD.

[42]  Ioannis G. Tollis,et al.  Treemaps for Directed Acyclic Graphs , 2007, GD.

[43]  Ulrik Brandes,et al.  More Canonical Ordering , 2011, J. Graph Algorithms Appl..

[44]  Inanç Birol,et al.  Hive plots - rational approach to visualizing networks , 2012, Briefings Bioinform..

[45]  Jacob L. Moreno,et al.  Who shall survive? : foundations of sociometry, group psychotherapy, and sociodrama , 1953 .

[46]  Walter Didimo,et al.  Planarization of Clustered Graphs , 2001, Graph Drawing.

[47]  David Eppstein,et al.  Journal of Graph Algorithms and Applications Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way , 2022 .

[48]  Reinhard von Hanxleden,et al.  Automatic layout in the face of unattached comments , 2014, 2014 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC).

[49]  Petra Mutzel.  The SPQR-Tree Data Structure in Graph Drawing , 2003, ICALP.

[50]  Nicolas Le Novère,et al.  Systems Biology Graphical Notation: Activity Flow language Level 1 Version 1.2 , 2015, J. Integr. Bioinform..

[51]  Bettina Speckmann,et al.  On rectangular cartograms , 2007 .

[52]  Bettina Speckmann,et al.  Travel-Time Maps: Linear Cartograms with Fixed Vertex Locations , 2014, GIScience.

[53]  Martin Gronemann,et al.  Bitonic st-orderings for Upward Planar Graphs , 2016, GD.

[54]  Gabriele Neyer.  Line Simplification with Restricted Orientations , 1999, WADS.

[55]  Alexander Wolff,et al.  Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming , 2011, IEEE Transactions on Visualization and Computer Graphics.

[56]  Udo Hoffmann,et al.  Intersection graphs and geometric objects in the plane , 2016 .

[57]  Ulrik Brandes,et al.  Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks , 2015, J. Graph Algorithms Appl..

[58]  Jeffrey Heer,et al.  SpanningAspectRatioBank Easing FunctionS ArrayIn ColorIn Date Interpolator MatrixInterpola NumObjecPointI Rectang ISchedu Parallel Pause Scheduler Sequen Transition Transitioner Transiti Tween Co DelimGraphMLCon IData JSONCon DataField DataSc Dat DataSource Data DataUtil DirtySprite LineS RectSprite , 2011 .

[59]  Reinhard von Hanxleden,et al.  Incremental diagram layout for automated model migration , 2016, MoDELS.

[60]  Roberto Tamassia,et al.  On-Line Graph Algorithms with SPQR-Trees , 1990, ICALP.

[61]  Walter Didimo,et al.  Orthogonal drawings of graphs with vertex and edge labels , 2005, Comput. Geom..

[62]  Emilio Di Giacomo,et al.  Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings , 2010, Theory of Computing Systems.

[63]  Michael Hoffmann,et al.  Quality Ratios of Measures for Graph Drawing Styles , 2014, CCCG.

[64]  Bettina Speckmann,et al.  Flow Map Layout via Spiral Trees , 2011, IEEE Transactions on Visualization and Computer Graphics.

[65]  Daniel Tunkelang,et al.  JIGGLE: Java Interactive Graph Layout Environment , 1998, GD.

[66]  Bettina Speckmann,et al.  Angle-Restricted Steiner Arborescences for Flow Map Layout , 2011, Algorithmica.

[67]  Stefan Felsner,et al.  Computing Cartograms with Optimal Complexity , 2013, Discret. Comput. Geom..

[68]  Peter D. Karp,et al.  Automated Drawing of Metabolic Pathways , 2000 .

[69]  Mario Albrecht,et al.  On Open Problems in Biological Network Visualization , 2009, GD.

[70]  Peter F. Stevens,et al.  AUGUSTIN AUGIER'S “ARBRE BOTANIQUE” (1801), A REMARKABLE EARLY BOTANICAL REPRESENTATION OF THE NATURAL SYSTEM , 1983 .

[71]  Jochen Seemann,et al.  Extending the Sugiyama Algorithm for Drawing UML Class Diagrams: Towards Automatic Layout of Object-Oriented Software Diagrams , 1997, GD.

[72]  Reinhard von Hanxleden,et al.  Taming graphical modeling , 2010, MODELS'10.

[73]  Petra Mutzel,et al.  Combining Graph Labeling and Compaction , 1999, GD.

[74]  Serdar Tasiran,et al.  TreeJuxtaposer: scalable tree comparison using Focus+Context with guaranteed visibility , 2003, ACM Trans. Graph..

[75]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[76]  Bernhard Schätz,et al.  Model-Based Development of Embedded Systems , 2002, OOIS Workshops.

[77]  Michael Jünger,et al.  Automatic Layout of UML Class Diagrams in Orthogonal Style , 2004, Inf. Vis..

[78]  Kim Marriott,et al.  A generic algorithm for layout of biological networks , 2009, BMC Bioinformatics.

[79]  Robert F. Cohen,et al.  Online Animated Graph Drawing for Web Navigation , 1997, GD.