| Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree | 1995/03/01 | English | 110 |
| Fast parallel and serial approximate string matching | 1989/06/01 | English | 109 |
| Monte-Carlo approximation algorithms for enumeration problems | 1989/09/01 | English | 107 |
| The Algorithmic Aspects of the Regularity Lemma | 1994/01/01 | English | 107 |
| Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs | 1996/09/01 | English | 107 |
| Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions | 2001/01/01 | English | 104 |
| NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs | 1998/02/01 | English | 99 |
| A separator theorem for graphs of bounded genus | 1984/09/01 | English | 97 |
| Factorizing words over an ordered alphabet | 1983/12/01 | English | 97 |
| A simple parallel tree contraction algorithm | 1989/06/01 | English | 97 |
| A Constructive Enumeration of Fullerenes | 1997/05/01 | English | 96 |
| The graph genus problem is NP-complete | 1989/12/01 | English | 95 |
| Analysis of a Local Search Heuristic for Facility Location Problems | 2000/10/01 | English | 94 |
| A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem | 2000/10/01 | English | 93 |
| Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs | 1988/12/01 | English | 91 |
| Graph Sandwich Problems | 1995/11/01 | English | 89 |
| Lowest common ancestors in trees and directed acyclic graphs | 2005/11/01 | English | 88 |
| NP completeness of finding the chromatic index of regular graphs | 1983/03/01 | English | 88 |
| Linear-time computation of optimal subgraphs of decomposable graphs | 1987/06/01 | English | 87 |
| Algorithms for two bottleneck optimization problems | 1988/09/01 | English | 86 |
| A Faster Algorithm for Finding the Minimum Cut in a Directed Graph | 1994/11/01 | English | 84 |
| Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane | 1983/12/01 | English | 81 |
| Approximation algorithms for partial covering problems | 2004/10/01 | English | 79 |
| Greedily Finding a Dense Subgraph | 2000/02/01 | English | 79 |
| A algorithm for two-dimensional packing | 1981/12/01 | English | 77 |
| NP-complete stable matching problems | 1990/06/01 | English | 77 |
| How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph | 1998/05/01 | English | 77 |
| Parameterizing above Guaranteed Values: MaxSat and MaxCut | 1999/05/01 | English | 77 |
| Approximations for minimum and min-max vehicle routing problems | 2006/04/01 | English | 76 |
| A linear algorithm for determining the separation of convex polyhedra | 1985/09/01 | English | 76 |