| 2004 | Minsquare Factors and Maxfix Covers of Graphs. | Nicola Apollonio, Andrs Seb |
| 2002 | A New Approach to Cactus Construction Applied to TSP Support Graphs. | Klaus Michael Wenger |
| 2002 | A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization. | Akihisa Tamura |
| 2002 | The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap. | Kunal Talwar |
| 2002 | An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem. | Maxim Sviridenko |
| 2002 | A Generalization of Edmonds' Matching and Matroid Intersection Algorithms. | Bianca Spille, Robert Weismantel |
| 2002 | The Minimum Latency Problem Is NP-Hard for Weighted Trees. | Ren Sitters |
| 2002 | The Demand Matching Problem. | F. Bruce Shepherd, Adrian Vetta |
| 2002 | Integer Programming and Arrovian Social Welfare Functions. | Jay Sethuraman, Chung-Piaw Teo, Rakesh Vohra |
| 2002 | Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms. | Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser |
| 2002 | Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design. | Ravi Ramamoorthi, Amitabh Sinha II |
| 2002 | Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems. | Michael Lewin, Dror Livnat, Uri Zwick |
| 2002 | Polynomial-Time Separation of Simple Comb Inequalities. | Adam N. Letchford, Andrea Lodi |
| 2002 | A New Subadditive Approach to Integer Programming. | Diego Klabjan |
| 2002 | On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes. | Klaus Jansen, Lorant Porkolab |
| 2002 | A Faster Scaling Algorithm for Minimizing Submodular Functions. | Satoru Iwata |
| 2002 | A New Min-Cut Max-Flow Ratio for Multicommodity Flows. | Oktay Gnlk |
| 2002 | A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property. | Bertrand Guenin |
| 2002 | Algorithms for Minimizing Response Time in Broadcast Scheduling. | Rajiv Gandhi, Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan |
| 2002 | Approximating the Advertisement Placement Problem. | Ari Freund, Joseph Naor |
| 2002 | The Quickest Multicommodity Flow Problem. | Lisa Fleischer, Martin Skutella |
| 2002 | A Polyhedral Study of the Cardinality Constrained Knapsack Problem. | Ismael R. de Farias Jr., George L. Nemhauser |
| 2002 | The Semidefinite Relaxation of the k -Partition Polytope Is Strong. | Andreas Eisenbltter |
| 2002 | An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs. | Sanjeeb Dash |
| 2002 | Building Edge-Failure Resilient Networks. | Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz |