David Eppstein

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2012
108Lombardi Drawings of Graphs. Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg. J. Graph Algorithms Appl. (16): 85-108 (2012). Web SearchBibTeXDownload
2011
107Category-based routing in social networks: Membership dimension and the small-world phenomenon. David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott. CASoN 2011, 102-107. Web SearchBibTeXDownload
106Tracking Moving Objects with Few Handovers. David Eppstein, Michael T. Goodrich, Maarten Löffler. CoRR (abs/1105.0392) (2011). Web SearchBibTeXDownload
105Privacy-Enhanced Methods for Comparing Compressed DNA Sequences. David Eppstein, Michael T. Goodrich, Pierre Baldi. CoRR (abs/1107.3593) (2011). Web SearchBibTeXDownload
104Planar and Poly-Arc Lombardi Drawings. Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler. CoRR (abs/1109.0345) (2011). Web SearchBibTeXDownload
103Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Short). David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott. CoRR (abs/1108.4675) (2011). Web SearchBibTeXDownload
102Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Full). David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott. CoRR (abs/1110.4499) (2011). Web SearchBibTeXDownload
101Planar and Poly-arc Lombardi Drawings. Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler. Graph Drawing 2011, 308-319. Web SearchBibTeXDownload
100Succinct Greedy Geometric Routing Using Hyperbolic Geometry. David Eppstein, Michael T. Goodrich. IEEE Trans. Computers (60): 1571-1580 (2011). Web SearchBibTeXDownload
99Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters. David Eppstein, Michael T. Goodrich. IEEE Trans. Knowl. Data Eng. (23): 297-306 (2011). Web SearchBibTeXDownload
98Guest Editor's Foreword. Sandip Das, Emden R. Gansner, Joe Kilian, Jon M. Kleinberg. J. Graph Algorithms Appl. (15): 3-5 (2011). Web SearchBibTeXDownload
97What's the difference?: efficient set reconciliation without prior context. David Eppstein, Michael T. Goodrich, Frank Uyeda, George Varghese. SIGCOMM 2011, 218-229. Web SearchBibTeXDownload
2010
96Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures. David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott. COCOA (1) 2010, 128-141. Web SearchBibTeXDownload
95Lombardi Drawings of Graphs. Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg. CoRR (abs/1009.0579) (2010). Web SearchBibTeXDownload
94Cloning Voronoi Diagrams via Retroactive Data Structures. Matthew T. Dickerson, David Eppstein, Michael T. Goodrich. CoRR (abs/1006.1921) (2010). Web SearchBibTeXDownload
93Privacy-Preserving Data-Oblivious Geometric Algorithms for Geographic Data. David Eppstein, Michael T. Goodrich, Roberto Tamassia. CoRR (abs/1009.1904) (2010). Web SearchBibTeXDownload
92Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics. David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott. CoRR (abs/1009.0783) (2010). Web SearchBibTeXDownload
91Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler. CoRR (abs/1009.0088) (2010). Web SearchBibTeXDownload
90Drawing Trees with Perfect Angular Resolution and Polynomial Area. Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg. CoRR (abs/1009.0581) (2010). Web SearchBibTeXDownload
89Privacy-preserving data-oblivious geometric algorithms for geographic data. David Eppstein, Michael T. Goodrich, Roberto Tamassia. GIS 2010, 13-22. Web SearchBibTeXDownload
88Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings. David Eppstein, Michael T. Goodrich, Darren Strash. SIAM J. Comput. (39): 3814-3829 (2010). Web SearchBibTeXDownload
87Questions answered. in theory.: http: //cstheory.stackexchange.com/. Dave Clarke, David Eppstein, Kaveh Ghasemloo, Lev Reyzin, András Z. Salamon, Peter W. Shor, Aaron Sterling, Suresh Venkatasubramanian. SIGACT News (41): 58-60 (2010). Web SearchBibTeXDownload
2009
86Going Off-road: Transversal Complexity in Road Networks. David Eppstein, Michael T. Goodrich, Lowell Trott. CoRR (abs/0909.2891) (2009). Web SearchBibTeXDownload
85Going off-road: transversal complexity in road networks. David Eppstein, Michael T. Goodrich, Lowell Trott. GIS 2009, 23-32. Web SearchBibTeXDownload
84Linear-time algorithms for geometric graphs with sublinearly many crossings. David Eppstein, Michael T. Goodrich, Darren Strash. SODA 2009, 150-159. Web SearchBibTeXDownload
83Approximate topological matching of quad meshes. David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf. The Visual Computer (25): 771-783 (2009). Web SearchBibTeXDownload
82On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem. Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker. WADS 2009, 242-253. Web SearchBibTeXDownload
2008
81Motorcycle Graphs: Canonical Quad Mesh Partitioning. David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf. Comput. Graph. Forum (27): 1477-1486 (2008). Web SearchBibTeXDownload
80Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings. David Eppstein, Michael T. Goodrich, Darren Strash. CoRR (abs/0812.0893) (2008). Web SearchBibTeXDownload
79Studying (Non-Planar) Road Networks Through an Algorithmic Lens. David Eppstein, Michael T. Goodrich. CoRR (abs/0808.3694) (2008). Web SearchBibTeXDownload
78Straight Skeletons of Three-Dimensional Polyhedra. Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman. ESA 2008, 148-160. Web SearchBibTeXDownload
77Studying (non-planar) road networks through an algorithmic lens. David Eppstein, Michael T. Goodrich. GIS 2008, 16. Web SearchBibTeXDownload
76Succinct Greedy Graph Drawing in the Hyperbolic Plane. David Eppstein, Michael T. Goodrich. Graph Drawing 2008, 14-25. Web SearchBibTeXDownload
75Skip Quadtrees: Dynamic Data Structures for Multidimensional Point Sets. David Eppstein, Michael T. Goodrich, Jonathan Z. Sun. Int. J. Comput. Geometry Appl. (18): 131-160 (2008). Web SearchBibTeXDownload
74Approximate topological matching of quadrilateral meshes. David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf. Shape Modeling International 2008, 83-92. Web SearchBibTeXDownload
2007
73Deterministic sampling and range counting in geometric data streams. Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich. ACM Transactions on Algorithms (3) (2007). Web SearchBibTeXDownload
72Confluent Layered Drawings. David Eppstein, Michael T. Goodrich, Jeremy Yu Meng. Algorithmica (47): 439-452 (2007). Web SearchBibTeXDownload
71Space-Efficient Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters. David Eppstein, Michael T. Goodrich. CoRR (abs/0704.3313) (2007). Web SearchBibTeXDownload
70Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg. SIAM J. Comput. (36): 1360-1375 (2007). Web SearchBibTeXDownload
69Guard placement for efficient point-in-polygon proofs. David Eppstein, Michael T. Goodrich, Nodari Sitchinava. Symposium on Computational Geometry 2007, 27-36. Web SearchBibTeXDownload
68Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton's Identities and Invertible Bloom Filters. David Eppstein, Michael T. Goodrich. WADS 2007, 637-648. Web SearchBibTeXDownload
2006
67Guard Placement For Wireless Localization. David Eppstein, Michael T. Goodrich, Nodari Sitchinava. CoRR (abs/cs/0603057) (2006). Web SearchBibTeXDownload
66Choosing Colors for Geometric Graphs via Color Space Embeddings. Michael B. Dillencourt, David Eppstein, Michael T. Goodrich. CoRR (abs/cs/0609033) (2006). Web SearchBibTeXDownload
65Choosing Colors for Geometric Graphs Via Color Space Embeddings. Michael B. Dillencourt, David Eppstein, Michael T. Goodrich. Graph Drawing 2006, 294-305. Web SearchBibTeXDownload
64The Effect of Faults on Network Expansion. Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler. Theory Comput. Syst. (39): 903-928 (2006). Web SearchBibTeXDownload
2005
63Hinged dissection of polyominoes and polyforms. Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman. Comput. Geom. (31): 237-262 (2005). Web SearchBibTeXDownload
62Confluent Layered Drawings. David Eppstein, Michael T. Goodrich, Jeremy Yu Meng. CoRR (abs/cs/0507051) (2005). Web SearchBibTeXDownload
61Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets. Lars Arge, David Eppstein, Michael T. Goodrich. CoRR (abs/cs/0507050) (2005). Cited by 19Web SearchBibTeXDownload
60Delta-confluent Drawings. David Eppstein, Michael T. Goodrich, Jeremy Yu Meng. CoRR (abs/cs/0510024) (2005). Web SearchBibTeXDownload
59Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg. CoRR (abs/cs/0505048) (2005). Web SearchBibTeXDownload
58The Skip Quadtree: A Simple Dynamic Data Structure for Multidimensional Data. David Eppstein, Michael T. Goodrich, Jonathan Z. Sun. CoRR (abs/cs/0507049) (2005). Web SearchBibTeXDownload
57Delta-Confluent Drawings. David Eppstein, Michael T. Goodrich, Jeremy Yu Meng. Graph Drawing 2005, 165-176. Web SearchBibTeXDownload
56Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng. J. Graph Algorithms Appl. (9): 31-52 (2005). Web SearchBibTeXDownload
55Skip-webs: efficient distributed data structures for multi-dimensional data sets. Lars Arge, David Eppstein, Michael T. Goodrich. PODC 2005, 69-76. Web SearchBibTeXDownload
54The skip quadtree: a simple dynamic data structure for multidimensional data. David Eppstein, Michael T. Goodrich, Jonathan Z. Sun. Symposium on Computational Geometry 2005, 296-305. Web SearchBibTeXDownload
53Improved Combinatorial Group Testing for Real-World Problem Sizes. David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg. WADS 2005, 86-98. Web SearchBibTeXDownload
2004
52The Effect of Faults on Network Expansion. Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler. CoRR (cs.DC/0404029) (2004). Web SearchBibTeXDownload
51Confluent Layered Drawings. David Eppstein, Michael T. Goodrich, Jeremy Yu Meng. Graph Drawing 2004, 184-194. Web SearchBibTeXDownload
50The effect of faults on network expansion. Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler. SPAA 2004, 286-293. Web SearchBibTeXDownload
49Deterministic sampling and range counting in geometric data streams. Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich. Symposium on Computational Geometry 2004, 144-151. Web SearchBibTeXDownload
2003
48Ununfoldable polyhedra with convex faces. Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink. Comput. Geom. (24): 51-62 (2003). Web SearchBibTeXDownload
47Deterministic Sampling and Range Counting in Geometric Data Streams. Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich. CoRR (cs.CG/0307027) (2003). Web SearchBibTeXDownload
46Guest Editor's Foreword. Sandip Das, Emden R. Gansner, Joe Kilian, Jon M. Kleinberg. Discrete & Computational Geometry (30): 1-2 (2003). Web SearchBibTeXDownload
45Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng. Graph Drawing 2003, 1-12. Web SearchBibTeXDownload
44Selected Open Problems in Graph Drawing. Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel. Graph Drawing 2003, 515-539. Web SearchBibTeXDownload
2002
43Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng. CoRR (cs.CG/0212046) (2002). Web SearchBibTeXDownload
42Flipping Cubical Meshes. Marshall W. Bern, David Eppstein, Jeff Erickson. Eng. Comput. (Lond.) (18): 173-187 (2002). Web SearchBibTeXDownload
41Vertex-unfoldings of simplicial manifolds. Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke. Symposium on Computational Geometry 2002, 237-243. Web SearchBibTeXDownload
2001
40Vertex-Unfoldings of Simplicial Manifolds. Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke. CoRR (cs.CG/0110054) (2001). Web SearchBibTeXDownload
39Vertex-Unfoldings of Simplicial Polyhedra. Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke. CoRR (cs.CG/0107023) (2001). Web SearchBibTeXDownload
38Flipping Cubical Meshes. Marshall W. Bern, David Eppstein, Jeff Erickson. CoRR (cs.CG/0108020) (2001). Web SearchBibTeXDownload
37The distribution of loop lengths in graphical models for turbo decoding. Xianping Ge, David Eppstein, Padhraic Smyth. IEEE Transactions on Information Theory (47): 2549-2553 (2001). Web SearchBibTeXDownload
36Internet packet filter management and rectangle geometry. David Eppstein, S. Muthukrishnan. SODA 2001, 827-835. Cited by 119Web SearchBibTeXDownload
2000
35Internet Packet Filter Management and Rectangle Geometry. David Eppstein, S. Muthukrishnan. CoRR (cs.CG/0010018) (2000). Web SearchBibTeXDownload
34Phutball Endgames are Hard. Erik D. Demaine, Martin L. Demaine, David Eppstein. CoRR (cs.CC/0008025) (2000). Web SearchBibTeXDownload
33One-Dimensional Peg Solitaire. Cristopher Moore, David Eppstein. CoRR (math.CO/0006067) (2000). Web SearchBibTeXDownload
32One-Dimensional Peg Solitaire, and Duotaire. Cristopher Moore, David Eppstein. CoRR (math.CO/0008172) (2000). Web SearchBibTeXDownload
31Regression Depth and Center Points. Nina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng. Discrete & Computational Geometry (23): 305-323 (2000). Web SearchBibTeXDownload
1999
30Ununfoldable polyhedra. Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo. CCCG 1999. Web SearchBibTeXDownload
29Hinged dissections of polyominoes and polyforms. Erik D. Demaine, Martin L. Demaine, David Eppstein, Erich Friedman. CCCG 1999. Web SearchBibTeXDownload
28Emerging Challenges in Computational Topology. Marshall W. Bern, David Eppstein, Pankaj K. Agarwal, Nina Amenta, L. Paul Chew, Tamal K. Dey, David P. Dobkin, Herbert Edelsbrunner, Cindy Grimm, Leonidas J. Guibas, John Harer, Joel Hass, Andrew Hicks, Carroll K. Johnson, Gilad Lerman, David Letscher, Paul E. Plassmann, Eric Sedgwick, Jack Snoeyink, Jeff Weeks, Chee-Keng Yap, Denis Zorin. CoRR (cs.CG/9909001) (1999). Web SearchBibTeXDownload
27The Distribution of Cycle Lengths in Graphical Models for Iterative Decoding. Xianping Ge, David Eppstein, Padhraic Smyth. CoRR (cs.DM/9907002) (1999). Web SearchBibTeXDownload
26Hinged Dissection of Polyominoes and Polyforms. Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman. CoRR (cs.CG/9907018) (1999). Web SearchBibTeXDownload
25Ununfoldable Polyhedra with Convex Faces. Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink. CoRR (cs.CG/9908003) (1999). Web SearchBibTeXDownload
24Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. David Eppstein, Jeff Erickson. Discrete & Computational Geometry (22): 569-592 (1999). Web SearchBibTeXDownload
23Optimal Point Placement for Mesh Smoothing. Nina Amenta, Marshall W. Bern, David Eppstein. J. Algorithms (30): 302-322 (1999). Web SearchBibTeXDownload
1998
22Optimal Point Placement for Mesh Smoothing. Nina Amenta, Marshall W. Bern, David Eppstein. CoRR (cs.CG/9809081) (1998). Web SearchBibTeXDownload
21Regression Depth and Center Points. Nina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng. CoRR (cs.CG/9809037) (1998). Web SearchBibTeXDownload
20Parametric and Kinetic Minimum Spanning Trees. Pankaj K. Agarwal, David Eppstein, Leonidas J. Guibas, Monika Rauch Henzinger. FOCS 1998, 596-605. Cited by 43Web SearchBibTeXDownload
19The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction. Nina Amenta, Marshall W. Bern, David Eppstein. Graphical Models and Image Processing (60): 125-135 (1998). Web SearchBibTeXDownload
18Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. David Eppstein, Jeff Erickson. Symposium on Computational Geometry 1998, 58-67. Web SearchBibTeXDownload
1997
17On Nearest-Neighbor Graphs. Mike Paterson, F. Frances Yao, F. Frances Yao. Discrete & Computational Geometry (17): 263-282 (1997). Web SearchBibTeXDownload
16Optimal Point Placement for Mesh Smoothing. Nina Amenta, Marshall W. Bern, David Eppstein. SODA 1997, 528-537. Web SearchBibTeXDownload
1996
15Approximating center points with iterative Radon points. Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng. Int. J. Comput. Geometry Appl. (6): 357-377 (1996). Web SearchBibTeX
14Using Sparsification for Parametric Minimum Spanning Tree Problems. David Fernández-Baca, Giora Slutzki, David Eppstein. SWAT 1996, 149-160. Web SearchBibTeXDownload
1995
13The Centroid of Points with Approximate Weights. Marshall W. Bern, David Eppstein, Leonidas J. Guibas, John Hershberger, Subhash Suri, Jan Wolter. ESA 1995, 460-472. Web SearchBibTeXDownload
12A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. David Eppstein, Gary L. Miller, Shang-Hua Teng. Fundam. Inform. (22): 309-329 (1995). Web SearchBibTeXDownload
11Dihedral Bounds for Mesh Generation in High Dimensions. Marshall W. Bern, L. Paul Chew, David Eppstein, Jim Ruppert. SODA 1995, 189-196. Web SearchBibTeXDownload
1994
10Visibility with a Moving Point of View. Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman. Algorithmica (11): 360-378 (1994). Cited by 81Web SearchBibTeXDownload
9Iterated Nearest Neighbors and Finding Minimal Polytopes. David Eppstein, Jeff Erickson. Discrete & Computational Geometry (11): 321-350 (1994). Web SearchBibTeXDownload
1993
8Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung. J. Algorithms (15): 173 (1993). Web SearchBibTeX
7Iterated Nearest Neighbors and Finding Minimal Polytopes. David Eppstein, Jeff Erickson. SODA 1993, 64-73. Web SearchBibTeXDownload
6Approximating Center Points with Iterated Radon Points. Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng. Symposium on Computational Geometry 1993, 91-98. Web SearchBibTeXDownload
5A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. David Eppstein, Gary L. Miller, Shang-Hua Teng. Symposium on Computational Geometry 1993, 99-108. Web SearchBibTeXDownload
1992
4Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees. Pankaj K. Agarwal, David Eppstein, Jirí Matousek. FOCS 1992, 80-89. Web SearchBibTeXDownload
3Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung. J. Algorithms (13): 33-54 (1992). Web SearchBibTeXDownload
1990
2Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph. David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung. SODA 1990, 1-11. Web SearchBibTeXDownload
1Visibility with a Moving Point of View. Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman. SODA 1990, 107-117. Cited by 81Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research