Browse by Author

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

Demaine, Erik D. and Hajiaghayi, MohammadTaghi (2004) Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004, New York, NY, USA , pp. 517-533 (Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_57).

This list was generated on Tue Sep 2 04:05:18 2014 CEST.