Browse by Author

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

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

Demaine, Erik D. and Demaine, Martin L. (1998) Planar Drawings of Origami Polyhedra. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 438-440 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_36).

Cabello, Sergio and Demaine, Erik D. and Rote, Günter (2004) Planar Embeddings of Graphs with Specified Edge Lengths. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 283-294 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_26).

This list was generated on Sat Dec 20 04:05:27 2014 CET.