Finding the k shortest paths D Eppstein SIAM Journal on Computing 28 (2), 652-673, 1998 | 2532 | 1998 |
Mesh generation and optimal triangulation M Bern, D Eppstein Computing in Euclidean Geometry (2nd ed), 47–123, 1995 | 1002 | 1995 |
Listing all maximal cliques in large sparse real-world graphs D Eppstein, M Löffler, D Strash Journal of Experimental Algorithmics (JEA) 18, 3.1, 2013 | 765* | 2013 |
The crust and the beta-skeleton: combinatorial curve reconstruction N Amenta, MW Bern, D Eppstein Graphical Models and Image Processing 60 (2), 125-135, 1998 | 657 | 1998 |
Subgraph isomorphism in planar graphs and related problems D Eppstein Journal of Graph Algorithms and Applications 3 (3), 1–27, 1999 | 634 | 1999 |
Provably good mesh generation M Bern, D Eppstein, J Gilbert Journal of Computer and System Sciences 48 (3), 384-409, 1994 | 567 | 1994 |
Sparsification—A technique for speeding up dynamic graph algorithms D Eppstein, Z Galil, GF Italiano, A Nissenzweig Journal of the ACM 44 (5), 669–696, 1997 | 542 | 1997 |
Spanning trees and spanners D Eppstein Handbook of Computational Geometry, 425-461, 2000 | 425 | 2000 |
Diameter and treewidth in minor-closed graph families D Eppstein Algorithmica 27, 275-291, 2000 | 360 | 2000 |
Reset sequences for monotonic automata D Eppstein SIAM J. Comput. 19 (3), 500-510, 1990 | 347 | 1990 |
Internet packet filter management and rectangle geometry D Eppstein, S Muthukrishnan Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms …, 2001 | 330 | 2001 |
Fast approximation of centrality D Eppstein, J Wang Journal of Graph Algorithms and Applications 8 (1), 39-45, 2004 | 315* | 2004 |
Dynamic graph algorithms D Eppstein, Z Galil, GF Italiano Algorithms and Theory of Computation Handbook, chapter 8, 1999 | 309* | 1999 |
3-coloring in time O(1.3289^n) R Beigel, D Eppstein Journal of Algorithms 54 (2), 168-204, 2005 | 303* | 2005 |
Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions D Eppstein, J Erickson Discrete & Computational Geometry 22 (4), 569-592, 1999 | 283 | 1999 |
On nearest-neighbor graphs D Eppstein, MS Paterson, FF Yao Discrete & Computational Geometry 17, 263-282, 1997 | 270 | 1997 |
Optimal point placement for mesh smoothing N Amenta, M Bern, D Eppstein Journal of Algorithms 30 (2), 302-322, 1999 | 244 | 1999 |
Sparse dynamic programming I: linear cost functions D Eppstein, Z Galil, R Giancarlo, GF Italiano Journal of the ACM (JACM) 39 (3), 519-545, 1992 | 236* | 1992 |
Maintenance of a minimum spanning forest in a dynamic plane graph D Eppstein, GF Italiano, R Tamassia, RE Tarjan, J Westbrook, M Yung Journal of Algorithms 13 (1), 33-54, 1992 | 236 | 1992 |
Approximation algorithms for geometric problems M Bern, D Eppstein Approximation algorithms for NP-hard problems, 296-345, 1996 | 233 | 1996 |