David Eppstein

Citeras av

	Alla	Sedan 2020
Citat	24178	5218
h-index	77	33
i10-index	260	123

1200

600

300

900

1991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202577 127 144 184 217 286 271 278 267 350 369 457 539 683 821 759 887 847 928 896 849 923 1096 952 994 1014 1107 1084 1064 1040 982 967 1016 1036 172

Offentlig åtkomst

Visa alla

54 artiklar

0 artiklar

tillgänglig

inte tillgänglig

Enligt krav från finansiärer

Medförfattare

Michael T. GoodrichProfessor of Computer Science, University of California, IrvineVerifierad e-postadress på uci.edu
Marshall BernVice President, Protein MetricsVerifierad e-postadress på proteinmetrics.com
Giuseppe F. ItalianoProfessor of Computer Science, LUISS University, Rome, ItalyVerifierad e-postadress på luiss.it
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyVerifierad e-postadress på mit.edu
Maarten LöfflerComputer Science, Utrecht UniversityVerifierad e-postadress på cs.uu.nl
Stephen KobourovProfessor of Computer Science, Technical University MunichVerifierad e-postadress på tum.de
Darren StrashHamilton CollegeVerifierad e-postadress på hamilton.edu
David R. WoodSchool of Mathematics, Monash UniversityVerifierad e-postadress på monash.edu
Jeff EricksonProfessor of Computer Science, University of Illinois Urbana-ChampaignVerifierad e-postadress på illinois.edu
Nina AmentaProfessor of Computer Science, University of California at DavisVerifierad e-postadress på cs.ucdavis.edu
Vida DujmovicUniversity of OttawaVerifierad e-postadress på uottawa.ca
Raffaele GiancarloUniversity of PalermoVerifierad e-postadress på community.unipa.it
Martin DemaineMITVerifierad e-postadress på mit.edu
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienVerifierad e-postadress på ac.tuwien.ac.at
Christian A. DuncanProfessor of Computer Science, Quinnipiac UniversityVerifierad e-postadress på acm.org
Leonidas GuibasProfessor of Computer Science, Stanford UniversityVerifierad e-postadress på cs.stanford.edu
Richard BeigelTemple UniversityVerifierad e-postadress på temple.edu
Roberto TamassiaPlastech Professor of Computer Science, Brown UniversityVerifierad e-postadress på cs.brown.edu
Moti YungDistinguished Research Scientist Google; Adjunct Research Prof. Columbia U.Verifierad e-postadress på cs.columbia.edu
Kevin VerbeekAssociate Professor, Mathematics and Computer Science, TU EindhovenVerifierad e-postadress på tue.nl

Följ

David Eppstein

Distinguished Professor of Computer Science, University of California, Irvine

Verifierad e-postadress på uci.edu - Startsida

algorithms data structures graph theory geometry


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
Finding the k shortest paths D Eppstein SIAM Journal on Computing 28 (2), 652-673, 1998	2584	1998
Mesh generation and optimal triangulation M Bern, D Eppstein Computing in Euclidean Geometry (2nd ed), 47–123, 1995	1014	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	811*	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	671	1998
Subgraph isomorphism in planar graphs and related problems D Eppstein Journal of Graph Algorithms and Applications 3 (3), 1–27, 1999	655	1999
Provably good mesh generation M Bern, D Eppstein, J Gilbert Journal of Computer and System Sciences 48 (3), 384-409, 1994	560	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	558	1997
Spanning trees and spanners D Eppstein Handbook of Computational Geometry, 425-461, 2000	437*	2000
Diameter and treewidth in minor-closed graph families D Eppstein Algorithmica 27, 275-291, 2000	377	2000
Reset sequences for monotonic automata D Eppstein SIAM J. Comput. 19 (3), 500-510, 1990	363	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	318*	2004
Dynamic graph algorithms D Eppstein, Z Galil, GF Italiano Algorithms and Theory of Computation Handbook, chapter 8, 1999	317*	1999
3-coloring in time O(1.3289^n) R Beigel, D Eppstein Journal of Algorithms 54 (2), 168-204, 2005	312*	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	295	1999
On nearest-neighbor graphs D Eppstein, MS Paterson, FF Yao Discrete & Computational Geometry 17, 263-282, 1997	295	1997
Optimal point placement for mesh smoothing N Amenta, M Bern, D Eppstein Journal of Algorithms 30 (2), 302-322, 1999	247	1999
Parallel recognition of series-parallel graphs D Eppstein Information and Computation 98 (1), 41-55, 1992	243	1992
Approximation algorithms for geometric problems M Bern, D Eppstein Approximation algorithms for NP-hard problems, 296-345, 1996	239	1996
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

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–20

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Följ

Citeras av

Medförfattare