David Eppstein

Navedeno

	Vse	Od leta 2019
Navedbe	23916	6046
indeks h	77	37
indeks i10	258	140

1200

600

300

900

199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202479 121 148 183 216 263 263 280 262 363 376 461 543 681 818 751 886 857 917 887 857 906 1093 958 992 1025 1108 1078 1066 1037 973 968 1033 963

Javni dostop

Prikaži vse

53 člankov

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Michael T. GoodrichProfessor of Computer Science, University of California, IrvinePreverjeni e-poštni naslov na uci.edu
Marshall BernVice President, Protein MetricsPreverjeni e-poštni naslov na proteinmetrics.com
Giuseppe F. ItalianoProfessor of Computer Science, LUISS University, Rome, ItalyPreverjeni e-poštni naslov na luiss.it
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyPreverjeni e-poštni naslov na mit.edu
Maarten LöfflerComputer Science, Utrecht UniversityPreverjeni e-poštni naslov na cs.uu.nl
Stephen KobourovProfessor of Computer Science, Technical University MunichPreverjeni e-poštni naslov na tum.de
Darren StrashHamilton CollegePreverjeni e-poštni naslov na hamilton.edu
David R. WoodSchool of Mathematics, Monash UniversityPreverjeni e-poštni naslov na monash.edu
Jeff EricksonProfessor of Computer Science, University of Illinois Urbana-ChampaignPreverjeni e-poštni naslov na illinois.edu
Nina AmentaProfessor of Computer Science, University of California at DavisPreverjeni e-poštni naslov na cs.ucdavis.edu
Vida DujmovicUniversity of OttawaPreverjeni e-poštni naslov na uottawa.ca
Raffaele GiancarloUniversity of PalermoPreverjeni e-poštni naslov na community.unipa.it
Martin DemaineMITPreverjeni e-poštni naslov na mit.edu
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU WienPreverjeni e-poštni naslov na ac.tuwien.ac.at
Christian A. DuncanProfessor of Computer Science, Quinnipiac UniversityPreverjeni e-poštni naslov na acm.org
Leonidas GuibasProfessor of Computer Science, Stanford UniversityPreverjeni e-poštni naslov na cs.stanford.edu
Richard BeigelTemple UniversityPreverjeni e-poštni naslov na temple.edu
Roberto TamassiaPlastech Professor of Computer Science, Brown UniversityPreverjeni e-poštni naslov na cs.brown.edu
Moti YungDistinguished Research Scientist Google; Adjunct Research Prof. Columbia U.Preverjeni e-poštni naslov na cs.columbia.edu
Kevin VerbeekAssociate Professor, Mathematics and Computer Science, TU EindhovenPreverjeni e-poštni naslov na tue.nl

Spremljaj

David Eppstein

Distinguished Professor of Computer Science, University of California, Irvine

Preverjeni e-poštni naslov na uci.edu - Domača stran

algorithms data structures graph theory geometry


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Finding the k shortest paths D Eppstein SIAM Journal on Computing 28 (2), 652-673, 1998	2578	1998
Mesh generation and optimal triangulation M Bern, D Eppstein Computing in Euclidean Geometry (2nd ed), 47–123, 1995	1013	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	794*	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	651	1999
Provably good mesh generation M Bern, D Eppstein, J Gilbert Journal of Computer and System Sciences 48 (3), 384-409, 1994	568	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	561	1997
Spanning trees and spanners D Eppstein Handbook of Computational Geometry, 425-461, 2000	441	2000
Diameter and treewidth in minor-closed graph families D Eppstein Algorithmica 27, 275-291, 2000	372	2000
Reset sequences for monotonic automata D Eppstein SIAM J. Comput. 19 (3), 500-510, 1990	352	1990
Internet packet filter management and rectangle geometry D Eppstein, S Muthukrishnan Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms …, 2001	331	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	312*	1999
3-coloring in time O(1.3289^n) R Beigel, D Eppstein Journal of Algorithms 54 (2), 168-204, 2005	305*	2005
On nearest-neighbor graphs D Eppstein, MS Paterson, FF Yao Discrete & Computational Geometry 17, 263-282, 1997	292	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	291	1999
Optimal point placement for mesh smoothing N Amenta, M Bern, D Eppstein Journal of Algorithms 30 (2), 302-322, 1999	244	1999
Parallel recognition of series-parallel graphs D Eppstein Information and Computation 98 (1), 41-55, 1992	238	1992
Approximation algorithms for geometric problems M Bern, D Eppstein Approximation algorithms for NP-hard problems, 296-345, 1996	236	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

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji