default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian A. Duncan
Person information
- affiliation: Quinnipiac University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j20]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler, Martin Nöllenburg:
Planar and poly-arc Lombardi drawings. J. Comput. Geom. 9(1): 328-355 (2018)- [j19]Andrew Gardner, Christian A. Duncan, Jinko Kanno
, Rastko R. Selmic:
On the Definiteness of Earth Mover's Distance and Its Relation to Set Intersection. IEEE Trans. Cybern. 48(11): 3184-3196 (2018) - 2017
- [c40]Andrew Gardner, Christian A. Duncan, Jinko Kanno, Rastko R. Selmic:
Estimating the distribution of unlabeled, correlated point sets. CDC 2017: 1554-1559 - [i9]Andrew Gardner, Jinko Kanno, Christian A. Duncan, Rastko R. Selmic:
Classifying Unordered Feature Sets with Convolutional Deep Averaging Networks. CoRR abs/1709.03019 (2017) - 2015
- [c39]Christian A. Duncan:
Maximizing the Degree of (Geometric) Thickness-t Regular Graphs. GD 2015: 199-204 - [i8]Andrew Gardner, Christian A. Duncan, Jinko Kanno, Rastko R. Selmic:
Earth Mover's Distance Yields Positive Definite Kernels For Certain Ground Distances. CoRR abs/1510.02833 (2015) - 2014
- [j18]Guyu Zhang, Christian A. Duncan, Jinko Kanno, Rastko R. Selmic:
Unmanned Ground Vehicle Navigation in Coordinate-Free and Localization-Free Wireless Sensor and Actuator Networks. J. Intell. Robotic Syst. 74(3-4): 869-891 (2014) - [c38]Andrew Gardner, Jinko Kanno, Christian A. Duncan, Rastko R. Selmic:
Measuring Distance between Unordered Sets of Different Sizes. CVPR 2014: 137-143 - [c37]Andrew Gardner, Christian A. Duncan, Jinko Kanno, Rastko R. Selmic:
3D hand posture recognition from small unlabeled point sets. SMC 2014: 164-169 - [e1]Christian A. Duncan, Antonios Symvonis:
Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, Germany, September 24-26, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8871, Springer 2014, ISBN 978-3-662-45802-0 [contents] - 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. Discret. Comput. Geom. 49(2): 157-182 (2013) - [c36]Guyu Zhang, Rastko R. Selmic, Christian A. Duncan, Jinko Kanno:
Multi-UGV multi-destination navigation in coordinate-free and localization-free Wireless Sensor and Actuator Networks. CDC 2013: 4134-4139 - [c35]Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander:
Graph Drawing Contest Report. GD 2013: 508-513 - [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 - [r2]Christian A. Duncan, Michael T. Goodrich:
Planar Orthogonal and Polyline Drawing Algorithms. Handbook of Graph Drawing and Visualization 2013: 223-246 - 2012
- [j16]Christian A. Duncan, Emden R. Gansner, Yifan 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. GD 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/ECC 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. GD 2011: 308-319 - [c29]Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander:
Graph Drawing Contest Report. GD 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. GD 2010: 183-194 - [c26]Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg:
Lombardi Drawings of Graphs. GD 2010: 195-207 - [c25]Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander:
Graph Drawing Contest Report. GD 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)
2000 – 2009
- 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. GD 2009: 45-56 - [c22]Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander:
Graph Drawing Contest Report. GD 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. GD 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. GD 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 Trans. Algorithms 2(3): 380-402 (2006) - [c19]Christian A. Duncan, Gunnar W. Klau, Stephen G. Kobourov, Georg Sander:
Graph-Drawing Contest Report. GD 2006: 448-452 - 2005
- [c18]Christian A. Duncan, Stephen G. Kobourov, Dorothea Wagner:
Graph-Drawing Contest Report. GD 2005: 528-531 - 2004
- [j9]Therese Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov:
Tight bounds on maximal and maximum matchings. Discret. Math. 285(1-3): 7-15 (2004) - [c17]Christian A. Duncan, David Eppstein, Stephen G. Kobourov:
The geometric thickness of low degree graphs. SCG 2004: 340-346 - [c16]Franz-Josef Brandenburg, Christian A. Duncan, Emden R. Gansner, Stephen G. Kobourov:
Graph-Drawing Contest Report. GD 2004: 512-516 - [r1]Christian A. Duncan, Michael T. Goodrich:
Approximate Geometric Query Structures. Handbook of Data Structures and Applications 2004 - 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]Christian A. Duncan:
Multi-way Space Partitioning Trees. WADS 2003: 219-230 - [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. Discret. Comput. Geom. 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. SCG 2001: 60-68 - [c12]Christian A. Duncan, Alon Efrat, Stephen G. Kobourov, Carola Wenk:
Drawing with Fat Edges. GD 2001: 162-177 - [c11]Christian A. Duncan, Stephen G. Kobourov:
Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution. GD 2001: 407-421 - [c10]Therese 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
1990 – 1999
- 1999
- [j2]Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Stina S. Bridgeman, Roberto Tamassia:
GeomNet: Geometric Computing Over the Internet. IEEE Internet Comput. 3(2): 21-29 (1999) - [c7]Gill Barequet, Christian A. Duncan, Michael T. Goodrich, Subodh Kumar, Mihai Pop:
Efficient Perspective-Accurate Silhouette Computation. SCG 1999: 417-418 - [c6]C. C. Cheng, Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov:
Drawing Planar Graphs with Circular Arcs. GD 1999: 117-126 - [c5]Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov:
Planarity-Preserving Clustering and Embedding for Large Planar Graphs. GD 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. GD 1998: 111-124 - 1997
- [c2]Gill Barequet, Stina S. Bridgeman, Christian A. Duncan, Michael T. Goodrich, Roberto Tamassia:
Classical Computational Geometry in GeomNet. SCG 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
