| 1999 | Approximating the Nearest Neighbor Interchange Distance for Evolutionary Trees with Non-uniform Degrees. | Wing-Kai Hon, Tak Wah Lam |
| 1999 | A Competitive Online Algorithm for the Paging Problem with "Shelf" Memory. | Sung-Pil Hong |
| 1999 | Tractable and Intractable Second-Order Matching Problems. | Kouichi Hirata, Keizo Yamada, Masateru Harao |
| 1999 | Multi-coloring Trees. | Magns M. Halldrsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle |
| 1999 | Approximations of Weighted Independent Set and Hereditary Subset Problems. | Magns M. Halldrsson |
| 1999 | A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation. | Joachim Gudmundsson, Christos Levcopoulos |
| 1999 | Distributionally-Hard Languages. | Lance Fortnow, Aduri Pavan, Alan L. Selman |
| 1999 | Efficient Learning of Some Linear Matrix Languages. | Henning Fernau |
| 1999 | Layout Problems on Lattice Graphs. | Josep Daz, Mathew D. Penrose, Jordi Petit, Maria J. Serna |
| 1999 | Minimizing Mean Response Time in Batch Processing System. | Xiaotie Deng, Yuzhong Zhang |
| 1999 | A Cominatorial Approach to Performance Analysis of a Shared-Memory Multiprocessor. | Sajal K. Das, Bhabani P. Sinha, Rajarshi Chaudhuri |
| 1999 | On Covering and Rank Problems for Boolean Matrices and Their Applications. | Carsten Damm, Ki Hang Kim, Fred W. Roush |
| 1999 | GCD of Many Integers. | Gene Cooperman, Sandra Feisel, Joachim von zur Gathen, George Havas |
| 1999 | On the Complexity of Approximating Colored-Graph Problems. | Andrea E. F. Clementi, Pierluigi Crescenzi, Gianluca Rossi |
| 1999 | Improving Parallel Computation with Fast Integer Sorting. | Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam |
| 1999 | Maximum Stabbing Line in 2D Plane. | Francis Y. L. Chin, Cao An Wang, Fu Lee Wang |
| 1999 | Generalized Shooter Location Problem. | Jeet Chaudhuri, Subhas C. Nandy |
| 1999 | On Routing in Circulant Graphs. | Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor E. Shparlinski |
| 1999 | A New Transference Theorem in the Geometry of Numbers. | Jin-yi Cai |
| 1999 | On Bounds for the k-Partitioning of Graphs. | Sergei L. Bezrukov, Robert Elssser, Ulf-Peter Schroeder |
| 1999 | On the Average Sensitivity of Testing Square-Free Numbers. | Anna Bernasconi, Carsten Damm, Igor E. Shparlinski |
| 1999 | Probabilities to Accept Languages by Quantum Finite Automata. | Andris Ambainis, Richard F. Bonner, Rusins Freivalds, Arnolds Kikusts |
| 1999 | On the Negation-Limited Circuit Complexity of Merging. | Kazuyuki Amano, Akira Maruoka, Jun Tarui |
| 1998 | Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K | Wenan Zang |
| 1998 | Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT. | Mutsunori Yagiura, Toshihide Ibaraki |