This book constitutes the proceedings of the 22nd International Symposium on Graph Drawing, GD 2014, held in Würzburg, Germany, in September 2014. The 41 full papers presented in this volume were carefully reviewed and selected from 72 submissions. The back matter of the book also contains 2 page poster papers presented at the conference. The contributions are organized in topical sections named: planar subgraphs; simultaneous embeddings; applications; contact representations; k-planar graphs; crossing minimization; level drawings; theory; fixed edge directions; drawing under constraints; clustered planarity; and greedy graphs.

Produktinformation

Utgivningsdatum2014-12-01
Mått155 x 235 x 30 mm
Vikt826 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor530
Upplaga2014
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783662458020

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT
Diskret matematik inom Naturvetenskap och teknik

Planar Subgraphs.- Planar Induced Subgraphs of Sparse Graphs.- Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph.- Drawing Partially Embedded and Simultaneously Planar Graphs.- Simultaneous Embeddings.- Drawing Simultaneously Embedded Graphs with Few Bends.- Planar and Quasi Planar Simultaneous Geometric Embedding.- Simultaneous Embeddability of Two Partitions.- Applications.- Luatodonotes: Boundary Labeling for Annotations in Texts.- A Coloring Algorithm for Disambiguating Graph and Map Drawings.- Untangling Hairballs: From 3 to 14 Degrees of Separation.- GION: Interactively Untangling Large Graphs on Wall-Sized Displays.- Contact Representations.- Balanced Circle Packings for Planar Graphs.- Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D.- The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings.- Bitonic st-orderings of Biconnected Planar Graphs.- k-Planar Graphs.- Drawing Outer 1-planar Graphs with Few Slopes.- Fan-Planar Graphs: Combinatorial Properties and Complexity Results.- On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs.- Crossing Minimization Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth.- A Crossing Lemma for the Pair-Crossing Number.- Are Crossings Important for Drawing Large Graphs?.- Level Drawings.- The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity).- Column Planarity and Partial Simultaneous Geometric Embedding.- Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths.- Theory.- Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture.- Morphing Schnyder Drawings of Planar Triangulations.- Trade-Offs in Planar Polyline Drawings.- Fixed Edge Directions.- Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports.- Planar Octilinear Drawings with One Bend Per Edge.- On the Complexity of HV-rectilinear Planarity Testing.- Embedding Four-Directional Paths on Convex Point Sets.- Drawing under Constraints.- Drawing Graphs within Restricted Area.- Height-Preserving Transformations of Planar Graph Drawings.- Drawing Planar Graphs with Reduced Height.- Anchored Drawings of Planar Graphs.- Clustered Planarity.- Advances on Testing C-Planarity of Embedded Flat Clustered Graphs.- Clustered Planarity Testing Revisited.- A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem.- MapSets: Visualizing Embedded and Clustered Graphs.- Greedy Graphs.- Increasing-Chord Graphs On Point Sets.- On Self-approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs.- On Monotone Drawings of Trees.- Graph Drawing Contest.- Graph Drawing Contest Report.- Posters.- A User Study on the Visualization of Directed Graphs.- GraphBook: Making Graph Paging Real.- Circular Tree Drawing by Simulating Network Synchronisation Dynamics and Scaling.- PiGra– A Tool for Pixelated Graph Representations.- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends.- Touching Triangle Representations in a k-gon of Biconnected Outerplanar Graphs.- 3D Graph Visualization with the Oculus Rift.- Force-Directed 3D Arc Diagrams.- People Prefer Less Stress and Fewer Crossings.- A New Approach to Visualizing General Trees Using Thickness-Adjustable Quadratic Curves.- Minimum Representations of Rectangle Visibility Graphs.

Mer från samma serie

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

749 kr

Del 15427

Internet of Things – ICIOT 2024

Shunli Zhang, Liang-Jie Zhang

Häftad, 2024

819 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

729 kr

Compiler Construction

Albert Cohen

Häftad, 2014

719 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

729 kr

Theory of Cryptography

Yehuda Lindell

Häftad, 2014

749 kr

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

749 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

749 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 219 kr

Objects and Databases

Alan Dearle, Roberto V. Zicari

Häftad, 2010

749 kr

Du kanske också är intresserad av

Graph Drawing

Patrick Healy, Nikola S. Nikolov

Häftad, 2006

749 kr

Graph Drawing

Petra Mutzel, Michael Jünger, Sebastian Leipert

Häftad, 2002

1 449 kr

Graph Drawing

Stephen North

Häftad, 1997

729 kr

Graph Drawing

Sue H. Whitesides

Häftad, 1999

729 kr

Del 8242

Graph Drawing

Stephen Wismath, Alexander Wolff

Häftad, 2013

729 kr

Graph Drawing

Ioannis G. Tollis, Maurizio Patrignani

Häftad, 2009

729 kr

Graph Drawing

Walter Didimo, Maurizio Patrignani

Häftad, 2013

729 kr

Graph Drawing

Stephen G. Kobourov, Michael T. Goodrich

Häftad, 2002

729 kr

Graph Drawing

Seok-Hee Hong, Takao Nishizeki, Wu Quan

Häftad, 2008

729 kr

Graph Drawing

David Eppstein, Emden R Gansner

Häftad, 2010

729 kr

Del i serien Lecture Notes in Computer Science

Graph Drawing

22nd International Symposium, GD 2014, Würzburg, Germany, September 24-26, 2014, Revised Selected Papers

Häftad, Engelska, 2014

AvChristian Duncan,Antonios Symvonis

729 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (10)

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

1 449 kr

Skickas inom 10-15 vardagar

Häftad

1 489 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

1 449 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Produktinformation

Utgivningsdatum2014-12-01
Mått155 x 235 x 30 mm
Vikt826 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor530
Upplaga2014
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783662458020

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT
Diskret matematik inom Naturvetenskap och teknik

Planar Subgraphs.- Planar Induced Subgraphs of Sparse Graphs.- Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph.- Drawing Partially Embedded and Simultaneously Planar Graphs.- Simultaneous Embeddings.- Drawing Simultaneously Embedded Graphs with Few Bends.- Planar and Quasi Planar Simultaneous Geometric Embedding.- Simultaneous Embeddability of Two Partitions.- Applications.- Luatodonotes: Boundary Labeling for Annotations in Texts.- A Coloring Algorithm for Disambiguating Graph and Map Drawings.- Untangling Hairballs: From 3 to 14 Degrees of Separation.- GION: Interactively Untangling Large Graphs on Wall-Sized Displays.- Contact Representations.- Balanced Circle Packings for Planar Graphs.- Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D.- The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings.- Bitonic st-orderings of Biconnected Planar Graphs.- k-Planar Graphs.- Drawing Outer 1-planar Graphs with Few Slopes.- Fan-Planar Graphs: Combinatorial Properties and Complexity Results.- On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs.- Crossing Minimization Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth.- A Crossing Lemma for the Pair-Crossing Number.- Are Crossings Important for Drawing Large Graphs?.- Level Drawings.- The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity).- Column Planarity and Partial Simultaneous Geometric Embedding.- Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths.- Theory.- Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture.- Morphing Schnyder Drawings of Planar Triangulations.- Trade-Offs in Planar Polyline Drawings.- Fixed Edge Directions.- Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports.- Planar Octilinear Drawings with One Bend Per Edge.- On the Complexity of HV-rectilinear Planarity Testing.- Embedding Four-Directional Paths on Convex Point Sets.- Drawing under Constraints.- Drawing Graphs within Restricted Area.- Height-Preserving Transformations of Planar Graph Drawings.- Drawing Planar Graphs with Reduced Height.- Anchored Drawings of Planar Graphs.- Clustered Planarity.- Advances on Testing C-Planarity of Embedded Flat Clustered Graphs.- Clustered Planarity Testing Revisited.- A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem.- MapSets: Visualizing Embedded and Clustered Graphs.- Greedy Graphs.- Increasing-Chord Graphs On Point Sets.- On Self-approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs.- On Monotone Drawings of Trees.- Graph Drawing Contest.- Graph Drawing Contest Report.- Posters.- A User Study on the Visualization of Directed Graphs.- GraphBook: Making Graph Paging Real.- Circular Tree Drawing by Simulating Network Synchronisation Dynamics and Scaling.- PiGra– A Tool for Pixelated Graph Representations.- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends.- Touching Triangle Representations in a k-gon of Biconnected Outerplanar Graphs.- 3D Graph Visualization with the Oculus Rift.- Force-Directed 3D Arc Diagrams.- People Prefer Less Stress and Fewer Crossings.- A New Approach to Visualizing General Trees Using Thickness-Adjustable Quadratic Curves.- Minimum Representations of Rectangle Visibility Graphs.