Browse by Author

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

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

Cibulka, Josef and Kyncl, Jan and Meszaros, Viola and Stolar, Rudolf and Valtr, Pavel (2009) Hamiltonian Alternating Paths on Bicolored Double-Chains. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008, Heraklion, Crete, Greece , pp. 181-192 (Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_18).

Babilon, Robert and Matoušek, Jiří and Maxová, Jana and Valtr, Pavel (2002) Low-Distortion Embeddings of Trees. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 343-351 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_27).

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

This list was generated on Fri Aug 22 04:05:21 2014 CEST.