Browse by Classification

Fox, Jacob and Pach, János and Tóth, Csaba D. (2008) A Bipartite Strengthening of the Crossing Lemma. [Conference Paper]

Pelsmajer, Michael J. and Schaefer, Marcus and Stefankovic, Daniel (2008) Crossing Number of Graphs with Rotation Systems. [Conference Paper]

Pelsmajer, Michael J. and Schaefer, Marcus and Stefankovic, Daniel (2008) Crossing Numbers and Parameterized Complexity. [Conference Paper]

Cerný, Jakub and Kyncl, Jan and Tóth, Géza (2008) Improvement on the Decay of Crossing Numbers. [Conference Paper]

Bekos, Michael A. and Kaufmann, Michael and Potika, Katerina and Symvonis, Antonios (2008) Line Crossing Minimization on Metro Maps. [Conference Paper]

Hlinený, Petr and Salazar, Gelasio (2007) On the Crossing Number of Almost Planar Graphs. [Conference Paper]

Fox, Jacob and Tóth, Csaba D. (2007) On the Decay of Crossing Numbers. [Conference Paper]

Wood, David R. and Telle, Jan Arne (2007) Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. [Conference Paper]

Pach, János and Tóth, Géza (2006) Crossing number of toroidal graphs. [Conference Paper]

Biedl, Therese and Brandenburg, Franz J. and Deng, Xiaotie (2006) Crossings and Permutations. [Conference Paper]

Buchheim, Christoph and Ebner, Dietmar and Jünger, Michael and Klau, Gunnar W. and Mutzel, Petra and Weiskircher, René (2006) Exact Crossing Minimization. [Conference Paper]

Huang, Weidong and Hong, Seok-Hee and Eades, Peter (2006) Layout effects on sociogram perception. [Conference Paper]

Gutwenger, Carsten and Chimani, Markus (2006) Non-Planar Core Reduction of Graphs. [Conference Paper]

Pelsmajer, Michael J. and Schaefer, Marcus and Stefankovic, Daniel (2006) Odd Crossing Number Is Not Crossing Number. [Conference Paper]

Kyncl, Jan and Valtr, Pavel (2006) On edges crossing few other edges in simple topological complete graphs. [Conference Paper]

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. [Conference Paper]

Gutwenger, Carsten and Mutzel, Petra (2004) An Experimental Study of Crossing Minimization Heuristics. [Conference Paper]

Nagamochi, Hiroshi (2004) An Improved Approximation to the One-Sided Bilayer Drawing. [Conference Paper]

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. [Conference Paper]

Suderman, Matthew and Whitesides, Sue (2004) Experiments with the Fixed-Parameter Approach for Two-Layer Planarization. [Conference Paper]

Dujmovic, Vida and Fernau, Henning and Kaufmann, Michael (2004) Fixed Parameter Algorithms for one-sided crossing minimization Revisited. [Conference Paper]

Efrat, Alon and Erten, Cesim and Kobourov, Stephen G. (2004) Fixed-Location Circular-Arc Drawing of Planar Graphs. [Conference Paper]

Dujmovic, Vida and Wood, David R. (2004) Layouts of Graph Subdivisions. [Conference Paper]

Gutwenger, Carsten and Mutzel, Petra (2003) An Experimental Study of Crossing Minimization Heuristics. [Conference Paper] (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. [Conference Paper]

Dujmovic, Vida and Whitesides, Sue (2002) An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. [Conference Paper]

Djidjev, Hristo and Vrt'o, Imrich (2002) An Improved Lower Bound for Crossing Numbers. [Conference Paper]

Forster, Michael (2002) Applying Crossing Reduction Strategies to Layered Compound Graphs. [Conference Paper]

Buchheim, Christoph and Hong, Seok-Hee (2002) Crossing Minimization for Symmetries. [Conference Paper]

Eschbach, Thomas and Günther, Wolfgang and Drechsler, Rolf and Becker, Bernd (2002) Crossing Reduction by Windows Optimization. [Conference Paper]

Hlinený, Petr (2002) Crossing-Critical Graphs and Path-Width. [Conference Paper]

Munoz, Xavier and Unger, W. and Vrt'o, Imrich (2002) One Sided Crossing Minimization Is NP-Hard for Sparse Graphs. [Conference Paper]

Di Battista, Giuseppe and Didimo, Walter and Marcandalli, A. (2002) Planarization of Clustered Graphs (Extended Abstract). [Conference Paper]

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

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

Felsner, Stefan and Liotta, Giuseppe and Wismath, Stephen (2002) Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions (Extended Abstract). [Conference Paper]

Newton, Matthew and Sykora, Ondrej and Vrt'o, Imrich (2002) Two New Heuristics for Two-Sided Bipartite Graph Drawing. [Conference Paper]

Castelló, Rodolfo and Mili, Rym and Tollis, Ioannis G. (2001) An Algorithmic Framework for Visualizing Statecharts. [Conference Paper]

Günther, Wolfgang and Schönfeld, Robby and Becker, Bernd and Molitor, Paul (2001) k-Layer Straightline Crossing Minimization by Speeding Up Sifting. [Conference Paper]

Bertault, François (1999) A Force-Directed Algorithm that Preserves Edge Crossing Properties. [Conference Paper]

Bertault, François and Miller, Mirka (1999) An Algorithm for Drawing Compound Graphs. [Conference Paper]

Waddle, Vance and Malhotra, Ashok (1999) An E log E Line Crossing Algorithm for Levelled Graphs. [Conference Paper]

Wood, David R. (1999) Multi-dimensional Orthogonal Graph Drawing with Small Boxes(Extended Abstract). [Conference Paper]

Shahrokhi, Farhad and Vrt'o, Imrich (1999) On 3-Layer Crossings and Pseudo Arrangements. [Conference Paper]

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. [Conference Paper]

Healy, Patrick and Kuusik, Ago (1999) The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation. [Conference Paper]

Matuszewski, Christian and Schönfeld, Robby and Molitor, Paul (1999) Using Sifting for k-Layer Straightline Crossing Minimization. [Conference Paper]

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). [Conference Paper]

de Fraysseix, Hubert and Ossona de Mendez, Patrice (1998) A Short Proof of a Gauss Problem. [Conference Paper]

Shahrokhi, Farhad and Sýkora, Ondrej and Székely, László A. and Vrt'o, Imrich (1998) Bipartite Crossing Numbers of Meshes and Hypercubes. [Conference Paper]

Kratochvíl, Jan (1998) Crossing Number of Abstract Topological Graphs. [Conference Paper]

Dillencourt, Michael B. and Eppstein, David and Hirschberg, Daniel S. (1998) Geometric Thickness of Complete Graphs. [Conference Paper]

Valtr, Pavel (1998) Graph Drawing with no k Pairwise Crosseing Edges. [Conference Paper]

Papakostas, Achilleas and Tollis, Ioannis G. (1998) Incremental Orthogonal Graph Drawing in Three Dimensions. [Conference Paper]

Six, Janet M. and Kakoulis, Konstantinos G. and Tollis, Ioannis G. (1998) Refinement of Orthogonal Graph Drawings. [Conference Paper]

Mutzel, Petra (1997) An Alternative Mathod to Crossing Minimization on Hierarchiocal Graphs (extended abstract). [Conference Paper]

Abellanas, Manuel and Garcìa, J. and Hernández, Gregorio and Noy, M. and Ramos, Pedro (1997) Bipartite Embeddings of Trees in the Plane. [Conference Paper]

Dogrusoz, Ugur and Madden, Brendan and Madden, Patrick (1997) Circular Layout in the Graph Layout Toolkit. [Conference Paper]

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. [Conference Paper]

Pach, János and Tóth, Géza (1997) Graphs Drawn with Few Crossings per Edge. [Conference Paper]

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. [Conference Paper]

Shahrokhi, Farhad and Sýkora, Ondrej and Székely, László A. and Vrt'o, Imrich (1996) Crossing Numbers of Meshes. [Conference Paper]

Shieh, Fwu-Shan and McCreary, Carolyn (1996) Directed Graphs Drawing by Clan-Based Decomposition. [Conference Paper]

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

Biedl, Therese (1996) New Lower Bounds for Orthogonal Graph Drawings. [Conference Paper]

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. [Conference Paper]

Shahrokhi, Farhad and Székely, László A. and Vrt'o, Imrich (1995) Crossing Numbers of Graphs, Lower Bound Techniques and Algorithms: A Survey. [Conference Paper]

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. [Conference Paper]