| 1998 | Simple Generalized Maximum Flow Algorithms. | va Tardos, Kevin D. Wayne |
| 1998 | On a Min-max Theorem of Cacti. | Zoltn Szigeti |
| 1998 | Characterizing Noninteger Polyhedra with 0-1 Constraints. | Andrs Seb |
| 1998 | Approximation Algorithms for the Mixed Postman Problem. | Balaji Raghavachari, Jeyakesavan Veerasamy |
| 1998 | The Generalized Stable Set Problem for Claw-Free Bidirected Graphs. | Daishin Nakamura, Akihisa Tamura |
| 1998 | Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs. | Hiroshi Nagamochi, Peter Eades |
| 1998 | Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems. | Alix Munier, Maurice Queyranne, Andreas S. Schulz |
| 1998 | The Intersection of Knapsack Polyhedra and Extensions. | Alexander Martin, Robert Weismantel |
| 1998 | Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs. | Stavros G. Kolliopoulos, Clifford Stein |
| 1998 | Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than Locations. | Volker Kaibel |
| 1998 | Non-approximability Results for Scheduling Problems with Minsum Criteria. | Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger |
| 1998 | The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem. | Dorit S. Hochbaum |
| 1998 | Incorporating Inequality Constraints in the Spectral Bundle Method. | Christoph Helmberg, Krzysztof C. Kiwiel, Franz Rendl |
| 1998 | A Characterization of Weakly Bipartite Graphs. | Bertrand Guenin |
| 1998 | An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow. | Andrew V. Goldberg, Jeffrey D. Oldham, Serge A. Plotkin, Clifford Stein |
| 1998 | Bipartite Designs. | Grigor Gasparyan |
| 1998 | Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time. | Lisa Fleischer |
| 1998 | New Classes of Lower Bounds for Bin Packing Problems. | Sndor P. Fekete, Jrg Schepers |
| 1998 | The Packing Property. | Grard Cornujols, Bertrand Guenin, Franois Margot |
| 1998 | A Class of Hard Small 0-1 Programs. | Grard Cornujols, Milind Dawande |
| 1998 | A Theorem of Truemper. | Michele Conforti, Ajai Kapoor |
| 1998 | Improved Approximation Algorithms for Uncapitated Facility Location. | Fabin A. Chudak |
| 1998 | Consecutive Ones and a Betweenness Problem in Computational Biology. | Thomas Christof, Marcus Oswald, Gerhard Reinelt |
| 1998 | An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. | Chandra Chekuri, Michael A. Bender |
| 1998 | An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs. | Joseph Cheriyan, Andrs Seb, Zoltn Szigeti |