- BALANCED ASPECT RATIO TREES Christian Alexander Duncan
- The Geometric Thickness of Low Degree Graphs CHRISTIAN A. DUNCAN
- Efficient Approximation and Optimization Algorithms for Computational Metrology
- K-D Trees Are Better when Cut on the Longest Matthew Dickerson 1 , Christian A. Duncan 2 , and Michael T. Goodrich 3 ?
- Classical Computational Geometry in GeomNet \Lambda Gill Barequet y Stina S. Bridgeman z Christian A. Duncan y Michael T. Goodrich y
- Journal of Graph Algorithms and Applications http://www.cs.brown.edu/publications/jgaa/
- Z .Journal of Algorithms 38, 303 333 2001 doi:10.1006rjagm.2000.1135, available online at http:rrwww.idealibrary.com on
- DOI: 10.1007/s004540010080 Discrete Comput Geom 25:405418 (2001) Discrete & Computational
- Optimal Constrained Graph Exploration Christian A. Duncan
- Tight Bounds on Maximal and Maximum Matchings
- Discrete Mathematics 285 (2004) 715 www.elsevier.com/locate/disc
- CCCG 2009, Vancouver, BC, August 1719, 2009 On Graph Thickness, Geometric Thickness, and Separator Theorems
