Items where Subject is "G Algorithms and Complexity > G.999 Others"

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

Abel, Zachary and Demaine, Erik D. and Demaine, Martin L. and Eppstein, David and Lubiw, Anna and Uehara, Ryuhei (2015) Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014, Würzburg, Germany , pp. 272-283 (Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_23).

Duncan, Christian A. (2015) Maximizing the Degree of (Geometric) Thickness-t Regular Graphs. In: Graph Drawing and Network Visualization: 23rd International Symposium, GD 2015, September 24-26, 2015, Los Angeles, CA, USA , pp. 199-204 (Official URL: http://dx.doi.org/10.1007/978-3-319-27261-0_17).

Rüegg, Ulf and Schulze, Christoph Daniel and Carstens, John Julian and von Hanxleden, Reinhard (2015) Size- and Port-Aware Horizontal Node Coordinate Assignment. In: Graph Drawing and Network Visualization: 23rd International Symposium, GD 2015, September 24-26, 2015, Los Angeles, CA, USA , pp. 139-150 (Official URL: http://dx.doi.org/10.1007/978-3-319-27261-0_12).

Schaefer, Marcus and Štefankovič, Daniel (2015) The Degenerate Crossing Number and Higher-Genus Embeddings. In: Graph Drawing and Network Visualization: 23rd International Symposium, GD 2015, September 24-26, 2015, Los Angeles, CA, USA , pp. 63-74 (Official URL: http://dx.doi.org/10.1007/978-3-319-27261-0_6).

Hu, Yifan and Shi, Lei (2014) A Coloring Algorithm for Disambiguating Graph and Map Drawings. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014, Würzburg, Germany , pp. 89-100 (Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_8).

Ruis-Vargas, Andres J. and Suk, Andrew and Tóth, Csaba D. (2014) Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014, Würzburg, Germany , pp. 284-293 (Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_24).

Aulbach, Maximilian and Fink, Martin and Schuhmann, Julian and Wolff, Alexander (2014) Drawing Graphs within Restricted Area. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014, Würzburg, Germany , pp. 367-379 (Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_31).

Bannister, Michael J. and Goodrich, Michael T. and Sampson, Peter (2014) Force-Directed 3D Arc Diagrams. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014, Würzburg, Germany , pp. 521-522 .

Barrera-Cruz, Fidel and Haxell, Penny and Lubiw, Anna (2014) Morphing Schnyder Drawings of Planar Triangulations. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014, Würzburg, Germany , pp. 294-305 (Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_25).

Kindermann, Philipp and Schulz, André and Spoerhase, Joachim and Wolff, Alexander (2014) On Monotone Drawings of Trees. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014, Würzburg, Germany , pp. 488-500 (Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_41).

Chimani, Markus and Eades, Patrick and Eades, Peter and Hong, Seok-Hee and Huang, Weidong and Klein, Karsten and Marner, Michael and Smith, Ross T. and Thomas, Bruce H. (2014) People Prefer Less Stress and Fewer Crossings. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014, Würzburg, Germany , pp. 523-524 .

Athenstädt, Jan Christoph and Hartmann, Tanja and Nöllenburg, Martin (2014) Simultaneous Embeddability of Two Partitions. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014, Würzburg, Germany , pp. 64-75 (Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_6).

Rüegg, Ulf and Kieffer, Steve and Dwyer, Tim and Marriott, Kim and Wybrow, Michael (2014) Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014, Würzburg, Germany , pp. 319-330 (Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_27).

Durocher, Stephane and Mondal, Debajyoti (2014) Trade-Offs in Planar Polyline Drawings. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014, Würzburg, Germany , pp. 306-318 (Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_26).

Sharir, Micha and Sheffer, Adam (2013) Counting Plane Graphs: Cross-Graph Charging Schemes. In: 20th International Symposium, GD 2012, September 19-21, 2012, Redmond, WA, USA , pp. 19-30 (Official URL: http://link.springer.com/chapter/10.1007/978-3-642-36763-2_3).

Angelini, Patrizio and Binucci, Carla and Da Lozzo, Giordano and Didimo, Walter and Grilli, Luca and Montecchiani, Fabrizio and Patrignani, Maurizio and Tollis, Ioannis G. (2013) Drawing Non-Planar Graphs with Crossing-Free Subgraphs. In: 21st International Symposium, GD 2013, September 23-25, 2013, Bordeaux, France , pp. 292-303 (Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_26).

Bannister, Michael J. and Eppstein, David and Simons, Joseph A. (2013) Fixed Parameter Tractability of Crossing Minimization of Almost-Trees. In: 21st International Symposium, GD 2013, September 23-25, 2013, Bordeaux, France , pp. 340-351 (Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_30).

Alamdari, Soroush and Biedl, Therese (2013) Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs. In: 20th International Symposium, GD 2012, September 19-21, 2012, Redmond, WA, USA , pp. 102-113 (Official URL: http://link.springer.com/chapter/10.1007/978-3-642-36763-2_10).

Di Giacomo, Emilio and Liotta, Giuseppe and Meijer, Henk (2013) The Approximate Rectangle of Influence Drawability Problem. In: 20th International Symposium, GD 2012, September 19-21, 2012, Redmond, WA, USA , pp. 114-125 (Official URL: http://link.springer.com/chapter/10.1007/978-3-642-36763-2_11).

Eppstein, David and Simons, Joseph A. (2012) Confluent Hasse Diagrams. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011, Eindhoven, The Netherlands , pp. 2-13 (Official URL: http://dx.doi.org/10.1007/978-3-642-25878-7_2).

Buchin, Kevin and Speckmann, Bettina and Verdonschot, Sander (2011) Optimizing Regular Edge Labelings. In: Graph Drawing 18th International Symposium, GD 2010, September 21-24, 2010, Konstanz, Germany , pp. 117-128 (Official URL: http://dx.doi.org/10.1007/978-3-642-18469-7_11).

Dwyer, Tim and Marriott, Kim and Wybrow, Michael (2007) Integrating Edge Routing into Force-Directed Layout. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006, Karlsruhe, Germany , pp. 8-19 (Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_3).

Papamanthou, Charalampos and Tollis, Ioannis G. (2006) Applications of Parameterized st-Orientations in Graph Drawing Algorithms. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 355-367 (Official URL: http://dx.doi.org/10.1007/11618058_32).

Patrignani, Maurizio (2006) Complexity Results for Three-dimensional Orthogonal Graph Drawing. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 368-379 (Official URL: http://dx.doi.org/10.1007/11618058_33).

Patrignani, Maurizio (2006) On Extending a Partial Straight-Line Drawing. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 380-385 (Official URL: http://dx.doi.org/10.1007/11618058_34).

Koren, Yehuda and Harel, David (2004) Axis-by-Axis Stress Minimization. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 450-459 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_42).

Efrat, Alon and Erten, Cesim and Kobourov, Stephen G. (2004) Fixed-Location Circular-Arc Drawing of Planar Graphs. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 147-158 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_14).

Hasunuma, Toru (2004) Laying Out Iterated Line Digraphs Using Queues. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 202-213 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_19).

Erten, Cesim and Kobourov, Stephen G. and Le, Vu and Navabi, Armand (2004) Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 437-449 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_41).

Di Giacomo, Emilio and Meijer, Henk (2004) Track Drawings of Graphs with Constant Queue Number. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 214-225 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_20).

Healy, Patrick and Nikolov, Nikola S. (2002) A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 98-109 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_10).

De Fraysseix, Hubert and Ossona de Mendez, Patrice (2002) A Characterization of DFS Cotree Critical Graphs. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 84-95 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_7).

Byun, Yanga and Jeong, Euna and Han, Kyungsook (2002) A Partitioned Approach to Protein Interaction Mapping. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 370-371 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_38).

Edwards, Keith and Farr, Graham (2002) An Algorithm for Finding Large Induced Planar Subgraphs. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 75-83 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_6).

Forster, Michael (2002) Applying Crossing Reduction Strategies to Layered Compound Graphs. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 276-284 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_26).

Six, Janet M. and Tollis, Ioannis G. (2002) Automated Visualization of Process Diagrams. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 44-59 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_4).

Di Giacomo, Emilio and Didimo, Walter and Liotta, Giuseppe and Wismath, Stephen (2002) Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 162-173 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_16).

Chanda, Amrita and Garg, Ashim (2002) Compact Encodings of Planar Orthogonal Drawings. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 174-185 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_17).

Bachl, Sabine and Brandenburg, Franz J. (2002) Computing and Drawing Isomorphic Subgraphs. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 74-85 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_8).

Mutton, Paul and Rodgers, Peter (2002) Demonstration of a Preprocessor for the Spring Embedder. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 374-375 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_40).

Carmel, Liran and Harel, David and Koren, Yehuda (2002) Drawing Directed Graphs Using One-Dimensional Optimization. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 193-206 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_19).

Liao, Chien-Chih and Lu, Hsueh-I. and Yen, Hsu-Chun (2002) Floor-Planning via Orderly Spanning Trees. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 367-377 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_29).

Fiala, Jirí and Kratochvíl, Jan and Proskurowski, Andrzej (2002) Geometric Systems of Disjoint Representatives. In: Graph Drawing, August 26-28, 2002, Irvine, CA, USA , pp. 110-117 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_11).

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).

Healy, Patrick and Nikolov, Nikola S. (2002) How to Layer a Directed Acyclic Graph. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 16-30 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_2).

Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (2002) Improving Walker's Algorithm to Run in Linear Time. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 344-353 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_32).

Rahman, Md. Saidur and Naznin, Mahmuda and Nishizeki, Takao (2002) Orthogonal Drawings of Plane Graphs without Bends. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 392-406 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_31).

Duncan, Christian A. and Kobourov, Stephen G. (2002) Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 407-421 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_32).

Pach, János and Tóth, Géza (2002) Recognizing String Graphs Is Decidable. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 247-260 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_20).

Rahman, Md. Saidur and Nishizeki, Takao and Ghosh, Shubhashis (2002) Rectangular Drawings of Planar Graphs (Extended Abstract). In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 244-255 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_23).

Bachl, Walter (2002) Semi-dynamic Orthogonal Drawings of Planar Graphs (Extended Abstract). In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 354-361 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_33).

Chen, Ho-Lin and Liao, Chien-Chih and Lu, Hsueh-I. and Yen, Hsu-Chun (2002) Some Applications of Orderly Spanning Trees in Graph Drawing. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 332-343 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_31).

Baburin, Danil E. (2002) Some Modifications of Sugiyama Approach. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 366-367 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_36).

Garg, Ashim and Rusu, Adrian (2002) Straight-Line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio (Extended Abstract). In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 320-331 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_30).

Newton, Matthew and Sýkora, Ondrej and Vrt'o, Imrich (2002) Two New Heuristics for Two-Sided Bipartite Graph Drawing. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 312-319 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_29).

Do Nascimento, Hugo A. D. and Eades, Peter (2002) User Hints for Directed Graph Drawing. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 205-219 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_17).

Boissonnat, J.D. and Cazals, F. and Flötotto, J. (2001) 2D-Structure Drawings of Similar Molecules. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 115-126 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_11).

Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (2001) A Fast Layout Algorithm for k-Level Graphs. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 229-240 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_22).

Harel, David and Koren, Yehuda (2001) A Fast Multi-scale Method for Drawing Large Graphs. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 183-196 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_18).

Dean, Alice M. (2001) A Layout Algorithm for Bar-Visibility Graphs on the Möbius Band. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 350-359 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_33).

Gutwenger, Carsten and Mutzel, Petra (2001) A Linear Time Implementation of SPQR-Trees. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 77-90 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_8).

Nakano, Shin-Ichi and Yoshikawa, Makiko (2001) A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs (Extended Abstract). In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 296-307 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_28).

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).

Bridgeman, Stina and Tamassia, Roberto (2001) A User Study in Similarity Measures for Graph Drawing. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 19-30 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_3).

Hong, Seok-Hee and Eades, Peter (2001) An Algorithm for Finding Three Dimensional Symmetry in Trees. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 360-371 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_34).

Castelló, Rodolfo and Mili, Rym and Tollis, Ioannis G. (2001) An Algorithmic Framework for Visualizing Statecharts. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 139-149 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_13).

Klau, Gunnar W. and Klein, Karsten and Mutzel, Petra (2001) An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract). In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 37-51 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_5).

Shieh, Fwu-Shan and McCreary, Carolyn (2001) Clan-Based Incremental Drawing. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 384-396 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_36).

Brandes, Ulrik and Shubina, Galina and Tamassia, Roberto and Wagner, Dorothea (2001) Fast Layout Methods for Timetable Graphs. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 127-138 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_12).

Gajer, Pawel and Kobourov, Stephen G. (2001) GRIP: Graph dRawing with Intelligent Placement. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 222-228 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_21).

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).

Chen, Ho-Lin and Lu, Hsueh-I. and Yen, Hsu-Chun (2001) On Maximum Symmetric Subgraphs. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 372-383 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_35).

De Fraysseix, Hubert and Ossona de Mendez, Patrice (2001) On topological aspects of orientations. [Journal (Paginated)]

Lynn, Benjamin Y. S. and Symvonis, Antonios and Wood, David R. (2001) Refinement of Three-Dimensional Orthogonal Graph Drawings. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 308-320 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_29).

Günther, Wolfgang and Schönfeld, Robby and Becker, Bernd and Molitor, Paul (2001) k-Layer Straightline Crossing Minimization by Speeding Up Sifting. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 253-258 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_24).

De Fraysseix, Hubert (1999) An Heuristic for Graph Symmetry Detection. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 276-285 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_29).

Klau, Gunnar W. and Mutzel, Petra (1999) Combining Graph Labeling and Compaction (Extended Abstract). In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 27-37 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_3).

Kaufmann, Michael and Wiese, Roland (1999) Embedding Vertices at Points: Few Bends Suffice for Planar Graphs. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 165-174 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_17).

Bachl, Sabine (1999) Isomorphic Subgraphs. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 286-296 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_30).

Wood, David R. (1999) Multi-dimensional Orthogonal Graph Drawing with Small Boxes(Extended Abstract). In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 311-322 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_32).

Mutzel, Petra and Ziegler, Thomas (1999) The Constrained Crossing Minimization Problem. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 175-185 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_18).

Healy, Patrick and Kuusik, Ago (1999) The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 205-216 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_21).

Barouni, Ala Eddine and Jaoua, Ali and Zaguia, Nejib (1999) Visualizing Algorithms for the Design and Analysis of Survivable Networks. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 232-241 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_24).

Goodrich, Michael T. and Wagner, Cristopher G. (1998) A Framework for Drawing Planar Graphs with Curves and Polylines. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 153-166 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_12).

Hayashi, Kunihiko and Inoue, Michiko and Masuzawa, Toshimitsu and Fujiwara, Hideo (1998) A Layout Adjustment Problem for Disjoint Rectangles Preserving Orthogonal Order. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 183-197 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_14).

Wiese, Roland and Kaufmann, Michael (1998) Adding Constraints to an Algorithm for Orthogonal Graph Drawing. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 462-463 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_47).

Houle, Michael E. and Webber, Richard (1998) Approximation Algorithms for Finding Best Viewpoints. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 210-223 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_16).

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).

Kratochvíl, Jan (1998) Crossing Number of Abstract Topological Graphs. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 238-245 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_18).

Bridgeman, Stina and Tamassia, Roberto (1998) Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 57-71 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_5).

Lenhart, William J. and Liotta, Giuseppe (1998) Drawable and Forbidden Minimum Weight Triangulations. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 1-12 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_45).

Hong, Seok-Hee and Eades, Peter and Quigley, Aaron and Lee, Sang-Ho (1998) Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 198-209 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_15).

Pach, János and Wenger, Rephael (1998) Embedding Planar Graphs at Fixed Vertex Locations. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 263-274 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_20).

Eades, Peter and Houle, Michael E. and Webber, Richard (1998) Finding the Best Viewpoints for Three-Dimensional Graph Drawings. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 87-98 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_53).

Dillencourt, Michael B. and Eppstein, David and Hirschberg, Daniel S. (1998) Geometric Thickness of Complete Graphs. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 102-110 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_8).

Brandenburg, Franz J. (1998) Graph Clustering I: Cycles of Cliques. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 158-168 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_59).

Roxborough, Tom and Sen, Arunabha (1998) Graph Clustering Using Multiway Ratio Cut (Software Demonstration). In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 291-296 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_71).

Biedl, Therese and Marks, Joe and Ryall, Kathy and Whitesides, Sue (1998) Graph Multidrawing: Finding Nice Drawings Without Defining Nice. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 347-355 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_26).

Dobkin, David P. and Gansner, Emden R. and Koutsofios, Lefteris and North, Stephen (1998) Implementing a General-Purpose Edge Router. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 262-271 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_68).

Gansner, Emden R. and North, Stephen (1998) Improved Force-Directed Layouts. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 364-373 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_28).

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).

Zhu, Binhai and Deng, Xiaotie (1998) On Computing and Drawing Maxmin-Height Covering Triangulation. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 464-466 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_48).

Fößmeier, Ulrich and Heß, Carsten and Kaufmann, Michael (1998) On Improving Orthogonal Drawings: The 4M-Algorithm. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 125-137 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_10).

Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1998) Pitfalls of Using PQ-Trees in Automatic Graph Drawing. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 193-204 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_62).

Demaine, Erik D. and Demaine, Martin L. (1998) Planar Drawings of Origami Polyhedra. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 438-440 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_36).

Gutwenger, Carsten and Mutzel, Petra (1998) Planar Polyline Drawings with Good Angular Resolution. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 167-182 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_13).

Bertolazzi, Paola and Di Battista, Giuseppe and Didimo, Walter (1998) Quasi-Upward planarity (extended abstract). In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 15-29 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_2).

Meyer, Bernd (1998) Self-Organizing Graphs - A Neural Network Perspective of Graph Layout. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 246-262 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_19).

Fekete, Sándor P. and Houle, Michael E. and Whitesides, Sue (1998) The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 272-283 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_69).

Biedl, Therese (1998) Three Approaches to 3D-Orthogonal Box-Drawings (Extended Abstract). In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 30-43 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_3).

Hliněný, Petr (1998) Touching Graphs of Unit Balls. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 350-358 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_80).

Brandes, Ulrik and Wagner, Dorothea (1998) Using Graph Layout to Visualize Train Interconnection Data. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 44-56 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_4).

Nakano, Shin-Ichi and Rahman, Md. Saidur and Nishizeki, Takao (1997) A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, , pp. 334-344 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_58).

Garg, Ashim and Tamassia, Roberto (1997) A New Minimum Cost Flow Algorithm with Applications to Graph Drawing. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 201-216 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_49).

Mutzel, Petra (1997) An Alternative Method to Crossing Minimization on Hierarchical Graphs (extended abstract). In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 318-333 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_57).

Lozada, L. A. P. and De Mendonça Neto, C. F. X. and Rosi, R. M. and Stolfi, J. (1997) Automatic Visualization of Two-Dimensional Cellular Complexes. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 303-317 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_56).

Calamoneri, Tiziana and Sterbini, Andrea (1997) Drawing 2-, 3- and 4-colorable Graphs in O(n²) Volume. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 53-62 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_37).

Kratochvíl, Jan (1997) Intersection Graphs of Noncrossing Arc-Connected Sets in the Plane. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, , pp. 257-270 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_53).

Bose, Prosenjit and Dean, Alice M. and Hutchinson, Joan P. and Shermer, Thomas (1997) On Rectangle Visibility Graphs. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 25-44 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_35).

Kakoulis, Konstantinos G. and Tollis, Ioannis G. (1997) On the Edge Label Placement Problem. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 241-256 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_52).

Alzohairi, Mohammad and Rival, Ivan (1997) Series-Parallel Planar Ordered Sets Have Pagenumber Two (Extended Abstract). In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 11-24 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_34).

Frick, Arne (1997) Upper Bounds on the Number of Hidden Nodes in Sugiyama's Algorithm. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 169-183 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_46).

Kuchem, Ruth and Wagner, Dorothea (1997) Wiring Edge-Disjoint Layouts. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 271-285 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_54).

Monien, Burkhard and Ramme, Friedhelm and Salmen, Helmut (1996) A Parallel Simulated Annealing Algorithm for Generating 3D Layouts of Undirected Graphs. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 396-408 (Official URL: http://dx.doi.org/10.1007/BFb0021823).

Shieh, Fwu-Shan and McCreary, Carolyn (1996) Directed Graphs Drawing by Clan-Based Decomposition. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 472-482 (Official URL: http://dx.doi.org/10.1007/BFb0021831).

He, Xin (1996) Grid Embedding of 4-Connected Plane Graphs. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 287-299 (Official URL: http://dx.doi.org/10.1007/BFb0021812).

Lenhart, William J. and Liotta, Giuseppe (1996) How to Draw Outerplanar Minimum Weight Triangulations. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 373-384 (Official URL: http://dx.doi.org/10.1007/BFb0021821).

North, Stephen (1996) Incremental Layout in DynaDAG. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 409-418 (Official URL: http://dx.doi.org/10.1007/BFb0021824).

Papakostas, Achilleas and Tollis, Ioannis G. (1996) Issues in Interactive Orthogonal Graph Drawing. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 419-430 (Official URL: http://dx.doi.org/10.1007/BFb0021825).

Kikusts, Paulis and Rucevskis, Peteris (1996) Layout Algorithms of Graph-Like Diagrams for GRADE Windows Graphic Editors. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 361-364 (Official URL: http://dx.doi.org/10.1007/BFb0021819).

Heath, Lenwood S. and Pemmaraju, Sriram V. (1996) Recognizing Leveled-Planar Dags in Linear Time. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 300-311 (Official URL: http://dx.doi.org/10.1007/BFb0021813).

Di Battista, Giuseppe and Liotta, Giuseppe and Whitesides, Sue (1996) The Strength of Weak Proximity (Extended Abstract). In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , Passau, Germany , pp. 178-189 (Official URL: http://dx.doi.org/10.1007/BFb0021802).

Eades, Peter and De Mendonça Neto, C. F. X. (1996) Vertex Splitting and Tension-Free Layout. In: Symposium on Graph Drawing, GD 1995 , September 20-22, 1995, Passau, Germany , pp. 202-211 (Official URL: http://dx.doi.org/10.1007/BFb0021804).

Frick, Arne and Ludwig, Andreas and Mehldau, Heiko (1995) A Fast Adaptive Layout Algorithm for Undirected Graphs (Extended Abstract and System Demonstration). In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 388-403 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_393).

De Fraysseix, Hubert and Ossona de Mendez, Patrice and Pach, János (1995) A Left-First Search Algorithm for Planar Graphs. [Journal (Paginated)]

Kaugars, Karlis and Reinfelds, Juris and Brazma, Alvis (1995) A Simple Algorithm for Drawing Large Graphs on Small Screens. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 278-281 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_382).

Chrobak, Marek and Nakano, Shin-Ichi (1995) Minimum-Width Grid Drawings of Plane Graphs (Extended Abstract). In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 104-110 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_361).

Garg, Ashim (1995) On Drawing Angle Graphs (Extended Abstract). In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 84-95 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_359).

Djidjev, Hristo (1995) On Drawing a Graph Convexly in the Plane (Extended Abstract). In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 76-83 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_358).

Godau, Michael (1995) On the difficulty of embedding planar graphs with inaccuracies (Extended Abstract). In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 254-261 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_377).

ElGindy, H. and Liotta, Giuseppe and Lubiw, Anna and Meijer, Henk and Whitesides, Sue (1995) Recognizing Rectangle of Influence Drawable Graphs (extended abstract). In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 352-363 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_390).

Jünger, Michael and Mutzel, Petra (1995) The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 119-130 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_363).

Jünger, Michael and Mutzel, Petra (1994) The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. [Preprint]

This list was generated on Sun Dec 4 04:05:06 2016 CET.