David Eppstein

Citace

	Všechny	Od 2020
Citace	24136	5194
h-index	77	33
i10-index	259	119

1200

600

300

900

1991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202579 120 148 183 217 264 262 279 264 363 375 464 545 680 819 753 884 857 921 892 856 915 1090 957 994 1024 1109 1080 1063 1039 972 973 1020 1032 154

Veřejný přístup

Zobrazit všechny

54 článků

0 článků

dostupné

nedostupné

Vychází ze zplnomocnění pro financování

Spoluautoři

Michael T. GoodrichProfessor of Computer Science, University of California, IrvineE-mailová adresa ověřena na: uci.edu
Marshall BernVice President, Protein MetricsE-mailová adresa ověřena na: proteinmetrics.com
Giuseppe F. ItalianoProfessor of Computer Science, LUISS University, Rome, ItalyE-mailová adresa ověřena na: luiss.it
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyE-mailová adresa ověřena na: mit.edu
Maarten LöfflerComputer Science, Utrecht UniversityE-mailová adresa ověřena na: cs.uu.nl
Stephen KobourovProfessor of Computer Science, Technical University MunichE-mailová adresa ověřena na: tum.de
Darren StrashHamilton CollegeE-mailová adresa ověřena na: hamilton.edu
David R. WoodSchool of Mathematics, Monash UniversityE-mailová adresa ověřena na: monash.edu
Jeff EricksonProfessor of Computer Science, University of Illinois Urbana-ChampaignE-mailová adresa ověřena na: illinois.edu
Nina AmentaProfessor of Computer Science, University of California at DavisE-mailová adresa ověřena na: cs.ucdavis.edu
Vida DujmovicUniversity of OttawaE-mailová adresa ověřena na: uottawa.ca
Raffaele GiancarloUniversity of PalermoE-mailová adresa ověřena na: community.unipa.it
Martin DemaineMITE-mailová adresa ověřena na: mit.edu
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienE-mailová adresa ověřena na: ac.tuwien.ac.at
Christian A. DuncanProfessor of Computer Science, Quinnipiac UniversityE-mailová adresa ověřena na: acm.org
Leonidas GuibasProfessor of Computer Science, Stanford UniversityE-mailová adresa ověřena na: cs.stanford.edu
Richard BeigelTemple UniversityE-mailová adresa ověřena na: temple.edu
Roberto TamassiaPlastech Professor of Computer Science, Brown UniversityE-mailová adresa ověřena na: cs.brown.edu
Moti YungDistinguished Research Scientist Google; Adjunct Research Prof. Columbia U.E-mailová adresa ověřena na: cs.columbia.edu
Kevin VerbeekAssociate Professor, Mathematics and Computer Science, TU EindhovenE-mailová adresa ověřena na: tue.nl

Sledovat

David Eppstein

Distinguished Professor of Computer Science, University of California, Irvine

E-mailová adresa ověřena na: uci.edu - Domovská stránka

algorithms data structures graph theory geometry


Název Seřadit podle citací Seřadit podle roku Seřadit podle názvu	Citace Citace	Rok
Finding the k shortest paths D Eppstein SIAM Journal on Computing 28 (2), 652-673, 1998	2594	1998
Mesh generation and optimal triangulation M Bern, D Eppstein Computing in Euclidean Geometry (2nd ed), 47–123, 1995	1016	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	664	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	570	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	567	1997
Spanning trees and spanners D Eppstein Handbook of Computational Geometry, 425-461, 2000	444	2000
Diameter and treewidth in minor-closed graph families D Eppstein Algorithmica 27, 275-291, 2000	376	2000
Reset sequences for monotonic automata D Eppstein SIAM J. Comput. 19 (3), 500-510, 1990	355	1990
Internet packet filter management and rectangle geometry D Eppstein, S Muthukrishnan Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms …, 2001	336	2001
Fast approximation of centrality D Eppstein, J Wang Journal of Graph Algorithms and Applications 8 (1), 39-45, 2004	316*	2004
Dynamic graph algorithms D Eppstein, Z Galil, GF Italiano Algorithms and Theory of Computation Handbook, chapter 8, 1999	313*	1999
3-coloring in time O(1.3289^n) R Beigel, D Eppstein Journal of Algorithms 54 (2), 168-204, 2005	308*	2005
On nearest-neighbor graphs D Eppstein, MS Paterson, FF Yao Discrete & Computational Geometry 17, 263-282, 1997	296	1997
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	293	1999
Optimal point placement for mesh smoothing N Amenta, M Bern, D Eppstein Journal of Algorithms 30 (2), 302-322, 1999	246	1999
Parallel recognition of series-parallel graphs D Eppstein Information and Computation 98 (1), 41-55, 1992	242	1992
Approximation algorithms for geometric problems M Bern, D Eppstein Approximation algorithms for NP-hard problems, 296-345, 1996	237	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

Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.

Články 1–20

Citace za rok

Duplicitní citace

Sloučené citace

Přidat spoluautorySpoluautoři

Sledovat

Citace

Spoluautoři