zbMATH — the first resource for mathematics

Graph drawing. 13th international symposium, GD 2005, Limerick, Ireland, September 12–14, 2005. Revised papers. (English) Zbl 1097.68006
Lecture Notes in Computer Science 3843. Berlin: Springer (ISBN 3-540-31425-3/pbk). xvii, 536 p. (2006).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding symposium has been reviewed (see Zbl 1069.68012).
Indexed articles:
Biedl, Therese; Brandenburg, Franz J.; Deng, Xiaotie, Crossings and permutations, 1-12 [Zbl 1171.68591]
Biedl, Therese; Lubiw, Anna; Spriggs, Michael J., Morphing planar graphs while preserving edge directions, 13-24 [Zbl 1171.68592]
Brandes, Ulrik; Fleischer, Daniel; Puppe, Thomas, Dynamic spectral layout of small worlds, 25-36 [Zbl 1171.68594]
Buchheim, Christoph; Ebner, Dietmar; Jünger, Michael; Klau, Gunnar W.; Mutzel, Petra; Weiskircher, René, Exact crossing minimization, 37-48 [Zbl 1171.68596]
Cortese, Pier Francesco; Di Battista, Giuseppe; Patrignani, Maurizio; Pizzonia, Maurizio, On embedding a cycle in a plane graph. (Extended abstract), 49-60 [Zbl 1171.68600]
de Berg, Mark; Mumford, Elena; Speckmann, Bettina, On rectilinear duals for vertex-weighted plane graphs, 61-72 [Zbl 1171.68654]
Dean, Alice M.; Evans, William; Gethner, Ellen; Laison, Joshua D.; Safari, Mohammad Ali; Trotter, William T., Bar \(k\)-visibility graphs: Bounds on the number of edges, chromatic number, and thickness, 73-82 [Zbl 1171.68601]
Devillers, Olivier; Everett, Hazel; Lazard, Sylvain; Pentcheva, Maria; Wismath, Stephen K., Drawing \(K_n\) in three dimensions with one bend per edge, 83-88 [Zbl 1171.68602]
Di Battista, Giuseppe; Frati, Fabrizio, Small area drawings of outerplanar graphs. (Extended abstract), 89-100 [Zbl 1171.68603]
Di Giacomo, Emilio; Liotta, Giuseppe; Meijer, Henk; Wismath, Stephen K., Volume requirements of 3D upward drawings, 101-110 [Zbl 1171.68604]
Di Giacomo, Emilio; Liotta, Giuseppe; Trotta, Francesco, How to embed a path onto two sets of points, 111-116 [Zbl 1171.68605]
Didimo, Walter; Giordano, Francesco; Liotta, Giuseppe, Upward spirality and upward planarity testing, 117-128 [Zbl 1171.68606]
Dujmović, Vida; Wood, David R., Graph treewidth and geometric thickness parameters, 129-140 [Zbl 1171.05371]
Dwyer, Tim; Koren, Yehuda; Marriott, Kim, Stress majorization with orthogonal ordering constraints, 141-152 [Zbl 1171.68608]
Dwyer, Tim; Marriott, Kim; Stuckey, Peter J., Fast node overlap removal, 153-164 [Zbl 1171.68609]
Eppstein, David; Goodrich, Michael T.; Meng, Jeremy Yu, Delta-confluent drawings, 165-176 [Zbl 1171.68610]
Fusy, Éric, Transversal structures on triangulations, with application to straight-line drawing, 177-188 [Zbl 1171.68613]
Gaertler, Marco; Wagner, Dorothea, A hybrid model for drawing dynamic and evolving graphs, 189-200 [Zbl 1171.68614]
Geyer, Markus; Kaufmann, Michael; Vrt’o, Imrich, Two trees which are self-intersecting when drawn simultaneously, 201-210 [Zbl 1171.68615]
Goodrich, Michael T.; Lueker, George S.; Sun, Jonathan Z., C-planarity of extrovert clustered graphs, 211-222 [Zbl 1171.68617]
Gutwenger, Carsten; Chimani, Markus, Non-planar core reduction of graphs, 223-234 [Zbl 1171.68618]
Hachul, Stefan; Jünger, Michael, An experimental comparison of fast algorithms for drawing general large graphs, 235-250 [Zbl 1171.68619]
Hong, Seok-Hee; Nikolov, Nikola S., Hierarchical layouts of directed graphs in three dimensions, 251-261 [Zbl 1171.68623]
Huang, Weidong; Hong, Seok-Hee; Eades, Peter, Layout effects on sociogram perception, 262-273 [Zbl 1171.68624]
Kynčl, Jan; Valtr, Pavel, On edges crossing few other edges in simple topological complete graphs, 274-284 [Zbl 1171.05325]
Lin, Chun-Cheng; Yen, Hsu-Chun, On balloon drawings of rooted trees, 285-296 [Zbl 1171.68629]
Miura, Kazuyuki; Azuma, Machiko; Nishizeki, Takao, Convex drawings of plane graphs of minimum outer apices, 297-308 [Zbl 1171.68632]
Noack, Andreas, Energy-based clustering of graphs with nonuniform degrees, 309-320 [Zbl 1171.68636]
Nöllenburg, Martin; Wolff, Alexander, A mixed-integer program for drawing high-quality metro maps, 321-333 [Zbl 1171.68637]
Pach, János; Tóth, Géza, Crossing number of toroidal graphs, 334-342 [Zbl 1171.05326]
Papadopoulos, Charis; Voglis, Constantinos, Drawing graphs using modular decomposition, 343-354 [Zbl 1171.68639]
Papamanthou, Charalampos; Tollis, Ioannis G., Applications of parameterized \(st\)-orientations in graph drawing algorithms, 355-367 [Zbl 1171.68640]
Patrignani, Maurizio, Complexity results for three-dimensional orthogonal graph drawing. (Extended abstract)., 368-379 [Zbl 1152.68484]
Patrignani, Maurizio, On extending a partial straight-line drawing, 380-385 [Zbl 1152.68485]
Pelsmajer, Michael J.; Schaefer, Marcus; Štefankovič, Daniel, Odd crossing number is not crossing number, 386-396 [Zbl 1171.05327]
Pizzonia, Maurizio, Minimum depth graph embeddings and quality of the drawings: An experimental analysis, 397-408 [Zbl 1171.68642]
Rahman, Md. Saidur; Egi, Noritsugu; Nishizeki, Takao, No-bend orthogonal drawings of series-parallel graphs. (Extended abstract), 409-420 [Zbl 1171.68645]
Streinu, Ileana, Parallel-redrawing mechanisms, pseudo-triangulations and kinetic planar graphs, 421-433 [Zbl 1171.68649]
Suderman, Matthew, Proper and planar drawings of graphs on three layers, 434-445 [Zbl 1171.68650]
Wybrow, Michael; Marriott, Kim; Stuckey, Peter J., Incremental connector routing, 446-457 [Zbl 1171.68651]
Zhang, Huaming; He, Xin, An application of well-orderly trees in graph drawing, 458-467 [Zbl 1171.68652]
Ho, Joshua; Hong, Seok-Hee, Drawing clustered graphs in three dimensions, 492-502 [Zbl 1171.68621]
Civril, Ali; Magdon-Ismail, Malik; Bocek-Rivele, Eli, SDE: Graph drawing using spectral distance embedding, 512-513 [Zbl 1171.68598]
Hong, Seok-Hee, MultiPlane: A new framework for drawing graphs in three dimensions, 514-515 [Zbl 1171.68622]
Poon, Sheung-Hung, On straightening low-diameter unit trees, 519-521 [Zbl 1171.68643]
Siebenhaller, Martin; Kaufmann, Michael, Mixed upward planarization – fast and robust, 522-523 [Zbl 1171.68647]
Duncan, Christian A.; Kobourov, Stephen G.; Wagner, Dorothea, Graph-drawing contest report, 528-531 [Zbl 1171.68607]
Mehlhorn, Kurt, Minimum cycle bases and surface reconstruction. (Abstract), 532 [Zbl 1171.68631]

68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68R10 Graph theory (including graph drawing) in computer science
68U05 Computer graphics; computational geometry (digital and algorithmic aspects)
05C85 Graph algorithms (graph-theoretic aspects)
00B25 Proceedings of conferences of miscellaneous specific interest
Full Text: DOI