Graph drawing. 12th international symposium, GD 2004, New York, NY, September 29--October 2, 2004. Revised selected papers. (Q2388710)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graph drawing. 12th international symposium, GD 2004, New York, NY, September 29--October 2, 2004. Revised selected papers. |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph drawing. 12th international symposium, GD 2004, New York, NY, September 29--October 2, 2004. Revised selected papers. |
scientific article |
Statements
Graph drawing. 12th international symposium, GD 2004, New York, NY, September 29--October 2, 2004. Revised selected papers. (English)
0 references
20 September 2005
0 references
The articles of this volume will be reviewed individually. The preceding symposium has been reviewed (see Zbl 1029.00056). Indexed articles: \textit{Aloupis, Greg; Bose, Prosenjit; Morin, Pat}, Reconfiguring triangulations with edge flips and point moves, 1-11 [Zbl 1111.68551] \textit{Andersen, Reid; Chung, Fan; Lu, Lincoln}, Drawing power law graphs, 12-17 [Zbl 1111.68552] \textit{Aziza, Shabnam; Biedl, Therese}, Hexagonal grid drawings: Algorithms and lower bounds, 18-24 [Zbl 1111.68553] \textit{Balogh, József; Salazar, Gelasio}, Improved bounds for the number of \((\leq\! k)\)-sets, convex quadrilaterals, and the rectilinear crossing number of \(K_n\), 25-35 [Zbl 1111.68554] \textit{Basu, Saugata; Dhandapani, Raghavan; Pollack, Richard}, On the realizable weaving patterns of polynomial curves in \(\mathbb R^3\), 36-42 [Zbl 1111.68721] \textit{Baur, Michael; Brandes, Ulrik; Gaertler, Marco; Wagner, Dorothea}, Drawing the AS graph in 2.5 dimensions, 43-48 [Zbl 1111.68556] \textit{Bekos, Michael A.; Kaufmann, Michael; Symvonis, Antonios; Wolff, Alexander}, Boundary labeling: Models and efficient algorithms for rectangular maps, 49-59 [Zbl 1111.68557] \textit{Bonichon, Nicolas; Felsner, Stefan; Mosbah, Mohamed}, Convex drawings of 3-connected plane graphs, 60-70 [Zbl 1111.68559] \textit{Bose, Prosenjit; Hurtado, Ferran; Rivera-Campo, Eduardo; Wood, David R.}, Partitions of complete geometric graphs into plane trees, 71-81 [Zbl 1111.68560] \textit{Boyer, John M.}, Additional PC-tree planarity conditions, 82-88 [Zbl 1111.68561] \textit{Brandes, Ulrik; Pich, Christian}, GraphML transformation, 89-99 [Zbl 1111.68562] \textit{Cortese, Pier Francesco; Di Battista, Giuseppe; Patrignani, Maurizio; Pizzonia, Maurizio}, Clustering cycles into cycles of clusters, 100-110 [Zbl 1111.68564] \textit{Dean, Alice M.; Gethner, Ellen; Hutchinson, Joan P.}, Unit bar-visibility layouts of triangulated polygons, 111-121 [Zbl 1111.68565] \textit{Dujmović, Vida; Suderman, Matthew; Wood, David R.}, Really straight graph drawings, 122-132 [Zbl 1111.68571] \textit{Dujmović, Vida; Wood, David R.}, Layouts of graph subdivisions, 133-143 [Zbl 1111.68572] \textit{Ebner, Dietmar; Klau, Gunnar W.; Weiskircher, René}, Label number maximization in the slider model, 144-154 [Zbl 1111.68573] \textit{Eiglsperger, Markus; Siebenhaller, Martin; Kaufmann, Michael}, An efficient implementation of Sugiyama's algorithm for layered graph drawing, 155-166 [Zbl 1111.68574] \textit{Ellis, Robert B.; Martin, Jeremy L.; Yan, Catherine}, Random geometric graph diameter in the unit disk with \(\ell_p\) metric, 167-172 [Zbl 1111.68575] \textit{Eppstein, David}, Algorithms for drawing media, 173-183 [Zbl 1111.68576] \textit{Eppstein, David; Goodrich, Michael T.; Meng, Jeremy Yu}, Confluent layered drawings, 184-194 [Zbl 1111.68577] \textit{Erten, Cesim; Kobourov, Stephen G.}, Simultaneous embedding of planar graphs with few bends, 195-205 [Zbl 1111.68578] \textit{Forster, Michael}, A fast and simple heuristic for constrained two-level crossing reduction, 206-216 [Zbl 1111.68579] \textit{de Fraysseix, Hubert; Ossona de Mendez, Patrice}, Contact and intersection representations, 217-227 [Zbl 1111.68603] \textit{Görg, Carsten; Birke, Peter; Pohl, Mathias; Diehl, Stephan}, Dynamic graph drawing of sequences of orthogonal and hierarchical graphs, 228-238 [Zbl 1111.68581] \textit{Gansner, Emden R.; Koren, Yehuda; North, Stephen}, Graph drawing by stress majorization, 239-250 [Zbl 1111.68580] \textit{Di Giacomo, Emilio; Didimo, Walter; Liotta, Giuseppe; Meijer, Henk}, Computing radial drawings on the minimum number of circles, 251-261 [Zbl 1111.68567] \textit{Di Giacomo, Emilio; Didimo, Walter; Liotta, Giuseppe; Suderman, Matthew}, Hamiltonian-with-handles graphs and the \(k\)-spine drawability problem, 262-272 [Zbl 1111.68568] \textit{Gotsman, Craig; Koren, Yehuda}, Distributed graph layout for sensor networks, 273-284 [Zbl 1111.68582] \textit{Hachul, Stefan; Jünger, Michael}, Drawing large graphs with a potential-field-based multilevel algorithm, 285-295 [Zbl 1111.68583] \textit{Healy, Patrick; Lynch, Karol}, Building blocks of upward planar digraphs, 296-306 [Zbl 1111.68584] \textit{Hong, Seok-Hee; Eades, Peter}, A linear time algorithm for constructing maximally symmetric straight-line drawings of planar graphs, 307-317 [Zbl 1111.68585] \textit{Hui, Peter; Schaefer, Marcus; Štefankovič, Daniel}, Train tracks and confluent drawings, 318-328 [Zbl 1111.68587] \textit{Kitching, Matthew; Whitesides, Sue}, The three dimensional logic engine, 329-339 [Zbl 1111.68588] \textit{Kynčl, Jan; Pach, János; Tóth, Géza}, Long alternating paths in bicolored point sets, 340-348 [Zbl 1111.68591] \textit{Marcus, Adam; Tardos, Gábor}, Intersection reverse sequences and geometric applications, 349-359 [Zbl 1111.68592] \textit{Newton, Matthew C.; Sýkora, Ondrej; Užovič, Martin; Vrt'o, Imrich}, New exact results and bounds for bipartite crossing numbers of meshes, 360-370 [Zbl 1111.68593] \textit{Norine, Serguei}, Drawing Pfaffian graphs, 371-376 [Zbl 1111.68594] \textit{Papamanthou, Charalampos; Tollis, Ioannis G.; Doerr, Martin}, 3D visualization of semantic metadata models and ontologies, 377-388 [Zbl 1111.68595] \textit{Patrignani, Maurizio}, A note on the self-similarity of some orthogonal drawings, 389-394 [Zbl 1111.68596] \textit{Pór, Attila; Wood, David R.}, No-three-in-line-in-3D, 395-402 [Zbl 1111.68597] \textit{Raitner, Marcus}, Visual navigation of compound graphs, 403-413 [Zbl 1111.68598] \textit{Torok, Lubomir; Vrt'o, Imrich}, Layout volumes of the hypercube, 414-424 [Zbl 1111.68601] \textit{Zhang, Huaming; He, Xin}, New theoretical bounds of visibility representation of plane graphs, 425-430 [Zbl 1111.68602] \textit{Hong, Seok-Hee; Merrick, Damian; do Nascimento, Hugo A. D.}, The metro map layout problem, 482-491 [Zbl 1111.68586] \textit{Demaine, Erik D.; Hajiaghayi, MohammadTaghi}, Fast algorithms for hard graph problems: Bidimensionality, minors, and local treewidth, 517-533 [Zbl 1111.68566]
0 references