![]() |
![]() ![]() |
|
GeneralNewsCall for Papers Important Dates Committees Tradition Poster SubmissionProceedingsConferenceFacilitiesRegistration proGD Satellite Event GD Challenge Program Invited Speakers Photos LocationTravelAccommodation Conference Venue City of Konstanz Things To Do Impressions |
Accepted Papers
How to draw a Tait-colored graph.
Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs.
Lombardi Drawings of Graphs.
Universal Pointsets for 2-coloured Trees.
Drawing Graphs on a Smartphone.
On Maximum Differential Graph Coloring.
Upward Geometric Graph Embeddings into Point Sets.
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area.
Drawing Ordered (k-1)-ary Trees on k-Grids.
Point-Set Embeddings of Plane 3-Trees.
Maximizing the Total Resolution of Graphs.
On Touching Triangle Graphs.
Improving Layered Graph Layouts with Edge Bundling.
A computational approach to Conway's thrackle conjecture.
On the size of graphs that admit polyline drawings with few bends and crossing angles.
Complexity of Finding Non-Planar Rectilinear Drawings of Graphs.
Drawing Trees with Perfect Angular Resolution and Polynomial Area.
The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs.
Difference Map Readability for Dynamic Graphs.
Optimal k-level Planarization and Crossing Minimization.
Confluent Drawing Algorithms using Rectangular Dualization.
Drawing Orthogonal Graphs with Flexibility Constraints.
On a Tree and a Path with no Geometric Simultaneous Embedding.
Optimal 3D Angular Resolution for Low-Degree Graphs.
Triangle contact representations and duality.
Monotone Drawings of Graphs.
Plane Drawings of Queue and Deque Graphs.
Convex Polygon Intersection Graphs.
Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints
Optimizing Regular Edge Labelings.
Drawing planar graphs of bounded degree with few slopes.
Topology-driven Force-directed Algorithms.
An Experimental Evaluation of Multilevel Layout Methods.
On Graphs Supported by Line Sets.
Dot-product representations of planar graphs.
|
Gold SponsorsSilver Sponsors |