| 1999 | A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees. Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting |
| 1999 | A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs. Xin He, Ming-Yang Kao, Hsueh-I Lu |
| 1999 | A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs. Pavol Hell, Ron Shamir, Roded Sharan |
| 1999 | A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem. Stavros G. Kolliopoulos, Satish Rao |
| 1999 | A Polyhedral Algorithm for Packings and Designs. Lucia Moura |
| 1999 | Adaptively-Secure Distributed Public-Key Systems. Yair Frankel, Philip D. MacKenzie, Moti Yung |
| 1999 | Algorithms - ESA '99, 7th Annual European Symposium, Prague, Czech Republic, July 16-18, 1999, Proceedings Jaroslav Nesetril |
| 1999 | An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling. Bram Verweij, Karen I. Aardal |
| 1999 | Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices. Volker Heun |
| 1999 | Approximation Algorithms for Restoration Capacity Planning. Steven J. Phillips, Jeffery R. Westbrook |
| 1999 | Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design. R. Ravi, F. Sibel Salman |
| 1999 | Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines. Leah Epstein, Jirí Sgall |
| 1999 | Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph. Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki |
| 1999 | Convex Quadratic Programming Relaxations for Network Scheduling Problems. Martin Skutella |
| 1999 | Dilworth's Theorem and Its Application for Path Systems of a Cycle - Implementation and Analysis. András A. Benczúr, Jörg Förster, Zoltán Király |
| 1999 | Efficient Algorithms foe On-Line Symbol Ranking Compression. Giovanni Manzini |
| 1999 | Efficient Algorithms for Integer Programs with Two Variables per Constraint. Reuven Bar-Yehuda, Dror Rawitz |
| 1999 | Efficient Approximation Algorithms for the Achromatic Number. Piotr Krysta, Krzysztof Lorys |
| 1999 | Efficient Searching for Multi-dimensional Data Made Simple. Enrico Nardelli, Maurizio Talamo, Paola Vocca |
| 1999 | Fast and Robust Smallest Enclosing Balls. Bernd Gärtner |
| 1999 | Faster Exact Solutions for Some NP-Hard Problems. Limor Drori, David Peleg |
| 1999 | Geometric Searching over the Rationals. Bernard Chazelle |
| 1999 | How Long Does a Bit Live in a Computer? (abstract). Bernhard Korte |
| 1999 | IP Address Lookup Made Fast and Simple. Pierluigi Crescenzi, Leandro Dardini, Roberto Grossi |
| 1999 | Improving Mergesort for Linked Lists. Salvador Roura |
| 1999 | Load Balancing Using Bisectors - A Tight Average-Case Analysis. Stefan Bischof, Thomas Schickinger, Angelika Steger |
| 1999 | Motif Statistics. Pierre Nicodème, Bruno Salvy, Philippe Flajolet |
| 1999 | Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing. Kazuo Iwama, Eiji Miyano |
| 1999 | Off-Line Temporary Tasks Assignment. Yossi Azar, Oded Regev |
| 1999 | On 2-Coverings and 2-Packings of Laminar Families. Joseph Cheriyan, Tibor Jordán, R. Ravi |
| 1999 | On Computing the Diameter of a Point Set in High Dimensional Euclidean Space. Daniele V. Finocchiaro, Marco Pellegrini |
| 1999 | On Constructing Suffix Arrays in External Memory. Andreas Crauser, Paolo Ferragina |
| 1999 | On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs. Alexander A. Ageev |
| 1999 | On List Update and Work Function Algorithms. Eric J. Anderson, Kirsten Hildrum, Anna R. Karlin, April Rasala, Michael E. Saks |
| 1999 | On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help. Thomas Jansen, Ingo Wegener |
| 1999 | On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees. Ting Chen, Ming-Yang Kao |
| 1999 | On-Line Load Banancing in a Hierarchical Server Topology. Amotz Bar-Noy, Ari Freund, Joseph Naor |
| 1999 | Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness. Ferdinando Cicalese, Daniele Mundici |
| 1999 | Provably Good and Practical Strategies for Non-Uniform Data Management in Networks. Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann |
| 1999 | Quartet Cleaning: Improved Algorithms and Simulations. Vincent Berry, Tao Jiang, Paul E. Kearney, Ming Li, Todd Wareham |
| 1999 | Random Cayley Graphs with O(log[G]) Generators Are Expanders. Igor Pak |
| 1999 | Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems. Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz |
| 1999 | Strategies for Searching with Different Access Costs. Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa |
| 1999 | Sum Multi-coloring of Graphs. Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai |
| 1999 | The 3-Server Problem in the Plane. Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore |
| 1999 | The Impact of Knowledge on Broadcasting Time in Radio Networks. Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc |
| 1999 | Threshold Phenomena in Random Lattices and Efficient Reduction Algorithms. Ali Akhavi |