| 1998 | A Capacitated Vehicle Routing Problem on a Tree. Shin-ya Hamaguchi, Naoki Katoh |
| 1998 | A New Approach for Speeding Up Enumeration Algorithms. Takeaki Uno |
| 1998 | A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution. Josep Díaz, Jordi Petit, Panagiotis Psycharis, Maria J. Serna |
| 1998 | A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem. Takashi Mihara, Shao Chin Sung |
| 1998 | Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings Kyung-Yong Chwa, Oscar H. Ibarra |
| 1998 | An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. Hiroshi Nagamochi, Toru Hasunuma |
| 1998 | An Optimal Algorithm for On-Line Palletizing at Delivery Industry. Jochen Rethmann, Egon Wanke |
| 1998 | Approximation Algorithms for Some Optimum Communication Spanning Tree Problems. Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang |
| 1998 | Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-Free Languages. Tatsuya Akutsu |
| 1998 | Casting with Skewed Ejection Direction. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong |
| 1998 | Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs. Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen |
| 1998 | Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently while Concealing it. Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung |
| 1998 | Computing Orthogonal Drawings in a Variable Embedding Setting. Walter Didimo, Giuseppe Liotta |
| 1998 | Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles. Joonsoo Choi, Chan-Su Shin, Sung Kwon Kim |
| 1998 | Convertibility among Grid Filling Curves. Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama |
| 1998 | Disjunctions of Horn Theories and Their Cores. Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino |
| 1998 | Dynamic Grid Embedding with Few Bends and Changes. Ulrik Brandes, Dorothea Wagner |
| 1998 | Facility Location on Terrains. Boris Aronov, Marc J. van Kreveld, René van Oostrum, Kasturi R. Varadarajan |
| 1998 | Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs. Yaw-Ling Lin |
| 1998 | Finding Planar Geometric Automorphisms in Planar Graphs. Seok-Hee Hong, Peter Eades, Sang Ho Lee |
| 1998 | Generalized Graph Colorability and Compressibility of Boolean Formulae. Richard Nock, Pascal Jappy, Jean Sallantin |
| 1998 | Generalized Self-Approaching Curves. Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote |
| 1998 | Hamiltonian Decomposition of Recursive Circulants. Jung-Heum Park |
| 1998 | Implementing Algorithms and Data Structures: An Educational and Research Perspective. Roberto Tamassia |
| 1998 | Inapproximability Results for Guarding Polygons without Holes. Stephan J. Eidenbenz |
| 1998 | K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph. Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki |
| 1998 | L Evanthia Papadopoulou |
| 1998 | Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words. Hiroki Arimura, Shinichi Shimozono |
| 1998 | Maximizing the Number of Connections in Optical Tree Networks. Thomas Erlebach, Klaus Jansen |
| 1998 | On the Complexity of Free Monoid Morphisms. Klaus-Jörn Lange, Pierre McKenzie |
| 1998 | On the Multiple Gene Duplication Problem. Michael R. Fellows, Michael T. Hallett, Ulrike Stege |
| 1998 | On-Line Scheduling of Parallel Jobs with Runtime Restrictions. Stefan Bischof, Ernst W. Mayr |
| 1998 | Optimal Approximate Agreement with Omission Faults. Richard Plunkett, Alan D. Fekete |
| 1998 | Optimality and Integer Programming Formulations of Triangulations in General Dimension. Akira Tajima |
| 1998 | Polyhedral Structure of Submodular and Posi-modular Systems. Hiroshi Nagamochi, Toshihide Ibaraki |
| 1998 | Quadtree Decomposition, Steiner Triangulation, and Ray Shooting. Siu-Wing Cheng, Kam-Hing Lee |
| 1998 | Random Regular Graphs with Edge Faults: Expansion through Cores. Andreas Goerdt |
| 1998 | Randomized K-Dimensional Binary Search Trees. Amalia Duch, Vladimir Estivill-Castro, Conrado Martínez |
| 1998 | Randomized O (log log n)-Round Leader Election Protocols in Packet Radio Networks. Koji Nakano, Stephan Olariu |
| 1998 | Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image. Tetsuo Asano, Hiro Ito, Souichi Kimura, Shigeaki Shimazu |
| 1998 | Selecting the k Largest Elements with Parity Tests. Tak Wah Lam, Hing-Fung Ting |
| 1998 | Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs. Philip N. Klein, Hsueh-I Lu |
| 1998 | Testing the Quality of Manufactured Disks and Cylinders. Prosenjit Bose, Pat Morin |
| 1998 | The Discrepancy Method. Bernard Chazelle |
| 1998 | The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees. Xiao Zhou, Takao Nishizeki |
| 1998 | The Inapproximability of Non NP-hard Optimization Problems. Liming Cai, David W. Juedes, Iyad A. Kanj |
| 1998 | The Steiner Tree Problem in Lambda Guo-Hui Lin, Guoliang Xue |
| 1998 | Two New Families of List Update Algorithms. Frank Schulz |
| 1998 | Two-Layer Planarization in Graph Drawing. Petra Mutzel, René Weiskircher |
| 1998 | Visibility Queries in Simple Polygons and Applications. Boris Aronov, Leonidas J. Guibas, Marek Teichmann, Li Zhang |