GD2001 Call for Participation
Michael Juenger
mjuenger at informatik.uni-koeln.de
Tue Jul 24 19:47:17 PDT 2001
***********************************************************************
*** ***
***** Call for Participation *****
****** ******
******* G R A P H D R A W I N G 2 0 0 1 *******
******** ********
******** September 23-26, 2001, Vienna, Austria ********
******** ********
******* Early Registration Deadline: August 8, 2001 *******
****** ******
***** http://www.ads.tuwien.ac.at/gd2001 *****
*** ***
***********************************************************************
****** Invited Lectures ******
Alexander Schrijver, CWI Amsterdam: Graph Drawing and Eigenvalues
Eduard Groeller, TU Vienna: Insight into Data Through Visualization
****** Conference Organization ******
Petra Mutzel, Vienna University of Technology
Michael Juenger, University of Cologne
jointly with the Austrian Academy of Sciences
****** Program ******
_____________________________________________________________________
| |
|Monday, 24 September 2001 |
|---------------------------------------------------------------------|
|09:00 - 09:15|Opening |
|---------------------------------------------------------------------|
|Hierarchical Drawing Chair: Petra Mutzel |
|---------------------------------------------------------------------|
|09:15 - 09:40|V. Dujmovic, M. Fellows, M. Hallett, M. Kitching, |
| |G. Liotta, C. McCartin, N. Nishimura, P. Ragde, |
| |F. Rosamond, M. Suderman, S. Whitesides, D. R. Wood |
| |A Fixed-Parameter Approach to Two-Layer Planarization |
|-------------|-------------------------------------------------------|
|09:40 - 10:00|P. Healy, N. S. Nikolov |
| |How to Layer a Directed Acyclic Graph |
|-------------|-------------------------------------------------------|
|10:00 - 10:20|U. Brandes, B. Köpf |
| |Fast and Simple Horizontal Coordinate Assignment |
|-------------|-------------------------------------------------------|
|10:20 - 10:40|J. M. Six, I. G. Tollis |
| |Automated Visualization of Process Diagrams |
|---------------------------------------------------------------------|
|Coffee Break |
|---------------------------------------------------------------------|
|Planarity Chair: Yefim Dinitz |
|---------------------------------------------------------------------|
|11:10 - 11:30|G. Di Battista, W. Didimo, A. Marcandalli |
| |Planarization of Clustered Graphs |
|-------------|-------------------------------------------------------|
|11:30 - 11:55|K. Edwards, G. Farr |
| |An Algorithm for Finding Large Induced Planar Subgraphs|
|-------------|-------------------------------------------------------|
|11:55 - 12:20|H. de Fraysseix, P. O. de Mendez |
| |A Characterization of DFS Cotree Critical Graphs |
|---------------------------------------------------------------------|
|Lunch |
|---------------------------------------------------------------------|
|Invited Presentation Chair: Michael Jünger |
|---------------------------------------------------------------------|
|14:00 - 15:00|Alexander Schrijver |
| |Graph Drawing and Eigenvalues |
|---------------------------------------------------------------------|
|Coffee Break |
|---------------------------------------------------------------------|
|Crossing Theory Chair: Herbert Fleischner |
|---------------------------------------------------------------------|
|15:30 - 15:55|H. Djidjev, I. Vrto |
| |An Improved Lower Bound for Crossing Numbers |
|-------------|-------------------------------------------------------|
|15:55 - 16:20|P. Hlineny |
| |Crossing-Critical Graphs and Path-Width |
|-------------|-------------------------------------------------------|
|16:20 - 16:40|X. Munoz, W. Unger, I. Vrto |
| |One Side Crossing Minimization is NP-hard for Forests |
| |of Stars of Degree 4 |
|---------------------------------------------------------------------|
|Coffee Break |
|---------------------------------------------------------------------|
|Compaction Chair: Michael Goodrich |
|---------------------------------------------------------------------|
|17:10 - 17:30|M. Eiglsperger, M. Kaufmann |
| |Fast Compaction for Orthogonal Drawings with Vertices |
| |of Prescribed Size |
|-------------|-------------------------------------------------------|
|17:30 - 17:50|C. Binucci, W. Didimo, G. Liotta, M. Nonato |
| |Labeling Heuristics for Orthogonal Drawings |
|_____________|_______________________________________________________|
_____________________________________________________________________
| |
|Tuesday, 25 September 2001 |
|---------------------------------------------------------------------|
|Planar Graphs Chair: Jan Kratochvil |
|---------------------------------------------------------------------|
|09:00 - 09:20|J. Pach, G. Tardos |
| |Untangling a Polygon |
|-------------|-------------------------------------------------------|
|09:20 - 09:45|C. A. Duncan, A. Efrat, S. G. Kobourov, C. Wenk |
| |Drawing with Fat Edges |
|---------------------------------------------------------------------|
|Symmetries Chair: Hubert de Fraysseix |
|---------------------------------------------------------------------|
|09:45 - 10:10|C. Buchheim, M. Jünger |
| |Detecting Symmetries by Branch & Cut |
|-------------|-------------------------------------------------------|
|10:10 - 10:35|S.-H. Hong |
| |Drawing Graphs Symmetrically in Three Dimensions |
|---------------------------------------------------------------------|
|Coffee Break |
|---------------------------------------------------------------------|
|Interactive Drawings Chair: Brendan Madden |
|---------------------------------------------------------------------|
|11:05 - 11:30|H. A. D. do Nascimento, P. Eades |
| |User Hints for Directed Graph Drawing |
|-------------|-------------------------------------------------------|
|11:30 - 11:50|C. Friedrich, M. E. Houle |
| |Graph Drawing in Motion II |
|-------------|-------------------------------------------------------|
|11:50 - 12:10|S. C. North, G. Woodhull |
| |On-line Hierarchical Graph Drawing |
|---------------------------------------------------------------------|
| Lunch |
|---------------------------------------------------------------------|
|14:00 - 16:00|Software Exhibition (program see below) |
| | |
|---------------------------------------------------------------------|
|Representations Chair: Franz Aurenhammer |
|---------------------------------------------------------------------|
|16:00 - 16:25|J. Pach, G. Toth |
| |Recognizing String Graphs is Decidable |
|-------------|-------------------------------------------------------|
|16:25 - 16:45|J. Cerny, D. Kral, H. Nyklova, O. Pangrac |
| |On Intersection Graphs of Segments with Prescribed |
| |Slopes |
|---------------------------------------------------------------------|
|Coffee Break |
|---------------------------------------------------------------------|
|History & Aesthetics Chair: Peter Eades |
|---------------------------------------------------------------------|
|17:15 - 17:40|E. Kruja, A. Blair, J. Marks, R. Waters |
| |A Short Note on the History of Graph Drawing |
|-------------|-------------------------------------------------------|
|17:40 - 18:00|J. Adamec, J. Nesetril |
| |Towards an Aesthetic Invariant for Graph Drawing |
|-------------|-------------------------------------------------------|
| 18:30 |Bus to Klosterneuburg |
| |Conference Dinner |
| | |
| |Graph Drawing Contest Chair: Franz Brandenburg |
|_____________|_______________________________________________________|
_____________________________________________________________________
| |
|Wednesday, 26 September 2001 |
|---------------------------------------------------------------------|
|2D- and 3D-Embeddings Chair: Shin-ichi Nakano |
|---------------------------------------------------------------------|
|09:00 - 09:25|T. Biedl, J. R. Johansen, T. Shermer, D. R. Wood |
| |Orthogonal Drawings With Few Layers |
|-------------|-------------------------------------------------------|
|09:25 - 09:50|D. R. Wood |
| |Bounded Degree Book Embeddings and Three-Dimensional |
| |Orthogonal Graph Drawing |
|-------------|-------------------------------------------------------|
|09:50 - 10:15|S. Felsner, G. Liotta, S. Wismath |
| |Straight Line Drawings on Restricted Integer Grids in |
| |Two and Three Dimensions |
|-------------|-------------------------------------------------------|
|10:15 - 10:40|R. Babilon, J. Matousek, J. Maxova, P. Valtr |
| |Low-Distortion Embeddings of Trees |
|---------------------------------------------------------------------|
|Coffee Break |
|---------------------------------------------------------------------|
|Invited Presentation Chair: Petra Mutzel |
|---------------------------------------------------------------------|
|11:00 - 12:00|Eduard Gröller |
| |Insight into Data Through Visualization |
|---------------------------------------------------------------------|
|Lunch |
|---------------------------------------------------------------------|
|Floor-Planning Chair: Therese Biedl |
|---------------------------------------------------------------------|
|14:00 - 14:25|C.-C. Liao, H.-I Lu, H.-C. Yen |
| |Floor-Planning via Orderly Spanning Tree |
|-------------|-------------------------------------------------------|
|14:25 - 14:45|K. Freivalds, U. Dogrusoz, P. Kikusts |
| |Disconnected Graph Layout and the Polyomino Packing |
| |Approach |
|-------------|-------------------------------------------------------|
|Planar Drawing Chair: Giuseppe Di Battista |
|---------------------------------------------------------------------|
|14:45 - 15:10|Md. S. Rahman, M. Naznin, T. Nishizeki |
| |Orthogonal Drawings of Plane Graphs Without Bends |
|-------------|-------------------------------------------------------|
|15:10 - 15:35|C. A. Duncan, S. G. Kobourov |
| |Polar Coordinate Drawing of Planar Graphs with Good |
| |Angular Resolution |
|---------------------------------------------------------------------|
|Coffee Break |
|---------------------------------------------------------------------|
|16:00 - 17:00|Special Session on Graph Exchange Formats |
| |Chair: Giuseppe Liotta |
|-------------|-------------------------------------------------------|
| 17:00 |Closing |
|_____________|_______________________________________________________|
=================================================================
_____________________________________________________________________
| |
|Software Exhibition Tuesday, 26 September 2001, 14:00 - 16:00 |
|---------------------------------------------------------------------|
|D. Auber |
|Tulip, a Huge Graphs Visualization Software |
| |
|G. Sander, A. Vasiliu |
|The ILOG JViews Graph Layout Module |
| |
|E. Di Giacomo, G. Liotta |
|Graph Drawing Animation over the Internet |
| |
|T. Dwyer, P. Eckersley |
|Wilmascope Interactive 3D Graph Visualisation System |
| |
|G. Barbagallo, A. Carmignani, G. Di Battista, W. Didimo, M. Pizzonia |
|Exploration and Visualization of Computer Networks: Polyphemus and |
|Hermes |
| |
|C. Lewerentz, F. Simon, F. Steinbrückner |
|3D Visualization of Large Object-Oriented Programs |
| |
|G. Barequet, S. Bridgeman, C. Duncan, A. Garg, M. Goodrich, |
|R. Tamassia |
|The Graph Drawing Server |
| |
|G. Di Battista, W. Didimo, M. Patrignani, M. Pizzonia |
|Drawing Database Schemas with DBdraw |
| |
|J. Delahousse, P. Auillans |
|Graph Drawing for Topic Maps and Semantic Network |
| |
|R. Wiese, M. Eiglsperger, M. Kaufmann |
|yFiles: Visualization and Automatic Layout of Graphs |
| |
|F. J. Brandenburg, M. Forster, A. Pick, M. Raitner, F. Schreiber |
|BioPath - Visualization of Biochemical Pathways |
| |
|F. Bertault, W. Feng, U. Foessmeier, G. Grigorescu, B. Madden |
|Graph Visualization API Library Technology for Application Builders |
| |
|J. Bagga, A. Heinz |
|JGraph - A Java System for Drawing Graphs and Running Algorithms |
| |
|C. Gutwenger, M. Jünger, K. Klein, J. Kupke, S. Leipert, P. Mutzel |
|Automatic Layout of UML Class Diagrams |
| |
|M. Baur, M. Benkert, U. Brandes, S. Cornelsen, M. Gaertler, B. Köpf, |
|J. Lerner, D. Wagner |
|visone - Software for Visual Social Network Analysis |
| |
|U. Lauther, A. Stuebinger |
|Generating Schematic Maps using Springembedder Methods |
| |
|H. Eichelberger |
|UML Class Diagrams via SugiBib |
| |
|P. Auillans, J. Delahousse |
|Mondeca Topic Maps Software and Graph Drawing |
| |
|G. Hotz, S. Lohse |
|Planarity Testing of Graphs on Base of a Spring Model |
| |
|D. Alberts, D. Ambras, R. Brockenauer, C. Buchheim, M. Elf, |
|S. Fialko, C. Gutwenger, M. Jünger, G. W. Klau, K. Klein, G. Koch, |
|T. Lange, S. Leipert, D. Luetke-Huettmann, P. Mutzel, S. Naeher, |
|R. Weiskircher, T. Ziegler |
|AGD - A Library of Algorithms for Graph Drawing |
| |
|W. Didimo, M. Patrignani, M. Pizzonia |
|Industrial Plant Drawer |
| |
|V. Batagelj, A. Mrvar |
|Pajek - Analysis and Visualization of Large Networks |
| |
|K. Ryall |
|GLIDE |
| |
|R. Castello, R. Mili, I. G. Tollis |
|Visualizing State Charts: The ViSta Tool |
| |
|J. Ellson, E. Gansner, L. Koutsofios, S. North, G. Woodhull |
|Graphviz - Open Source Graph Drawing Tools |
|_____________________________________________________________________|
--
-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.
More information about the Compgeom-announce
mailing list