| The Competitiveness of On-Line Assignments | 1995/03/01 | English | 76 |
| Distance labeling in graphs | 2004/10/01 | English | 74 |
| Designing Least-Cost Nonblocking Broadband Networks | 1997/08/01 | English | 72 |
| A weighted matroid intersection algorithm | 1981/12/01 | English | 72 |
| Characterizations of totally balanced matrices | 1984/06/01 | English | 72 |
| Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees | 1990/12/01 | English | 72 |
| How to Allocate Network Centers | 1993/11/01 | English | 71 |
| Improved Approximations for the Steiner Tree Problem | 1994/11/01 | English | 70 |
| Analysis of Two Simple Heuristics on a Random Instance ofk-sat | 1996/03/01 | English | 70 |
| Fully Dynamic Algorithms for Maintaining Shortest Paths Trees | 2000/02/01 | English | 68 |
| An O(n log n) unidirectional distributed algorithm for extrema finding in a circle | 1982/09/01 | English | 68 |
| Planar 3DM is NP-complete | 1986/06/01 | English | 68 |
| Short monotone formulae for the majority function | 1984/09/01 | English | 67 |
| Data Structures for Mobile Data | 1999/04/01 | English | 66 |
| Fast randomized consensus using shared memory | 1990/09/01 | English | 64 |
| Approximating the Minimum-Degree Steiner Tree to within One of Optimal | 1994/11/01 | English | 62 |
| The solution of some random NP-hard problems in polynomial expected time | 1989/12/01 | English | 62 |
| Recovery in distributed systems using optimistic message logging and checkpointing | 1990/09/01 | English | 61 |
| Bicriteria Network Design Problems | 1998/07/01 | English | 61 |
| A Better Algorithm for an Ancient Scheduling Problem | 1996/03/01 | English | 61 |
| On Bipartite and Multipartite Clique Problems | 2001/11/01 | English | 60 |
| Fast Distributed Construction of Smallk-Dominating Sets and Applications | 1998/07/01 | English | 59 |
| Online Weighted Matching | 1993/05/01 | English | 59 |
| Finding kth paths and p-centers by generating and searching good data structures | 1983/03/01 | English | 58 |
| A Faster Deterministic Maximum Flow Algorithm | 1994/11/01 | English | 57 |
| On Linear Time Minor Tests with Depth-First Search | 1993/01/01 | English | 57 |
| Problems complete for deterministic logarithmic space | 1987/09/01 | English | 55 |
| An optimal algorithm for finding minimal enclosing triangles | 1986/06/01 | English | 55 |
| Compact Routing with Minimum Stretch | 2001/01/01 | English | 55 |
| Exploring Unknown Undirected Graphs | 1999/11/01 | English | 55 |