| 2001 | Integral Polyhedra Related to Even Cycle and Even Cut Matroids. | Bertrand Guenin |
| 2001 | Circuit Mengerian Directed Graphs. | Bertrand Guenin |
| 2001 | On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem. | Naveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F. Sibel Salman, Amitabh Sinha II |
| 2001 | Bisubmodular Function Minimization. | Satoru Fujishige, Satoru Iwata |
| 2001 | An Extension of a Theorem of Henneberg and Laman. | Andrs Frank, Lszl Szeg |
| 2001 | Combined Connectivity Augmentation and Orientation Problems. | Andrs Frank, Tams Kirly |
| 2001 | A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity. | Lisa Fleischer |
| 2001 | A Matroid Generalization of the Stable Matching Polytope. | Tams Fleiner |
| 2001 | Approximating k-Spanner Problems for k>2. | Michael Elkin, David Peleg |
| 2001 | Fast 2-Variable Integer Programming. | Friedrich Eisenbrand, Gnter Rote |
| 2001 | On the Rank of Mixed 0, 1 Polyhedra. | Grard Cornujols, Yanjun Li |
| 2001 | Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation. | Fabin A. Chudak, Tim Roughgarden, David P. Williamson |
| 2001 | The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release Dates. | Cheng-Feng Mabel Chou, Maurice Queyranne, David Simchi-Levi |
| 2001 | Edge Covers of Setpairs and the Iterative Rounding Method. | Joseph Cheriyan, Santosh S. Vempala |
| 2001 | Strongly Polynomial Algorithms for the Unsplittable Flow Problem. | Yossi Azar, Oded Regev |
| 2001 | Two O (log | Aaron Archer |
| 1999 | Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut. | Eduardo Uchoa, Marcus Poggi de Arago |
| 1999 | Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications. | Chung-Piaw Teo, Jay Sethuraman, Wee-Peng Tan |
| 1999 | On Optimal Ear-Decompositions of Graphs. | Zoltn Szigeti |
| 1999 | An Introduction to Empty Lattice Simplices. | Andrs Seb |
| 1999 | Scheduling Two Machines with Release Times. | John Noga, Steven S. Seiden |
| 1999 | A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts. | Hiroshi Nagamochi, Toshihide Ibaraki |
| 1999 | Optimizing over All Combinatorial Embeddings of a Planar Graph. | Petra Mutzel, Ren Weiskircher |
| 1999 | Approximation Algorithms for a Directed Network Design Problem. | Vardges Melkonian, va Tardos |
| 1999 | Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow. | Stavros G. Kolliopoulos, Clifford Stein |