☰

Christian A. Duncan, Ph.D. - Publications

Affiliations: 
2000 Johns Hopkins University, Baltimore, MD 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

29 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2015 Duncan CA. Maximizing the degree of (Geometric) thickness-t regular graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9411: 199-204. DOI: 10.1007/978-3-319-27261-0_17  0.355
2014 Zhang G, Duncan CA, Kanno J, Selmic RR. Unmanned ground vehicle navigation in coordinate-free and localization-free wireless sensor and actuator networks Journal of Intelligent and Robotic Systems: Theory and Applications. 74: 869-891. DOI: 10.1007/S10846-013-9836-4  0.321
2013 Duncan CA, Eppstein D, Goodrich MT, Kobourov SG, Nöllenburg M. Drawing Trees with Perfect Angular Resolution and Polynomial Area Discrete and Computational Geometry. 49: 157-182. DOI: 10.1007/S00454-012-9472-Y  0.556
2012 Duncan CA, Gansner ER, Hu YF, Kaufmann M, Kobourov SG. Optimal polygonal representation of planar graphs Algorithmica. 63: 672-691. DOI: 10.1007/s00453-011-9525-2  0.509
2012 Duncan CA, Eppstein D, Goodrich MT, Kobourov SG, Löffler M. Planar and poly-arc Lombardi drawings Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7034: 308-319. DOI: 10.1007/978-3-642-25878-7_30  0.632
2011 Duncan CA, Eppstein D, Goodrich MT, Kobourov SG, Nöllenburg M. Lombardi drawings of graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6502: 195-207. DOI: 10.7155/Jgaa.00251  0.659
2011 Duncan CA. On graph thickness, geometric thickness, and separator theorems Computational Geometry: Theory and Applications. 44: 95-99. DOI: 10.1016/J.Comgeo.2010.09.005  0.519
2010 Duncan CA, Goodrich MT, Kobourov SG. Planar drawings of higher-genus graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5849: 45-56. DOI: 10.7155/Jgaa.00215  0.615
2008 Duncan CA, Kobourov SG, Sander G. Graph drawing contest report Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4875: 395-400. DOI: 10.1007/978-3-540-77537-9_39  0.426
2007 Brass P, Cenek E, Duncan CA, Efrat A, Erten C, Ismailescu DP, Kobourov SG, Lubiw A, Mitchell JSB. On simultaneous planar graph embeddings Computational Geometry: Theory and Applications. 36: 117-130. DOI: 10.1016/j.comgeo.2006.05.006  0.437
2006 Duncan CA, Efrat A, Kobourov S, Wenk C. Drawing with fat edges International Journal of Foundations of Computer Science. 17: 1143-1163. DOI: 10.1142/S0129054106004315  0.546
2006 Duncan CA, Kobourov SG, Wagner D. Graph-drawing contest report Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3843: 528-531. DOI: 10.1007/11618058_54  0.426
2004 Duncan CA, Eppstein D, Kobourov SG. The geometric thickness of low degree graphs Proceedings of the Annual Symposium On Computational Geometry. 340-346.  0.501
2003 Brass P, Cenek E, Duncan CA, Efrat A, Erten C, Ismailescu D, Kobourov SG, Lubiw A, Mitchell JSB. On simultaneous planar graph embeddings Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2748: 243-255. DOI: 10.1016/J.Comgeo.2006.05.006  0.497
2003 Duncan CA. Multi-way space partitioning trees Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2748: 219-230.  0.322
2002 Duncan CA, Kobourov SG. Polar coordinate drawing of planar graphs with good angular resolution Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2265: 407-421. DOI: 10.1142/9789812773296_0015  0.39
2001 Duncan CA, Kobourov SG, Anil Kumar VS. Optimal constrained graph exploration Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 807-814. DOI: 10.1145/1159892.1159897  0.309
2001 Duncan CA, Kobourov SG, Anil Kumar VS. Optimal constrained graph exploration Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 807-814. DOI: 10.1145/1159892.1159897  0.408
2001 Biedl T, Demaine ED, Duncan CA, Fleischer R, Kobourov SG. Tight bounds on maximal and maximum matchings Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2223: 308-319. DOI: 10.1016/J.Disc.2004.05.003  0.508
2001 Duncan CA, Goodrich MT, Kobourov S. Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees Journal of Algorithms. 38: 303-333. DOI: 10.1006/jagm.2000.1135  0.497
2000 Laing AK, Cypher R, Duncan CA. On the flattest common supersequence method for deadlock-free routing in arbitrary networks Theory of Computing Systems. 33: 393-426. DOI: 10.1007/S002240010011  0.33
2000 Dickerson M, Duncan CA, Goodrich MT. K-D trees are better when cut on the longest side Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1879: 179-190.  0.557
2000 Duncan CA, Goodrich MT, Kobourov SG. Balanced aspect ratio trees and their use for drawing large graphs Journal of Graph Algorithms and Applications. 4: 19-46.  0.636
1999 Barequet G, Duncan CA, Goodrich MT, Bridgeman SS, Tamassia R. GeomNet: Geometric computing over the Internet Ieee Internet Computing. 3: 21-29. DOI: 10.1109/4236.761650  0.51
1999 Duncan CA, Goodrich MT, Kobourov SG. Planarity-preserving clustering and embedding for large planar graphs? Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1731: 186-196. DOI: 10.1016/S0925-7721(02)00094-9  0.651
1999 Cheng CC, Duncan CA, Goodrich MT, Kobourov SG. Drawing Planar Graphs with Circular Arcs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1731: 117-126. DOI: 10.1007/S004540010080  0.674
1999 Duncan CA, Goodrich MT, Kobourov SG. Balanced aspect ratio trees and their use for drawing very large graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1547: 111-124. DOI: 10.1007/3-540-37623-2_9  0.639
1999 Barequet G, Duncan CA, Goodrich MT, Kumar S, Pop M. Efficient perspective-accurate silhouette computation Proceedings of the Annual Symposium On Computational Geometry. 417-418.  0.498
1998 Barequet G, Duncan CA, Kumar S. RSVP: A geometric toolkit for controlled repair of solid models Ieee Transactions On Visualization and Computer Graphics. 4: 162-177. DOI: 10.1109/2945.694983  0.304
Show low-probability matches.