72 citations · 218 across the 15 of their papers we have counts for
32 papers
Nonrepetitive Paths and Cycles in Graphs with Application to Sudoku
David Eppstein
We provide a simple linear time transformation from a directed or undirected graph with labeled edges to an unlabeled digraph, such that paths in the input graph in which no two co…
Skip-Webs: Efficient Distributed Data Structures for Multi-Dimensional Data Sets
Lars Arge, David Eppstein, Michael T. Goodrich
We present a framework for designing efficient distributed data structures for multi-dimensional data. Our structures, which we call skip-webs, extend and improve previous randomiz…
The Skip Quadtree: A Simple Dynamic Data Structure for Multidimensional Data
David Eppstein, Michael T. Goodrich, Jonathan Z. Sun
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R^2) or the skip octree (for point data in R^d, with constant d>2). Our data s…
The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems
Josiah Carlson, David Eppstein
We consider problems in which we are given a rooted tree as input, and must find a subtree with the same root, optimizing some objective function of the nodes in the subtree. When…
Quasiconvex Programming
David Eppstein
We define quasiconvex programming, a form of generalized linear programming in which one seeks the point minimizing the pointwise maximum of a collection of quasiconvex functions.…
Algorithms for Drawing Media
David Eppstein
We describe algorithms for drawing media, systems of states, tokens and actions that have state transition graphs in the form of partial cubes. Our algorithms are based on two prin…