| 1998 | A Cost Optimal Parallel Algorithm for Computing Force Field in N-Body Simulations. | Guoliang Xue |
| 1998 | Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices. | Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang |
| 1998 | A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter. | Jeng-Jung Wang, Ting-Yi Sung, Lih-Hsing Hsu, Men-Yang Lin |
| 1998 | A Grap Optimization Problem in Virtual Colonoscopy. | Jie Wang, Yaorong Ge |
| 1998 | Maximum Weight Triangulation and Its Application on Graph Drawing. | Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang |
| 1998 | Lower Bounds for Wide-Sense Non-blocking Clos Network. | Kuo-Hui Tsai, Da-Wei Wang |
| 1998 | On Boolean Lowness and Boolean Highness. | Steffen Reith, Klaus W. Wagner |
| 1998 | A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree. | Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Chuan Yi Tang |
| 1998 | Algorithmic Approaches to Information Retrieval and Data Mining (Abstract). | Christos H. Papadimitriou |
| 1998 | Eulerian Secret Key Exchange. | Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki |
| 1998 | On the dm Conjecture on Circulant Graphs. | Bernard Mans, Francesco Pappalardi, Igor E. Shparlinski |
| 1998 | An Exact Characterization of Symmetric Functions in qAC | Chi-Jen Lu |
| 1998 | The Ultimate Strategy to Search on m Rays? | Alejandro Lpez-Ortiz, Sven Schuierer |
| 1998 | Better Approximation of Diagonal-Flip Transformation and Rotation Transformation. | Ming Li, Louxin Zhang |
| 1998 | De-amortization of Algorithms. | S. Rao Kosaraju, Mihai Pop |
| 1998 | Min-Max-Boundary Domain Decomposition. | Marcos A. Kiwi, Daniel A. Spielman, Shang-Hua Teng |
| 1998 | Multirate Multicast Switching Networks. | Dongsoo S. Kim, Ding-Zhu Du |
| 1998 | Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses. | Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki |
| 1998 | The Number of Rearrangements in a 3-stage Clos Network Using an Auxiliary Switch. | Frank K. Hwang, Wen-Dar Lin |
| 1998 | Executing Divisible Jobs on a Network with a Fixed Number of Processors. | Tsan-sheng Hsu, Dian Rae Lopez |
| 1998 | The Inherent Dimension of Bounded Counting Classes. | Ulrich Hertrampf |
| 1998 | On the Power of Additive Combinatorial Search Model. | Vladimir Grebinski |
| 1998 | Combinatorial Problems Arising in Massive Data Sets (Abstract). | Fan R. K. Chung, Ronald L. Graham |
| 1998 | The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries. | Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. Pandu Rangan |
| 1998 | On The Bahncard Problem. | Rudolf Fleischer |