2 citations · 2 across the 3 of their papers we have counts for
4 papers
Biased Range Trees
Vida Dujmovic, John Howat, Pat Morin
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R^2 and a query distribution D for 2-sided orthogonal range counting queries. Th…
Distinct Distances in Graph Drawings
Paz Carmi, Vida Dujmović, Pat Morin +1
The \emph{distance-number} of a graph is the minimum number of distinct edge-lengths over all straight-line drawings of in the plane. This definition generalises many well-…
Induced Subgraphs of Bounded Degree and Bounded Treewidth
Prosenjit Bose, Vida Dujmovic, David R. Wood
We prove that for all and , every graph with treewidth at most has a `large' induced subgraph , where has treewidth at most and every v…
Flipturning polygons
Oswin Aichholzer, Carmen Cortes, Erik D. Demaine +7
A flipturn is an operation that transforms a nonconvex simple polygon into another simple polygon, by rotating a concavity 180 degrees around the midpoint of its bounding convex hu…