Browse by Author

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

Klein, Rolf and Kutz, Martin (2007) Computing Geometric Minimum-Dilation Graphs is NP-Hard. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006, Karlsruhe, Germany , pp. 196-207 (Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_20).

This list was generated on Mon Sep 1 04:05:27 2014 CEST.