| 1999 | A Faster Algorithm for Finding Disjoint Paths in Grids. Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting |
| 1999 | A Linear Algorithm for Finding Total Colorings of Partial k-Trees. Shuji Isobe, Xiao Zhou, Takao Nishizeki |
| 1999 | A Linear Time Algorithm for Recognizing Regular Boolean Functions. Kazuhisa Makino |
| 1999 | A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. Tetsuo Asano, Naoki Katoh, Kazuhiro Kawashima |
| 1999 | Algorithms and Computation, 10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999, Proceedings Alok Aggarwal, C. Pandu Rangan |
| 1999 | Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs. Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki |
| 1999 | An O(1) Time Algorithm for Generating Multiset Permutations. Tadao Takaoka |
| 1999 | Approximating Multicast Congestion. Santosh S. Vempala, Berthold Vöcking |
| 1999 | Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki |
| 1999 | Approximation Algorithms for Channel Assignment with Constraints. Jeannette C. M. Janssen, Lata Narayanan |
| 1999 | Approximation Algorithms for Some Clustering and Classification Problems. Éva Tardos |
| 1999 | Approximation Algorithms in Batch Processing. Xiaotie Deng, Chung Keung Poon, Yuzhong Zhang |
| 1999 | Asynchronous Random Polling Dynamic Load Balancing. Peter Sanders |
| 1999 | Bisecting Two Subsets in 3-Connected Graphs. Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki |
| 1999 | Carrying Umbrellas: An Online Relocation Problem on Graphs. Jae-Ha Lee, Chong-Dae Park, Kyung-Yong Chwa |
| 1999 | Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs. Mirela Damian-Iordache, Sriram V. Pemmaraju |
| 1999 | Constructing the Suffix Tree of a Tree with a Large Alphabet. Tetsuo Shibuya |
| 1999 | Convexifying Monotone Polygons. Therese C. Biedl, Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, Michael A. Soss |
| 1999 | Efficient Approximation Algorithms for Multi-label Map Labeling. Binhai Zhu, Chung Keung Poon |
| 1999 | Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks. Jacir Luiz Bordim, Jiangtao Cui, Tatsuya Hayashi, Koji Nakano, Stephan Olariu |
| 1999 | External Memory Algorithms for Outerplanar Graphs. Anil Maheshwari, Norbert Zeh |
| 1999 | General Splay: A Basic Theory and Calculus. George F. Georgakopoulos, David J. McClurkin |
| 1999 | Generalized Maximum Independent Sets for Trees in Subquadratic Time. Binay K. Bhattacharya, Michael E. Houle |
| 1999 | Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots. Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer |
| 1999 | Hardness of Approximating Independent Domination in Circle Graphs. Mirela Damian-Iordache, Sriram V. Pemmaraju |
| 1999 | How Many People Can Hide in a Terrain? Stephan J. Eidenbenz |
| 1999 | LexBFS-Ordering in Asteroidal Triple-Free Graphs. Jou-Ming Chang, Chin-Wen Ho, Ming-Tat Ko |
| 1999 | Multiple Spin-Block Decisions. Peter Damaschke |
| 1999 | On-Line Load Balancing of Temporary Tasks Revisited. Kar-Keung To, Prudence W. H. Wong |
| 1999 | Online Routing in Triangulations. Prosenjit Bose, Pat Morin |
| 1999 | Online Scheduling of Parallel Communications with Individual Deadlines. Jae-Ha Lee, Kyung-Yong Chwa |
| 1999 | Ordered Binary Decision Diagrams as Knowledge-Bases. Takashi Horiyama, Toshihide Ibaraki |
| 1999 | Output-Sensitive Algorithms for Uniform Partitions of Points. Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen |
| 1999 | Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs. Fang-Rong Hsu, Yaw-Ling Lin, Yin-Te Tsai |
| 1999 | Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields. Abhijit Das, C. E. Veni Madhavan |
| 1999 | Reverse Center Location Problem. Jianzhong Zhang, Xiaoguang Yang, Mao-cheng Cai |
| 1999 | Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability. Daya Ram Gaur, Ramesh Krishnamurti |
| 1999 | Static Dictionaries Supporting Rank. Venkatesh Raman, S. Srinivasa Rao |
| 1999 | Station Layouts in the Presence of Location Constraints. Prosenjit Bose, Christos Kaklamanis, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, David Peleg |
| 1999 | Survivable Networks with Bounded Delay: The Edge Failure Case. Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke |
| 1999 | The Engineering of Some Bipartite Matching Programs. Kurt Mehlhorn |
| 1999 | The Query Complexity of Program Checking by Constant-Depth Circuits. Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran |
| 1999 | Topology-Oriented Approach to Robust Geometric Computation. Kokichi Sugihara |
| 1999 | Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle. Kazuo Iwama, Shuichi Miyazaki |
| 1999 | Upper Bounds for MaxSat: Further Improved. Nikhil Bansal, Venkatesh Raman |