| On simultaneous planar graph embeddings P Brass, E Cenek, CA Duncan, A Efrat, C Erten, DP Ismailescu, ... Computational Geometry 36 (2), 117-130, 2007 | 190* | 2007 |
| Optimal constrained graph exploration CA Duncan, SG Kobourov, VSA Kumar ACM Transactions on Algorithms (TALG) 2 (3), 380-402, 2006 | 172 | 2006 |
| Balanced aspect ratio trees: Combining the advantages of kd trees and octrees CA Duncan, MT Goodrich, S Kobourov Journal of Algorithms 38 (1), 303-333, 2001 | 129 | 2001 |
| Tight bounds on maximal and maximum matchings T Biedl, ED Demaine, CA Duncan, R Fleischer, SG Kobourov Discrete Mathematics 285 (1-3), 7-15, 2004 | 110 | 2004 |
| Lombardi drawings of graphs C Duncan, D Eppstein, M Goodrich, S Kobourov, M Nöllenburg Journal of Graph Algorithms and Applications 16 (1), 85-108, 2012 | 102 | 2012 |
| RSVP: A geometric toolkit for controlled repair of solid models G Barequet, CA Duncan, S Kumar IEEE Transactions on Visualization and Computer Graphics 4 (2), 162-177, 2002 | 80 | 2002 |
| Measuring distance between unordered sets of different sizes A Gardner, J Kanno, CA Duncan, R Selmic Proceedings of the IEEE conference on computer vision and pattern …, 2014 | 79 | 2014 |
| Efficient approximation and optimization algorithms for computational metrology CA Duncan, MT Goodrich, EA Ramos Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 121-130, 1997 | 78 | 1997 |
| The geometric thickness of low degree graphs CA Duncan, D Eppstein, SG Kobourov Proceedings of the twentieth annual symposium on Computational geometry, 340-346, 2004 | 70 | 2004 |
| Balanced aspect ratio trees and their use for drawing very large graphs CA Duncan, MT Goodrich, SG Kobourov International Symposium on Graph Drawing, 111-124, 1998 | 60 | 1998 |
| Planar Orthogonal and Polyline Drawing Algorithms. CA Duncan, MT Goodrich Handbook of Graph Drawing and Visualization, 223-246, 2013 | 58 | 2013 |
| Efficient perspective-accurate silhouette computation and applications M Pop, C Duncan, G Barequet, M Goodrich, W Huang, S Kumar Proceedings of the seventeenth annual symposium on Computational geometry, 60-68, 2001 | 58 | 2001 |
| Drawing trees with perfect angular resolution and polynomial area CA Duncan, D Eppstein, MT Goodrich, SG Kobourov, M Nöllenburg Discrete & Computational Geometry 49 (2), 157-182, 2013 | 54 | 2013 |
| Optimal polygonal representation of planar graphs CA Duncan, ER Gansner, YF Hu, M Kaufmann, SG Kobourov Algorithmica 63 (3), 672-691, 2012 | 48 | 2012 |
| Drawing planar graphs with circular arcs CC Cheng, CA Duncan, MT Goodrich, SG Kobourov Discrete & Computational Geometry 25 (3), 405-418, 2001 | 46 | 2001 |
| Balanced aspect ratio trees CA Duncan The Johns Hopkins University, 2000 | 43 | 2000 |
| Planar and poly-arc Lombardi drawings CA Duncan, D Eppstein, MT Goodrich, SG Kobourov, M Löffler International Symposium on Graph Drawing, 308-319, 2011 | 37 | 2011 |
| Drawing planar graphs with circular arcs CC Cheng, CA Duncan, MT Goodrich, SG Kobourov International Symposium on Graph Drawing, 117-126, 1999 | 31 | 1999 |
| Planar drawings of higher-genus graphs. CA Duncan, MT Goodrich, SG Kobourov Journal of Graph Algorithms and Applications 15 (1), 7-32, 2011 | 30 | 2011 |
| Drawing with fat edges CA Duncan, A Efrat, SG Kobourov, C Wenk International Symposium on Graph Drawing, 162-177, 2001 | 30 | 2001 |
Stephen KobourovProfessor of Computer Science, Technical University MunichVerified email at tum.de
