



LEADER 
06659nmm a2200373 u 4500 
001 
EB000652097 
003 
EBX01000000000000000505179 
005 
00000000000000.0 
007 
cr 
008 
140122  eng 
020 


a 9783540245957

100 
1 

a Liotta, Guiseppe
e [editor]

245 
0 
0 
a Graph Drawing
h Elektronische Ressource
b 11th International Symposium, GD 2003, Perugia, Italy, September 2124, 2003, Revised Papers
c edited by Guiseppe Liotta

250 


a 1st ed. 2004

260 


a Berlin, Heidelberg
b Springer Berlin Heidelberg
c 2004, 2004

300 


a XIV, 542 p
b online resource

505 
0 

a Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes  AxisbyAxis Stress Minimization  Drawing Graphs with Nonuniform Nodes Using Potential Fields  Surfaces and Diagrams  Drawing AreaProportional Venn and Euler Diagrams  Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface  Posters  Degree Navigator TM : The Journey of a Visualization Software  HexGraph: Applying Graph Drawing Algorithms to the Game of Hex  GLuskap: Visualization and Manipulation of Graph Drawings in 3Dimensions  WebLinkage Viewer: Drawing Links in the Web Based on a SiteOriented Framework  The Puzzle Layout Problem  Visual Data Mining with ILOG Discovery  Graph Drawing Contest  GraphDrawing Contest Report  Invited Talks  Engineering and Visualizing Algorithms  Report on the Invited Lecture by Pat Hanrahan, Titled “On Being in the Right Space”  Open Problems  Selected Open Problems in Graph Drawing

505 
0 

a GraphEx: An Improved Graph Translation Service  A Constrained, ForceDirected Layout Algorithm for Biological Pathways  IntersectionFree Morphing of Planar Graphs  Fixed Parameter Tractability  Fixed Parameter Algorithms for onesided crossing minimization Revisited  Experiments with the FixedParameter Approach for TwoLayer Planarization  Clusters, Cuts, and Orthogonal Drawings  Characterizing Families of Cuts That Can Be Represented by AxisParallel Rectangles  Convex Drawing for cPlanar Biconnected Clustered Graphs  Layout of Directed Hypergraphs with Orthogonal Hyperedges  NoBend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs  kLevel Drawings  Radial Level Planarity Testing and Embedding in Linear Time  An Improved Approximation to the OneSided Bilayer Drawing  StraightLine Drawings of 2Outerplanar Graphs on Two Curves  Force Directed and EnergyBased Techniques  An Energy Model for Visual Graph Clustering 

505 
0 

a Planarity and Planar Drawings  Confluent Drawings: Visualizing Nonplanar Diagrams in a Planar Way  An Experimental Study of Crossing Minimization Heuristics  Stop Minding Your P’s and Q’s: Implementing a Fast and Simple DFSBased Planarity Testing and Embedding Algorithm  Bounds and Methods for kPlanar Crossing Numbers  Geometric Graph Theory  How Many Ways Can One Draw a Graph?  Two Results on Intersection Graphs of Polygons  Stretching of Jordan Arc Contact Systems  Noncrossing Hamiltonian Paths in Geometric Graphs  Applications and Systems – Part I  GraphAEL: Graph Animations with Evolving Layouts  Visualizing Related Metabolic Pathways in Two and a Half Dimensions  GoVisual for CASE Tools Borland Together ControlCenter and Gentleware Poseidon – System Demonstration  StraightLine, Circular, and CircularArc Drawings  AreaEfficient Drawings of Outerplanar Graphs  A Framework for UserGrouped Circular Drawings 

505 
0 

a FixedLocation CircularArc Drawing of Planar Graphs  A More Practical Algorithm for Drawing Binary Trees in Linear Area with Arbitrary Aspect Ratio  Symmetries  An Integer Programming Approach to Fuzzy Symmetry Detection  Barycentric Drawings of Periodic Graphs  3DDrawings  ThreeDimensional Grid Drawings with Subquadratic Volume  Laying Out Iterated Line Digraphs Using Queues  Track Drawings of Graphs with Constant Queue Number  3D Visibility Representations of Complete Graphs  Drawing SeriesParallel Graphs on Restricted Integer 3D Grids  Nearly Optimal Three Dimensional Layout of Hypercube Networks  Embeddings and Triangulations  Graph Embedding with Minimum Depth and Maximum External Face  More Efficient Generation of Plane Triangulations  Planar Embeddings of Graphs with Specified Edge Lengths  Applicationsand Systems – Part II  BGPlay: A System for Visualizing the Interdomain Routing Evolution 

653 


a Computer graphics

653 


a Computer science / Mathematics

653 


a Discrete Mathematics in Computer Science

653 


a Computer Graphics

653 


a Algorithms

653 


a Discrete Mathematics

653 


a Discrete mathematics

041 
0 
7 
a eng
2 ISO 6392

989 


b SBA
a Springer Book Archives 2004

490 
0 

a Lecture Notes in Computer Science

028 
5 
0 
a 10.1007/b94919

856 
4 
0 
u https://doi.org/10.1007/b94919?nosfx=y
x Verlag
3 Volltext

082 
0 

a 511.1

520 


a The 11th International Symposium on Graph Drawing (GD 2003) was held on September 21–24, 2003, at the Universit` a degli Studi di Perugia, Perugia, Italy. GD 2003 attracted 93 participants from academic and industrial institutions in 17 countries. In response to the call for papers, the program committee received 88 re larsubmissionsdescribingoriginalresearchand/orsystemdemonstrations.Each submission was reviewed by at least 4 program committee members and c ments were returned to the authors. Following extensive email discussions, the program committee accepted 34 long papers (12 pages each in the proceedings) and 11 short papers (6 pages each in the proceedings). Also, 6 posters (2 pages each in the proceedings) were displayed in the conference poster gallery. In addition to the 88 submissions, the program committee also received a submission of special type, one that was not competing with the others for a time slot in the conference program and that collects selected open problems in graph drawing. The aim of this paper, which was refereed with particular care andUNCHANGEDtworoundsofrevisions,istostimulatefutureresearchinthe graph drawing community. The paper presents 42 challenging open problems in di?erentareasofgraphdrawingandcontainsmorethan120references.Although the length of the paper makes it closer to a journal version than to a conference extended abstract, we decided to include it in the conference proceedings so that it could easily reach in a short time the vast majority of the graph drawing community
