| On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension | 1996/11/01 | English | 54 |
| A Tight Analysis of the Greedy Algorithm for Set Cover | 1997/11/01 | English | 54 |
| Lower bounds for algebraic decision trees | 1982/03/01 | English | 53 |
| On two geometric problems related to the travelling salesman problem | 1984/06/01 | English | 53 |
| The NP-completeness column: An ongoing guide | 1982/06/01 | English | 52 |
| Approximation Algorithms for Maximization Problems Arising in Graph Partitioning | 2001/11/01 | English | 52 |
| A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk | 1995/05/01 | English | 52 |
| A new proof for the first-fit decreasing bin-packing algorithm | 1985/03/01 | English | 51 |
| Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem | 1984/12/01 | English | 51 |
| Approximating Clique and Biclique Problems | 1998/10/01 | English | 50 |
| Approximating Maximum Leaf Spanning Trees in Almost Linear Time | 1998/10/01 | English | 50 |
| Applications of Parametric Searching in Geometric Optimization | 1994/11/01 | English | 50 |
| A Reliable Randomized Algorithm for the Closest-Pair Problem | 1997/10/01 | English | 49 |
| A linear algorithm for a core of a tree | 1980/09/01 | English | 49 |
| The Stable Roommates Problem with Ties | 2002/04/01 | English | 49 |
| Shape from probing | 1987/03/01 | English | 48 |
| The concave least-weight subsequence problem revisited | 1988/09/01 | English | 48 |
| On the Diameter of the Pancake Network | 1997/10/01 | English | 48 |
| Improved Approximation Algorithms for Uniform Connectivity Problems | 1996/09/01 | English | 48 |
| Greedy Local Improvement and Weighted Set Packing Approximation | 2001/05/01 | English | 48 |
| Recognition of Circle Graphs | 1994/03/01 | English | 47 |
| On the Approximation of Maximum Satisfiability | 1994/11/01 | English | 47 |
| Stability in circular arc graphs | 1988/09/01 | English | 47 |
| Finding the convex hull facet by facet | 1985/03/01 | English | 47 |
| 3-coloring in time | 2005/02/01 | English | 46 |
| On Markov Chains for Independent Sets | 2000/04/01 | English | 46 |
| Efficient algorithms for a family of matroid intersection problems | 1984/03/01 | English | 45 |
| Implementation of simultaneous memory address access in models that forbid it | 1983/03/01 | English | 45 |
| A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3 | 2000/07/01 | English | 44 |
| On Rotations and the Generation of Binary Trees | 1993/11/01 | English | 44 |