| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | David Eppstein |
Solving Single-digit Sudoku Subproblems  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg |
Lombardi Drawings of Graphs. |
J. Graph Algorithms Appl. |
2012 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein |
Optimally Fast Incremental Manhattan Plane Embedding and Planar Tight Span Construction. |
JoCG |
2011 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich |
Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters. |
IEEE Trans. Knowl. Data Eng. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich |
Succinct Greedy Geometric Routing Using Hyperbolic Geometry. |
IEEE Trans. Computers |
2011 |
DBLP DOI BibTeX RDF |
autocratic weight-balanced trees, dyadic tree metric space, Greedy routing, hyperbolic geometry |
| 1 | Sergio Cabello, David Eppstein, Sandi Klavzar |
The Fibonacci Dimension of a Graph. |
Electr. J. Comb. |
2011 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Darren Strash |
Listing All Maximal Cliques in Large Sparse Real-World Graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Michael J. Bannister, David Eppstein |
Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott |
Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Full) |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Gill Barequet, Matthew T. Dickerson, David Eppstein, David Hodorkovsky, Kira Vyatkina |
On 2-Site Voronoi Diagrams under Geometric Distance Functions |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Maarten Löffler |
Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Michael J. Bannister, David Eppstein |
Randomized Speedup of the Bellman-Ford Algorithm |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler |
Planar and Poly-Arc Lombardi Drawings |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott |
Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Short) |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Joseph A. Simons |
Confluent Hasse diagrams |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich, Maarten Löffler |
Tracking Moving Objects with Few Handovers |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira |
Adjacency-Preserving Spatial Treemaps |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich, Pierre Baldi |
Privacy-Enhanced Methods for Comparing Compressed DNA Sequences |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Kevin A. Wortman |
Optimal Angular Resolution for Face-Symmetric Drawings. |
J. Graph Algorithms Appl. |
2011 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Emden R. Gansner |
Guest Editor's Foreword. |
J. Graph Algorithms Appl. |
2011 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein |
Recognizing Partial Cubes in Quadratic Time. |
J. Graph Algorithms Appl. |
2011 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich, Maarten Löffler, Darren Strash, Lowell Trott |
Category-based routing in social networks: Membership dimension and the small-world phenomenon. |
CASoN |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Maarten Löffler |
Bounds on the complexity of halfspace intersections when the bounded faces have small dimension. |
Symposium on Computational Geometry |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Darren Strash |
Listing All Maximal Cliques in Large Sparse Real-World Graphs. |
SEA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich, Frank Uyeda, George Varghese |
What's the difference?: efficient set reconciliation without prior context. |
SIGCOMM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich, Maarten Löffler |
Tracking Moving Objects with Few Handovers. |
WADS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira |
Adjacency-Preserving Spatial Treemaps. |
WADS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Maarten Löffler |
Planar and Poly-arc Lombardi Drawings. |
Graph Drawing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael J. Bannister, David Eppstein |
Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings. |
Graph Drawing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Joseph A. Simons |
Confluent Hasse Diagrams. |
Graph Drawing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein |
Happy Endings for Flip Graphs. |
JoCG |
2010 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein |
Densities of Minor-Closed Graph Families. |
Electr. J. Comb. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg |
Drawing Trees with Perfect Angular Resolution and Polynomial Area |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg |
Lombardi Drawings of Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein |
Regular Labelings and Geometric Structures |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg |
Optimal 3D Angular Resolution for Low-Degree Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler |
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Maarten Löffler, Darren Strash |
Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Matthew T. Dickerson, David Eppstein, Michael T. Goodrich |
Cloning Voronoi Diagrams via Retroactive Data Structures |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich, Roberto Tamassia |
Privacy-Preserving Data-Oblivious Geometric Algorithms for Geographic Data |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Erin W. Chambers, David Eppstein |
Flows in One-Crossing-Minor-Free Graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott |
Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Hans-Jürgen Bandelt, Victor Chepoi, David Eppstein |
Combinatorics and Geometry of Finite and Infinite Squaregraphs. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dave Clarke, David Eppstein, Kaveh Ghasemloo, Lev Reyzin, András Z. Salamon, Peter W. Shor, Aaron Sterling, Suresh Venkatasubramanian |
Questions answered. in theory.: http: //cstheory.stackexchange.com/. |
SIGACT News |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich, Darren Strash |
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew T. Dickerson, David Eppstein, Michael T. Goodrich |
Cloning Voronoi Diagrams via Retroactive Data Structures. |
ESA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein |
Paired Approximation Problems and Incompatible Inapproximabilities. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Matthew Dickerson, David Eppstein, Kevin A. Wortman |
Planar Voronoi Diagrams for Sums of Convex Functions, Smoothed Distance and Dilation. |
ISVD |
2010 |
DBLP DOI BibTeX RDF |
biotope transform metric, Lloyd's algorithm, pseudocircle, pseudoline, smoothed distance, randomized algorithms, Voronoi diagram, dilation, convex function |
| 1 | David Eppstein, Elena Mumford |
Steinitz theorems for orthogonal polyhedra. |
Symposium on Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
Steinitz theorem, orthogonal polyhedron, planar graph |
| 1 | David Eppstein |
Regular labelings and geometric structures. |
CCCG |
2010 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich, Darren Strash, Lowell Trott |
Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures. |
COCOA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | John Augustine, David Eppstein, Kevin A. Wortman |
Approximate Weighted Farthest Neighbors and Minimum Dilation Stars. |
COCOON |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Erin W. Chambers, David Eppstein |
Flows in One-Crossing-Minor-Free Graphs. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein |
Regular Labelings and Geometric Structures. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Maarten Löffler, Darren Strash |
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Erin W. Chambers, David Eppstein, Michael T. Goodrich, Maarten Löffler |
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area. |
Graph Drawing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg |
Optimal 3D Angular Resolution for Low-Degree Graphs. |
Graph Drawing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Emden R. Gansner (eds.) |
Graph Drawing, 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers |
Graph Drawing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg |
Drawing Trees with Perfect Angular Resolution and Polynomial Area. |
Graph Drawing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Martin Nöllenburg |
Lombardi Drawings of Graphs. |
Graph Drawing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich, Roberto Tamassia |
Privacy-preserving data-oblivious geometric algorithms for geographic data. |
GIS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf |
Approximate topological matching of quad meshes. |
The Visual Computer |
2009 |
DBLP DOI BibTeX RDF |
Topological matching, Lazy-greedy heuristic, NP-complete, NP-hard, Isomorphism, Quad mesh |
| 1 | David Eppstein |
Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition. |
ACM Transactions on Algorithms |
2009 |
DBLP DOI BibTeX RDF |
pants decomposition, sum of cluster sizes, approximation algorithm, Hierarchical clustering, minimum spanning tree, hyperbolic geometry |
| 1 | David Eppstein |
All maximal independent sets and dynamic dominance for sparse graphs. |
ACM Transactions on Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein |
Testing bipartiteness of geometric intersection graphs. |
ACM Transactions on Algorithms |
2009 |
DBLP DOI BibTeX RDF |
Hopcroft's problem, coin graph, geometric thickness, graph coloring, minimum spanning tree, Bipartite graph, line segments, disks, intersection graph |
| 1 | David Eppstein |
Graph-Theoretic Solutions to Computational Geometry Problems |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Elena Mumford |
Orientation-Constrained Rectangular Layouts |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek |
Area-Universal Rectangular Layouts |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Emma S. Spiro |
The h-Index of a Graph and its Application to Dynamic Subgraph Statistics |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein |
Optimally fast incremental Manhattan plane embedding and planar tight span construction |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein |
Paired approximation problems and incompatible inapproximabilities |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Elena Mumford |
Steinitz Theorems for Orthogonal Polyhedra |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Kevin A. Wortman |
Optimal Embedding Into Star Metrics |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich, Lowell Trott |
Going Off-road: Transversal Complexity in Road Networks |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Sergio Cabello, David Eppstein, Sandi Klavzar |
The Fibonacci dimension of a graph |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Kevin A. Wortman |
Optimal Angular Resolution for Face-Symmetric Drawings |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2009 |
DBLP BibTeX RDF |
|
| 1 | Pablo Diaz-Gutierrez, David Eppstein, Meenakshisundaram Gopi |
Curvature Aware Fundamental Cycles. |
Comput. Graph. Forum |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann |
Edges and switches, tunnels and bridges. |
Comput. Geom. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein |
Finding Large Clique Minors is Hard. |
J. Graph Algorithms Appl. |
2009 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein |
Graph-Theoretic Solutions to Computational Geometry Problems. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich, Darren Strash |
Linear-time algorithms for geometric graphs with sublinearly many crossings. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Elena Mumford |
Self-overlapping curves revisited. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
two-site distance functions, complexity, animation, Voronoi diagrams |
| 1 | David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek |
Area-universal rectangular layouts. |
Symposium on Computational Geometry |
2009 |
DBLP DOI BibTeX RDF |
rectangular layouts |
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Elena Mumford |
Orientation-Constrained Rectangular Layouts. |
WADS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Emma S. Spiro |
The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics. |
WADS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Kevin A. Wortman |
Optimal Embedding into Star Metrics. |
WADS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich, Lowell Trott |
Going off-road: transversal complexity in road networks. |
GIS |
2009 |
DBLP DOI BibTeX RDF |
edge crossings, multiscale-dispersed graphs, ray-shooting data structures, road networks, geometric graphs, line transversals |
| 1 | David Eppstein, Elena Mumford |
Self-overlapping Curves Revisited |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman |
Straight Skeletons of Three-Dimensional Polyhedra |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich, Darren Strash |
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich |
Succinct Greedy Graph Drawing in the Hyperbolic Plane |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein |
Isometric Diamond Subgraphs |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein |
Finding Large Clique Minors is Hard |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein |
Learning Sequences |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Matthew Dickerson, David Eppstein, Kevin A. Wortman |
Dilation, smoothed distance, and minimization diagrams of convex functions |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich |
Studying (Non-Planar) Road Networks Through an Algorithmic Lens |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf |
Motorcycle Graphs: Canonical Quad Mesh Partitioning. |
Comput. Graph. Forum |
2008 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")