David Eppstein

From MaRDI portal
Person:283880

Available identifiers

zbMath Open eppstein.davidWikidataQ3017847 ScholiaQ3017847MaRDI QIDQ283880

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61265092024-04-09Paper
Lower bounds for non-adaptive shortest path relaxation2024-01-16Paper
https://portal.mardi4nfdi.de/entity/Q61793372023-12-16Paper
https://portal.mardi4nfdi.de/entity/Q60591742023-11-02Paper
https://portal.mardi4nfdi.de/entity/Q60591892023-11-02Paper
Quasipolynomiality of the Smallest Missing Induced Subgraph2023-09-20Paper
Angles of arc-polygons and lombardi drawings of cacti2023-06-26Paper
A stronger lower bound on parametric minimum spanning trees2023-06-05Paper
The centroid of points with approximate weights2023-05-08Paper
https://portal.mardi4nfdi.de/entity/Q58755412023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q58756172023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q58756212023-02-03Paper
Parallel construction of quadtrees and quality triangulations2023-01-18Paper
Using sparsification for parametric minimum spanning tree problems2022-12-09Paper
Finding the k smallest spanning trees2022-12-09Paper
Geometric dominating sets -- a minimum version of the no-three-in-line problem2022-10-06Paper
https://portal.mardi4nfdi.de/entity/Q51043522022-09-09Paper
An efficient algorithm for shortest paths in vertical and horizontal segments2022-08-19Paper
https://portal.mardi4nfdi.de/entity/Q50889622022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50889632022-07-18Paper
Limitations on realistic hyperbolic graph drawing2022-07-01Paper
Stack-number is not bounded by queue-number2022-06-30Paper
Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings2022-06-28Paper
The graphs of stably matchable pairs2022-06-08Paper
Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes2022-05-20Paper
Algorithms for Stable Matching and Clustering in a Grid2022-05-18Paper
Cubic Planar Graphs that cannot be Drawn on few Lines2022-05-13Paper
Ununfoldable polyhedra with \(6\) vertices or \(6\) faces2022-04-08Paper
A stronger lower bound on parametric minimum spanning trees2022-03-25Paper
On the treewidth of Hanoi graphs2022-02-21Paper
Egyptian Fractions with Denominators from Sequences Closed Under Doubling2021-10-05Paper
https://portal.mardi4nfdi.de/entity/Q50094732021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q50094782021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q50027692021-07-28Paper
On polyhedral realization with isosceles triangles2021-07-28Paper
C-planarity testing of embedded clustered graphs with bounded dual carving-width2021-07-26Paper
NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs2021-06-22Paper
Grid peeling and the affine curve-shortening flow2021-04-01Paper
Counting polygon triangulations is hard2021-01-29Paper
Approximate Greedy Clustering and Distance Selection for Graph Metrics2021-01-12Paper
Face flips in origami tessellations2020-11-12Paper
Existence and hardness of conveyor belts2020-11-05Paper
Minor-Closed Graph Classes with Bounded Layered Pathwidth2020-10-28Paper
Homotopy height, grid-major height and graph-drawing height2020-10-26Paper
Treetopes and their graphs2020-09-01Paper
Parameterized leaf power recognition via embedding into graph products2020-08-12Paper
Faster Evaluation of Subtraction Games2020-08-11Paper
https://portal.mardi4nfdi.de/entity/Q33010082020-08-11Paper
[https://portal.mardi4nfdi.de/wiki/Publication:3303782 Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms]2020-08-04Paper
https://portal.mardi4nfdi.de/entity/Q51118752020-05-27Paper
On the treewidth of Hanoi graphs2020-04-30Paper
Reactive proximity data structures for graphs2020-02-12Paper
Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect2020-01-16Paper
Reconfiguring undirected paths2020-01-16Paper
https://portal.mardi4nfdi.de/entity/Q52402242019-10-24Paper
Randomized Speedup of the Bellman–Ford Algorithm2019-09-17Paper
Small Superpatterns for Dominance Drawing2019-09-17Paper
Grid peeling and the affine curve-shortening flow2019-09-12Paper
Covering many points with a small-area box2019-09-10Paper
Realization and Connectivity of the Graphs of Origami Flat Foldings2019-09-10Paper
https://portal.mardi4nfdi.de/entity/Q49671752019-07-03Paper
Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges2019-05-15Paper
https://portal.mardi4nfdi.de/entity/Q46338212019-05-06Paper
https://portal.mardi4nfdi.de/entity/Q46338222019-05-06Paper
Maximum plane trees in multipartite geometric graphs2019-04-25Paper
Track layouts, layered path decompositions, and leveled planarity2019-04-25Paper
Flat foldings of plane graphs with prescribed angles and edge lengths2019-02-27Paper
Planar and Poly-arc Lombardi Drawings2019-02-27Paper
Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count2019-02-20Paper
The Effect of Planarization on Width2019-02-20Paper
Realization and connectivity of the graphs of origami flat foldings2019-02-15Paper
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth2019-01-18Paper
Spanning trees in multipartite geometric graphs2019-01-11Paper
Folding Polyominoes into (Poly)Cubes2018-11-26Paper
Vertex-unfoldings of simplicial manifolds2018-11-23Paper
Subexponential-time and FPT algorithms for embedded flat clustered planarity2018-11-22Paper
The Parametric Closure Problem2018-11-12Paper
Testing bipartiteness of geometric intersection graphs2018-11-05Paper
The Effect of Planarization on Width2018-10-25Paper
Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs2018-10-25Paper
Models and algorithms for graph watermarking2018-10-18Paper
Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect2018-10-04Paper
Treetopes and their Graphs2018-07-16Paper
Forbidden Configurations in Discrete Geometry2018-06-27Paper
Maximizing the Sum of Radii of Disjoint Balls or Disks2018-06-05Paper
From discrepancy to majority2018-05-23Paper
On the planar split thickness of graphs2018-04-11Paper
https://portal.mardi4nfdi.de/entity/Q31328562018-01-30Paper
Parameterized Complexity of 1-Planarity2018-01-12Paper
The skip quadtree2017-10-20Paper
Minimum dilation stars2017-10-20Paper
Area-universal rectangular layouts2017-10-20Paper
https://portal.mardi4nfdi.de/entity/Q53695102017-10-17Paper
https://portal.mardi4nfdi.de/entity/Q53686912017-10-10Paper
Minimum Forcing Sets for Miura Folding Patterns2017-10-05Paper
Multivariate regression depth2017-09-29Paper
Optimized color gamuts for tiled displays2017-09-29Paper
Deterministic sampling and range counting in geometric data streams2017-09-29Paper
The geometric thickness of low degree graphs2017-09-29Paper
Maximum plane trees in multipartite geometric graphs2017-09-22Paper
Succinct Greedy Geometric Routing Using Hyperbolic Geometry2017-07-27Paper
Rooted Cycle Bases2017-07-13Paper
Listing All Maximal Cliques in Large Sparse Real-World Graphs2017-06-16Paper
Structure of Graphs with Locally Restricted Crossings2017-05-24Paper
Strict Confluent Drawing2017-03-30Paper
Adjacency-preserving spatial treemaps2017-03-30Paper
Rigid Origami Vertices: Conditions and Forcing Sets2017-03-30Paper
Happy endings for flip graphs2017-03-09Paper
https://portal.mardi4nfdi.de/entity/Q29680802017-03-09Paper
Steinitz Theorems for Orthogonal Polyhedra2017-03-09Paper
Track Layout Is Hard2017-02-21Paper
Genus, Treewidth, and Local Crossing Number2017-02-10Paper
Simple Recognition of Halin Graphs and Their Generalizations2016-07-05Paper
Dynamic connectivity in digital images2016-06-01Paper
Distance-sensitive planar point location2016-05-17Paper
On the planar split thickness of graphs2016-05-03Paper
From Discrepancy to Majority2016-05-03Paper
Folding a paper strip to minimize thickness2016-02-18Paper
Ramified rectilinear polygons: coordinatization by dendrons2016-02-03Paper
Near-linear-time deterministic plane Steiner spanners for well-spaced point sets2016-01-29Paper
The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings2016-01-07Paper
Improved Grid Map Layout by Point Set Matching2015-11-03Paper
Contact Graphs of Circular Arcs2015-10-30Paper
The Parametric Closure Problem2015-10-30Paper
Rooted Cycle Bases2015-10-30Paper
Linear-Time Algorithms for Proportional Apportionment2015-09-11Paper
Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms2015-09-02Paper
Deterministic sampling and range counting in geometric data streams2015-09-02Paper
Metric Dimension Parameterized by Max Leaf Number2015-08-25Paper
https://portal.mardi4nfdi.de/entity/Q55017892015-08-14Paper
https://portal.mardi4nfdi.de/entity/Q55018312015-08-14Paper
Quasiconvex Analysis of Backtracking Algorithms2015-08-03Paper
https://portal.mardi4nfdi.de/entity/Q55013482015-08-03Paper
Planar Induced Subgraphs of Sparse Graphs2015-05-18Paper
Separator based sparsification for dynamic planar graph algorithms2015-05-07Paper
Skip-webs2015-03-10Paper
Folding a Paper Strip to Minimize Thickness2015-02-27Paper
The graphs of planar soap bubbles2015-02-17Paper
Planar Induced Subgraphs of Sparse Graphs2015-01-07Paper
Balanced Circle Packings for Planar Graphs2015-01-07Paper
The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings2015-01-07Paper
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth2015-01-07Paper
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths2015-01-07Paper
https://portal.mardi4nfdi.de/entity/Q29345792014-12-18Paper
Squarepants in a tree2014-11-18Paper
All maximal independent sets and dynamic dominance for sparse graphs2014-11-18Paper
A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing2014-11-14Paper
https://portal.mardi4nfdi.de/entity/Q29217002014-10-13Paper
Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket2014-09-30Paper
Grid minors in damaged grids2014-09-04Paper
Antimatroids and balanced pairs2014-06-12Paper
Universal Point Sets for Drawing Planar Graphs with Circular Arcs2014-06-10Paper
Drawing Arrangement Graphs In Small Grids, Or How To Play Planarity2014-05-22Paper
https://portal.mardi4nfdi.de/entity/Q54176912014-05-22Paper
Superpatterns and Universal Point Sets2014-05-22Paper
Steinitz Theorems for Orthogonal Polyhedra2014-04-03Paper
Bounds on the complexity of halfspace intersections when the bounded faces have small dimension2014-03-24Paper
On 2-site Voronoi diagrams under geometric distance functions2014-02-06Paper
Superpatterns and Universal Point Sets2013-12-20Paper
Fixed Parameter Tractability of Crossing Minimization of Almost-Trees2013-12-20Paper
Strict Confluent Drawing2013-12-20Paper
Drawing Arrangement Graphs in Small Grids, or How to Play Planarity2013-12-20Paper
Category-based routing in social networks: membership dimension and the small-world phenomenon2013-12-11Paper
Confluent Hasse Diagrams2013-11-28Paper
Optimal Angular Resolution for Face-Symmetric Drawings2013-11-28Paper
Parameterized Complexity of 1-Planarity2013-08-12Paper
Combinatorial Pair Testing: Distinguishing Workers from Slackers2013-08-12Paper
Bounds on the complexity of halfspace intersections when the bounded faces have small dimension2013-08-05Paper
Optimal 3D Angular Resolution for Low-Degree Graphs2013-04-09Paper
Flows in One-Crossing-Minor-Free Graphs2013-04-09Paper
Planar Lombardi Drawings for Subcubic Graphs2013-04-03Paper
On the Density of Maximal 1-Planar Graphs2013-04-03Paper
Force-Directed Graph Drawing Using Social Gravity and Scaling2013-04-03Paper
Drawing trees with perfect angular resolution and polynomial area2013-03-20Paper
The Complexity of Bendless Three-Dimensional Orthogonal Graph Drawing2013-03-19Paper
Inapproximability of Orthogonal Compaction2012-12-07Paper
The h-Index of a Graph and its Application to Dynamic Subgraph Statistics2012-12-04Paper
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area2012-12-04Paper
Area-Universal and Constrained Rectangular Layouts2012-09-12Paper
Extended dynamic subgraph statistics using \(h\)-index parameterized data structures2012-08-13Paper
Planar and Poly-arc Lombardi Drawings2012-03-09Paper
Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings2012-03-09Paper
Confluent Hasse Diagrams2012-03-09Paper
Lombardi Drawings of Graphs2012-01-12Paper
Adjacency-Preserving Spatial Treemaps2011-08-12Paper
Tracking Moving Objects with Few Handovers2011-08-12Paper
Combinatorics and Geometry of Finite and Infinite Squaregraphs2011-07-18Paper
The Fibonacci dimension of a graph2011-06-01Paper
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings2011-04-04Paper
APPROXIMATE WEIGHTED FARTHEST NEIGHBORS AND MINIMUM DILATION STARS2011-03-25Paper
Drawing Trees with Perfect Angular Resolution and Polynomial Area2011-02-11Paper
Optimal 3D Angular Resolution for Low-Degree Graphs2011-02-11Paper
Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area2011-02-11Paper
Lombardi Drawings of Graphs2011-02-11Paper
Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures2011-01-08Paper
Densities of minor-closed graph families2010-12-16Paper
Flows in One-Crossing-Minor-Free Graphs2010-12-09Paper
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time2010-12-09Paper
Cloning Voronoi Diagrams via Retroactive Data Structures2010-09-06Paper
https://portal.mardi4nfdi.de/entity/Q35795092010-08-06Paper
Approximate Weighted Farthest Neighbors and Minimum Dilation Stars2010-07-20Paper
Regular Labelings and Geometric Structures2010-07-01Paper
Algorithms and Data Structures2010-04-20Paper
Graph-Theoretic Solutions to Computational Geometry Problems2010-01-21Paper
Manhattan orbifolds2009-12-15Paper
On verifying and engineering the wellgradedness of a union-closed family2009-12-07Paper
Finding Large Clique Minors is Hard2009-10-21Paper
On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem2009-10-20Paper
Orientation-Constrained Rectangular Layouts2009-10-20Paper
The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics2009-10-20Paper
Optimal Embedding into Star Metrics2009-10-20Paper
Graph Drawing2009-08-11Paper
Graph Drawing2009-08-11Paper
Edges and switches, tunnels and bridges2009-06-30Paper
Succinct Greedy Graph Drawing in the Hyperbolic Plane2009-03-03Paper
The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing2009-03-03Paper
Isometric Diamond Subgraphs2009-03-03Paper
Edges and Switches, Tunnels and Bridges2009-02-17Paper
Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton’s Identities and Invertible Bloom Filters2009-02-17Paper
Happy endings for flip graphs2009-02-12Paper
Guard placement for efficient point-in-polygon proofs2009-02-12Paper
The Traveling Salesman Problem for Cubic Graphs2009-01-19Paper
Upright-Quad Drawing of st-Planar Learning Spaces2009-01-19Paper
Straight Skeletons of Three-Dimensional Polyhedra2008-11-25Paper
Algorithms for media2008-09-29Paper
SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS2008-08-26Paper
https://portal.mardi4nfdi.de/entity/Q54586582008-04-16Paper
Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes2007-10-22Paper
Drawings of planar graphs with few slopes and segments2007-10-12Paper
The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems2007-09-07Paper
Choosing Colors for Geometric Graphs Via Color Space Embeddings2007-08-28Paper
Upright-Quad Drawing of st-Planar Learning Spaces2007-08-28Paper
Trees with Convex Faces and Optimal Angles2007-08-28Paper
Confluent layered drawings2007-05-10Paper
Minimum dilation stars2007-03-15Paper
Cubic partial cubes from simplicial arrangements2007-03-12Paper
The effect of faults on network expansion2007-01-25Paper
Graph Drawing2006-11-13Paper
Algorithms and Data Structures2006-10-25Paper
https://portal.mardi4nfdi.de/entity/Q52902642006-04-28Paper
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way2006-04-03Paper
Graph Drawing2005-12-07Paper
Graph Drawing2005-12-07Paper
Hinged dissection of polyominoes and polyforms2005-08-05Paper
Fast hierarchical clustering and other applications of dynamic closest pairs2005-08-04Paper
QUADRILATERAL MESHING BY CIRCLE PACKING2005-06-10Paper
PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS2005-06-10Paper
Fast Approximation of Centrality2005-05-25Paper
The lattice dimension of a graph2005-05-04Paper
https://portal.mardi4nfdi.de/entity/Q46575802005-03-14Paper
3-coloring in time2005-02-22Paper
https://portal.mardi4nfdi.de/entity/Q44712852004-07-28Paper
https://portal.mardi4nfdi.de/entity/Q44713492004-07-28Paper
https://portal.mardi4nfdi.de/entity/Q44647182004-05-27Paper
https://portal.mardi4nfdi.de/entity/Q44647202004-05-27Paper
Tiling space and slabs with acute tetrahedra.2004-03-29Paper
Small Maximal Independent Sets and Faster Exact Graph Coloring2003-11-30Paper
https://portal.mardi4nfdi.de/entity/Q44077122003-11-10Paper
https://portal.mardi4nfdi.de/entity/Q44222712003-09-03Paper
Setting Parameters by Example2003-06-19Paper
The minimum expectation selection problem2003-03-19Paper
https://portal.mardi4nfdi.de/entity/Q47785392002-11-18Paper
https://portal.mardi4nfdi.de/entity/Q47785472002-11-18Paper
https://portal.mardi4nfdi.de/entity/Q47785792002-11-18Paper
Multivariate regression depth2002-11-18Paper
Tangent Spheres and Triangle Centers2002-09-12Paper
Beta-skeletons have unbounded dilation2002-09-03Paper
The distribution of loop lengths in graphical models for turbo decoding2002-08-04Paper
https://portal.mardi4nfdi.de/entity/Q27683672002-07-22Paper
https://portal.mardi4nfdi.de/entity/Q27682972002-03-24Paper
https://portal.mardi4nfdi.de/entity/Q27683142002-01-30Paper
https://portal.mardi4nfdi.de/entity/Q42303292002-01-21Paper
https://portal.mardi4nfdi.de/entity/Q42303272002-01-17Paper
https://portal.mardi4nfdi.de/entity/Q44077132002-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44077192002-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44888572001-08-20Paper
Incremental and Decremental Maintenance of Planar Width2000-12-19Paper
Geometric Thickness of Complete Graphs2000-12-14Paper
Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions2000-10-17Paper
https://portal.mardi4nfdi.de/entity/Q49455092000-09-24Paper
Subgraph Isomorphism in Planar Graphs and Related Problems2000-09-19Paper
Diameter and treewidth in minor-closed graph families2000-08-27Paper
https://portal.mardi4nfdi.de/entity/Q42527292000-04-26Paper
Regression depth and center points.2000-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42341161999-09-15Paper
Geometric lower bounds for parametric matroid optimization1999-07-12Paper
https://portal.mardi4nfdi.de/entity/Q42502311999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q42523031999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q42523991999-06-17Paper
Optimal Point Placement for Mesh Smoothing1999-05-31Paper
Linear complexity hexahedral mesh generation1999-05-03Paper
Separator-Based Sparsification II: Edge and Vertex Connectivity1998-09-21Paper
Finding the k Shortest Paths1998-09-21Paper
On triangulating three-dimensional polygons1998-08-02Paper
Faster Circle Packing with Application to Nonobtuse Triangulation1998-02-26Paper
Sparsification—a technique for speeding up dynamic graph algorithms1998-02-17Paper
Minimum Range Balanced Cuts via Dynamic Subset Sums1997-11-10Paper
Faster geometric \(k\)-point MST approximation1997-10-28Paper
Choosing Subsets with Maximum Weighted Average1997-08-25Paper
https://portal.mardi4nfdi.de/entity/Q43351971997-08-04Paper
https://portal.mardi4nfdi.de/entity/Q31299221997-05-28Paper
https://portal.mardi4nfdi.de/entity/Q43352061997-04-23Paper
https://portal.mardi4nfdi.de/entity/Q48860991997-03-23Paper
Algorithms for proximity problems in higher dimensions1997-01-14Paper
APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS1996-12-16Paper
https://portal.mardi4nfdi.de/entity/Q48860481996-11-04Paper
Average case analysis of dynamic geometric optimization1996-11-04Paper
Separator based sparsification. I: Planarity testing and minimum spanning trees1996-07-16Paper
https://portal.mardi4nfdi.de/entity/Q48584431995-12-13Paper
Offline Algorithms for Dynamic Minimum Spanning Tree Problems1995-11-22Paper
TREE-WEIGHTED NEIGHBORS AND GEOMETRIC k SMALLEST SPANNING TREES1995-08-27Paper
Asymptotic speed-ups in constructive solid geometry1995-08-09Paper
Sparse dynamic programming II1995-07-13Paper
TRIANGULATING POLYGONS WITHOUT LARGE ANGLES1995-05-17Paper
https://portal.mardi4nfdi.de/entity/Q47633881995-04-11Paper
https://portal.mardi4nfdi.de/entity/Q47633921995-04-11Paper
https://portal.mardi4nfdi.de/entity/Q43273711995-04-05Paper
Dynamic Euclidean minimum spanning trees and extrema of binary functions1995-03-20Paper
Iterated nearest neighbors and finding minimal polytopes1995-03-01Paper
https://portal.mardi4nfdi.de/entity/Q31404021994-11-29Paper
Provably good mesh generation1994-11-01Paper
Approximating the minimum weight Steiner triangulation1994-10-19Paper
Arboricity and bipartite subgraph listing algorithms1994-09-25Paper
Sparse dynamic programming I1994-08-21Paper
On the number of minimal 1-Steiner trees1994-08-10Paper
Visibility with a moving point of view1994-05-05Paper
https://portal.mardi4nfdi.de/entity/Q31388711994-01-02Paper
https://portal.mardi4nfdi.de/entity/Q31388841994-01-02Paper
https://portal.mardi4nfdi.de/entity/Q31389311993-12-15Paper
https://portal.mardi4nfdi.de/entity/Q31389501993-10-20Paper
Connectivity, graph minors, and subgraph multiplicity1993-08-24Paper
https://portal.mardi4nfdi.de/entity/Q40366031993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40374351993-05-18Paper
Improved bounds for intersecting triangles and halving planes1993-05-16Paper
POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS1993-04-01Paper
Dynamic Three-Dimensional Linear Programming1993-02-25Paper
Parallel recognition of series-parallel graphs1993-01-17Paper
Finding the \(k\) smallest spanning trees1992-12-14Paper
The farthest point Delaunay triangulation minimizes angles1992-08-13Paper
Maintenance of a minimum spanning forest in a dynamic plane graph1992-06-28Paper
Simultaneous strong separations of probabilistic and unambiguous complexity classes1992-06-28Paper
Equipartitions of graphs1992-06-28Paper
Finding minimum area \(k\)-gons1992-06-28Paper
Planar orientations with low out-degree and compaction of adjacency matrices1992-06-26Paper
THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33597911991-01-01Paper
Reset Sequences for Monotonic Automata1990-01-01Paper
Sequence comparison with mixed convex and concave costs1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42063971990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30333161989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38132981988-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: David Eppstein