+612 9045 4394
Graph Drawing : 17th International Symposium, GD 2009, Chicago, Il, Usa, September 22-25, 2009. Revised Papers - David Eppstein

Graph Drawing

17th International Symposium, GD 2009, Chicago, Il, Usa, September 22-25, 2009. Revised Papers

By: David Eppstein (Editor), Emden R. Gansner (Editor)


Published: 29th July 2010
Ships: 15 business days
15 business days
or 4 easy payments of $42.38 with Learn more

The 17th International Symposium on Graph Drawing (GD 2009) was held in Chicago, USA, September 22-25, 2009, and was attended by 91 participants from 19 countries. In response to the call for papers, the Program Committee received 79 s- missions. Each submission was reviewed by at least three Program Committee members. Following substantial discussions, the committee accepted 31 long - pers and 4 short papers. All authors received detailed reviewers' comments. In a separate submission process, 10 posters were accepted. These were described during the conference, and displayedatthe conferencesite. Eachposter was also granted a two-page description in the conference proceedings. Two invited speakers, J´ anos Pach from EPFL Lausanne and R´ eny Institute, and Martin Wattenberg from IBM Research, gave absorbing talks during the conference. Prof. Pach looked at the class of string graphs, and tantalized us to consider why their properties are so mathematically beautiful. Dr. Watt- berg showed how sometimes twisting the standard rules of graph drawing can illuminate unexpected information contained in graphs. Keepingwithtradition, the symposiumhostedthe 15thAnnualGraphDr- ingContest, including aGraphDrawingChallengeforconferenceattendees.The contest elicited robust participation from the community with 27 submissions. These proceedings end with a detailed report of the contest. As always, the success of a conference such as this relies on the help of many people. Our thanks to the Program Committee and all of the external referees who worked so hard to sift for the best among the submitted papers. The OrganizingCommittee providedus with admirablefacilities, a ?ne banquet, andtookcareofsomanyotherdetailsthatitwashardtobelievetherewereonly threemembers: Jennifer McClelland, MichaelJ.PelsmajerandMarcusSchaefer.

Invited Talks
Why Are String Graphs So Beautiful? (Extended Abstract)p. 1
The Art of Cheating When Drawing a Graph (Extended Abstract)p. 2
Drawing Hamiltonian Cycles with No Large Anglesp. 3
Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawingsp. 15
On the Perspectives Opened by Right Angle Crossing Drawingsp. 21
Drawing 3-Polytopes with Good Vertex Resolutionp. 33
Planar Drawings of Higher-Genus Graphsp. 45
Splitting Clusters to Get C-Planarityp. 57
On the Characterization of Level Planar Trees by Minimal Patternsp. 69
Characterization of Unlabeled Radial Level Planar Graphs (Extended Abstract)p. 81
Upward Planarization Layoutp. 94
More Flexible Radial Layoutp. 107
WiGis: A Framework for Scalable Web-Based Interactive Graph Visualizationsp. 119
Port Constraints in Hierarchical Layout of Data Flow Diagramsp. 135
Fast Edge-Routing for Large Graphsp. 147
Leftist Canonical Orderingp. 159
Succinct Greedy Drawings Do Not Always Existp. 171
Geometric Simultaneous Embeddings of a Graph and a Matchingp. 183
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphsp. 195
Removing Independently Even Crossingsp. 201
Manhattan-Geodesic Embedding of Planar Graphsp. 207
Orthogonal Connector Routingp. 219
On Rectilinear Drawing of Graphsp. 232
Semi-bipartite Graph Visualization for Gene Ontology Networksp. 244
On Open Problems in Biological Network Visualizationp. 256
A Novel Grid-Based Visualization Approach for Metabolic Networks with Advanced Focus&Context Viewp. 268
Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphsp. 280
Drawing Trees in a Streaming Modelp. 292
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degreep. 304
Drawing Planar 3-Trees with Given Face-Areasp. 316
3D Visibility Representations by Regular Polygonsp. 323
Complexity of Some Geometric and Topological Problemsp. 334
On Planar Supports for Hypergraphsp. 345
DAGmaps and ¿-Visibility Representations of DAGsp. 357
Drawing Directed Graphs Clockwisep. 369
An Improved Algorithm for the Metro-line Crossing Minimization Problemp. 381
Layout with Circular and Other Non-linear Constraints Using Procrustes Projectionp. 393
GMap: Drawing Graphs as Mapsp. 405
Using High Dimensions to Compare Drawings of Graphsp. 408
On ¿-Constrained Upward Topological Book Embeddingsp. 411
4-Labelings and Grid Embeddings of Plane Quadrangulationsp. 413
IBM ILOG Graph Layout for Eclipsep. 415
Layout Techniques Coupled with Web2.0-Based Business Process Modelingp. 417
Proving or Disproving Planar Straight-Line Embeddability onto Given Rectanglesp. 419
Visualization of Complex BPEL Modelsp. 421
DAGmaps and Dominance Relationshipsp. 424
Scaffold Hunter - Interactive Exploration of Chemical Spacep. 426
Graph Drawing Contest
Graph Drawing Contest Reportp. 428
Author Indexp. 435
Table of Contents provided by Ingram. All Rights Reserved.

ISBN: 9783642118043
ISBN-10: 3642118046
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 436
Published: 29th July 2010
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.37 x 15.49  x 2.29
Weight (kg): 0.68