The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Christian A. Duncan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gill Barequet, Stina S. Bridgeman, Christian A. Duncan, Michael T. Goodrich, Roberto Tamassia
    Classical Computational Geometry in GeomNet. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:412-414 [Conf]
  2. Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Subodh Kumar, Mihai Pop
    Efficient Perspective-Accurate Silhouette Computation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:417-418 [Conf]
  3. Christian A. Duncan, David Eppstein, Stephen G. Kobourov
    The geometric thickness of low degree graphs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:340-346 [Conf]
  4. Mihai Pop, Christian A. Duncan, Gill Barequet, Michael T. Goodrich, Wenjing Huang, Subodh Kumar
    Efficient perspective-accurate silhouette computation and applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:60-68 [Conf]
  5. Matthew Dickerson, Christian A. Duncan, Michael T. Goodrich
    K-D Trees Are Better when Cut on the Longest Side. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:179-190 [Conf]
  6. Franz-Josef Brandenburg, Christian A. Duncan, Emden R. Gansner, Stephen G. Kobourov
    Graph-Drawing Contest Report. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:512-516 [Conf]
  7. Christian A. Duncan, Alon Efrat, Stephen G. Kobourov, Carola Wenk
    Drawing with Fat Edges. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:162-177 [Conf]
  8. Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
    Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:111-124 [Conf]
  9. C. C. Cheng, Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
    Drawing Planar Graphs with Circular Arcs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:117-126 [Conf]
  10. Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
    Planarity-Preserving Clustering and Embedding for Large Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:186-196 [Conf]
  11. Christian A. Duncan, Stephen G. Kobourov
    Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:407-421 [Conf]
  12. Christian A. Duncan, Stephen G. Kobourov, Dorothea Wagner
    Graph-Drawing Contest Report. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:528-531 [Conf]
  13. Christian A. Duncan, Gunnar W. Klau, Stephen G. Kobourov, Georg Sander
    Graph-Drawing Contest Report. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:448-452 [Conf]
  14. Therese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov
    Tight Bounds on Maximal and Maximum Matchings. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:308-319 [Conf]
  15. Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
    Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:300-309 [Conf]
  16. Christian A. Duncan, Michael T. Goodrich, Edgar A. Ramos
    Efficient Approximation and Optimization Algorithms for Computational Metrology. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:121-130 [Conf]
  17. Christian A. Duncan, Stephen G. Kobourov, V. S. Anil Kumar
    Optimal constrained graph exploration. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:807-814 [Conf]
  18. 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. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:243-255 [Conf]
  19. Christian A. Duncan
    Multi-way Space Partitioning Trees. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:219-230 [Conf]
  20. Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
    Planarity-preserving clustering and embedding for large planar graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:24, n:2, pp:95-114 [Journal]
  21. 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. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:2, pp:117-130 [Journal]
  22. Christian A. Duncan, Alon Efrat, Cesim Erten, Stephen G. Kobourov, Joseph S. B. Mitchell
    On Simultaneous Graph Embedding [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  23. Christian A. Duncan, David Eppstein, Stephen G. Kobourov
    The Geometric Thickness of Low Degree Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  24. C. C. Cheng, Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
    Drawing Planar Graphs with Circular Arcs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:3, pp:405-418 [Journal]
  25. Therese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov
    Tight bounds on maximal and maximum matchings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:7-15 [Journal]
  26. Christian A. Duncan, Alon Efrat, Stephen G. Kobourov, Carola Wenk
    Drawing with Fat Edges. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:5, pp:1143-1164 [Journal]
  27. Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Stina S. Bridgeman, Roberto Tamassia
    GeomNet: Geometric Computing Over the Internet. [Citation Graph (0, 0)][DBLP]
    IEEE Internet Computing, 1999, v:3, n:2, pp:21-29 [Journal]
  28. Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
    Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:38, n:1, pp:303-333 [Journal]
  29. Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
    Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2000, v:4, n:3, pp:19-46 [Journal]
  30. Christian A. Duncan, Stephen G. Kobourov
    Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2003, v:7, n:4, pp:311-333 [Journal]
  31. Ambrose Kofi Laing, Robert Cypher, Christian A. Duncan
    On the Flattest Common Supersequence Method for Deadlock-Free Routing in Arbitrary Networks. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2000, v:33, n:5/6, pp:393-426 [Journal]
  32. Christian A. Duncan, Stephen G. Kobourov, V. S. Anil Kumar
    Optimal constrained graph exploration. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:3, pp:380-402 [Journal]
  33. Gill Barequet, Christian A. Duncan, Subodh Kumar
    RSVP: A Geometric Toolkit for Controlled Repair of Solid Models. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Vis. Comput. Graph., 1998, v:4, n:2, pp:162-177 [Journal]

  34. On Graph Thickness, Geometric Thickness, and Separator Theorems. [Citation Graph (, )][DBLP]


  35. Graph Drawing Contest Report. [Citation Graph (, )][DBLP]


  36. Planar Drawings of Higher-Genus Graphs. [Citation Graph (, )][DBLP]


  37. Graph Drawing Contest Report. [Citation Graph (, )][DBLP]


  38. Graph Drawing Contest Report. [Citation Graph (, )][DBLP]


  39. Planar Drawings of Higher-Genus Graphs [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002