Approximating Independent Sets in Degree-3 Graphs
Approaching the 5/4-approximation for Rectilinear Steiner Trees
Exact and Approximation Algorithms for Geometric and Capacitatived Set Cover Problems
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications
8/7-approximation Algorithm for (1,2)-TSP
On Approximation of the Power-p and Steiner Trees
One.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two
Approximating Transitivity in Directed Networks
An Approximation Algorithm for the Steiner Tree Problem
Approximating Transitive Reductions for Directed Networks
Improved Approximation Lower Bounds on Small Occurrence Optimization
The Complexity of Two-dimensional Compressed Pattern Matching
On Complexity of Regular Languages in Terms of Finite Automata
On Approximation of the Power-p and Bottleneck Steiner Trees
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION
A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon
On Complexity of Regular Languages in Terms of Finite Automa
Approximating Optimal Binary Trees in Parallel