DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» David Eppstein
David Eppstein
Knowledge Spaces Applications in Education Knowledge Spaces
[PDF]246.8Kb
Drawing Graphs and Maps with Curves
Forbidden Configurations in Discrete Geometry
Graphs in Nature
Sparsification–A Technique for Speeding up Dynamic Graph Algorithms
Dynamic Generators of Topologically Embedded Graphs David Eppstein
Listing K-Cliques in Sparse Real-World Graphs Maximilien Danisch, Oana Balalau, Mauro Sozio
R, 44, 177 Abu-Khzam, Faisal N., 51 Agarwal, Pankaj K., 61, 190
Quasiconvex Programming
Graph-Theoretic Solutions to Computational Geometry Problems
Reactive Proximity Data Structures for Graphs
Finding the K Shortest Paths
Decremental SPQR-Trees for Planar Graphs
Graph-Theoretic Solutions to Computational Geometry Problems
Antimatroids and Balanced Pairs
Crossing Patterns in Nonplanar Road Networks
Lattices and Polyhedra from Graphs
Top View
Finding a Maximum-Weight Convex Set in a Chordal Graph
K-Best Solutions of MSO Problems on Tree-Decomposable Graphs∗
On the Edge Crossings of the Greedy Spanner
Knowledge Spaces Applications in Education Knowledge Spaces
Convex-Arc Drawings of Pseudolines
Subgraph Isomorphism in Planar Graphs and Related Problems
Cubic Planar Graphs That Cannot Be Drawn on Few Lines David Eppstein Computer Science Department, University of California, Irvine, USA
[email protected]
Arxiv:2105.05371V1 [Cs.DM] 11 May 2021 Total Investment Cost, the Return on the Investment)
Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs
Parameterization and Concise Representation in Graph Algorithms: Leaf Powers, Subgraphs with Hereditary Properties, and Activity-On-Edge Minimization
Shortest Paths in Two Intersecting Pencils of Lines
A Verified Program for the Enumeration of All Maximal
Listing All Maximal Cliques in Large Sparse Real-World Graphs
Three Modern Variations on the Classic Sorting Problem
Cubic Partial Cubes from Simplicial Arrangements
David Eppstein
Efficient Algorithms for Sequence Analysis∗
Forbidden Configurations in Discrete Geometry David Eppstein Frontmatter More Information
Sparse Dynamic Programming II: Convex and Concave Cost Functions
Optimal Edge Weight Perturbations to Attack Shortest Paths Benjamin A
Counting Polygon Triangulations Is Hard
Arxiv:Math/0204252V2
Dynamic Generators of Topologically Embedded Graphs
Separator Based Sparsification I. Planarity Testing and Minimum
Robust Statistics and Arrangements David Eppstein