The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
David Eppstein: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David P. Dobkin, David Eppstein
    Computing the Discrepancy. [Citation Graph (1, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:47-52 [Conf]
  2. David Eppstein
    Finding the k Shortest Paths [Citation Graph (1, 0)][DBLP]
    FOCS, 1994, pp:154-165 [Conf]
  3. David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig
    Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    FOCS, 1992, pp:60-69 [Conf]
  4. Jean Cardinal, David Eppstein
    Lazy Algorithms for Dynamic Closest Pair with Arbitary Distance Measures. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:112-119 [Conf]
  5. Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo
    Ununfoldable polyhedra. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  6. Erik D. Demaine, Martin L. Demaine, David Eppstein, Erich Friedman
    Hinged dissections of polyominoes and polyforms. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  7. Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich
    Deterministic sampling and range counting in geometric data streams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:144-151 [Conf]
  8. Gill Barequet, Matthew Dickerson, David Eppstein
    On Triangulating Three-Dimensional Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:38-47 [Conf]
  9. Marshall W. Bern, David P. Dobkin, David Eppstein
    Triangulating Polygons without Large Angles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:222-231 [Conf]
  10. Marshall W. Bern, David Eppstein
    Multivariate regression depth. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:315-321 [Conf]
  11. Marshall W. Bern, David Eppstein
    Optimized color gamuts for tiled displays. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:274-281 [Conf]
  12. Marshall W. Bern, David Eppstein
    Polynomial-Size Nonobtuse Triangulation of Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:342-350 [Conf]
  13. Marshall W. Bern, David Eppstein
    Worst-Case Bounds for Subadditive Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:183-188 [Conf]
  14. Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng
    Approximating Center Points with Iterated Radon Points. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:91-98 [Conf]
  15. Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke
    Vertex-unfoldings of simplicial manifolds. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:237-243 [Conf]
  16. Christian A. Duncan, David Eppstein, Stephen G. Kobourov
    The geometric thickness of low degree graphs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:340-346 [Conf]
  17. David Eppstein
    Linear Complexity Hexahedral Mesh Generation. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:58-67 [Conf]
  18. David Eppstein, Jeff Erickson
    Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:58-67 [Conf]
  19. David Eppstein, M. Gopi
    Single-strip triangulation of manifolds with arbitrary topology. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:455-456 [Conf]
  20. David Eppstein, Michael T. Goodrich, Jonathan Z. Sun
    The skip quadtree: a simple dynamic data structure for multidimensional data. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:296-305 [Conf]
  21. David Eppstein, Gary L. Miller, Shang-Hua Teng
    A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:99-108 [Conf]
  22. David Eppstein, Kevin A. Wortman
    Minimum dilation stars. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:321-326 [Conf]
  23. David Eppstein
    Happy endings for flip graphs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:92-101 [Conf]
  24. David Eppstein, Michael T. Goodrich, Nodari Sitchinava
    Guard placement for efficient point-in-polygon proofs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:27-36 [Conf]
  25. Marshall W. Bern, David Eppstein, Leonidas J. Guibas, John Hershberger, Subhash Suri, Jan Wolter
    The Centroid of Points with Approximate Weights. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:460-472 [Conf]
  26. Pankaj K. Agarwal, David Eppstein, Leonidas J. Guibas, Monika Rauch Henzinger
    Parametric and Kinetic Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:596-605 [Conf]
  27. Pankaj K. Agarwal, David Eppstein, Jirí Matousek
    Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:80-89 [Conf]
  28. Richard Beigel, David Eppstein
    3-Coloring in Time O(1.3446n): A No-MIS Algorithm. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:444-452 [Conf]
  29. Marshall W. Bern, David Eppstein, John R. Gilbert
    Provably Good Mesh Generation [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:231-241 [Conf]
  30. David Eppstein
    Dynamic Three-Dimensional Linear Programming [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:488-494 [Conf]
  31. David Eppstein
    Setting Parameters by Example. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:309-318 [Conf]
  32. David Eppstein, Zvi Galil, Raffaele Giancarlo
    Speeding up Dynamic Programming [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:488-496 [Conf]
  33. Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel
    Selected Open Problems in Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:515-539 [Conf]
  34. David Eppstein
    Separating Thickness from Geometric Thickness. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:150-161 [Conf]
  35. David Eppstein
    Algorithms for Drawing Media. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:173-183 [Conf]
  36. David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
    Confluent Layered Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:184-194 [Conf]
  37. David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
    Delta-Confluent Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:165-176 [Conf]
  38. Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
    Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:1-12 [Conf]
  39. Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
    Geometric Thickness of Complete Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:101-110 [Conf]
  40. David Eppstein
    Upright-Quad Drawing of st -Planar Learning Spaces. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:282-293 [Conf]
  41. Michael B. Dillencourt, David Eppstein, Michael T. Goodrich
    Choosing Colors for Geometric Graphs Via Color Space Embeddings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:294-305 [Conf]
  42. Josiah Carlson, David Eppstein
    Trees with Convex Faces and Optimal Angles. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:77-88 [Conf]
  43. Marshall W. Bern, David Eppstein, F. Frances Yao
    The Expected Extremes in a Delaunay Triangulation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:674-685 [Conf]
  44. David Eppstein
    Reset Sequences for Finite Automata with Application to Design of Parts Orienters. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:230-238 [Conf]
  45. David Eppstein, Zvi Galil
    Parallel Algorithmic Techniques for Combinatorial Computation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:304-318 [Conf]
  46. David Eppstein
    A Heuristic Approach to Program Inversion. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1985, pp:219-221 [Conf]
  47. Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Sandra L. Mitchell, Tio Seng Tan
    Edge Insertion for Optional Triangulations. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:46-60 [Conf]
  48. Lars Arge, David Eppstein, Michael T. Goodrich
    Skip-webs: efficient distributed data structures for multi-dimensional data sets. [Citation Graph (0, 0)][DBLP]
    PODC, 2005, pp:69-76 [Conf]
  49. Pablo Diaz-Gutierrez, David Eppstein, M. Gopi
    Single Triangle Strip and Loop on Manifolds with Boundaries. [Citation Graph (0, 0)][DBLP]
    SIBGRAPI, 2006, pp:221-228 [Conf]
  50. Nina Amenta, Marshall W. Bern, David Eppstein
    Optimal Point Placement for Mesh Smoothing. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:528-537 [Conf]
  51. Marshall W. Bern, L. Paul Chew, David Eppstein, Jim Ruppert
    Dihedral Bounds for Mesh Generation in High Dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:189-196 [Conf]
  52. Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman
    Visibility with a Moving Point of View. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:107-117 [Conf]
  53. Marshall W. Bern, David Eppstein
    Möbius-invariant natural neighbor interpolation. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:128-129 [Conf]
  54. Marek Chrobak, David Eppstein, Giuseppe F. Italiano, Moti Yung
    Efficient Sequential and Parallel Algorithms for Computing Recovery Points in Trees and Paths. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:158-167 [Conf]
  55. David Eppstein
    Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:329-337 [Conf]
  56. David Eppstein
    Dynamic generators of topologically embedded graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:599-608 [Conf]
  57. David Eppstein
    Quasiconvex analysis of backtracking algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:788-797 [Conf]
  58. David Eppstein
    Testing bipartiteness of geometric intersection graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:860-868 [Conf]
  59. David Eppstein
    All maximal independent sets and dynamic dominance for sparse graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:451-459 [Conf]
  60. David Eppstein
    Approximating the Minimum Weight Triangulation. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:48-57 [Conf]
  61. David Eppstein
    New Algorithms for Minimum Area k-gons. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:83-88 [Conf]
  62. David Eppstein
    Average Case Analysis of Dynamic Geometric Optimization. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:77-86 [Conf]
  63. David Eppstein
    Clustering for Faster Network Simplex Pivots. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:160-166 [Conf]
  64. David Eppstein
    Subgraph Isomorphism in Planar Graphs and Related Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:632-640 [Conf]
  65. David Eppstein
    Faster Construction of Planar Two-Centers. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:131-138 [Conf]
  66. David Eppstein
    Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:619-628 [Conf]
  67. David Eppstein
    Incremental and Decremental Maintenance of Planar Width. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:899-900 [Conf]
  68. David Eppstein, Jeff Erickson
    Iterated Nearest Neighbors and Finding Minimal Polytopes. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:64-73 [Conf]
  69. David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
    Sparse Dynamic Programming. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:513-522 [Conf]
  70. David Eppstein, David Hart
    Shortest Paths in an Arrangement with k Line Orientations. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:310-316 [Conf]
  71. David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung
    Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:1-11 [Conf]
  72. David Eppstein, S. Muthukrishnan
    Internet packet filter management and rectangle geometry. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:827-835 [Conf]
  73. David Eppstein, Joseph Wang
    Fast approximation of centrality. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:228-229 [Conf]
  74. Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler
    The effect of faults on network expansion. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:286-293 [Conf]
  75. David Eppstein
    Geometric lower bounds for parametric matroid optimization. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:662-671 [Conf]
  76. David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
    Separator based sparsification for dynamic planar graph algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:208-217 [Conf]
  77. Josiah Carlson, David Eppstein
    The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:400-410 [Conf]
  78. David Eppstein
    Finding the k Smallest Spanning Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:38-47 [Conf]
  79. David Fernández-Baca, Giora Slutzki, David Eppstein
    Using Sparsification for Parametric Minimum Spanning Tree Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:149-160 [Conf]
  80. Marshall W. Bern, David Eppstein
    Optimal Möbius Transformations for Information Visualization and Meshing. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:14-25 [Conf]
  81. Marshall W. Bern, David Eppstein
    Optimization over Zonotopes and Training Support Vector Machines. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:111-121 [Conf]
  82. Marshall W. Bern, David Eppstein, Shang-Hua Teng
    Parallel Construction of Quadtrees and Quality Triangulations. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:188-199 [Conf]
  83. David Eppstein
    Small Maximal Independent Sets and Faster Exact Graph Coloring. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:462-470 [Conf]
  84. David Eppstein
    The Traveling Salesman Problem for Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:307-318 [Conf]
  85. David Eppstein
    Offline Algorithms for Dynamic Minimum Spanning Tree Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:392-399 [Conf]
  86. David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
    Improved Combinatorial Group Testing for Real-World Problem Sizes. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:86-98 [Conf]
  87. David Eppstein, David Hart
    An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:234-247 [Conf]
  88. Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman
    Visibility with a Moving Point of View. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:4, pp:360-378 [Journal]
  89. David Eppstein
    Diameter and Treewidth in Minor-Closed Graph Families. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:3, pp:275-291 [Journal]
  90. David Eppstein
    Asymptotic Speed-Ups in Constructive Solid Geometry. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:13, n:5, pp:462-471 [Journal]
  91. David Eppstein, Marshall W. Bern, Brad L. Hutchings
    Algorithms for Coloring Quadtrees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:1, pp:87-94 [Journal]
  92. David Eppstein
    Finding the k Smallest Spanning Trees. [Citation Graph (0, 0)][DBLP]
    BIT, 1992, v:32, n:2, pp:237-248 [Journal]
  93. M. Gopi, David Eppstein
    Single-Strip Triangulation of Manifolds with Arbitrary Topology. [Citation Graph (0, 0)][DBLP]
    Comput. Graph. Forum, 2004, v:23, n:3, pp:371-380 [Journal]
  94. Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink
    Ununfoldable polyhedra with convex faces. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:24, n:2, pp:51-62 [Journal]
  95. Gill Barequet, Matthew Dickerson, David Eppstein
    On triangulating three-dimensional polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:3, pp:155-170 [Journal]
  96. Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman
    Hinged dissection of polyominoes and polyforms. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:31, n:3, pp:237-262 [Journal]
  97. David Eppstein, John M. Sullivan, Alper Üngör
    Tiling space and slabs with acute tetrahedra. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:27, n:3, pp:237-255 [Journal]
  98. Matthew Dickerson, David Eppstein
    Algorithms for Proximity Problems in Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1995, v:5, n:, pp:277-291 [Journal]
  99. David Eppstein
    Beta-skeletons have unbounded dilation. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:1, pp:43-52 [Journal]
  100. David Eppstein
    The Farthest Point Delaunay Triangulation Minimizes Angles. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:143-148 [Journal]
  101. David Eppstein
    Average Case Analysis of Dynamic Geometric Optimization. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:45-68 [Journal]
  102. David Eppstein
    Faster Geometric K-point MST Approximation. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:231-240 [Journal]
  103. David Eppstein
    Linear complexity hexahedral mesh generation. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:12, n:1-2, pp:3-16 [Journal]
  104. David Eppstein
    Searching for Spaceships [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  105. Erik D. Demaine, Martin L. Demaine, David Eppstein
    Phutball Endgames are Hard [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  106. Marshall W. Bern, David Eppstein
    Computing the Depth of a Flat [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  107. David Eppstein, S. Muthukrishnan
    Internet Packet Filter Management and Rectangle Geometry [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  108. Marshall W. Bern, David Eppstein
    Optimal Moebius Transformations for Information Visualization and Meshing [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  109. Marshall W. Bern, David Eppstein
    Optimization Over Zonotopes and Training Support Vector Machines [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  110. David Eppstein
    Hinged Kite Mirror Dissection [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  111. Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke
    Vertex-Unfoldings of Simplicial Polyhedra [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  112. Marshall W. Bern, David Eppstein, Jeff Erickson
    Flipping Cubical Meshes [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  113. Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke
    Vertex-Unfoldings of Simplicial Manifolds [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  114. Marshall W. Bern, David Eppstein
    Moebius-Invariant Natural Neighbor Interpolation [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  115. Marshall W. Bern, David Eppstein
    Optimized Color Gamuts for Tiled Displays [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  116. Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
    Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  117. David Eppstein, John M. Sullivan, Alper Üngör
    Tiling space and slabs with acute tetrahedra [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  118. David Eppstein
    Testing Bipartiteness of Geometric Intersection Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  119. Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich
    Deterministic Sampling and Range Counting in Geometric Data Streams [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  120. Christian A. Duncan, David Eppstein, Stephen G. Kobourov
    The Geometric Thickness of Low Degree Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  121. M. Gopi, David Eppstein
    Single-Strip Triangulation of Manifolds with Arbitrary Topology [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  122. Nina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng
    Regression Depth and Center Points [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  123. David Eppstein
    Incremental and Decremental Maintenance of Planar Width [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  124. Nina Amenta, Marshall W. Bern, David Eppstein
    Optimal Point Placement for Mesh Smoothing [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  125. David Eppstein
    Linear Complexity Hexahedral Mesh Generation [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  126. Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman
    Hinged Dissection of Polyominoes and Polyforms [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  127. David Eppstein, Marshall W. Bern, Brad L. Hutchings
    Algorithms for Coloring Quadtrees [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  128. David Eppstein
    Beta-Skeletons have Unbounded Dilation [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  129. Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink
    Ununfoldable Polyhedra with Convex Faces [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  130. Marshall W. Bern, David Eppstein
    Quadrilateral Meshing by Circle Packing [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  131. 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
    Emerging Challenges in Computational Topology [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  132. Marshall W. Bern, David Eppstein
    Multivariate Regression Depth [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  133. Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler
    The Effect of Faults on Network Expansion [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  134. David Eppstein, Joseph Wang
    A steady state model for graph power laws [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  135. Xianping Ge, David Eppstein, Padhraic Smyth
    The Distribution of Cycle Lengths in Graphical Models for Iterative Decoding [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  136. Richard Beigel, David Eppstein
    3-Coloring in Time O(1.3289^n) [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  137. David Eppstein, Joseph Wang
    Fast Approximation of Centrality [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  138. David Eppstein
    Improved Algorithms for 3-Coloring, 3-Edge-Coloring, and Constraint Satisfaction [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  139. David Eppstein
    Small Maximal Independent Sets and Faster Exact Graph Coloring [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  140. David Eppstein, George S. Lueker
    The Minimum Expectation Selection Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  141. David Eppstein, Jean-Claude Falmagne
    Algorithms for Media [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  142. David Eppstein
    Dynamic Generators of Topologically Embedded Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  143. David Eppstein
    The traveling salesman problem for cubic graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  144. David Eppstein
    Quasiconvex Analysis of Backtracking Algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  145. David Eppstein
    The lattice dimension of a graph [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  146. David Eppstein
    Algorithms for Drawing Media [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  147. David Eppstein
    All Maximal Independent Sets and Dynamic Dominance for Sparse Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  148. David Eppstein
    Setting Parameters by Example [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  149. David Eppstein
    Subgraph Isomorphism in Planar Graphs and Related Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  150. David Eppstein
    Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  151. Cristopher Moore, David Eppstein
    One-Dimensional Peg Solitaire [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  152. Cristopher Moore, David Eppstein
    One-Dimensional Peg Solitaire, and Duotaire [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  153. David Eppstein
    Separating Geometric Thickness from Book Thickness [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  154. David Eppstein
    Separating Thickness from Geometric Thickness [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  155. Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
    Geometric Thickness of Complete Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  156. Nina Amenta, Marshall W. Bern, David Eppstein
    The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction. [Citation Graph (0, 0)][DBLP]
    Graphical Models and Image Processing, 1998, v:60, n:2, pp:125-135 [Journal]
  157. Boris Aronov, Marshall W. Bern, David Eppstein
    On the Number of Minimal 1-Steiner Trees. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:12, n:, pp:29-34 [Journal]
  158. Nina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng
    Regression Depth and Center Points. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:23, n:3, pp:305-323 [Journal]
  159. Marshall W. Bern, David Eppstein
    Multivariate Regression Depth. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:1, pp:1-17 [Journal]
  160. Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Sandra L. Mitchell, Tio Seng Tan
    Edge Insertion for Optimal Triangulations. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:47-65 [Journal]
  161. David Eppstein
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:1, pp:1-2 [Journal]
  162. David Eppstein
    Approximating the Minimum Weight Steiner Triangulation. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:11, n:, pp:163-191 [Journal]
  163. David Eppstein
    Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:111-122 [Journal]
  164. David Eppstein
    Geometric Lower Bounds for Parametric Matroid Optimization. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:20, n:4, pp:463-476 [Journal]
  165. David Eppstein, Jeff Erickson
    Iterated Nearest Neighbors and Finding Minimal Polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:11, n:, pp:321-350 [Journal]
  166. David Eppstein, Jeff Erickson
    Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:4, pp:569-592 [Journal]
  167. David Eppstein, Mark H. Overmars, Günter Rote, Gerhard J. Woeginger
    Finding Minimum Area k-gons. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:45-58 [Journal]
  168. David Eppstein, Mike Paterson, F. Frances Yao
    On Nearest-Neighbor Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:17, n:3, pp:263-282 [Journal]
  169. David Eppstein
    The lattice dimension of a graph. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:5, pp:585-592 [Journal]
  170. Marshall W. Bern, David Eppstein, Jeff Erickson
    Flipping Cubical Meshes. [Citation Graph (0, 0)][DBLP]
    Eng. Comput. (Lond.), 2002, v:18, n:3, pp:173-187 [Journal]
  171. David Eppstein, Gary L. Miller, Shang-Hua Teng
    A Deterministic Linear Time Algorithm for Geometric Separators and its Applications. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1995, v:22, n:4, pp:309-329 [Journal]
  172. David Eppstein
    Parallel Recognition of Series-Parallel Graphs [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:98, n:1, pp:41-55 [Journal]
  173. Marshall W. Bern, David P. Dobkin, David Eppstein
    Triangulating polygons without large angles. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:171-192 [Journal]
  174. Marshall W. Bern, David Eppstein
    Quadrilateral Meshing by Circle Packing. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2000, v:10, n:4, pp:347-360 [Journal]
  175. Marshall W. Bern, David Eppstein
    Polynomial-size nonobtuse triangulation of polygons. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:3, pp:241-255 [Journal]
  176. Marshall W. Bern, David Eppstein
    Erratum: Polynomial-size nonobtuse triangulation of polygons. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:4, pp:449-450 [Journal]
  177. Marshall W. Bern, David Eppstein, Shang-Hua Teng
    Parallel Construction of Quadtrees and Quality Triangulations. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1999, v:9, n:6, pp:517-532 [Journal]
  178. Marshall W. Bern, David Eppstein, F. Frances Yao
    The expected extremes in a Delaunay triangulation. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1991, v:1, n:1, pp:79-91 [Journal]
  179. Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng
    Approximating center points with iterative Radon points. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:3, pp:357-377 [Journal]
  180. David Eppstein
    Tree-weighted neighbors and geometric k smallest spanning trees. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1994, v:4, n:2, pp:229-238 [Journal]
  181. David Eppstein
    Faster Circle Packing with Application to Non-Obtuse Triangulation. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:5, pp:485-492 [Journal]
  182. David Eppstein
    Arboricity and Bipartite Subgraph Listing Algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:4, pp:207-211 [Journal]
  183. David Eppstein
    Dynamic Connectivity in Digital Images. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:3, pp:121-126 [Journal]
  184. David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
    Sparse Dynamic Programming I: Linear Cost Functions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:3, pp:519-545 [Journal]
  185. David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
    Sparse Dynamic Programming II: Convex and Concave Cost Functions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:3, pp:546-567 [Journal]
  186. David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig
    Sparsification - a technique for speeding up dynamic graph algorithms. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:5, pp:669-696 [Journal]
  187. Nina Amenta, Marshall W. Bern, David Eppstein
    Optimal Point Placement for Mesh Smoothing. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:30, n:2, pp:302-322 [Journal]
  188. Richard Beigel, David Eppstein
    3-coloring in time O(1.3289n). [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:54, n:2, pp:168-204 [Journal]
  189. David Eppstein
    Incremental and Decremental Maintenance of Planar Width. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:570-577 [Journal]
  190. David Eppstein
    Sequence Comparison with Mixed Convex and Concave Costs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1990, v:11, n:1, pp:85-101 [Journal]
  191. David Eppstein
    Offline Algorithms for Dynamic Minimum Spanning Tree Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:17, n:2, pp:237-250 [Journal]
  192. David Eppstein
    Minimum Range Balanced Cuts via Dynamic Subset Sums. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:23, n:2, pp:375-385 [Journal]
  193. David Eppstein, Daniel S. Hirschberg
    Choosing Subsets with Maximum Weighted Average. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:24, n:1, pp:177-193 [Journal]
  194. David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung
    Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:1, pp:33-54 [Journal]
  195. David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung
    Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:15, n:1, pp:173- [Journal]
  196. David Eppstein, Giuseppe F. Italiano
    PREFACE: Festschrift for Zvi Galil. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1999, v:15, n:1, pp:1-3 [Journal]
  197. Marshall W. Bern, David Eppstein, John R. Gilbert
    Provably Good Mesh Generation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:48, n:3, pp:384-409 [Journal]
  198. David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
    Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:52, n:1, pp:3-27 [Journal]
  199. David Eppstein
    Improved Bounds for Intersecting Triangles and Halving Planes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1993, v:62, n:1, pp:176-182 [Journal]
  200. David Eppstein
    Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2000, v:5, n:, pp:1- [Journal]
  201. Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
    Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2005, v:9, n:1, pp:31-52 [Journal]
  202. Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg
    Geometric Thickness of Complete Graphs. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2000, v:4, n:3, pp:5-17 [Journal]
  203. David Eppstein
    Small Maximal Independent Sets and Faster Exact Graph Coloring. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2003, v:7, n:2, pp:131-140 [Journal]
  204. David Eppstein
    Subgraph Isomorphism in Planar Graphs and Related Problems. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1999, v:3, n:3, pp:- [Journal]
  205. David Eppstein, Joseph Wang
    Fast Approximation of Centrality. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2004, v:8, n:, pp:39-45 [Journal]
  206. David Eppstein, Lane A. Hemachandra, James Tisdall, Bülent Yener
    Simultaneous Strong Separations of Probabilistic and Unambiguous Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1992, v:25, n:1, pp:23-36 [Journal]
  207. David Eppstein
    Clustering for faster network simplex pivots. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:35, n:3, pp:173-180 [Journal]
  208. David Fernández-Baca, Giora Slutzki, David Eppstein
    Using Sparsification for Parametric Minimum Spanning Tree Problems. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1996, v:3, n:4, pp:352-366 [Journal]
  209. David Eppstein, George S. Lueker
    The minimum expectation selection problem. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:21, n:3-4, pp:278-292 [Journal]
  210. David Eppstein
    Setting Parameters by Example. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:3, pp:643-653 [Journal]
  211. David Eppstein
    Reset Sequences for Monotonic Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:3, pp:500-510 [Journal]
  212. David Eppstein
    Finding the k Shortest Paths. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:652-673 [Journal]
  213. David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer
    Separator-Based Sparsification II: Edge and Vertex Connectivity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:341-381 [Journal]
  214. David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
    Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1360-1375 [Journal]
  215. David Eppstein
    Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:4, pp:492-509 [Journal]
  216. David Eppstein
    Foreword to special issue on SODA 2002. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:1, pp:- [Journal]
  217. Marek Chrobak, David Eppstein
    Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:86, n:2, pp:243-266 [Journal]
  218. Xianping Ge, David Eppstein, Padhraic Smyth
    The distribution of loop lengths in graphical models for turbo decoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:6, pp:2549-2553 [Journal]
  219. David P. Dobkin, David Eppstein, Don P. Mitchell
    Computing the Discrepancy with Applications to Supersampling Patterns. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Graph., 1996, v:15, n:4, pp:354-376 [Journal]
  220. Tony Givargis, David Eppstein
    Memory reference caching for activity reduction on address buses. [Citation Graph (0, 0)][DBLP]
    Microprocessors and Microsystems, 2005, v:29, n:4, pp:145-153 [Journal]
  221. David Eppstein
    Squarepants in a tree: sum of subtree clustering and hyperbolic pants decomposition. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:29-38 [Conf]
  222. David Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann
    Edges and Switches, Tunnels and Bridges. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:77-88 [Conf]
  223. David Eppstein, Michael T. Goodrich
    Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton's Identities and Invertible Bloom Filters. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:637-648 [Conf]
  224. David Eppstein, Michael T. Goodrich, Jeremy Yu Meng
    Confluent Layered Drawings. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:4, pp:439-452 [Journal]
  225. David Eppstein, Kevin A. Wortman
    Minimum dilation stars. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:37, n:1, pp:27-37 [Journal]
  226. Vida Dujmovic, David Eppstein, Matthew Suderman, David R. Wood
    Drawings of planar graphs with few slopes and segments. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:38, n:3, pp:194-212 [Journal]
  227. David Eppstein, Michael T. Goodrich
    Space-Efficient Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  228. David Eppstein, Jean-Claude Falmagne, Hasan Uzun
    On Verifying and Engineering the Well-gradedness of a Union-closed Family [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  229. David Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann
    Edges and Switches, Tunnels and Bridges [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  230. David Eppstein
    Recognizing Partial Cubes in Quadratic Time [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  231. David Eppstein
    Happy endings for flip graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  232. Michael B. Dillencourt, David Eppstein, Michael T. Goodrich
    Choosing Colors for Geometric Graphs via Color Space Embeddings [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  233. John Augustine, David Eppstein, Kevin A. Wortman
    Approximate Weighted Farthest Neighbors and Minimum Dilation Stars [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  234. David Eppstein, Michael T. Goodrich, Nodari Sitchinava
    Guard Placement For Wireless Localization [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  235. Josiah Carlson, David Eppstein
    The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  236. David Eppstein
    Squarepants in a Tree: Sum of Subtree Clustering and Hyperbolic Pants Decomposition [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  237. David Eppstein
    Upright-Quad Drawing of st-Planar Learning Spaces [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  238. Josiah Carlson, David Eppstein
    Trees with Convex Faces and Optimal Angles [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  239. David Eppstein
    The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  240. David Eppstein, Kevin A. Wortman
    Minimum Dilation Stars [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  241. David Eppstein
    Quasiconvex Programming [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  242. David Eppstein, Joan Feigenbaum, Chung-Lun Li
    Equipartitions of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:91, n:3, pp:239-248 [Journal]
  243. Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler
    The Effect of Faults on Network Expansion. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:6, pp:903-928 [Journal]
  244. Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich
    Deterministic sampling and range counting in geometric data streams. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:2, pp:- [Journal]

  245. Regular labelings and geometric structures. [Citation Graph (, )][DBLP]


  246. Approximate Weighted Farthest Neighbors and Minimum Dilation Stars. [Citation Graph (, )][DBLP]


  247. Animating a continuous family of two-site Voronoi diagrams (and a proof of a bound on the number of regions). [Citation Graph (, )][DBLP]


  248. Area-universal rectangular layouts. [Citation Graph (, )][DBLP]


  249. Steinitz theorems for orthogonal polyhedra. [Citation Graph (, )][DBLP]


  250. Straight Skeletons of Three-Dimensional Polyhedra. [Citation Graph (, )][DBLP]


  251. Cloning Voronoi Diagrams via Retroactive Data Structures. [Citation Graph (, )][DBLP]


  252. Succinct Greedy Graph Drawing in the Hyperbolic Plane. [Citation Graph (, )][DBLP]


  253. The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing. [Citation Graph (, )][DBLP]


  254. Isometric Diamond Subgraphs. [Citation Graph (, )][DBLP]


  255. Studying (non-planar) road networks through an algorithmic lens. [Citation Graph (, )][DBLP]


  256. Going off-road: transversal complexity in road networks. [Citation Graph (, )][DBLP]


  257. Approximate topological matching of quadrilateral meshes. [Citation Graph (, )][DBLP]


  258. Recognizing partial cubes in quadratic time. [Citation Graph (, )][DBLP]


  259. Linear-time algorithms for geometric graphs with sublinearly many crossings. [Citation Graph (, )][DBLP]


  260. Self-overlapping curves revisited. [Citation Graph (, )][DBLP]


  261. Paired Approximation Problems and Incompatible Inapproximabilities. [Citation Graph (, )][DBLP]


  262. On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem. [Citation Graph (, )][DBLP]


  263. Optimal Embedding into Star Metrics. [Citation Graph (, )][DBLP]


  264. The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics. [Citation Graph (, )][DBLP]


  265. Orientation-Constrained Rectangular Layouts. [Citation Graph (, )][DBLP]


  266. Graph-Theoretic Solutions to Computational Geometry Problems. [Citation Graph (, )][DBLP]


  267. Planar Voronoi Diagrams for Sums of Convex Functions, Smoothed Distance and Dilation. [Citation Graph (, )][DBLP]


  268. Motorcycle Graphs: Canonical Quad Mesh Partitioning. [Citation Graph (, )][DBLP]


  269. Curvature Aware Fundamental Cycles. [Citation Graph (, )][DBLP]


  270. Cubic Partial Cubes from Simplicial Arrangements. [Citation Graph (, )][DBLP]


  271. Edges and switches, tunnels and bridges. [Citation Graph (, )][DBLP]


  272. Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes [Citation Graph (, )][DBLP]


  273. The Skip Quadtree: A Simple Dynamic Data Structure for Multidimensional Data [Citation Graph (, )][DBLP]


  274. Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets [Citation Graph (, )][DBLP]


  275. Confluent Layered Drawings [Citation Graph (, )][DBLP]


  276. Nonrepetitive Paths and Cycles in Graphs with Application to Sudoku [Citation Graph (, )][DBLP]


  277. Delta-confluent Drawings [Citation Graph (, )][DBLP]


  278. Cubic Partial Cubes from Simplicial Arrangements [Citation Graph (, )][DBLP]


  279. Learning Sequences [Citation Graph (, )][DBLP]


  280. Straight Skeletons of Three-Dimensional Polyhedra [Citation Graph (, )][DBLP]


  281. Finding Large Clique Minors is Hard [Citation Graph (, )][DBLP]


  282. Succinct Greedy Graph Drawing in the Hyperbolic Plane [Citation Graph (, )][DBLP]


  283. Self-overlapping Curves Revisited [Citation Graph (, )][DBLP]


  284. Isometric Diamond Subgraphs [Citation Graph (, )][DBLP]


  285. Studying (Non-Planar) Road Networks Through an Algorithmic Lens [Citation Graph (, )][DBLP]


  286. Dilation, smoothed distance, and minimization diagrams of convex functions [Citation Graph (, )][DBLP]


  287. Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings [Citation Graph (, )][DBLP]


  288. Area-Universal Rectangular Layouts [Citation Graph (, )][DBLP]


  289. The Fibonacci dimension of a graph [Citation Graph (, )][DBLP]


  290. The h-Index of a Graph and its Application to Dynamic Subgraph Statistics [Citation Graph (, )][DBLP]


  291. On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem [Citation Graph (, )][DBLP]


  292. Orientation-Constrained Rectangular Layouts [Citation Graph (, )][DBLP]


  293. Optimal Embedding Into Star Metrics [Citation Graph (, )][DBLP]


  294. Optimal Angular Resolution for Face-Symmetric Drawings [Citation Graph (, )][DBLP]


  295. Graph-Theoretic Solutions to Computational Geometry Problems [Citation Graph (, )][DBLP]


  296. Optimally fast incremental Manhattan plane embedding and planar tight span construction [Citation Graph (, )][DBLP]


  297. Paired approximation problems and incompatible inapproximabilities [Citation Graph (, )][DBLP]


  298. Going Off-road: Transversal Complexity in Road Networks [Citation Graph (, )][DBLP]


  299. Steinitz Theorems for Orthogonal Polyhedra [Citation Graph (, )][DBLP]


  300. Cloning Voronoi Diagrams via Retroactive Data Structures [Citation Graph (, )][DBLP]


  301. Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time [Citation Graph (, )][DBLP]


  302. Regular Labelings and Geometric Structures [Citation Graph (, )][DBLP]


  303. Flows in One-Crossing-Minor-Free Graphs [Citation Graph (, )][DBLP]


  304. Algorithms for media. [Citation Graph (, )][DBLP]


Search in 0.277secs, Finished in 0.289secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002