Items where Subject is "G Algorithms and Complexity > G.350 Clusters"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Number of items at this level: 32.

Gronemann, Martin and Jünger, Michael (2013) Drawing Clustered Graphs as Topographic Maps. In: 20th International Symposium, GD 2012, September 19-21, 2012, Redmond, WA, USA , pp. 426-438 (Official URL: http://link.springer.com/chapter/10.1007/978-3-642-36763-2_38).

Athenstädt, Jan Christoph and Görke, Robert and Krug, Marcus and Nöllenburg, Martin (2013) Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor. In: 20th International Symposium, GD 2012, September 19-21, 2012, Redmond, WA, USA , pp. 553-554 (Official URL: http://link.springer.com/chapter/10.1007/978-3-642-36763-2_49).

Jelínek, Vít and Suchý, Ondrej and Tesar, Marek and Vyskocil, Tomás (2009) Clustered Planarity: Clusters with Few Outgoing Edges. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008, Heraklion, Crete, Greece , pp. 102-113 (Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_11).

Jelínek, Vít and Jelínková, Eva and Kratochvíl, Jan and Lidický, Bernard (2009) Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008, Heraklion, Crete, Greece , pp. 121-132 (Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_13).

Chimani, Markus and Gutwenger, Carsten and Jansen, Mathias and Klein, Karsten and Mutzel, Petra (2009) Computing Maximum C-planar Subgraphs. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008, Heraklion, Crete, Greece , pp. 115-120 (Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_12).

Jelínková, Eva and Kára, Jan and Kratochvíl, Jan and Pergel, Martin and Suchý, Ondrej and Vyskocil, Tomás (2008) Clustered Planarity: Small Clusters in Eulerian Graphs. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007, Sydney, Australia , pp. 303-314 (Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_30).

Di Battista, Giuseppe and Frati, Fabrizio (2008) Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007, Sydney, Australia , pp. 291-302 (Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_29).

Qu, Huamin and Zhou, Hong and Wu, Yingcai (2007) Controllable and Progressive Edge Clustering for Large Networks. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006, Karlsruhe, Germany , pp. 399-404 (Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_38).

Siebenhaller, Martin (2007) Partitioned Drawings. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006, Karlsruhe, Germany , pp. 252-257 (Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_25).

Merrick, Damian and Gudmundsson, Joachim (2007) Path Simplification for Metro Map Layout. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006, Karlsruhe, Germany , pp. 258-269 (Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_26).

Lehmann, Katharina A. and Kottler, Stephan (2007) Visualizing Large and Clustered Networks. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006, Karlsruhe, Germany , pp. 240-251 (Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_24).

Cortese, Pier Francesco and Di Battista, Giuseppe and Patrignani, Maurizio and Pizzonia, Maurizio (2004) Clustering Cycles into Cycles of Clusters (Extended Abstract). In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004, New York, NY, USA , pp. 100-110 (Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_12).

Nagamochi, Hiroshi and Kuroya, Katsutoshi (2004) Convex Drawing for c-Planar Biconnected Clustered Graphs. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 369-380 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_34).

Gutwenger, Carsten and Jünger, Michael and Leipert, Sebastian and Mutzel, Petra and Percan, Merijam and Weiskircher, René (2002) Advances in C-Planarity Testing of Clustered Graphs (Extended Abstract). In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 220-235 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_21).

Friedrich, Carsten and Houle, Michael E. (2002) Graph Drawing in Motion II. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 220-231 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_18).

Walshaw, C. (2001) A Multilevel Algorithm for Force-Directed Graph Drawing. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 171-182 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_17).

Quigley, Aaron and Eades, Peter (2001) FADE: Graph Drawing, Clustering, and Visual Abstraction. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 197-210 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_19).

Brandes, Ulrik and Cornelsen, Sabine and Wagner, Dorothea (2001) How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract). In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 103-114 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_10).

Six, Janet M. and Tollis, Ioannis G. (1999) A Framework for Circular Drawings of Networks. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 107-116 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_11).

Bertault, François and Miller, Mirka (1999) An Algorithm for Drawing Compound Graphs. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 197-204 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_20).

Edachery, Jubin and Sen, Arunabha and Brandenburg, Franz J. (1999) Graph Clustering Using Distance-k Cliques. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 98-106 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_10).

Lisitsyn, Ivan A. and Kasyanov, Victor N. (1999) Higres - Visualization System for Clustered Graphs and Graph Algorithms. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 82-89 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_8).

Batagelj, Vladimir and Mrvar, Andrej and Zaversnik, Matjaz (1999) Partitioning Approach to Visualization of Large Graphs. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 90-97 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_9).

Duncan, Christian A. and Goodrich, Michael T. and Kobourov, Stephen G. (1999) Planarity-Preserving Clustering and Embedding for Large Planar Graphs. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 186-196 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_19).

Huang, Mao Lin and Eades, Peter (1998) A Fully Animated Interactive System for Clustering and Navigating Huge Graphs. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 374-383 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_29).

Duncan, Christian A. and Goodrich, Michael T. and Kobourov, Stephen G. (1998) Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 111-124 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_9).

Schreiber, Falk and Skodinis, Konstantinos (1998) NP-Completeness of Some Tree-Clustering Problems. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 288-301 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_22).

Sablowski, Reinhard and Frick, Arne (1997) Automatic Graph Clustering (System Demonstration). In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 395-400 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_63).

Dogrusoz, Ugur and Madden, Brendan and Madden, Patrick (1997) Circular Layout in the Graph Layout Toolkit. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 92-100 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_40).

Eades, Peter and Feng, Qing-Wen (1997) Multilevel Visualization of Clustered Graphs. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 101-112 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_41).

Eades, Peter and Feng, Qing-Wen and Lin, Xuemin (1997) Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 113-128 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_42).

Gronemann, Martin and Jünger, Michael Drawing Clustered Graphs as Topographic Maps. [Preprint]

This list was generated on Mon Dec 22 04:04:49 2014 CET.