| City College Session (SESSION 1): Wednesday 11:00am-12:35pm - Session Chair: Janos Pach |
| 11:00-11:20 | N. Bonichon, S. Felsner, M. Mosbah |
| Convex Drawings of 3-Connected Plane Graphs
|
| 11:20-11:40 | P. Healy, K. Lynch |
| Building Blocks of Upward Planar Digraphs
|
| 11:40-12:00 | G. Aloupis, P. Bose, P. Morin |
| Reconfiguring Triangulations with Edge Flips and Point Moves
|
| 12:00-12:20 | P. Bose, F. Hurtado, E. Rivera-Campo, D. Wood |
| Partitions of Complete Geometric Graphs into Plane Trees
|
| 12:20-12:35 | H. Zhang, X. He: |
| New Theoretical Bounds of Visibility Representation of Plane Graphs
|
| SESSION 2: Wednesday 2:30pm-4:05pm - Session Chair: Franz-J. Brandenburg |
| 2:30- 2:45 | R. Andersen, F. Chung, L. Lu |
| Drawing Power Law Graphs
|
| 2:45- 3:05 | D. Eppstein |
| Algorithms for Drawing Media |
| 3:05- 3:25 | C. Gotsman, Y. Koren |
| Distributed Graph Layout for Sensor Networks
|
| 3:25- 3:45 | M. Raitner |
| Visual Navigation of Compound Graphs
|
| 3:45- 4:05 | E. Gansner, Y. Koren, S. North |
| Graph Drawing by Stress Majorization
|
| SESSION 3: Wednesday 4:35pm-6:10pm - Session Chair: Emden Gansner |
| 4:35- 4:55 | S. Hong, P. Eades |
| A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Planar Graphs
|
| 4:55- 5:15 | D. Ebner, G. Klau, R. Weiskircher |
| Label Number Maximization in the Slider Model
|
| 5:15- 5:35 | M. Eiglsperger, M. Siebenhaller, M. Kaufmann |
| An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing
|
| 5:35- 5:55 | M. Forster |
| A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction
|
| 5:55- 6:10 | J. Boyer |
| Additional PC-tree Planarity Conditions
|
| University of North Texas Session (SESSION 4): Thursday 9:00am-10:40pm - Session Chair: Farhad Shahrokhi |
| 9:00- 9:20 | V. Dujmovic', D. Wood |
| Layouts of Graph Subdivisions
|
| 9:20- 9:40 | L. Torok, I. Vrt'o |
| Layout Volumes of the Hypercube
|
| 9:40-10:00 | V. Dujmovic', M. Suderman, D. Wood |
| Really Straight Graph Drawings
|
| 10:00-10:20 | D. Eppstein, M. Goodrich, J. Meng |
| Confluent Layered Drawings
|
| 10:20-10:40 | P. Hue, M. Schaefer, D. Stefankovic |
| Train Tracks and Confluent Drawings
|
| SESSION 5: Thursday 11:10am-12:30pm - Session Chair: Ondrej Sykora |
| 11:10-11:30 | A. Dean, E. Gethner, J. Hutchinson |
| Unit Bar-Visibility Layouts of Triangulated Polygons
|
| 11:30-11:50 | H. de Fraysseix, P. Ossona de Mendez |
| Contact and Intersection Representations
|
| 11:50-12:10 | E. Di Giacomo, W. Didimo, G. Liotta, H. Meijer |
| Computing Radial Drawings on the Minimum Number of Circles
|
| 12:10-12:30 | M. Kitching, S. Whitesides |
| The Three Dimensional Logic Engine
|
| SESSION 6: Thursday 2:30pm-4:05pm - Session Chair: Roberto Tamassia |
| 2:30- 2:50 | A. Marcus, G. Tardos |
| Intersection Reverse Sequences and Geometric Applications
|
| 2:50- 3:10 | J. Kyncl, J. Pach, G. Toth |
| Long Alternating Paths in Bicolored Point Sets
|
| 3:10- 3:25 | S. Norine |
| Drawing Pfaffian Graphs
|
| 3:25- 3:45 | M. Newton, O. Sykora, M. Uzovic, I. Vrto |
| New Exact Results and Bounds for Bipartite Crossing Numbers of Meshes
|
| 3:45- 4:05 | J. Balogh, G. Salazar |
| Improved Bounds for the Number of k-sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of K_n
|
| SESSION 7: Thursday 4:35pm-6:00pm - Session Chair: Stephen Kobourov |
| 4:35- 4:55 | P. F. Cortese, G. Di Battista, M. Patrignani, M. Pizzonia |
| Clustering Cycles into Cycles of Clusters
|
| 4:55- 5:10 | M. Baur, U. Brandes, M. Gaertler, D. Wagner |
| Drawing the AS Graph in Two and a Half Dimensions
|
| 5:10- 5:25 | S. Basu, R. Dhandapani, R. Pollack |
| On the Realizable Weaving Patterns of Polynomial Curves in R^3
|
| 5:25- 5:45 | E. Di Giacomo, W. Didimo, G. Liotta, M. Suderman |
| Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem
|
| 5:45- 6:00 | R. Ellis, X. Jia, J. Martin, C. Yan |
| Random Geometric Graph Diameter in the Unit Disk with l_p Metric
|
| SESSION 8: Friday 9:00am-10:40am - Session Chair: Hubert de Fraysseix |
| 9:00- 9:20 | C. Papamanthou, I. Tollis, M. Doerr |
| 3D Visualization of Semantic Metadata Models and Ontologies
|
| 9:20- 9:40 | M. Bekos, M. Kaufmann, A. Symvonis, A. Wolff |
| Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps
|
| 9:40-10:00 | C. Goerg, P. Birke, M. Pohl, S. Diehl |
| Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs
|
| 10:00-10:20 | U. Brandes, C. Pich |
| GraphML Transformation
|
| 10:20-10:40 | S. Hachul, M. Junger |
| Drawing Large Graphs with a Potential Field Based Multilevel Algorithm
|
| SESSION 9: Friday 11:10am-12:20pm - Session Chair: Giuseppe Liotta |
| 11:10-11:30 | C. Erten, S. Kobourov |
| Simultaneous Embedding of Planar Graphs with Few Bends
|
| 11:30-11:50 | A. Por, D. Wood |
| No-Three-in-Line in 3D
|
| 11:50-12:05 | S. Aziza, T. Biedl |
| Hexagonal Grid Drawings: Algorithms and Lower Bounds
|
| 12:05-12:20 | M. Patrignani |
| A Note on the Self-Similarity of Some Orthogonal Drawings
|
| SESSION 10: Friday 2:15pm-4:40pm - Session Chair: Arian Rusu |
| 2:15- 2:30 | B. Finkel, R. Tamassia |
| Curvilinear Graph Drawing Using the Force-Directed Method
|
| 2:30- 2:50 | D. Forrester, S. Kobourov, A. Navabi, K. Wampler, G. Yee |
| Graphael: A System for Generalized Force-Directed Layouts
|
| 2:50- 3:10 | S. Kobourov, C. Pitta |
| An Interactive Multi-User System for Simultaneous Graph Drawing
|
| 3:10- 3:30 | S. Hong, T. Murtagh |
| Visualization of Large and Complex Networks Using PolyPlane
|
| 3:30- 3:50 | S. Kobourov, R. Yusufov |
| Visualizing Large Graphs with Compound-Fisheye Views and Treemaps
|
| 3:50- 4:05 | P. Holleis, F. Brandenburg |
| QUOGGLES: Query On Graphs - a Graphical Largely Extensible System
|
| 4:05- 4:20 | U. Dogrusoz, E. Giral, A. Cetintas, A. Civril, E. Demir |
| A Compound Graph Layout Algorithm for Biological Pathways
|
| 4:20- 4:40 | S. Hong, D. Merrick, H. Nascimento |
| The Metro Map Layout Problem
|