| 1993 | A general class of greedily solvable linear programs. Maurice Queyranne, Frits C. R. Spieksma, Fabio Tardella |
| 1993 | A nearly best-possible approximation algorithm for node-weighted Steiner trees. Philip N. Klein, R. Ravi |
| 1993 | A new \frac34-approximation algorithm for MAX SAT. Michel X. Goemans, David P. Williamson |
| 1993 | A polyhedron with all s-t cuts as vertices, and adjacency of cuts. Naveen Garg, Vijay V. Vazirani |
| 1993 | A primal-dual parallel approximation technique applied to weighted set and vertex cover. Samir Khuller, Uzi Vishkin, Neal E. Young |
| 1993 | A spectral approach to bandwidth and separator problems in graphs. Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl |
| 1993 | An analysis of a Monte Carlo algorithm for estimating the permanent. Mark Jerrum |
| 1993 | An approximation algorithm for weighted itk-polymatroids and the Steiner tree problem in graphs. Alexander Zelikovsky |
| 1993 | An efficient approximation algorithm for the survivable network design problem. Harold N. Gabow, Michel X. Goemans, David P. Williamson |
| 1993 | An efficient implementation of a scaling minimum-cost flow algorithm. Andrew V. Goldberg |
| 1993 | Canceling most helpful total submodular cuts for submodular flow. S. Thomas McCormick, Thomas R. Ervolina |
| 1993 | Circuit packings on surfaces with at most three cross-caps. András Sebö |
| 1993 | Computing the optimum stock size. Hans Kellerer, Franz Rendl, Gerhard J. Woeginger |
| 1993 | Conservation laws, extended polymatroids and multi-armed bandit problems: a unified approach to ind exable systems. Dimitris Bertsimas, José Niño-Mora |
| 1993 | Cycles of prescribed modularity in planar digraphs. Anna Galluccio, Martin Loebl |
| 1993 | Delta-polymatroids and an extension of Edmonds-Giles' TDI scheme. Masataka Nakamura |
| 1993 | Dynamic algorithms for optimization problems in bounded tree-width graphs. Robert F. Cohen, Sairam Sairam, Roberto Tamassia, Jeffrey Scott Vitter |
| 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 | On Lovász's cathedral theorem. Zoltán Szigeti |
| 1993 | On a characterization of the minimum assignment and matching in the independent random model. Florin Avram, Dimitris Bertsimas |
| 1993 | On the (integral) maximum tw flow in vertex and edge capacitated planar graphs. Frieda Granot, Michal Penn |
| 1993 | On the geodesic-structure of graphs: a polyhedral approach to metric decomposition. Michael Lomonosov, András Sebö |
| 1993 | On the monotonization of polyhedra. Egon Balas, Matteo Fischetti |
| 1993 | On the transitive acyclic subdigraph polytope. Rudolf Müller |
| 1993 | Optimal and almost optimal algorithms for connectivity augmentation problems. Tibor Jordán |
| 1993 | Optimal solution and value of parametric integer programs. Ravi Kannan |
| 1993 | Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29 - May 1, 1993 Giovanni Rinaldi, Laurence A. Wolsey |
| 1993 | Routing in grid graphs by cutting planes. Martin Grötschel, Alexander Martin, Robert Weismantel |
| 1993 | Sequential and parallel algorithms for edge-coloring series-parallel multigraphs. Xiao Zhou, Hitoshi Suzuki, Takao Nishizeki |
| 1993 | Solving integer programs with Fenchel cutting planes and preprocessing. E. Andrew Boyd |
| 1993 | Solving the maximum weight planar subgraph. Michael Jünger, Petra Mutzel |
| 1993 | Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems. J. A. Hoogeveen, Steef L. van de Velde |
| 1993 | The complex of maximal lattice free simplices. Imre Bárány, Roger Howe, Herbert E. Scarf |
| 1993 | Using path inequalities in a branch and cut code for the symmetric traveling salesman problem. Jean-Maurice Clochard, Denis Naddef |
| 1993 | When cycles collapse: A general approximation technique for constrained two-connectivity problems. Philip N. Klein, R. Ravi |