| 1995 | The Topological Structure of Maximal Lattice Free Convex Bodies: The General Case. | Imre Brny, Herbert E. Scarf, David Shallcross |
| 1995 | Use of Hidden Network Structure in the Set Partitioning Problem. | Agha Iqbal Ali, Hyun-Soo Han, Jeffery L. Kennington |
| 1995 | A Characterization of Seymour Graphs. | Alexander A. Ageev, Alexandr V. Kostochka, Zoltn Szigeti |
| 1993 | Sequential and parallel algorithms for edge-coloring series-parallel multigraphs. | Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki |
| 1993 | An approximation algorithm for weighted itk-polymatroids and the Steiner tree problem in graphs. | Alexander Zelikovsky |
| 1993 | On Lovsz's cathedral theorem. | Zoltn Szigeti |
| 1993 | Circuit packings on surfaces with at most three cross-caps. | Andrs Seb |
| 1993 | A general class of greedily solvable linear programs. | Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella |
| 1993 | Formulations for the stable set polytope of a claw-free graph. | William R. Pulleyblank, F. Bruce Shepherd |
| 1993 | Nearly uniform scheduling of file transfers. | Shin-Ichi Nakano, Takao Nishizeki |
| 1993 | Delta-polymatroids and an extension of Edmonds-Giles' TDI scheme. | Masataka Nakamura |
| 1993 | On the transitive acyclic subdigraph polytope. | Rudolf Mller |
| 1993 | Canceling most helpful total submodular cuts for submodular flow. | S. Thomas McCormick, Thomas R. Ervolina |
| 1993 | On the geodesic-structure of graphs: a polyhedral approach to metric decomposition. | Michael Lomonosov, Andrs Seb |
| 1993 | A nearly best-possible approximation algorithm for node-weighted Steiner trees. | Philip N. Klein, R. Ravi |
| 1993 | When cycles collapse: A general approximation technique for constrained two-connectivity problems. | Philip N. Klein, R. Ravi |
| 1993 | A primal-dual parallel approximation technique applied to weighted set and vertex cover. | Samir Khuller, Uzi Vishkin, Neal E. Young |
| 1993 | Computing the optimum stock size. | Hans Kellerer, Franz Rendl, Gerhard J. Woeginger |
| 1993 | Optimal solution and value of parametric integer programs. | Ravi Kannan |
| 1993 | Solving the maximum weight planar subgraph. | Michael Jnger, Petra Mutzel |
| 1993 | Optimal and almost optimal algorithms for connectivity augmentation problems. | Tibor Jordn |
| 1993 | An analysis of a Monte Carlo algorithm for estimating the permanent. | Mark Jerrum |
| 1993 | Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems. | J. A. Hoogeveen, Steef L. van de Velde |
| 1993 | A spectral approach to bandwidth and separator problems in graphs. | Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl |
| 1993 | Routing in grid graphs by cutting planes. | Martin Grtschel, Alexander Martin, Robert Weismantel |