Browse by Author

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

Matousek, Jirí and Barát, János and Wood, David R. (2005) Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness. [Preprint]

Babilon, Robert and Matousek, Jirí 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).

Matousek, Jirí (1999) The Anatomy of a Geometric Algorithm. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 1-7 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_1).

This list was generated on Mon Jul 28 04:05:21 2014 CEST.