| 2013 | ||
|---|---|---|
| j17 | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg: Drawing Trees with Perfect Angular Resolution and Polynomial Area. Discrete & Computational Geometry 49(2): 157-182 (2013) | |
| c34 | Andrew Gardner, Christian A. Duncan, Rastko R. Selmic, Jinko Kanno: Real-time classification of dynamic hand gestures from marker-based position data. IUI Companion 2013: 13-16 | |
| 2012 | ||
| j16 | Christian A. Duncan, Emden R. Gansner, Y. F. Hu, Michael Kaufmann, Stephen G. Kobourov: Optimal Polygonal Representation of Planar Graphs. Algorithmica 63(3): 672-691 (2012) | |
| j15 | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg: Lombardi Drawings of Graphs. J. Graph Algorithms Appl. 16(1): 85-108 (2012) | |
| c33 | Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander: Graph Drawing Contest Report. Graph Drawing 2012: 575-579 | |
| 2011 | ||
| j14 | Christian A. Duncan: On graph thickness, geometric thickness, and separator theorems. Comput. Geom. 44(2): 95-99 (2011) | |
| j13 | Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Planar Drawings of Higher-Genus Graphs. J. Graph Algorithms Appl. 15(1): 7-32 (2011) | |
| c32 | Guyu Zhang, Christian A. Duncan, Jinko Kanno, Rastko R. Selmic: Distributed unmanned ground vehicle navigation in coordinate-free and localization-free wireless sensor and actuator networks. CDC-ECE 2011: 7262-7267 | |
| c31 | Christian A. Duncan, Vir V. Phoha: On the Complexity of Aggregating Information for Authentication and Profiling. DPM/SETOP 2011: 58-71 | |
| c30 | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler: Planar and Poly-arc Lombardi Drawings. Graph Drawing 2011: 308-319 | |
| c29 | Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander: Graph Drawing Contest Report. Graph Drawing 2011: 449-455 | |
| i7 | Christian A. Duncan, Emden R. Gansner, Yifan Hu, Michael Kaufmann, Stephen G. Kobourov: Optimal Polygonal Representation of Planar Graphs. CoRR abs/1104.1482 (2011) | |
| i6 | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler: Planar and Poly-Arc Lombardi Drawings. CoRR abs/1109.0345 (2011) | |
| 2010 | ||
| c28 | Guyu Zhang, Christian A. Duncan, Jinko Kanno, Rastko R. Selmic: Unmanned Ground Vehicle Navigation in Coordinate-free and Localization-free Wireless Sensor and Acutuator Networks. CCA 2010: 428-433 | |
| c27 | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg: Drawing Trees with Perfect Angular Resolution and Polynomial Area. Graph Drawing 2010: 183-194 | |
| c26 | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg: Lombardi Drawings of Graphs. Graph Drawing 2010: 195-207 | |
| c25 | Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander: Graph Drawing Contest Report. Graph Drawing 2010: 406-411 | |
| i5 | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg: Lombardi Drawings of Graphs. CoRR abs/1009.0579 (2010) | |
| i4 | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg: Drawing Trees with Perfect Angular Resolution and Polynomial Area. CoRR abs/1009.0581 (2010) | |
| 2009 | ||
| c24 | Christian A. Duncan: On Graph Thickness, Geometric Thickness, and Separator Theorems. CCCG 2009: 13-16 | |
| c23 | Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Planar Drawings of Higher-Genus Graphs. Graph Drawing 2009: 45-56 | |
| c22 | Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander: Graph Drawing Contest Report. Graph Drawing 2009: 428-433 | |
| i3 | Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Planar Drawings of Higher-Genus Graphs. CoRR abs/0908.1608 (2009) | |
| 2008 | ||
| c21 | Ugur Dogrusöz, Christian A. Duncan, Carsten Gutwenger, Georg Sander: Graph Drawing Contest Report. Graph Drawing 2008: 453-458 | |
| 2007 | ||
| j12 | Peter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell: On simultaneous planar graph embeddings. Comput. Geom. 36(2): 117-130 (2007) | |
| c20 | Christian A. Duncan, Stephen G. Kobourov, Georg Sander: Graph Drawing Contest Report. Graph Drawing 2007: 395-400 | |
| 2006 | ||
| j11 | Christian A. Duncan, Alon Efrat, Stephen G. Kobourov, Carola Wenk: Drawing with Fat Edges. Int. J. Found. Comput. Sci. 17(5): 1143-1164 (2006) | |
| j10 | Christian A. Duncan, Stephen G. Kobourov, V. S. Anil Kumar: Optimal constrained graph exploration. ACM Transactions on Algorithms 2(3): 380-402 (2006) | |
| c19 | Christian A. Duncan, Gunnar W. Klau, Stephen G. Kobourov, Georg Sander: Graph-Drawing Contest Report. Graph Drawing 2006: 448-452 | |
| 2005 | ||
| c18 | Christian A. Duncan, Stephen G. Kobourov, Dorothea Wagner: Graph-Drawing Contest Report. Graph Drawing 2005: 528-531 | |
| 2004 | ||
| j9 | Therese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov: Tight bounds on maximal and maximum matchings. Discrete Mathematics 285(1-3): 7-15 (2004) | |
| c17 | Christian A. Duncan, David Eppstein, Stephen G. Kobourov: The geometric thickness of low degree graphs. Symposium on Computational Geometry 2004: 340-346 | |
| c16 | Franz-Josef Brandenburg, Christian A. Duncan, Emden R. Gansner, Stephen G. Kobourov: Graph-Drawing Contest Report. Graph Drawing 2004: 512-516 | |
| 2003 | ||
| j8 | Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Planarity-preserving clustering and embedding for large planar graphs. Comput. Geom. 24(2): 95-114 (2003) | |
| j7 | Christian A. Duncan, Stephen G. Kobourov: Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution. J. Graph Algorithms Appl. 7(4): 311-333 (2003) | |
| c15 | ||
| c14 | Peter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell: On Simultaneous Planar Graph Embeddings. WADS 2003: 243-255 | |
| i2 | Christian A. Duncan, David Eppstein, Stephen G. Kobourov: The Geometric Thickness of Low Degree Graphs. CoRR cs.CG/0312056 (2003) | |
| 2002 | ||
| i1 | Christian A. Duncan, Alon Efrat, Cesim Erten, Stephen G. Kobourov, Joseph S. B. Mitchell: On Simultaneous Graph Embedding. CoRR cs.CG/0206018 (2002) | |
| 2001 | ||
| j6 | C. C. Cheng, Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Drawing Planar Graphs with Circular Arcs. Discrete & Computational Geometry 25(3): 405-418 (2001) | |
| j5 | Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees. J. Algorithms 38(1): 303-333 (2001) | |
| c13 | Mihai Pop, Christian A. Duncan, Gill Barequet, Michael T. Goodrich, Wenjing Huang, Subodh Kumar: Efficient perspective-accurate silhouette computation and applications. Symposium on Computational Geometry 2001: 60-68 | |
| c12 | Christian A. Duncan, Alon Efrat, Stephen G. Kobourov, Carola Wenk: Drawing with Fat Edges. Graph Drawing 2001: 162-177 | |
| c11 | Christian A. Duncan, Stephen G. Kobourov: Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution. Graph Drawing 2001: 407-421 | |
| c10 | Therese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov: Tight Bounds on Maximal and Maximum Matchings. ISAAC 2001: 308-319 | |
| c9 | Christian A. Duncan, Stephen G. Kobourov, V. S. Anil Kumar: Optimal constrained graph exploration. SODA 2001: 807-814 | |
| 2000 | ||
| j4 | Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs. J. Graph Algorithms Appl. 4(3): 19-46 (2000) | |
| j3 | Ambrose Kofi Laing, Robert Cypher, Christian A. Duncan: On the Flattest Common Supersequence Method for Deadlock-Free Routing in Arbitrary Networks. Theory Comput. Syst. 33(5/6): 393-426 (2000) | |
| c8 | Matthew Dickerson, Christian A. Duncan, Michael T. Goodrich: K-D Trees Are Better when Cut on the Longest Side. ESA 2000: 179-190 | |
| 1999 | ||
| j2 | Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Stina S. Bridgeman, Roberto Tamassia: GeomNet: Geometric Computing Over the Internet. IEEE Internet Computing 3(2): 21-29 (1999) | |
| c7 | Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Subodh Kumar, Mihai Pop: Efficient Perspective-Accurate Silhouette Computation. Symposium on Computational Geometry 1999: 417-418 | |
| c6 | C. C. Cheng, Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Drawing Planar Graphs with Circular Arcs. Graph Drawing 1999: 117-126 | |
| c5 | Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Planarity-Preserving Clustering and Embedding for Large Planar Graphs. Graph Drawing 1999: 186-196 | |
| c4 | Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees. SODA 1999: 300-309 | |
| 1998 | ||
| j1 | Gill Barequet, Christian A. Duncan, Subodh Kumar: RSVP: A Geometric Toolkit for Controlled Repair of Solid Models. IEEE Trans. Vis. Comput. Graph. 4(2): 162-177 (1998) | |
| c3 | Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs. Graph Drawing 1998: 111-124 | |
| 1997 | ||
| c2 | Gill Barequet, Stina S. Bridgeman, Christian A. Duncan, Michael T. Goodrich, Roberto Tamassia: Classical Computational Geometry in GeomNet. Symposium on Computational Geometry 1997: 412-414 | |
| c1 | Christian A. Duncan, Michael T. Goodrich, Edgar A. Ramos: Efficient Approximation and Optimization Algorithms for Computational Metrology. SODA 1997: 121-130 | |
Colors in the list of coauthors
Last update Mon May 20 04:07:53 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page