David Eppstein
David Eppstein
Chancellor's Professor of Computer Science, University of California, Irvine
E-mail confirmado em uci.edu - Página inicial
Título
Citado por
Citado por
Ano
Finding the k shortest paths
D Eppstein
SIAM Journal on Computing 28 (2), 652-673, 1998
21091998
Mesh generation and optimal triangulation
M Bern, D Eppstein
Computing in Euclidean Geometry (2nd ed), 47–123, 1995
9121995
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
5701998
Subgraph isomorphism in planar graphs and related problems
D Eppstein
Journal of Graph Algorithms and Applications 3 (3), 1–27, 1999
5281999
Provably good mesh generation
M Bern, D Eppstein, J Gilbert
Journal of Computer and System Sciences 48 (3), 384-409, 1994
5201994
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
4531997
Listing all maximal cliques in large sparse real-world graphs in near-optimal time
D Eppstein, M Löffler, D Strash
Journal of Experimental Algorithmics (JEA) 18, 3.1, 2013
432*2013
Spanning trees and spanners
D Eppstein
Handbook of Computational Geometry, 425-461, 2000
3882000
Diameter and treewidth in minor-closed graph families
D Eppstein
Algorithmica 27 (3-4), 275-291, 2000
2852000
Reset sequences for monotonic automata
D Eppstein
SIAM J. Comput. 19 (3), 500-510, 1990
2661990
Dynamic graph algorithms
D Eppstein, Z Galil, GF Italiano
Algorithms and Theory of Computation Handbook, chapter 8, 1999
263*1999
3-coloring in time O(1.3289^n)
R Beigel, D Eppstein
Journal of Algorithms 54 (2), 168-204, 2005
262*2005
Internet packet filter management and rectangle geometry
D Eppstein, S Muthukrishnan
Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms …, 2001
2552001
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
2441999
Fast approximation of centrality
D Eppstein, J Wang
Journal of Graph Algorithms and Applications 8 (1), 39-45, 2004
2382004
Optimal point placement for mesh smoothing
N Amenta, M Bern, D Eppstein
Journal of Algorithms 30 (2), 302-322, 1999
2181999
Approximation algorithms for geometric problems
M Bern, D Eppstein
Approximation algorithms for NP-hard problems, 296-345, 1996
2011996
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
2001992
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
198*1992
Fast hierarchical clustering and other applications of dynamic closest pairs
D Eppstein
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms …, 1998
1741998
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20