Given an ordinary differential equation on a homogeneous manifold, one can construct a "geometric integrator" by determining a compatible ordinary differential equation ...
We propose a speed-up method for discrete-event simulations, including sweep-line or -plane techniques, requiring the repeated calculation of the times at which certain discrete e...
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...