×

Graph drawing. 10th international symposium, GD 2002, Irvine, CA, USA, August 26–28, 2002. Revised papers. (English) Zbl 1007.00058

Lecture Notes in Computer Science. 2528. Berlin: Springer. xiii, 384 p. (2002).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding symposium has been reviewed (see Zbl 0984.00060).
Indexed articles:
Brandes, Ulrik; Eiglsperger, Markus; Kaufmann, Michael; Wagner, Dorothea, Sketch-driven orthogonal graph drawing, 1-11 [Zbl 1037.68568]
Kaufmann, Michael; Wiese, Roland, Maintaining the mental map for circular drawings, 12-22 [Zbl 1037.68591]
Diehl, Stephan; Görg, Carsten, Graphs, they are changing. Dynamic graph drawing for a sequence of graphs, 23-30 [Zbl 1037.68577]
Cornelsen, Sabine; Schank, Thomas; Wagner, Dorothea, Drawing graphs on two and three lines, 31-41 [Zbl 1037.68574]
Dujmović, Vida; Morin, Pat; Wood, David R., Path-width and three-dimensional straight-line grid drawings of graphs, 42-53 [Zbl 1037.68580]
Biedl, Therese, Drawing outer-planar graphs in \(O(n \log n)\) area, 54-65 [Zbl 1037.68565]
Binucci, Carla; Didimo, Walter; Liotta, Giuseppe; Nonato, Maddalena, Computing labeled orthogonal drawings, 66-73 [Zbl 1037.68566]
Bachl, Sabine; Brandenburg, Franz-Josef, Computing and drawing isomorphic subgraphs, 74-85 [Zbl 1037.68562]
Abelson, David; Hong, Seok-Hee; Taylor, Donald E., A group-theoretic method for drawing graphs symmetrically, 86-97 [Zbl 1037.68559]
Healy, Patrick; Nikolov, Nikola S., A branch-and-cut approach to the directed acyclic graph layering problem, 98-109 [Zbl 1037.68590]
Fiala, Jirí; Kratochvíl, Jan; Proskurowski, Andrzej, Geometric systems of disjoint representatives, 110-117 [Zbl 1037.68584]
Dujmović, Vida; Whitesides, Sue, An efficient fixed parameter tractable algorithm for 1-sided crossing minimization, 118-129 [Zbl 1037.68581]
Barth, Wilhelm; Jünger, Michael; Mutzel, Petra, Simple and efficient bilayer cross counting, 130-141 [Zbl 1037.68564]
Di Giacomo, Emilio; Liotta, Giuseppe; Patrignani, Maurizio, Orthogonal 3D shapes of theta graphs, 142-149 [Zbl 1037.68576]
Eppstein, David, Separating thickness from geometric thickness, 150-161 [Zbl 1037.68582]
Di Giacomo, Emilio; Didimo, Walter; Liotta, Giuseppe; Wismath, Stephen K., Book embeddings and point-set embeddings of series-parallel digraphs, 162-173 [Zbl 1037.68575]
Chanda, Amrita; Garg, Ashim, Compact encodings of planar orthogonal drawings, 174-185 [Zbl 1037.68572]
Sýkora, Ondrej; Székely, László A.; Vrt’o, Imrich, Fractional lengths and crossing numbers, 186-192 [Zbl 1037.68600]
Carmel, Liran; Harel, David; Koren, Yehuda, Drawing directed graphs using one-dimensional optimization, 193-206 [Zbl 1037.68571]
Harel, David; Koren, Yehuda, Graph drawing by high-dimensional embedding, 207-219 [Zbl 1037.68589]
Gutwenger, Carsten; Jünger, Michael; Leipert, Sebastian; Mutzel, Petra; Percan, Merijam; Weiskircher, René, Advances in \(c\)-planarity testing of clustered graphs, 220-235 [Zbl 1037.68587]
Raitner, Marcus, HGV: A library for hierarchies, graphs, and views, 236-243 [Zbl 1037.68597]
Rahman, Md. Saidur; Nishizeki, Takao; Ghosh, Shubhashis, Rectangular drawings of planar graphs, 244-255 [Zbl 1037.68596]
Miura, Kazuyuki; Miyazawa, Ayako; Nishizeki, Takao, Extended rectangular drawings of plane graphs with designated corners, 256-267 [Zbl 1037.68592]
Teoh, Soon Tee; Ma, Kwan-Liu, RINGS: A technique for visualizing large hierarchies, 268-275 [Zbl 1037.68601]
Forster, Michael, Applying crossing reduction strategies to layered compound graphs, 276-284 [Zbl 1037.68585]
Eschbach, Thomas; Günther, Wolfgang; Drechsler, Rolf; Becker, Bernd, Crossing reduction by windows optimization, 285-294 [Zbl 1037.68583]
Pach, János; Pinchasi, Rom; Tardos, Gábor; Tóth, Géza, Geometric graphs with no self-intersecting path of length three, 295-311 [Zbl 1037.68595]
Newton, Matthew; Sýkora, Ondrej; Vrt’o, Imrich, Two new heuristics for two-sided bipartite graph drawing, 312-319 [Zbl 1037.68594]
Garg, Ashim; Rusu, Adrian, Straight-line drawings of binary trees with linear area and arbitrary aspect ratio, 320-331 [Zbl 1037.68586]
Chen, Ho-Lin; Liao, Chien-Chih; Lu, Hsueh-I; Yen, Hsu-Chun, Some applications of orderly spanning trees in graph drawing, 332-343 [Zbl 1037.68573]
Buchheim, Christoph; Jünger, Michael; Leipert, Sebastian, Improving Walker’s algorithm to run in linear time, 344-353 [Zbl 1037.68569]
Bachl, Walter, Semi-dynamic orthogonal drawings of planar graphs, 354-361 [Zbl 1037.68563]
Diguglielmo, Gilles; Durocher, Eric; Kaplan, Philippe; Sander, Georg; Vasiliu, Adrian, Graph layout for workflow applications with ILOG JViews, 362-363 [Zbl 1037.68578]
Han, Kyungsook; Ju, Byong-Hyon; Park, Jong H., InterViewer: Dynamic visualization of protein-protein interactions, 364-365 [Zbl 1037.68588]
Baburin, Danil E., Some modifications of Sugiyama approach, 366-367 [Zbl 1037.68561]
Dogrusoz, Ugur; Genc, Burkay, A framework for complexity management in graph visualization, 368-369 [Zbl 1037.68579]
Byun, Yanga; Jeong, Euna; Han, Kyungsook, A partitioned approach to protein interaction mapping, 370-371 [Zbl 1037.68570]
Streinu, Ileana; Tosun, Elif, Camera position reconstruction and tight direction networks, 372-373 [Zbl 1037.68599]
Mutton, Paul; Rodgers, Peter, Demonstration of a preprocessor for the spring embedder, 374-375 [Zbl 1037.68593]
Brandenburg, Franz J., Graph-drawing contest report, 376-379 [Zbl 1037.68567]
Arvo, James, Techniques for interactive graph drawing, 380 [Zbl 1037.68560]
Ruskey, Frank, Drawing Venn diagrams, 381 [Zbl 1037.68598]

MSC:

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

Citations:

Zbl 0984.00060

Software:

JViews
PDFBibTeX XMLCite
Full Text: DOI Link