David Eppstein

引用次数

	总计	2018 年至今
引用	22802	6078
h 指数	74	37
i10 指数	249	137

1200

600

300

900

19911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202380 129 142 179 209 256 267 274 259 361 366 461 533 668 812 743 879 859 914 892 851 903 1074 957 996 1027 1103 1076 1036 1035 974 980 968

开放获取的出版物数量

查看全部

45 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Michael T. GoodrichProfessor of Computer Science, University of California, Irvine在 uci.edu 的电子邮件经过验证
Marshall BernVice President, Protein Metrics在 proteinmetrics.com 的电子邮件经过验证
Giuseppe F. ItalianoProfessor of Computer Science, LUISS University, Rome, Italy在 luiss.it 的电子邮件经过验证
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of Technology在 mit.edu 的电子邮件经过验证
Maarten LöfflerComputer Science, Utrecht University在 cs.uu.nl 的电子邮件经过验证
Stephen KobourovProfessor of Computer Science, University of Arizona在 cs.arizona.edu 的电子邮件经过验证
Darren StrashHamilton College在 hamilton.edu 的电子邮件经过验证
David R. WoodSchool of Mathematics, Monash University在 monash.edu 的电子邮件经过验证
Jeff EricksonProfessor of Computer Science, University of Illinois, Urbana-Champaign在 illinois.edu 的电子邮件经过验证
Nina AmentaProfessor of Computer Science, University of California at Davis在 cs.ucdavis.edu 的电子邮件经过验证
Raffaele GiancarloUniversity of Palermo在 community.unipa.it 的电子邮件经过验证
Vida DujmovicUniversity of Ottawa在 uottawa.ca 的电子邮件经过验证
Martin DemaineMIT在 mit.edu 的电子邮件经过验证
Martin NöllenburgProfessor, Algorithms and Complexity Group, TU Wien在 ac.tuwien.ac.at 的电子邮件经过验证
Christian A. DuncanProfessor of Computer Science, Quinnipiac University在 acm.org 的电子邮件经过验证
Leonidas GuibasProfessor of Computer Science, Stanford University在 cs.stanford.edu 的电子邮件经过验证
Richard BeigelTemple University在 temple.edu 的电子邮件经过验证
Roberto TamassiaPlastech Professor of Computer Science, Brown University在 cs.brown.edu 的电子邮件经过验证
Moti YungDistinguished Research Scientist Google; Adjunct Research Prof. Columbia U.在 cs.columbia.edu 的电子邮件经过验证
Jack SnoeyinkComputer Science, UNC Chapel Hill在 cs.unc.edu 的电子邮件经过验证

关注

David Eppstein

Distinguished Professor of Computer Science, University of California, Irvine

在 uci.edu 的电子邮件经过验证 - 首页

algorithms data structures graph theory geometry


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Finding the k shortest paths D Eppstein SIAM Journal on Computing 28 (2), 652-673, 1998	2497	1998
Mesh generation and optimal triangulation M Bern, D Eppstein Computing in Euclidean Geometry (2nd ed), 47–123, 1995	1006	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	718*	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	655	1998
Subgraph isomorphism in planar graphs and related problems D Eppstein Journal of Graph Algorithms and Applications 3 (3), 1–27, 1999	624	1999
Provably good mesh generation M Bern, D Eppstein, J Gilbert Journal of Computer and System Sciences 48 (3), 384-409, 1994	562	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	531	1997
Spanning trees and spanners D Eppstein Handbook of Computational Geometry, 425-461, 2000	417	2000
Diameter and treewidth in minor-closed graph families D Eppstein Algorithmica 27, 275-291, 2000	353	2000
Reset sequences for monotonic automata D Eppstein SIAM J. Comput. 19 (3), 500-510, 1990	344	1990
Internet packet filter management and rectangle geometry D Eppstein, S Muthukrishnan Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms …, 2001	326	2001
Fast approximation of centrality D Eppstein, J Wang Journal of Graph Algorithms and Applications 8 (1), 39-45, 2004	305*	2004
Dynamic graph algorithms D Eppstein, Z Galil, GF Italiano Algorithms and Theory of Computation Handbook, chapter 8, 1999	298*	1999
3-coloring in time O(1.3289^n) R Beigel, D Eppstein Journal of Algorithms 54 (2), 168-204, 2005	295*	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	284	1999
On nearest-neighbor graphs D Eppstein, MS Paterson, FF Yao Discrete & Computational Geometry 17, 263-282, 1997	248	1997
Optimal point placement for mesh smoothing N Amenta, M Bern, D Eppstein Journal of Algorithms 30 (2), 302-322, 1999	243	1999
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	234	1992
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	230*	1992
Approximation algorithms for geometric problems M Bern, D Eppstein Approximation algorithms for NP-hard problems, 296-345, 1996	229	1996

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

关注

引用次数

合著作者