| 1999 | Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs. | Mirela Damian-Iordache, Sriram V. Pemmaraju |
| 1999 | Hardness of Approximating Independent Domination in Circle Graphs. | Mirela Damian-Iordache, Sriram V. Pemmaraju |
| 1999 | Multiple Spin-Block Decisions. | Peter Damaschke |
| 1999 | Survivable Networks with Bounded Delay: The Edge Failure Case. | Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke |
| 1999 | LexBFS-Ordering in Asteroidal Triple-Free Graphs. | Jou-Ming Chang, Chin-Wen Ho, Ming-Tat Ko |
| 1999 | A Faster Algorithm for Finding Disjoint Paths in Grids. | Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting |
| 1999 | Online Routing in Triangulations. | Prosenjit Bose, Pat Morin |
| 1999 | Station Layouts in the Presence of Location Constraints. | Prosenjit Bose, Christos Kaklamanis, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, David Peleg |
| 1999 | Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks. | Jacir Luiz Bordim, JiangTao Cui, Tatsuya Hayashi, Koji Nakano, Stephan Olariu |
| 1999 | Convexifying Monotone Polygons. | Therese C. Biedl, Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, Michael A. Soss |
| 1999 | Generalized Maximum Independent Sets for Trees in Subquadratic Time. | Binay K. Bhattacharya, Michael E. Houle |
| 1999 | Upper Bounds for MaxSat: Further Improved. | Nikhil Bansal, Venkatesh Raman |
| 1999 | A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. | Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima |
| 1999 | The Query Complexity of Program Checking by Constant-Depth Circuits. | Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran |
| 1999 | Output-Sensitive Algorithms for Uniform Partitions of Points. | Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen |
| 1998 | The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees. | Xiao Zhou, Takao Nishizeki |
| 1998 | Approximation Algorithms for Some Optimum Communication Spanning Tree Problems. | Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang |
| 1998 | A New Approach for Speeding Up Enumeration Algorithms. | Takeaki Uno |
| 1998 | Implementing Algorithms and Data Structures: An Educational and Research Perspective. | Roberto Tamassia |
| 1998 | Optimality and Integer Programming Formulations of Triangulations in General Dimension. | Akira Tajima |
| 1998 | Two New Families of List Update Algorithms. | Frank Schulz |
| 1998 | An Optimal Algorithm for On-Line Palletizing at Delivery Industry. | Jochen Rethmann, Egon Wanke |
| 1998 | Optimal Approximate Agreement with Omission Faults. | Richard Plunkett, Alan D. Fekete |
| 1998 | Hamiltonian Decomposition of Recursive Circulants. | Jung-Heum Park |
| 1998 | L | Evanthia Papadopoulou |