Items where Subject is "G Algorithms and Complexity > G.420 Crossings"

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

Hong, Seok-Hee and Eades, Peter and Katoh, Naoki and Liotta, Giuseppe and Schweitzer, Pascal and Suzuki, Yusuke (2013) A Linear-Time Algorithm for Testing Outer-1-Planarity. In: 21st International Symposium, GD 2013, September 23-25, 2013, Bordeaux, France , pp. 71-82 (Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_7).

Betz, Gregor and Doll, Christoph and Gemsa, Andreas and Rutter, Ignaz and Wagner, Dorothea (2013) Column-Based Graph Layouts. In: 20th International Symposium, GD 2012, September 19-21, 2012, Redmond, WA, USA , pp. 236-247 (Official URL: http://link.springer.com/chapter/10.1007/978-3-642-36763-2_21).

Bereg, Sergey and Holroyd, Alexander E. and Nachmanson, Lev and Pupyrev, Sergey (2013) Drawing Permutations with Few Corners. In: 21st International Symposium, GD 2013, September 23-25, 2013, Bordeaux, France , pp. 484-495 (Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_42).

Okamoto, Yoshio and Tatsu, Yuichi and Uno, Yushi (2013) Exact and Fixed-Parameter Algorithms for Metro-Line Crossing Minimization Problems. In: 21st International Symposium, GD 2013, September 23-25, 2013, Bordeaux, France , pp. 520-521 .

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

Fink, Martin and Pupyrev, Sergey (2013) Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases. In: 21st International Symposium, GD 2013, September 23-25, 2013, Bordeaux, France , pp. 328-339 (Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_29).

Suk, Andrew and Walczak, Bartosz (2013) New Bounds on the Maximum Number of Edges in k-Quasi-Planar Graphs. In: 21st International Symposium, GD 2013, September 23-25, 2013, Bordeaux, France , pp. 95-106 (Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_9).

Auer, Christopher and Bachmaier, Christian and Brandenburg, Franz J. and Gleißner, Andreas and Hanauer, Kathrin and Neuwirth, Daniel and Reislhuber, Josef (2013) Recognizing Outer 1-Planar Graphs in Linear Time. In: 21st International Symposium, GD 2013, September 23-25, 2013, Bordeaux, France , pp. 107-118 (Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_10).

Bekos, Michael A. and Kaufmann, Michael and Krug, Robert and Näher, Stefan and Roselli, Vincenzo (2013) Slanted Orthogonal Drawings. In: 21st International Symposium, GD 2013, September 23-25, 2013, Bordeaux, France , pp. 424-435 (Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_37).

Alam, Md. Jawaherul and Brandenburg, Franz J. and Kobourov, Stephen G. (2013) Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs. In: 21st International Symposium, GD 2013, September 23-25, 2013, Bordeaux, France , pp. 83-94 (Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_8).

Auer, Christopher and Bachmaier, Christian and Brandenburg, Franz J. and Gleißner, Andreas and Hanauer, Kathrin and Neuwirth, Daniel (2013) The Density of Classes of 1-Planar Graphs. In: 21st International Symposium, GD 2013, September 23-25, 2013 , pp. 524-525 .

Radoslav, Fulek and Pelsmajer, Michael J. and Schaefer, Marcus and Štefankovič, Daniel (2012) Adjacent Crossings Do Matter. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011, Eindhoven, The Netherlands , pp. 343-354 (Official URL: http://dx.doi.org/10.1007/978-3-642-25878-7_33).

Argyriou, Evmorfia N. and Bekos, Michael A. and Kaufmann, Michael and Symvonis, Antonios (2012) Combining Problems on RAC Drawings and Simultaneous Graph Drawings. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011, Eindhoven, The Netherlands , pp. 433-434 (Official URL: http://dx.doi.org/10.1007/978-3-642-25878-7_41).

Pach, János and Tóth, Géza (2012) Monotone Crossing Number. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011, Eindhoven, The Netherlands , pp. 278-289 (Official URL: http://dx.doi.org/10.1007/978-3-642-25878-7_27).

Eades, Peter and Liotta, Giuseppe (2012) Right Angle Crossing Graphs and 1-Planarity. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011, Eindhoven, The Netherlands , pp. 148-153 (Official URL: http://dx.doi.org/10.1007/978-3-642-25878-7_15).

Argyriou, Evmorfia and Bekos, Michael and Symvonis, Antonios (2011) Maximizing the Total Resolution of Graphs. In: Graph Drawing 18th International Symposium, GD 2010, September 21-24, 2010, Konstanz, Germany , pp. 62-67 (Official URL: http://dx.doi.org/10.1007/978-3-642-18469-7_6).

Gange, Graeme and Stuckey, Peter J. and Marriott, Kim (2011) Optimal k-Level Planarization and Crossing Minimization. In: Graph Drawing 18th International Symposium, GD 2010, September 21-24, 2010, Konstanz, Germany , pp. 238-249 (Official URL: http://dx.doi.org/10.1007/978-3-642-18469-7_22).

Nöllenburg, Martin (2010) An Improved Algorithm for the Metro-line Crossing Minimization Problem. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009, Chicago, IL, USA , pp. 381-392 (Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_36).

Di Giacomo, Emilio and Didimo, Walter and Liotta, Giuseppe and Meijer, Henk (2010) Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009, Chicago, IL, USA , pp. 15-20 (Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_4).

Eades, Peter and Hong, Seok-Hee and Poon, Sheung-Hung (2010) On Rectilinear Drawing of Graphs. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009, Chicago, IL, USA , pp. 232-243 (Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_23).

Angelini, Patrizio and Cittadini, Luca and Di Battista, Giuseppe and Didimo, Walter and Frati, Fabrizio and Kaufmann, Michael and Symvonis, Antonios (2010) On the Perspectives Opened by Right Angle Crossing Drawings. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009, Chicago, IL, USA , pp. 21-32 (Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_5).

Mchedlidze, Tamara and Symvonis, Antonios (2010) On ρ-Constrained Upward Topological Book Embeddings. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009, Chicago, IL, USA , pp. 411-412 (Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_40).

Pelsmajer, Michael J. and Schaefer, Marcus and Stefankovic, Daniel (2010) Removing Independently Even Crossings. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009, Chicago, IL, USA , pp. 201-206 (Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_20).

Erten, Cesim and Sözdinler, Melih (2009) A Robust Biclustering Method Based on Crossing Minimization in Bipartite Graphs. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008, Heraklion, Crete, Greece , pp. 439-440 (Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_45).

Chimani, Markus and Hlinený, Petr and Mutzel, Petra (2009) Approximating the Crossing Number of Apex Graphs. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008, Heraklion, Crete, Greece , pp. 432-434 (Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_42).

Cabello, Sergio and Mohar, Bojan (2009) Crossing and Weighted Crossing Number of Near-Planar Graphs. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008, Heraklion, Crete, Greece , pp. 38-49 (Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_5).

Buchin, Kevin and Buchin, Maike and Byrka, Jaroslaw and Nöllenburg, Martin and Okamoto, Yoshio and Silveira, Rodrigo I. and Wolff, Alexander (2009) Drawing (Complete) Binary Tanglegrams. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008, Heraklion, Crete, Greece , pp. 324-335 (Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_32).

Mchedlidze, Tamara and Symvonis, Antonios (2009) Spine Crossing Minimization in Upward Topological Book Embeddings. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008, Heraklion, Crete, Greece , pp. 445-446 (Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_48).

Argyriou, Evmorfia and Bekos, Michael A. and Kaufmann, Michael and Symvonis, Antonios (2009) Two Polynomial Time Algorithms for the Metro-Line Crossing Minimization Problem. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008, Heraklion, Crete, Greece , pp. 336-347 (Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_33).

Fox, Jacob and Pach, János and Tóth, Csaba D. (2008) A Bipartite Strengthening of the Crossing Lemma. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007, Sydney, Australia , pp. 13-24 (Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_4).

Pelsmajer, Michael J. and Schaefer, Marcus and Stefankovic, Daniel (2008) Crossing Number of Graphs with Rotation Systems. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007, Sydney, Australia , pp. 3-12 (Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_3).

Pelsmajer, Michael J. and Schaefer, Marcus and Stefankovic, Daniel (2008) Crossing Numbers and Parameterized Complexity. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007, Sydney, Australia , pp. 31-36 (Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_6).

Cerný, Jakub and Kyncl, Jan and Tóth, Géza (2008) Improvement on the Decay of Crossing Numbers. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007, Sydney, Australia , pp. 25-30 (Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_5).

Bekos, Michael A. and Kaufmann, Michael and Potika, Katerina and Symvonis, Antonios (2008) Line Crossing Minimization on Metro Maps. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007, Sydney, Australia , pp. 231-242 (Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_24).

Benkert, Marc and Nöllenburg, Martin and Uno, Takeaki and Wolff, Alexander (2007) Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transport Maps. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006, Karlsruhe, Germany , pp. 270-281 (Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_27).

Hlinený, Petr and Salazar, Gelasio (2007) On the Crossing Number of Almost Planar Graphs. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006, Karlsruhe, Germany , pp. 162-173 (Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_17).

Fox, Jacob and Tóth, Csaba D. (2007) On the Decay of Crossing Numbers. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006, Karlsruhe, Germany , pp. 174-183 (Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_18).

Wood, David R. and Telle, Jan Arne (2007) Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006, Karlsruhe, Germany , pp. 150-161 (Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_16).

Pach, János and Tóth, Géza (2006) Crossing number of toroidal graphs. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 334-342 (Official URL: http://dx.doi.org/10.1007/11618058_30).

Biedl, Therese and Brandenburg, Franz J. and Deng, Xiaotie (2006) Crossings and Permutations. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 1-12 (Official URL: http://dx.doi.org/10.1007/11618058_1).

Buchheim, Christoph and Ebner, Dietmar and Jünger, Michael and Klau, Gunnar W. and Mutzel, Petra and Weiskircher, René (2006) Exact Crossing Minimization. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 37-48 (Official URL: http://dx.doi.org/10.1007/11618058_4).

Huang, Weidong and Hong, Seok-Hee and Eades, Peter (2006) Layout effects on sociogram perception. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 262-273 (Official URL: http://dx.doi.org/10.1007/11618058_24).

Gutwenger, Carsten and Chimani, Markus (2006) Non-Planar Core Reduction of Graphs. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 223-234 (Official URL: http://dx.doi.org/10.1007/11618058_21).

Pelsmajer, Michael J. and Schaefer, Marcus and Stefankovic, Daniel (2006) Odd Crossing Number Is Not Crossing Number. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 386-396 (Official URL: http://dx.doi.org/10.1007/11618058_35).

Kyncl, Jan and Valtr, Pavel (2006) On edges crossing few other edges in simple topological complete graphs. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 274-284 (Official URL: http://dx.doi.org/10.1007/11618058_25).

Buchheim, Christoph and Hong, Seok-Hee (2005) Crossing Minimization for Symmetries. [Journal (Paginated)]

Forster, Michael (2004) A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004, New York, NY, USA , pp. 206-216 (Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_22).

Gutwenger, Carsten and Mutzel, Petra (2004) An Experimental Study of Crossing Minimization Heuristics. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 13-24 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_2).

Nagamochi, Hiroshi (2004) An Improved Approximation to the One-Sided Bilayer Drawing. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 406-418 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_38).

Shahrokhi, Farhad and Sýkora, Ondrej and Székely, László A. and Vrt'o, Imrich (2004) Bounds and Methods for k-Planar Crossing Numbers. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 37-46 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_4).

Suderman, Matthew and Whitesides, Sue (2004) Experiments with the Fixed-Parameter Approach for Two-Layer Planarization. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 345-356 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_32).

Dujmovic, Vida and Fernau, Henning and Kaufmann, Michael (2004) Fixed Parameter Algorithms for one-sided crossing minimization Revisited. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 332-344 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_31).

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

Murray, Colin and Friedrich, Carsten and Eades, Peter (2004) HexGraph: Applying Graph Drawing Algorithms to the Game of Hex. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 494-495 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_47).

Dujmovic, Vida and Wood, David R. (2004) Layouts of Graph Subdivisions. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004, New York, NY, USA , pp. 133-143 (Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_15).

Gutwenger, Carsten and Mutzel, Petra (2003) An Experimental Study of Crossing Minimization Heuristics. In: Graph Drawing 2003, 2003, Perugia . (In Press)

Dujmovic, Vida and Fellows, M. and Hallett, M. and Kitching, Matthew and Liotta, Giuseppe and McCartin, C. and Nishimura, N. and Ragde, P. and Rosamond, F. and Suderman, Matthew and Whitesides, Sue and Wood, David R. (2002) A Fixed-Parameter Approach to Two-Layer Planarization. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 1-15 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_1).

Dujmovic, Vida and Whitesides, Sue (2002) An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 118-129 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_12).

Djidjev, Hristo and Vrt'o, Imrich (2002) An Improved Lower Bound for Crossing Numbers. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 96-101 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_8).

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

Buchheim, Christoph and Hong, Seok-Hee (2002) Crossing Minimization for Symmetries. In: 13th Annual International Symposium on Algorithms and Computation (ISAAC 2002), November 20-23, 2002, Vancouver, Canada , pp. 563-574 (Official URL: http://dx.doi.org/10.1007/3-540-36136-7_49).

Eschbach, Thomas and Günther, Wolfgang and Drechsler, Rolf and Becker, Bernd (2002) Crossing Reduction by Windows Optimization. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 285-294 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_27).

Hlinený, Petr (2002) Crossing-Critical Graphs and Path-Width. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 102-114 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_9).

Sýkora, Ondrej and Székely, László A. and Vrt'o, Imrich (2002) Fractional Lengths and Crossing Numbers. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 186-192 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_18).

Munoz, Xavier and Unger, W. and Vrt'o, Imrich (2002) One Sided Crossing Minimization Is NP-Hard for Sparse Graphs. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 115-123 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_10).

Di Battista, Giuseppe and Didimo, Walter and Marcandalli, A. (2002) Planarization of Clustered Graphs (Extended Abstract). In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 60-74 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_5).

Barth, Wilhelm and Jünger, Michael and Mutzel, Petra (2002) Simple and Efficient Bilayer Cross Counting. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 130-141 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_13).

Barth, Wilhelm and Jünger, Michael and Mutzel, Petra (2002) Simple and Efficient Bilayer Cross Counting. [Preprint]

Felsner, Stefan and Liotta, Giuseppe and Wismath, Stephen (2002) Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions (Extended Abstract). In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 328-342 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_26).

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

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

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

Bertault, François (1999) A Force-Directed Algorithm that Preserves Edge Crossing Properties. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 351-358 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_36).

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

Waddle, Vance and Malhotra, Ashok (1999) An E log E Line Crossing Algorithm for Levelled Graphs. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 59-71 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_6).

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

Shahrokhi, Farhad and Vrt'o, Imrich (1999) On 3-Layer Crossings and Pseudo Arrangements. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 225-231 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_23).

De Fraysseix, Hubert and Ossona de Mendez, Patrice (1999) On a Characterization of Gauss Codes. [Journal (Paginated)]

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

Matuszewski, Christian and Schönfeld, Robby and Molitor, Paul (1999) Using Sifting for k-Layer Straightline Crossing Minimization. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 217-224 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_22).

Jünger, Michael and Lee, Eva K. and Mutzel, Petra and Odenthal, Thomas (1998) A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem (Extended Abstract). In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 13-24 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_46).

De Fraysseix, Hubert and Ossona de Mendez, Patrice (1998) A Short Proof of a Gauss Problem. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 230-235 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_65).

Shahrokhi, Farhad and Sýkora, Ondrej and Székely, László A. and Vrt'o, Imrich (1998) Bipartite Crossing Numbers of Meshes and Hypercubes. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 37-46 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_48).

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

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

Valtr, Pavel (1998) Graph Drawing with no k Pairwise Crossing Edges. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 205-218 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_63).

Papakostas, Achilleas and Tollis, Ioannis G. (1998) Incremental Orthogonal Graph Drawing in Three Dimensions. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 52-63 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_50).

Six, Janet M. and Kakoulis, Konstantinos G. and Tollis, Ioannis G. (1998) Refinement of Orthogonal Graph Drawings. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 302-315 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_23).

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

Abellanas, Manuel and Garcìa, J. and Hernández, Gregorio and Noy, M. and Ramos, Pedro (1997) Bipartite Embeddings of Trees in the Plane. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 1-10 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_33).

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

Di Battista, Giuseppe and Garg, Ashim and Liotta, Giuseppe and Parise, Armando and Tamassia, Roberto and Tassinari, Emanuele and Vargiu, Francesco and Vismara, Luca (1997) Drawing Directed Acyclic Graphs: An Experimantal Study. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 76-91 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_39).

Pach, János and Tóth, Géza (1997) Graphs Drawn with Few Crossings per Edge. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 345-354 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_59).

Jünger, Michael and Mutzel, Petra (1996) 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms. [Preprint]

Sander, Georg (1996) A Fast Heuristic for Hierarchical Manhattan Layout. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 447-458 (Official URL: http://dx.doi.org/10.1007/BFb0021828).

Shahrokhi, Farhad and Sýkora, Ondrej and Székely, László A. and Vrt'o, Imrich (1996) Crossing Numbers of Meshes. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 463-471 (Official URL: http://dx.doi.org/10.1007/BFb0021830).

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

Jünger, Michael and Mutzel, Petra (1996) Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 337-348 (Official URL: http://dx.doi.org/10.1007/BFb0021817).

Biedl, Therese (1996) New Lower Bounds for Orthogonal Graph Drawings. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 28-39 (Official URL: http://dx.doi.org/10.1007/BFb0021788).

Agarwal, Pankaj K. and Aronov, Boris and Pach, János and Pollack, Richard and Sharir, Micha (1996) Quasi-Planar Graphs Have a Linear Number of Edges. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 1-7 (Official URL: http://dx.doi.org/10.1007/BFb0021784).

Shahrokhi, Farhad and Székely, László A. and Vrt'o, Imrich (1995) Crossing Numbers of Graphs, Lower Bound Techniques and Algorithms: A Survey. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 131-142 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_364).

Jünger, Michael and Mutzel, Petra (1995) Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization. [Preprint]

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

This list was generated on Wed Oct 22 04:04:50 2014 CEST.