Subject: G.420 Crossings
Number of records: 72.
Jünger, Michael and Mutzel, Petra (1996) 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms.
Fox, Jacob and Pach, János and Tóth, Csaba D. (2008) A Bipartite Strengthening of the Crossing Lemma. In Hong, Seok-Hee and Nishizeki, Takao and Quan, Wu, Eds. Proceedings Graph Drawing, pages pp. 13-24, Sidney, Australia.
Forster, Michael (2004) A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction. In Pach, János, Eds. Proceedings Graph Drawing, pages pp. 206-216, New York.
Sander, Georg (1996) A Fast Heuristic for Hierarchical Manhattan Layout. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 447-458, Passau, Germany.
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 Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 1-15, Vienna, Austria.
Bertault, François (1999) A Force-Directed Algorithm that Preserves Edge Crossing Properties. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 351-358, Stirín Castle, Czech Republic.
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 DiBattista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 13-24, Rome, Italy.
de Fraysseix, Hubert and Ossona de Mendez, Patrice (1998) A Short Proof of a Gauss Problem. In Di Battista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 230-235, Rome, Italy.
Bertault, François and Miller, Mirka (1999) An Algorithm for Drawing Compound Graphs. In Kratochvíl, Jan, Eds. Proceedings Gaph Drawing, pages pp. 197-204, Stirín Castle, Czech Republic.
Castelló, Rodolfo and Mili, Rym and Tollis, Ioannis G. (2001) An Algorithmic Framework for Visualizing Statecharts. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 139-149, Colonial Williamsburg.
Mutzel, Petra (1997) An Alternative Mathod to Crossing Minimization on Hierarchiocal Graphs (extended abstract). In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 318-333, Berkeley, California, USA.
Waddle, Vance and Malhotra, Ashok (1999) An E log E Line Crossing Algorithm for Levelled Graphs. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 59-71, Stirín Castle, Czech Republic.
Dujmovic, Vida and Whitesides, Sue (2002) An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 118-129, Irvine, CA, USA.
Gutwenger, Carsten and Mutzel, Petra (2003) An Experimental Study of Crossing Minimization Heuristics. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing 2003, Perugia.
Gutwenger, Carsten and Mutzel, Petra (2004) An Experimental Study of Crossing Minimization Heuristics. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 13-24, Perugia, Italy.
Nagamochi, Hiroshi (2004) An Improved Approximation to the One-Sided Bilayer Drawing. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 406-418, Perugia.
Djidjev, Hristo and Vrt'o, Imrich (2002) An Improved Lower Bound for Crossing Numbers. In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 96-101, Vienna, Austria.
Forster, Michael (2002) Applying Crossing Reduction Strategies to Layered Compound Graphs. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 276-284, Irvine, CA, USA.
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 DiBattista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 37-46, Rome, Italy.
Abellanas, Manuel and Garcìa, J. and Hernández, G. and Noy, M. and Ramos, Pedro (1997) Bipartite Embeddings of Trees in the Plane. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 01-10, Berkeley, California, USA.
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 Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 37-46, Perugia, Italy.
Dogrusoz, Ugur and Madden, Brendan and Madden, Patrick (1997) Circular Layout in the Graph Layout Toolkit. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 92-100, Berkeley, California, USA.
Buchheim, Christoph and Hong, Seok-Hee (2002) Crossing Minimization for Symmetries. In Bose, Prosenjit and Morin, Pat, Eds. Proceedings 13th Annual International Symposium on Algorithms and Computation (ISAAC 2002), pages pp. 563-574, Vancouver, Canada.
Buchheim, Christoph and Hong, Seok-Hee (2005) Crossing Minimization for Symmetries. Theory of Computing Systems 38(3):pp. 293-311.
Kratochvíl, Jan (1998) Crossing Number of Abstract Topological Graphs. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 238-245, Montréal, Canada.
Pelsmajer, Michael J. and Schaefer, Marcus and Stefankovic, Daniel (2008) Crossing Number of Graphs with Rotation Systems. In Hong, Seok-Hee and Nishizeki, Takao and Quan, Wu, Eds. Proceedings Graph Drawing, pages pp. 3-12, Sidney, Australia.
Pach, János and Tóth, Géza (2006) Crossing number of toroidal graphs. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 334-342, Limerick, Ireland.
Pelsmajer, Michael J. and Schaefer, Marcus and Stefankovic, Daniel (2008) Crossing Numbers and Parameterized Complexity. In Hong, Seok-Hee and Nishizeki, Takao and Quan, Wu, Eds. Proceedings Graph Drawing, pages pp. 31-36, Sidney, Australia.
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 Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 131-142, Princeton.
Shahrokhi, Farhad and Sýkora, Ondrej and Székely, László A. and Vrt'o, Imrich (1996) Crossing Numbers of Meshes. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 463-471, Passau, Germany.
Eschbach, Thomas and Günther, Wolfgang and Drechsler, Rolf and Becker, Bernd (2002) Crossing Reduction by Windows Optimization. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 285-294, Irvine, CA, USA.
Hlinený, Petr (2002) Crossing-Critical Graphs and Path-Width. In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 102-114, Vienna, Austria.
Biedl, Therese and Brandenburg, Franz J. and Deng, Xiaotie (2006) Crossings and Permutations. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 1-12, Limerick, Ireland.
Shieh, Fwu-Shan and McCreary, Carolyn (1996) Directed Graphs Drawing by Clan-Based Decomposition. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 472-482, Passau, Germany.
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 North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 76-91, Berkeley, California, USA.
Jünger, Michael and Mutzel, Petra (1996) Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 337-348, Passau, Germany.
Jünger, Michael and Mutzel, Petra (1995) Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization.
Buchheim, Christoph and Ebner, Dietmar and Jünger, Michael and Klau, Gunnar W. and Mutzel, Petra and Weiskircher, René (2006) Exact Crossing Minimization. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 37-48, Limerick, Ireland.
Suderman, Matthew and Whitesides, Sue (2004) Experiments with the Fixed-Parameter Approach for Two-Layer Planarization. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 345-356, Perugia.
Dujmovic, Vida and Fernau, Henning and Kaufmann, Michael (2004) Fixed Parameter Algorithms for one-sided crossing minimization Revisited. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 332-344, Perugia.
Efrat, Alon and Erten, Cesim and Kobourov, Stephen G. (2004) Fixed-Location Circular-Arc Drawing of Planar Graphs. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 147-158, Perugia.
Dillencourt, Michael B. and Eppstein, David and Hirschberg, Daniel S. (1998) Geometric Thickness of Complete Graphs. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 102-110, Montréal, Canada.
Valtr, Pavel (1998) Graph Drawing with no k Pairwise Crosseing Edges. In Di Battista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 205-218, Rome, Italy.
Pach, János and Tóth, Géza (1997) Graphs Drawn with Few Crossings per Edge. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 345-354, Berkeley, California, USA.
Cerný, Jakub and Kyncl, Jan and Tóth, Géza (2008) Improvement on the Decay of Crossing Numbers. In Hong, Seok-Hee and Nishizeki, Takao and Quan, Wu, Eds. Proceedings Graph Drawing, pages pp. 25-30, Sidney, Australia.
Papakostas, Achilleas and Tollis, Ioannis G. (1998) Incremental Orthogonal Graph Drawing in Three Dimensions. In DiBattista, Guiseppe, Eds. Proceedings Graph Drawing, pages pp. 52-63, Rome, Italy.
Günther, Wolfgang and Schönfeld, Robby and Becker, Bernd and Molitor, Paul (2001) k-Layer Straightline Crossing Minimization by Speeding Up Sifting. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 253-258, Colonial Williamsburg.
Huang, Weidong and Hong, Seok-Hee and Eades, Peter (2006) Layout effects on sociogram perception. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 262-273, Limerick, Ireland.
Dujmovic, Vida and Wood, David R. (2004) Layouts of Graph Subdivisions. In Pach, János, Eds. Proceedings Graph Drawing, pages pp. 133-143, New York.
Bekos, Michael A. and Kaufmann, Michael and Potika, Katerina and Symvonis, Antonios (2008) Line Crossing Minimization on Metro Maps. In Hong, Seok-Hee and Nishizeki, Takao and Quan, Wu, Eds. Proceedings Graph Drawing, pages pp. 231-242, Sidney, Australia.
Wood, David R. (1999) Multi-dimensional Orthogonal Graph Drawing with Small Boxes(Extended Abstract). In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 311-322, Stirín Castle, Czech Republic.
Biedl, Therese (1996) New Lower Bounds for Orthogonal Graph Drawings. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 28-39, Passau, Germany.
Gutwenger, Carsten and Chimani, Markus (2006) Non-Planar Core Reduction of Graphs. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 223-234, Limerick, Ireland.
Pelsmajer, Michael J. and Schaefer, Marcus and Stefankovic, Daniel (2006) Odd Crossing Number Is Not Crossing Number. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 386-396, Limerick, Ireland.
Shahrokhi, Farhad and Vrt'o, Imrich (1999) On 3-Layer Crossings and Pseudo Arrangements. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 225-231, Stirín Castle, Czech Republic.
de Fraysseix, Hubert and Ossona de Mendez, Patrice (1999) On a Characterization of Gauss Codes. Discrete and Computational Geometry 22(2):pp. 287-295.
Kyncl, Jan and Valtr, Pavel (2006) On edges crossing few other edges in simple topological complete graphs. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 274-284, Limerick, Ireland.
Hlinený, Petr and Salazar, Gelasio (2007) On the Crossing Number of Almost Planar Graphs. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 162-173, Karlsruhe, Germany.
Fox, Jacob and Toth, Csaba D. (2007) On the Decay of Crossing Numbers. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 174-183, Karlsruhe, Germany.
Munoz, Xavier and Unger, W. and Vrt'o, Imrich (2002) One Sided Crossing Minimization Is NP-Hard for Sparse Graphs. In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 115-123, Vienna, Austria.
Wood, David R. and Telle, Jan Arne (2007) Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. In Kaufmann, Michael and Wagner, Dorothea, Eds. Proceedings Graph Drawing, pages pp. 150-161, Karlsruhe, Germany.
Di Battista, Giuseppe and Didimo, Walter and Marcandalli, A. (2002) Planarization of Clustered Graphs (Extended Abstract). In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 60-74, Vienna, Austria.
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 Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 1-7, Passau, Germany.
Six, Janet M. and Kakoulis, Konstantinos G. and Tollis, Ioannis G. (1998) Refinement of Orthogonal Graph Drawings. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 302-315, Montréal, Canada.
Barth, Wilhelm and Jünger, Michael and Mutzel, Petra (2002) Simple and Efficient Bilayer Cross Counting.
Barth, Wilhelm and Jünger, Michael and Mutzel, Petra (2002) Simple and Efficient Bilayer Cross Counting. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 130-141, Irvine, CA, USA.
Felsner, Stefan and Liotta, Giuseppe and Wismath, Stephen (2002) Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions (Extended Abstract). In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 328-342, Vienna, Austria.
Mutzel, Petra and Ziegler, Thomas (1999) The Constrained Crossing Minimization Problem. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 175-185, Stirín Castle, Czech Republic.
Jünger, Michael and Mutzel, Petra (1995) The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. In Tamassia, Roberto and Tollis, Ioannis G., Eds. Proceedings Graph Drawing, pages pp. 119-130, Princeton.
Healy, Patrick and Kuusik, Ago (1999) The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 205-216, Stirín Castle, Czech Republic.
Newton, Matthew and Sykora, Ondrej and Vrt'o, Imrich (2002) Two New Heuristics for Two-Sided Bipartite Graph Drawing. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 312-319, Irvine, CA, USA.
Matuszewski, Christian and Schönfeld, Robby and Molitor, Paul (1999) Using Sifting for k-Layer Straightline Crossing Minimization. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 217-224, Stirín Castle, Czech Republic.
This list was generated on Fri Jun 27 09:36:11 CEST 2008.
