 | 2009 |
|---|
| 297 |       | David Eppstein,
Michael T. Goodrich,
Darren Strash:
Linear-time algorithms for geometric graphs with sublinearly many crossings.
SODA 2009: 150-159 |
| 296 | | David Eppstein,
Elena Mumford:
Self-overlapping curves revisited.
SODA 2009: 160-169 |
| 295 | | David Eppstein,
Elena Mumford,
Bettina Speckmann,
Kevin Verbeek:
Area-universal rectangular layouts.
Symposium on Computational Geometry 2009: 267-276 |
| 294 | | Matthew T. Dickerson,
David Eppstein:
Animating a continuous family of two-site Voronoi diagrams (and a proof of a bound on the number of regions).
Symposium on Computational Geometry 2009: 92-93 |
| 293 | | Wenliang Du,
David Eppstein,
Michael T. Goodrich,
George S. Lueker:
On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem.
WADS 2009: 242-253 |
| 292 | | David Eppstein,
Elena Mumford:
Orientation-Constrained Rectangular Layouts.
WADS 2009: 266-277 |
| 291 | | David Eppstein,
Emma S. Spiro:
The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics.
WADS 2009: 278-289 |
| 290 | | David Eppstein,
Kevin A. Wortman:
Optimal Embedding into Star Metrics.
WADS 2009: 290-301 |
| 289 | | David Eppstein:
Testing bipartiteness of geometric intersection graphs.
ACM Transactions on Algorithms 5(2): (2009) |
| 288 | | David Eppstein:
Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition.
ACM Transactions on Algorithms 5(3): (2009) |
| 287 | | David Eppstein,
Elena Mumford,
Bettina Speckmann,
Kevin Verbeek:
Area-Universal Rectangular Layouts
CoRR abs/0901.3924: (2009) |
| 286 | | Sergio Cabello,
David Eppstein,
Sandi Klavzar:
The Fibonacci dimension of a graph
CoRR abs/0903.2507: (2009) |
| 285 | | David Eppstein,
Emma S. Spiro:
The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
CoRR abs/0904.3741: (2009) |
| 284 | | Wenliang Du,
David Eppstein,
Michael T. Goodrich,
George S. Lueker:
On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
CoRR abs/0904.3756: (2009) |
| 283 | | David Eppstein,
Elena Mumford:
Orientation-Constrained Rectangular Layouts
CoRR abs/0904.4312: (2009) |
| 282 | | David Eppstein,
Kevin A. Wortman:
Optimal Embedding Into Star Metrics
CoRR abs/0905.0283: (2009) |
| 281 | | David Eppstein,
Kevin A. Wortman:
Optimal Angular Resolution for Face-Symmetric Drawings
CoRR abs/0907.5474: (2009) |
| 280 | | David Eppstein:
Graph-Theoretic Solutions to Computational Geometry Problems
CoRR abs/0908.3916: (2009) |
| 279 | | David Eppstein:
Optimally fast incremental Manhattan plane embedding and planar tight span construction
CoRR abs/0909.1866: (2009) |
| 278 | | David Eppstein:
Paired approximation problems and incompatible inapproximabilities
CoRR abs/0909.1870: (2009) |
| 277 | | David Eppstein,
Michael T. Goodrich,
Lowell Trott:
Going Off-road: Transversal Complexity in Road Networks
CoRR abs/0909.2891: (2009) |
| 2008 |
|---|
| 276 | | Gill Barequet,
David Eppstein,
Michael T. Goodrich,
Amir Vaxman:
Straight Skeletons of Three-Dimensional Polyhedra.
ESA 2008: 148-160 |
| 275 | | David Eppstein,
Michael T. Goodrich:
Studying (non-planar) road networks through an algorithmic lens.
GIS 2008: 16 |
| 274 | | David Eppstein,
Michael T. Goodrich:
Succinct Greedy Graph Drawing in the Hyperbolic Plane.
Graph Drawing 2008: 14-25 |
| 273 | | David Eppstein:
Isometric Diamond Subgraphs.
Graph Drawing 2008: 384-389 |
| 272 | | David Eppstein:
The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing.
Graph Drawing 2008: 78-89 |
| 271 | | David Eppstein:
Recognizing partial cubes in quadratic time.
SODA 2008: 1258-1266 |
| 270 | | David Eppstein,
Michael T. Goodrich,
Ethan Kim,
Rasmus Tamstorf:
Approximate topological matching of quadrilateral meshes.
Shape Modeling International 2008: 83-92 |
| 269 | | David Eppstein:
Learning Sequences
CoRR abs/0803.4030: (2008) |
| 268 | | Gill Barequet,
David Eppstein,
Michael T. Goodrich,
Amir Vaxman:
Straight Skeletons of Three-Dimensional Polyhedra
CoRR abs/0805.0022: (2008) |
| 267 | | David Eppstein,
Michael T. Goodrich:
Succinct Greedy Graph Drawing in the Hyperbolic Plane
CoRR abs/0806.0341: (2008) |
| 266 | | David Eppstein,
Elena Mumford:
Self-overlapping Curves Revisited
CoRR abs/0806.1724: (2008) |
| 265 | | David Eppstein:
Finding Large Clique Minors is Hard
CoRR abs/0807.0007: (2008) |
| 264 | | David Eppstein:
Isometric Diamond Subgraphs
CoRR abs/0807.2218: (2008) |
| 263 | | David Eppstein,
Michael T. Goodrich:
Studying (Non-Planar) Road Networks Through an Algorithmic Lens
CoRR abs/0808.3694: (2008) |
| 262 | | Matthew Dickerson,
David Eppstein,
Kevin A. Wortman:
Dilation, smoothed distance, and minimization diagrams of convex functions
CoRR abs/0812.0607: (2008) |
| 261 | | David Eppstein,
Michael T. Goodrich,
Darren Strash:
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings
CoRR abs/0812.0893: (2008) |
| 260 | | David Eppstein,
Michael T. Goodrich,
Ethan Kim,
Rasmus Tamstorf:
Motorcycle Graphs: Canonical Quad Mesh Partitioning.
Comput. Graph. Forum 27(5): 1477-1486 (2008) |
| 259 | | David Eppstein,
Jean-Claude Falmagne:
Algorithms for media.
Discrete Applied Mathematics 156(8): 1308-1320 (2008) |
| 258 | | David Eppstein,
Michael T. Goodrich,
Jonathan Z. Sun:
Skip Quadtrees: Dynamic Data Structures for Multidimensional Point Sets.
Int. J. Comput. Geometry Appl. 18(1/2): 131-160 (2008) |
| 257 | | David Eppstein:
Upright-Quad Drawing of st-Planar Learning Spaces.
J. Graph Algorithms Appl. 12(1): 51-72 (2008) |
| 2007 |
|---|
| 256 | | David Eppstein:
Squarepants in a tree: sum of subtree clustering and hyperbolic pants decomposition.
SODA 2007: 29-38 |
| 255 | | David Eppstein,
Michael T. Goodrich,
Nodari Sitchinava:
Guard placement for efficient point-in-polygon proofs.
Symposium on Computational Geometry 2007: 27-36 |
| 254 | | David Eppstein:
Happy endings for flip graphs.
Symposium on Computational Geometry 2007: 92-101 |
| 253 | | David Eppstein,
Michael T. Goodrich:
Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton's Identities and Invertible Bloom Filters.
WADS 2007: 637-648 |
| 252 | | David Eppstein,
Marc J. van Kreveld,
Elena Mumford,
Bettina Speckmann:
Edges and Switches, Tunnels and Bridges.
WADS 2007: 77-88 |
| 251 | | David Eppstein:
Foreword to special issue on SODA 2002.
ACM Transactions on Algorithms 3(1): (2007) |
| 250 | | Amitabha Bagchi,
Amitabh Chaudhary,
David Eppstein,
Michael T. Goodrich:
Deterministic sampling and range counting in geometric data streams.
ACM Transactions on Algorithms 3(2): (2007) |
| 249 | | David Eppstein,
Michael T. Goodrich,
Jeremy Yu Meng:
Confluent Layered Drawings.
Algorithmica 47(4): 439-452 (2007) |
| 248 | | David Eppstein,
Jean-Claude Falmagne,
Hasan Uzun:
On Verifying and Engineering the Well-gradedness of a Union-closed Family
CoRR abs/0704.2919: (2007) |
| 247 | | David Eppstein,
Michael T. Goodrich:
Space-Efficient Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters
CoRR abs/0704.3313: (2007) |
| 246 | | David Eppstein,
Marc J. van Kreveld,
Elena Mumford,
Bettina Speckmann:
Edges and Switches, Tunnels and Bridges
CoRR abs/0705.0413: (2007) |
| 245 | | David Eppstein:
Recognizing Partial Cubes in Quadratic Time
CoRR abs/0705.1025: (2007) |
| 244 | | David Eppstein:
The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing
CoRR abs/0709.4087: (2007) |
| 243 | | David Eppstein,
Kevin A. Wortman:
Minimum dilation stars.
Comput. Geom. 37(1): 27-37 (2007) |
| 242 | | Vida Dujmovic,
David Eppstein,
Matthew Suderman,
David R. Wood:
Drawings of planar graphs with few slopes and segments.
Comput. Geom. 38(3): 194-212 (2007) |
| 241 | | Love Singhal,
Elaheh Bozorgzadeh,
David Eppstein:
Interconnect Criticality-Driven Delay Relaxation.
IEEE Trans. on CAD of Integrated Circuits and Systems 26(10): 1803-1817 (2007) |
| 240 | | David Eppstein:
The Traveling Salesman Problem for Cubic Graphs.
J. Graph Algorithms Appl. 11(1): 61-81 (2007) |
| 239 | | David Eppstein,
Michael T. Goodrich,
Daniel S. Hirschberg:
Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes.
SIAM J. Comput. 36(5): 1360-1375 (2007) |
| 2006 |
|---|
| 238 | | David Eppstein:
Upright-Quad Drawing of st -Planar Learning Spaces.
Graph Drawing 2006: 282-293 |
| 237 | | Michael B. Dillencourt,
David Eppstein,
Michael T. Goodrich:
Choosing Colors for Geometric Graphs Via Color Space Embeddings.
Graph Drawing 2006: 294-305 |
| 236 | | Josiah Carlson,
David Eppstein:
Trees with Convex Faces and Optimal Angles.
Graph Drawing 2006: 77-88 |
| 235 | | Pablo Diaz-Gutierrez,
David Eppstein,
M. Gopi:
Single Triangle Strip and Loop on Manifolds with Boundaries.
SIBGRAPI 2006: 221-228 |
| 234 | | Josiah Carlson,
David Eppstein:
The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems.
SWAT 2006: 400-410 |
| 233 | | David Eppstein:
Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms.
ACM Transactions on Algorithms 2(4): 492-509 (2006) |
| 232 | | John Augustine,
David Eppstein,
Kevin A. Wortman:
Approximate Weighted Farthest Neighbors and Minimum Dilation Stars
CoRR abs/cs/0602029: (2006) |
| 231 | | David Eppstein,
Michael T. Goodrich,
Nodari Sitchinava:
Guard Placement For Wireless Localization
CoRR abs/cs/0603057: (2006) |
| 230 | | David Eppstein:
Squarepants in a Tree: Sum of Subtree Clustering and Hyperbolic Pants Decomposition
CoRR abs/cs/0604034: (2006) |
| 229 | | David Eppstein:
Upright-Quad Drawing of st-Planar Learning Spaces
CoRR abs/cs/0607094: (2006) |
| 228 | | Josiah Carlson,
David Eppstein:
Trees with Convex Faces and Optimal Angles
CoRR abs/cs/0607113: (2006) |
| 227 | | Michael B. Dillencourt,
David Eppstein,
Michael T. Goodrich:
Choosing Colors for Geometric Graphs via Color Space Embeddings
CoRR abs/cs/0609033: (2006) |
| 226 | | David Eppstein:
Happy endings for flip graphs
CoRR abs/cs/0610092: (2006) |
| 225 | | David Eppstein:
Cubic Partial Cubes from Simplicial Arrangements.
Electr. J. Comb. 13(1): (2006) |
| 224 | | Amitabha Bagchi,
Ankur Bhargava,
Amitabh Chaudhary,
David Eppstein,
Christian Scheideler:
The Effect of Faults on Network Expansion.
Theory Comput. Syst. 39(6): 903-928 (2006) |
| 2005 |
|---|
| 223 | | David Eppstein,
Michael T. Goodrich,
Jeremy Yu Meng:
Delta-Confluent Drawings.
Graph Drawing 2005: 165-176 |
| 222 | | Lars Arge,
David Eppstein,
Michael T. Goodrich:
Skip-webs: efficient distributed data structures for multi-dimensional data sets.
PODC 2005: 69-76 |
| 221 | | David Eppstein:
All maximal independent sets and dynamic dominance for sparse graphs.
SODA 2005: 451-459 |
| 220 | | David Eppstein,
Michael T. Goodrich,
Jonathan Z. Sun:
The skip quadtree: a simple dynamic data structure for multidimensional data.
Symposium on Computational Geometry 2005: 296-305 |
| 219 | | David Eppstein,
Kevin A. Wortman:
Minimum dilation stars.
Symposium on Computational Geometry 2005: 321-326 |
| 218 | | David Eppstein,
Michael T. Goodrich,
Daniel S. Hirschberg:
Improved Combinatorial Group Testing for Real-World Problem Sizes.
WADS 2005: 86-98 |
| 217 | | Josiah Carlson,
David Eppstein:
The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems
CoRR abs/cs/0503023: (2005) |
| 216 | | David Eppstein,
Michael T. Goodrich,
Daniel S. Hirschberg:
Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes
CoRR abs/cs/0505048: (2005) |
| 215 | | David Eppstein,
Michael T. Goodrich,
Jonathan Z. Sun:
The Skip Quadtree: A Simple Dynamic Data Structure for Multidimensional Data
CoRR abs/cs/0507049: (2005) |
| 214 | | Lars Arge,
David Eppstein,
Michael T. Goodrich:
Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets
CoRR abs/cs/0507050: (2005) |
| 213 | | David Eppstein,
Michael T. Goodrich,
Jeremy Yu Meng:
Confluent Layered Drawings
CoRR abs/cs/0507051: (2005) |
| 212 | | David Eppstein:
Nonrepetitive Paths and Cycles in Graphs with Application to Sudoku
CoRR abs/cs/0507053: (2005) |
| 211 | | David Eppstein,
Michael T. Goodrich,
Jeremy Yu Meng:
Delta-confluent Drawings
CoRR abs/cs/0510024: (2005) |
| 210 | | David Eppstein:
Cubic Partial Cubes from Simplicial Arrangements
CoRR abs/math/0510263: (2005) |
| 209 | | Erik D. Demaine,
Martin L. Demaine,
David Eppstein,
Greg N. Frederickson,
Erich Friedman:
Hinged dissection of polyominoes and polyforms.
Comput. Geom. 31(3): 237-262 (2005) |
| 208 | | David Eppstein:
The lattice dimension of a graph.
Eur. J. Comb. 26(5): 585-592 (2005) |
| 207 | | Richard Beigel,
David Eppstein:
3-coloring in time O(1.3289n).
J. Algorithms 54(2): 168-204 (2005) |
| 206 | | Matthew Dickerson,
David Eppstein,
Michael T. Goodrich,
Jeremy Yu Meng:
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way.
J. Graph Algorithms Appl. 9(1): 31-52 (2005) |
| 205 | | Tony Givargis,
David Eppstein:
Memory reference caching for activity reduction on address buses.
Microprocessors and Microsystems 29(4): 145-153 (2005) |
| 2004 |
|---|
| 204 |  | Jean Cardinal,
David Eppstein:
Lazy Algorithms for Dynamic Closest Pair with Arbitary Distance Measures.
ALENEX/ANALC 2004: 112-119 |
| 203 | | David Eppstein:
Algorithms for Drawing Media.
Graph Drawing 2004: 173-183 |
| 202 | | David Eppstein,
Michael T. Goodrich,
Jeremy Yu Meng:
Confluent Layered Drawings.
Graph Drawing 2004: 184-194 |
| 201 | | David Eppstein:
Quasiconvex analysis of backtracking algorithms.
SODA 2004: 788-797 |
| 200 | | David Eppstein:
Testing bipartiteness of geometric intersection graphs.
SODA 2004: 860-868 |
| 199 | | Amitabha Bagchi,
Ankur Bhargava,
Amitabh Chaudhary,
David Eppstein,
Christian Scheideler:
The effect of faults on network expansion.
SPAA 2004: 286-293 |
| 198 | | Amitabha Bagchi,
Amitabh Chaudhary,
David Eppstein,
Michael T. Goodrich:
Deterministic sampling and range counting in geometric data streams.
Symposium on Computational Geometry 2004: 144-151 |
| 197 | | Christian A. Duncan,
David Eppstein,
Stephen G. Kobourov:
The geometric thickness of low degree graphs.
Symposium on Computational Geometry 2004: 340-346 |
| 196 | | David Eppstein,
M. Gopi:
Single-strip triangulation of manifolds with arbitrary topology.
Symposium on Computational Geometry 2004: 455-456 |
| 195 | | David Eppstein,
Kevin A. Wortman:
Minimum Dilation Stars
CoRR abs/cs/0412025: (2004) |
| 194 | | David Eppstein:
Quasiconvex Programming
CoRR abs/cs/0412046: (2004) |
| 193 | | M. Gopi,
David Eppstein:
Single-Strip Triangulation of Manifolds with Arbitrary Topology
CoRR cs.CG/0405036: (2004) |
| 192 | | Amitabha Bagchi,
Ankur Bhargava,
Amitabh Chaudhary,
David Eppstein,
Christian Scheideler:
The Effect of Faults on Network Expansion
CoRR cs.DC/0404029: (2004) |
| 191 | | David Eppstein:
The lattice dimension of a graph
CoRR cs.DS/0402028: (2004) |
| 190 | | David Eppstein:
Algorithms for Drawing Media
CoRR cs.DS/0406020: (2004) |
| 189 | | David Eppstein:
All Maximal Independent Sets and Dynamic Dominance for Sparse Graphs
CoRR cs.DS/0407036: (2004) |
| 188 | | David Eppstein,
John M. Sullivan,
Alper Üngör:
Tiling space and slabs with acute tetrahedra.
Comput. Geom. 27(3): 237-255 (2004) |
| 187 | | M. Gopi,
David Eppstein:
Single-Strip Triangulation of Manifolds with Arbitrary Topology.
Comput. Graph. Forum 23(3): 371-380 (2004) |
| 186 | | David Eppstein,
Joseph Wang:
Fast Approximation of Centrality.
J. Graph Algorithms Appl. 8: 39-45 (2004) |
| 2003 |
|---|
| 185 | | Matthew Dickerson,
David Eppstein,
Michael T. Goodrich,
Jeremy Yu Meng:
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way.
Graph Drawing 2003: 1-12 |
| 184 | | Franz-Josef Brandenburg,
David Eppstein,
Michael T. Goodrich,
Stephen G. Kobourov,
Giuseppe Liotta,
Petra Mutzel:
Selected Open Problems in Graph Drawing.
Graph Drawing 2003: 515-539 |
| 183 | | Marshall W. Bern,
David Eppstein:
Möbius-invariant natural neighbor interpolation.
SODA 2003: 128-129 |
| 182 | | David Eppstein:
Dynamic generators of topologically embedded graphs.
SODA 2003: 599-608 |
| 181 | | Marshall W. Bern,
David Eppstein:
Optimized color gamuts for tiled displays.
Symposium on Computational Geometry 2003: 274-281 |
| 180 | | David Eppstein:
The Traveling Salesman Problem for Cubic Graphs.
WADS 2003: 307-318 |
| 179 | | David Eppstein,
John M. Sullivan,
Alper Üngör:
Tiling space and slabs with acute tetrahedra
CoRR cs.CG/0302027: (2003) |
| 178 | | David Eppstein:
Testing Bipartiteness of Geometric Intersection Graphs
CoRR cs.CG/0307023: (2003) |
| 177 | | Amitabha Bagchi,
Amitabh Chaudhary,
David Eppstein,
Michael T. Goodrich:
Deterministic Sampling and Range Counting in Geometric Data Streams
CoRR cs.CG/0307027: (2003) |
| 176 | | Christian A. Duncan,
David Eppstein,
Stephen G. Kobourov:
The Geometric Thickness of Low Degree Graphs
CoRR cs.CG/0312056: (2003) |
| 175 | | David Eppstein:
The traveling salesman problem for cubic graphs
CoRR cs.DS/0302030: (2003) |
| 174 | | David Eppstein:
Quasiconvex Analysis of Backtracking Algorithms
CoRR cs.DS/0304018: (2003) |
| 173 | | Marshall W. Bern,
Erik D. Demaine,
David Eppstein,
Eric Kuo,
Andrea Mantler,
Jack Snoeyink:
Ununfoldable polyhedra with convex faces.
Comput. Geom. 24(2): 51-62 (2003) |
| 172 | | David Eppstein:
Guest Editor's Foreword.
Discrete & Computational Geometry 30(1): 1-2 (2003) |
| 171 | | David Eppstein:
Small Maximal Independent Sets and Faster Exact Graph Coloring.
J. Graph Algorithms Appl. 7(2): 131-140 (2003) |
| 170 | | David Eppstein:
Setting Parameters by Example.
SIAM J. Comput. 32(3): 643-653 (2003) |
| 2002 |
|---|
| 169 | | David Eppstein:
Separating Thickness from Geometric Thickness.
Graph Drawing 2002: 150-161 |
| 168 | | Erik D. Demaine,
David Eppstein,
Jeff Erickson,
George W. Hart,
Joseph O'Rourke:
Vertex-unfoldings of simplicial manifolds.
Symposium on Computational Geometry 2002: 237-243 |
| 167 | | David Eppstein,
Marshall W. Bern,
Brad L. Hutchings:
Algorithms for Coloring Quadtrees.
Algorithmica 32(1): 87-94 (2002) |
| 166 | | Marshall W. Bern,
David Eppstein:
Moebius-Invariant Natural Neighbor Interpolation
CoRR cs.CG/0207081: (2002) |
| 165 | | Marshall W. Bern,
David Eppstein:
Optimized Color Gamuts for Tiled Displays
CoRR cs.CG/0212007: (2002) |
| 164 | | Matthew Dickerson,
David Eppstein,
Michael T. Goodrich,
Jeremy Yu Meng:
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
CoRR cs.CG/0212046: (2002) |
| 163 | | David Eppstein,
Joseph Wang:
A steady state model for graph power laws
CoRR cs.DM/0204001: (2002) |
| 162 | | David Eppstein,
Jean-Claude Falmagne:
Algorithms for Media
CoRR cs.DS/0206033: (2002) |
| 161 | | David Eppstein:
Dynamic Generators of Topologically Embedded Graphs
CoRR cs.DS/0207082: (2002) |
| 160 | | David Eppstein:
Separating Thickness from Geometric Thickness
CoRR math.CO/0204252: (2002) |
| 159 | | David Eppstein:
Beta-skeletons have unbounded dilation.
Comput. Geom. 23(1): 43-52 (2002) |
| 158 | | Marshall W. Bern,
David Eppstein:
Multivariate Regression Depth.
Discrete & Computational Geometry 28(1): 1-17 (2002) |
| 157 | | Marshall W. Bern,
David Eppstein,
Jeff Erickson:
Flipping Cubical Meshes.
Eng. Comput. (Lond.) 18(3): 173-187 (2002) |
| 156 | | David Eppstein,
George S. Lueker:
The minimum expectation selection problem.
Random Struct. Algorithms 21(3-4): 278-292 (2002) |
| 2001 |
|---|
| 155 | | David Eppstein,
Joseph Wang:
Fast approximation of centrality.
SODA 2001: 228-229 |
| 154 | | David Eppstein:
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction.
SODA 2001: 329-337 |
| 153 | | David Eppstein,
S. Muthukrishnan:
Internet packet filter management and rectangle geometry.
SODA 2001: 827-835 |
| 152 | | Marshall W. Bern,
David Eppstein:
Optimization over Zonotopes and Training Support Vector Machines.
WADS 2001: 111-121 |
| 151 | | Marshall W. Bern,
David Eppstein:
Optimal Möbius Transformations for Information Visualization and Meshing.
WADS 2001: 14-25 |
| 150 | | David Eppstein:
Small Maximal Independent Sets and Faster Exact Graph Coloring.
WADS 2001: 462-470 |
| 149 | | Marshall W. Bern,
David Eppstein:
Optimal Moebius Transformations for Information Visualization and Meshing
CoRR cs.CG/0101006: (2001) |
| 148 | | Marshall W. Bern,
David Eppstein:
Optimization Over Zonotopes and Training Support Vector Machines
CoRR cs.CG/0105017: (2001) |
| 147 | | David Eppstein:
Hinged Kite Mirror Dissection
CoRR cs.CG/0106032: (2001) |
| 146 | | Erik D. Demaine,
David Eppstein,
Jeff Erickson,
George W. Hart,
Joseph O'Rourke:
Vertex-Unfoldings of Simplicial Polyhedra
CoRR cs.CG/0107023: (2001) |
| 145 | | Marshall W. Bern,
David Eppstein,
Jeff Erickson:
Flipping Cubical Meshes
CoRR cs.CG/0108020: (2001) |
| 144 | | Erik D. Demaine,
David Eppstein,
Jeff Erickson,
George W. Hart,
Joseph O'Rourke:
Vertex-Unfoldings of Simplicial Manifolds
CoRR cs.CG/0110054: (2001) |
| 143 | | David Eppstein,
George S. Lueker:
The Minimum Expectation Selection Problem
CoRR cs.DS/0110011: (2001) |
| 142 | | David Eppstein:
Separating Geometric Thickness from Book Thickness
CoRR math.CO/0109195: (2001) |
| 141 | | Xianping Ge,
David Eppstein,
Padhraic Smyth:
The distribution of loop lengths in graphical models for turbo decoding.
IEEE Transactions on Information Theory 47(6): 2549-2553 (2001) |
| 2000 |
|---|
| 140 | | Marshall W. Bern,
David Eppstein:
Multivariate regression depth.
Symposium on Computational Geometry 2000: 315-321 |
| 139 | | David Eppstein:
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs.
ACM Journal of Experimental Algorithmics 5: 1 (2000) |
| 138 | | David Eppstein:
Diameter and Treewidth in Minor-Closed Graph Families.
Algorithmica 27(3): 275-291 (2000) |
| 137 | | David Eppstein:
Searching for Spaceships
CoRR cs.AI/0004003: (2000) |
| 136 | | Erik D. Demaine,
Martin L. Demaine,
David Eppstein:
Phutball Endgames are Hard
CoRR cs.CC/0008025: (2000) |
| 135 | | Marshall W. Bern,
David Eppstein:
Computing the Depth of a Flat
CoRR cs.CG/0009024: (2000) |
| 134 | | David Eppstein,
S. Muthukrishnan:
Internet Packet Filter Management and Rectangle Geometry
CoRR cs.CG/0010018: (2000) |
| 133 | | Richard Beigel,
David Eppstein:
3-Coloring in Time O(1.3289^n)
CoRR cs.DS/0006046: (2000) |
| 132 | | David Eppstein,
Joseph Wang:
Fast Approximation of Centrality
CoRR cs.DS/0009005: (2000) |
| 131 | | David Eppstein:
Improved Algorithms for 3-Coloring, 3-Edge-Coloring, and Constraint Satisfaction
CoRR cs.DS/0009006: (2000) |
| 130 | | David Eppstein:
Small Maximal Independent Sets and Faster Exact Graph Coloring
CoRR cs.DS/0011009: (2000) |
| 129 | | Cristopher Moore,
David Eppstein:
One-Dimensional Peg Solitaire
CoRR math.CO/0006067: (2000) |
| 128 | | Cristopher Moore,
David Eppstein:
One-Dimensional Peg Solitaire, and Duotaire
CoRR math.CO/0008172: (2000) |
| 127 | | Nina Amenta,
Marshall W. Bern,
David Eppstein,
Shang-Hua Teng:
Regression Depth and Center Points.
Discrete & Computational Geometry 23(3): 305-323 (2000) |
| 126 | | Marshall W. Bern,
David Eppstein:
Quadrilateral Meshing by Circle Packing.
Int. J. Comput. Geometry Appl. 10(4): 347-360 (2000) |
| 125 | | David Eppstein:
Incremental and Decremental Maintenance of Planar Width.
J. Algorithms 37(2): 570-577 (2000) |
| 124 | | Michael B. Dillencourt,
David Eppstein,
Daniel S. Hirschberg:
Geometric Thickness of Complete Graphs.
J. Graph Algorithms Appl. 4(3): 5-17 (2000) |
| 123 | | David Eppstein:
Clustering for faster network simplex pivots.
Networks 35(3): 173-180 (2000) |
| 1999 |
|---|
| 122 | | Erik D. Demaine,
Martin L. Demaine,
David Eppstein,
Erich Friedman:
Hinged dissections of polyominoes and polyforms.
CCCG 1999 |
| 121 | | Marshall W. Bern,
Erik D. Demaine,
David Eppstein,
Eric Kuo:
Ununfoldable polyhedra.
CCCG 1999 |
| 120 | | David Eppstein:
Setting Parameters by Example.
FOCS 1999: 309-318 |
| 119 | | David Eppstein,
David Hart:
Shortest Paths in an Arrangement with k Line Orientations.
SODA 1999: 310-316 |
| 118 | | David Eppstein:
Incremental and Decremental Maintenance of Planar Width.
SODA 1999: 899-900 |
| 117 | | Erik D. Demaine,
Martin L. Demaine,
David Eppstein,
Greg N. Frederickson,
Erich Friedman:
Hinged Dissection of Polyominoes and Polyforms
CoRR cs.CG/9907018: (1999) |
| 116 | | David Eppstein,
Marshall W. Bern,
Brad L. Hutchings:
Algorithms for Coloring Quadtrees
CoRR cs.CG/9907030: (1999) |
| 115 | | David Eppstein:
Beta-Skeletons have Unbounded Dilation
CoRR cs.CG/9907031: (1999) |
| 114 | | Marshall W. Bern,
Erik D. Demaine,
David Eppstein,
Eric Kuo,
Andrea Mantler,
Jack Snoeyink:
Ununfoldable Polyhedra with Convex Faces
CoRR cs.CG/9908003: (1999) |
| 113 | | Marshall W. Bern,
David Eppstein:
Quadrilateral Meshing by Circle Packing
CoRR cs.CG/9908016: (1999) |
| 112 | | 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
CoRR cs.CG/9909001: (1999) |
| 111 | | Marshall W. Bern,
David Eppstein:
Multivariate Regression Depth
CoRR cs.CG/9912013: (1999) |
| 110 | | Xianping Ge,
David Eppstein,
Padhraic Smyth:
The Distribution of Cycle Lengths in Graphical Models for Iterative Decoding
CoRR cs.DM/9907002: (1999) |
| 109 | | David Eppstein:
Setting Parameters by Example
CoRR cs.DS/9907001: (1999) |
| 108 | | David Eppstein:
Subgraph Isomorphism in Planar Graphs and Related Problems
CoRR cs.DS/9911003: (1999) |
| 107 | | David Eppstein:
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
CoRR cs.DS/9912014: (1999) |
| 106 | | Michael B. Dillencourt,
David Eppstein,
Daniel S. Hirschberg:
Geometric Thickness of Complete Graphs
CoRR math.CO/9910185: (1999) |
| 105 | | David Eppstein:
Linear complexity hexahedral mesh generation.
Comput. Geom. 12(1-2): 3-16 (1999) |
| 104 | | David Eppstein,
Jeff Erickson:
Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions.
Discrete & Computational Geometry 22(4): 569-592 (1999) |
| 103 | | Marshall W. Bern,
David Eppstein,
Shang-Hua Teng:
Parallel Construction of Quadtrees and Quality Triangulations.
Int. J. Comput. Geometry Appl. 9(6): 517-532 (1999) |
| 102 | | Nina Amenta,
Marshall W. Bern,
David Eppstein:
Optimal Point Placement for Mesh Smoothing.
J. Algorithms 30(2): 302-322 (1999) |
| 101 | | David Eppstein,
Giuseppe F. Italiano:
PREFACE: Festschrift for Zvi Galil.
J. Complexity 15(1): 1-3 (1999) |
| 100 | | David Eppstein:
Subgraph Isomorphism in Planar Graphs and Related Problems.
J. Graph Algorithms Appl. 3(3): (1999) |
| 1998 |
|---|
| 99 | | Pankaj K. Agarwal,
David Eppstein,
Leonidas J. Guibas,
Monika Rauch Henzinger:
Parametric and Kinetic Minimum Spanning Trees.
FOCS 1998: 596-605 |
| 98 | | Michael B. Dillencourt,
David Eppstein,
Daniel S. Hirschberg:
Geometric Thickness of Complete Graphs.
Graph Drawing 1998: 101-110 |
| 97 | | David Eppstein:
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs.
SODA 1998: 619-628 |
| 96 | | David Eppstein,
Jeff Erickson:
Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions.
Symposium on Computational Geometry 1998: 58-67 |
| 95 | | Nina Amenta,
Marshall W. Bern,
David Eppstein,
Shang-Hua Teng:
Regression Depth and Center Points
CoRR cs.CG/9809037: (1998) |
| 94 | | David Eppstein:
Incremental and Decremental Maintenance of Planar Width
CoRR cs.CG/9809038: (1998) |
| 93 | | Nina Amenta,
Marshall W. Bern,
David Eppstein:
Optimal Point Placement for Mesh Smoothing
CoRR cs.CG/9809081: (1998) |
| 92 | | David Eppstein:
Linear Complexity Hexahedral Mesh Generation
CoRR cs.CG/9809109: (1998) |
| 91 | | Gill Barequet,
Matthew Dickerson,
David Eppstein:
On triangulating three-dimensional polygons.
Comput. Geom. 10(3): 155-170 (1998) |
| 90 | | David Eppstein:
Geometric Lower Bounds for Parametric Matroid Optimization.
Discrete & Computational Geometry 20(4): 463-476 (1998) |
| 89 | | Nina Amenta,
Marshall W. Bern,
David Eppstein:
The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction.
Graphical Models and Image Processing 60(2): 125-135 (1998) |
| 88 | | David Eppstein,
Zvi Galil,
Giuseppe F. Italiano,
Thomas H. Spencer:
Separator-Based Sparsification II: Edge and Vertex Connectivity.
SIAM J. Comput. 28(1): 341-381 (1998) |
| 87 | | David Eppstein:
Finding the k Shortest Paths.
SIAM J. Comput. 28(2): 652-673 (1998) |
| 1997 |
|---|
| 86 | | David Eppstein:
Faster Construction of Planar Two-Centers.
SODA 1997: 131-138 |
| 85 | | Nina Amenta,
Marshall W. Bern,
David Eppstein:
Optimal Point Placement for Mesh Smoothing.
SODA 1997: 528-537 |
| 84 | | David Eppstein,
David Hart:
An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments.
WADS 1997: 234-247 |
| 83 | | David Eppstein:
Faster Geometric K-point MST Approximation.
Comput. Geom. 8: 231-240 (1997) |
| 82 | | David Eppstein,
Mike Paterson,
F. Frances Yao:
On Nearest-Neighbor Graphs.
Discrete & Computational Geometry 17(3): 263-282 (1997) |
| 81 | | David Eppstein:
Dynamic Connectivity in Digital Images.
Inf. Process. Lett. 62(3): 121-126 (1997) |
| 80 | | David Eppstein:
Faster Circle Packing with Application to Non-Obtuse Triangulation.
Int. J. Comput. Geometry Appl. 7(5): 485-492 (1997) |
| 79 | | David Eppstein,
Zvi Galil,
Giuseppe F. Italiano,
Amnon Nissenzweig:
Sparsification - a technique for speeding up dynamic graph algorithms.
J. ACM 44(5): 669-696 (1997) |
| 78 | | David Eppstein:
Minimum Range Balanced Cuts via Dynamic Subset Sums.
J. Algorithms 23(2): 375-385 (1997) |
| 77 | | David Eppstein,
Daniel S. Hirschberg:
Choosing Subsets with Maximum Weighted Average.
J. Algorithms 24(1): 177-193 (1997) |
| 1996 |
|---|
| 76 | | David Fernández-Baca,
Giora Slutzki,
David Eppstein:
Using Sparsification for Parametric Minimum Spanning Tree Problems.
SWAT 1996: 149-160 |
| 75 | | Gill Barequet,
Matthew Dickerson,
David Eppstein:
On Triangulating Three-Dimensional Polygons.
Symposium on Computational Geometry 1996: 38-47 |
| 74 | | David Eppstein:
Linear Complexity Hexahedral Mesh Generation.
Symposium on Computational Geometry 1996: 58-67 |
| 73 | | David P. Dobkin,
David Eppstein,
Don P. Mitchell:
Computing the Discrepancy with Applications to Supersampling Patterns.
ACM Trans. Graph. 15(4): 354-376 (1996) |
| 72 | | David Eppstein:
Average Case Analysis of Dynamic Geometric Optimization.
Comput. Geom. 6: 45-68 (1996) |
| 71 | | Kenneth L. Clarkson,
David Eppstein,
Gary L. Miller,
Carl Sturtivant,
Shang-Hua Teng:
Approximating center points with iterative Radon points.
Int. J. Comput. Geometry Appl. 6(3): 357-377 (1996) |
| 70 | | David Eppstein,
Zvi Galil,
Giuseppe F. Italiano,
Thomas H. Spencer:
Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees.
J. Comput. Syst. Sci. 52(1): 3-27 (1996) |
| 69 | | David Fernández-Baca,
Giora Slutzki,
David Eppstein:
Using Sparsification for Parametric Minimum Spanning Tree Problems.
Nord. J. Comput. 3(4): 352-366 (1996) |
| 1995 |
|---|
| 68 | | Marshall W. Bern,
David Eppstein,
Leonidas J. Guibas,
John Hershberger,
Subhash Suri,
Jan Wolter:
The Centroid of Points with Approximate Weights.
ESA 1995: 460-472 |
| 67 | | Richard Beigel,
David Eppstein:
3-Coloring in Time O(1.3446n): A No-MIS Algorithm.
FOCS 1995: 444-452 |
| 66 | | Marshall W. Bern,
L. Paul Chew,
David Eppstein,
Jim Ruppert:
Dihedral Bounds for Mesh Generation in High Dimensions.
SODA 1995: 189-196 |
| 65 | | David Eppstein:
Subgraph Isomorphism in Planar Graphs and Related Problems.
SODA 1995: 632-640 |
| 64 | | David Eppstein:
Geometric lower bounds for parametric matroid optimization.
STOC 1995: 662-671 |
| 63 | | David Eppstein:
Asymptotic Speed-Ups in Constructive Solid Geometry.
Algorithmica 13(5): 462-471 (1995) |
| 62 | | Matthew Dickerson,
David Eppstein:
Algorithms for Proximity Problems in Higher Dimensions.
Comput. Geom. 5: 277-291 (1995) |
| 61 | | David Eppstein:
Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions.
Discrete & Computational Geometry 13: 111-122 (1995) |
| 60 | | Richard Beigel,
David Eppstein:
3-Coloring in time O(1.3446n): A no-MIS Algorithm
Electronic Colloquium on Computational Complexity (ECCC) 2(33): (1995) |
| 59 | | David Eppstein,
Gary L. Miller,
Shang-Hua Teng:
A Deterministic Linear Time Algorithm for Geometric Separators and its Applications.
Fundam. Inform. 22(4): 309-329 (1995) |
| 58 | | Marshall W. Bern,
David P. Dobkin,
David Eppstein:
Triangulating polygons without large angles.
Int. J. Comput. Geometry Appl. 5: 171-192 (1995) |
| 1994 |
|---|
| 57 | | David Eppstein:
Finding the k Shortest Paths
FOCS 1994: 154-165 |
| 56 | | David Eppstein:
Clustering for Faster Network Simplex Pivots.
SODA 1994: 160-166 |
| 55 | | David Eppstein:
Average Case Analysis of Dynamic Geometric Optimization.
SODA 1994: 77-86 |
| 54 | | Marshall W. Bern,
David P. Dobkin,
David Eppstein,
Robert L. Grossman:
Visibility with a Moving Point of View.
Algorithmica 11(4): 360-378 (1994) |
| 53 | | David Eppstein:
Approximating the Minimum Weight Steiner Triangulation.
Discrete & Computational Geometry 11: 163-191 (1994) |
| 52 | | David Eppstein,
Jeff Erickson:
Iterated Nearest Neighbors and Finding Minimal Polytopes.
Discrete & Computational Geometry 11: 321-350 (1994) |
| 51 | | Boris Aronov,
Marshall W. Bern,
David Eppstein:
On the Number of Minimal 1-Steiner Trees.
Discrete & Computational Geometry 12: 29-34 (1994) |
| 50 | | David Eppstein:
Arboricity and Bipartite Subgraph Listing Algorithms.
Inf. Process. Lett. 51(4): 207-211 (1994) |
| 49 | | David Eppstein:
Tree-weighted neighbors and geometric k smallest spanning trees.
Int. J. Comput. Geometry Appl. 4(2): 229-238 (1994) |
| 48 | | David Eppstein:
Offline Algorithms for Dynamic Minimum Spanning Tree Problems.
J. Algorithms 17(2): 237-250 (1994) |
| 47 | | Marshall W. Bern,
David Eppstein,
John R. Gilbert:
Provably Good Mesh Generation.
J. Comput. Syst. Sci. 48(3): 384-409 (1994) |
| 1993 |
|---|
| 46 | | David Eppstein,
Jeff Erickson:
Iterated Nearest Neighbors and Finding Minimal Polytopes.
SODA 1993: 64-73 |
| 45 | | David Eppstein,
Zvi Galil,
Giuseppe F. Italiano,
Thomas H. Spencer:
Separator based sparsification for dynamic planar graph algorithms.
STOC 1993: 208-217 |
| 44 | | Marshall W. Bern,
David Eppstein:
Worst-Case Bounds for Subadditive Geometric Graphs.
Symposium on Computational Geometry 1993: 183-188 |
| 43 | | David P. Dobkin,
David Eppstein:
Computing the Discrepancy.
Symposium on Computational Geometry 1993: 47-52 |
| 42 | | Kenneth L. Clarkson,
David Eppstein,
Gary L. Miller,
Carl Sturtivant,
Shang-Hua Teng:
Approximating Center Points with Iterated Radon Points.
Symposium on Computational Geometry 1993: 91-98 |
| 41 | | David Eppstein,
Gary L. Miller,
Shang-Hua Teng:
A Deterministic Linear Time Algorithm for Geometric Separators and its Applications.
Symposium on Computational Geometry 1993: 99-108 |
| 40 | | Marshall W. Bern,
David Eppstein,
Shang-Hua Teng:
Parallel Construction of Quadtrees and Quality Triangulations.
WADS 1993: 188-199 |
| 39 | | Marshall W. Bern,
Herbert Edelsbrunner,
David Eppstein,
Sandra L. Mitchell,
Tiow Seng Tan:
Edge Insertion for Optimal Triangulations.
Discrete & Computational Geometry 10: 47-65 (1993) |
| 38 | | 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.
J. Algorithms 15(1): 173 (1993) |
| 37 | | David Eppstein:
Improved Bounds for Intersecting Triangles and Halving Planes.
J. Comb. Theory, Ser. A 62(1): 176-182 (1993) |
| 1992 |
|---|
| 36 | | David Eppstein,
Zvi Galil,
Giuseppe F. Italiano,
Amnon Nissenzweig:
Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract)
FOCS 1992: 60-69 |
| 35 | | Pankaj K. Agarwal,
David Eppstein,
Jirí Matousek:
Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees
FOCS 1992: 80-89 |
| 34 | | Marshall W. Bern,
Herbert Edelsbrunner,
David Eppstein,
Sandra L. Mitchell,
Tiow Seng Tan:
Edge Insertion for Optional Triangulations.
LATIN 1992: 46-60 |
| 33 | | David Eppstein:
Approximating the Minimum Weight Triangulation.
SODA 1992: 48-57 |
| 32 | | David Eppstein:
New Algorithms for Minimum Area k-gons.
SODA 1992: 83-88 |
| 31 | | Marshall W. Bern,
David P. Dobkin,
David Eppstein:
Triangulating Polygons without Large Angles.
Symposium on Computational Geometry 1992: 222-231 |
| 30 | | David Eppstein:
Finding the k Smallest Spanning Trees.
BIT 32(2): 237-248 (1992) |
| 29 | | David Eppstein,
Mark H. Overmars,
Günter Rote,
Gerhard J. Woeginger:
Finding Minimum Area k-gons.
Discrete & Computational Geometry 7: 45-58 (1992) |
| 28 | | David Eppstein:
Dynamic Three-Dimensional Linear Programming.
INFORMS Journal on Computing 4(4): 360-368 (1992) |
| 27 | | David Eppstein:
Parallel Recognition of Series-Parallel Graphs
Inf. Comput. 98(1): 41-55 (1992) |
| 26 | | Marshall W. Bern,
David Eppstein:
Polynomial-size nonobtuse triangulation of polygons.
Int. J. Comput. Geometry Appl. 2(3): 241-255 (1992) |
| 25 | | Marshall W. Bern,
David Eppstein:
Erratum: Polynomial-size nonobtuse triangulation of polygons.
Int. J. Comput. Geometry Appl. 2(4): 449-450 (1992) |
| 24 | | David Eppstein,
Zvi Galil,
Raffaele Giancarlo,
Giuseppe F. Italiano:
Sparse Dynamic Programming I: Linear Cost Functions.
J. ACM 39(3): 519-545 (1992) |
| 23 | | David Eppstein,
Zvi Galil,
Raffaele Giancarlo,
Giuseppe F. Italiano:
Sparse Dynamic Programming II: Convex and Concave Cost Functions.
J. ACM 39(3): 546-567 (1992) |
| 22 | | 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.
J. Algorithms 13(1): 33-54 (1992) |
| 21 | | David Eppstein,
Lane A. Hemachandra,
James Tisdall,
Bülent Yener:
Simultaneous Strong Separations of Probabilistic and Unambiguous Complexity Classes.
Mathematical Systems Theory 25(1): 23-36 (1992) |
| 1991 |
|---|
| 20 | | David Eppstein:
Dynamic Three-Dimensional Linear Programming
FOCS 1991: 488-494 |
| 19 | | Marshall W. Bern,
David Eppstein,
F. Frances Yao:
The Expected Extremes in a Delaunay Triangulation.
ICALP 1991: 674-685 |
| 18 | | Marek Chrobak,
David Eppstein,
Giuseppe F. Italiano,
Moti Yung:
Efficient Sequential and Parallel Algorithms for Computing Recovery Points in Trees and Paths.
SODA 1991: 158-167 |
| 17 | | Marshall W. Bern,
David Eppstein:
Polynomial-Size Nonobtuse Triangulation of Polygons.
Symposium on Computational Geometry 1991: 342-350 |
| 16 | | David Eppstein:
Offline Algorithms for Dynamic Minimum Spanning Tree Problems.
WADS 1991: 392-399 |
| 15 | | David Eppstein:
The Farthest Point Delaunay Triangulation Minimizes Angles.
Comput. Geom. 1: 143-148 (1991) |
| 14 | | Marshall W. Bern,
David Eppstein,
F. Frances Yao:
The expected extremes in a Delaunay triangulation.
Int. J. Comput. Geometry Appl. 1(1): 79-91 (1991) |
| 13 | | Marek Chrobak,
David Eppstein:
Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices.
Theor. Comput. Sci. 86(2): 243-266 (1991) |
| 1990 |
|---|
| 12 | | Marshall W. Bern,
David Eppstein,
John R. Gilbert:
Provably Good Mesh Generation
FOCS 1990: 231-241 |
| 11 | | 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.
SODA 1990: 1-11 |
| 10 | | Marshall W. Bern,
David P. Dobkin,
David Eppstein,
Robert L. Grossman:
Visibility with a Moving Point of View.
SODA 1990: 107-117 |
| 9 | | David Eppstein,
Zvi Galil,
Raffaele Giancarlo,
Giuseppe F. Italiano:
Sparse Dynamic Programming.
SODA 1990: 513-522 |
| 8 | | David Eppstein:
Finding the k Smallest Spanning Trees.
SWAT 1990: 38-47 |
| 7 | | David Eppstein,
Joan Feigenbaum,
Chung-Lun Li:
Equipartitions of graphs.
Discrete Mathematics 91(3): 239-248 (1990) |
| 6 | | David Eppstein:
Sequence Comparison with Mixed Convex and Concave Costs.
J. Algorithms 11(1): 85-101 (1990) |
| 5 | | David Eppstein:
Reset Sequences for Monotonic Automata.
SIAM J. Comput. 19(3): 500-510 (1990) |
| 1989 |
|---|
| 4 | | David Eppstein,
Zvi Galil:
Parallel Algorithmic Techniques for Combinatorial Computation.
ICALP 1989: 304-318 |
| 1988 |
|---|
| 3 | | David Eppstein,
Zvi Galil,
Raffaele Giancarlo:
Speeding up Dynamic Programming
FOCS 1988: 488-496 |
| 2 | | David Eppstein:
Reset Sequences for Finite Automata with Application to Design of Parts Orienters.
ICALP 1988: 230-238 |
| 1985 |
|---|
| 1 | | David Eppstein:
A Heuristic Approach to Program Inversion.
IJCAI 1985: 219-221 |
