1 citations · 1 across the 5 of their papers we have counts for
5 papers
Fast Schulze Voting Using Quickselect
Arushi Arora, David Eppstein, Randy Le Huynh
The Schulze voting method aggregates voter preference data using maxmin-weight graph paths, achieving the Condorcet property that a candidate who would win every head-to-head conte…
Computational Complexities of Folding
David Eppstein
We prove several hardness results on folding origami crease patterns. Flat-folding finite crease patterns is fixed-parameter tractable in the ply of the folded pattern (how many la…
Noncrossing Longest Paths and Cycles
Greg Aloupis, Ahmad Biniaz, Prosenjit Bose +7
Edge crossings in geometric graphs are sometimes undesirable as they could lead to unwanted situations such as collisions in motion planning and inconsistency in VLSI layout. Short…
Maintaining Light Spanners via Minimal Updates
Hadi Khodabandeh, David Eppstein
We study the problem of maintaining a lightweight bounded-degree -spanner of a dynamic point set in a -dimensional Euclidean space, where and $d…
Some Polycubes Have No Edge Zipper Unfolding
Erik D. Demaine, Martin L. Demaine, David Eppstein +1
It is unknown whether every polycube (polyhedron constructed by gluing cubes face-to-face) has an edge unfolding, that is, cuts along edges of the cubes that unfolds the polycube t…