On the Hardness of Approximating Minimization Problems.
The Turn Model for Adaptive Routing.
A Single-Exponential Upper Bound for Finding Shortest Paths in Three Dimensions.
Shortest Paths in the Plane with Polygonal Obstacles.
Equivalence, Reversibility, Symmetry and Concavity Properties in Fork-Join Queueing Networks with Blocking.
Counting Networks.
Fully Persistent Lists with Catenation.
Circumscription with Homomorphisms: Solving the Equality and Counterexample Problems.