2008 | ||
---|---|---|
35 | EE | Ugur Dogrusoz, Christian A. Duncan, Carsten Gutwenger, Georg Sander: Graph Drawing Contest Report. Graph Drawing 2008: 453-458 |
2007 | ||
34 | EE | Christian A. Duncan, Stephen G. Kobourov, Georg Sander: Graph Drawing Contest Report. Graph Drawing 2007: 395-400 |
33 | EE | 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) |
2006 | ||
32 | EE | Christian A. Duncan, Gunnar W. Klau, Stephen G. Kobourov, Georg Sander: Graph-Drawing Contest Report. Graph Drawing 2006: 448-452 |
31 | EE | Christian A. Duncan, Stephen G. Kobourov, V. S. Anil Kumar: Optimal constrained graph exploration. ACM Transactions on Algorithms 2(3): 380-402 (2006) |
30 | EE | Christian A. Duncan, Alon Efrat, Stephen G. Kobourov, Carola Wenk: Drawing with Fat Edges. Int. J. Found. Comput. Sci. 17(5): 1143-1164 (2006) |
2005 | ||
29 | EE | Christian A. Duncan, Stephen G. Kobourov, Dorothea Wagner: Graph-Drawing Contest Report. Graph Drawing 2005: 528-531 |
2004 | ||
28 | EE | Franz-Josef Brandenburg, Christian A. Duncan, Emden R. Gansner, Stephen G. Kobourov: Graph-Drawing Contest Report. Graph Drawing 2004: 512-516 |
27 | EE | Christian A. Duncan, David Eppstein, Stephen G. Kobourov: The geometric thickness of low degree graphs. Symposium on Computational Geometry 2004: 340-346 |
26 | EE | 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) |
2003 | ||
25 | EE | Christian A. Duncan: Multi-way Space Partitioning Trees. WADS 2003: 219-230 |
24 | EE | 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 |
23 | EE | Christian A. Duncan, David Eppstein, Stephen G. Kobourov: The Geometric Thickness of Low Degree Graphs CoRR cs.CG/0312056: (2003) |
22 | 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) | |
21 | EE | 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) |
2002 | ||
20 | EE | Christian A. Duncan, Alon Efrat, Cesim Erten, Stephen G. Kobourov, Joseph S. B. Mitchell: On Simultaneous Graph Embedding CoRR cs.CG/0206018: (2002) |
2001 | ||
19 | EE | Christian A. Duncan, Alon Efrat, Stephen G. Kobourov, Carola Wenk: Drawing with Fat Edges. Graph Drawing 2001: 162-177 |
18 | EE | Christian A. Duncan, Stephen G. Kobourov: Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution. Graph Drawing 2001: 407-421 |
17 | EE | 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 |
16 | EE | Christian A. Duncan, Stephen G. Kobourov, V. S. Anil Kumar: Optimal constrained graph exploration. SODA 2001: 807-814 |
15 | EE | 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 |
14 | EE | 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) |
13 | 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) | |
2000 | ||
12 | Matthew Dickerson, Christian A. Duncan, Michael T. Goodrich: K-D Trees Are Better when Cut on the Longest Side. ESA 2000: 179-190 | |
11 | EE | 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) |
10 | EE | 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) |
1999 | ||
9 | EE | C. C. Cheng, Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Drawing Planar Graphs with Circular Arcs. Graph Drawing 1999: 117-126 |
8 | EE | Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov: Planarity-Preserving Clustering and Embedding for Large Planar Graphs. Graph Drawing 1999: 186-196 |
7 | EE | 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 |
6 | EE | Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Subodh Kumar, Mihai Pop: Efficient Perspective-Accurate Silhouette Computation. Symposium on Computational Geometry 1999: 417-418 |
5 | 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) | |
1998 | ||
4 | EE | 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 |
3 | EE | 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) |
1997 | ||
2 | Christian A. Duncan, Michael T. Goodrich, Edgar A. Ramos: Efficient Approximation and Optimization Algorithms for Computational Metrology. SODA 1997: 121-130 | |
1 | EE | 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 |