Browse by Author

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 12.

Conference Paper

Kaufmann, Michael and Vrt'o, Imrich and Geyer, Markus (2006) Two trees which are self-intersecting when drawn simultaneously. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 201-210(Official URL: http://dx.doi.org/10.1007/11618058_19).

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 , pp. 37-46(Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_4).

Torok, Lubomir and Vrt'o, Imrich (2004) Layout Volumes of the Hypercube. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004 , pp. 414-424(Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_42).

Newton, Matthew and Sýkora, Ondrej and Uzovic, Martin and Vrt'o, Imrich (2004) New Exact Results and Bounds for Bipartite Crossing Numbers of Meshes. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004 , pp. 360-370(Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_36).

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 , pp. 96-101(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_8).

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 , 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 , pp. 115-123(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_10).

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 , pp. 312-319(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_29).

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 , pp. 225-231(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_23).

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 , pp. 37-46(Official URL: http://dx.doi.org/10.1007/3-540-63938-1_48).

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 , pp. 463-471(Official URL: http://dx.doi.org/10.1007/BFb0021830).

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 , pp. 131-142(Official URL: http://dx.doi.org/10.1007/3-540-58950-3_364).

This list was generated on Thu Jul 9 09:34:35 2020 CEST.