| 2000 | A 2-Approximation Algorithm for Path Coloring on Trees of Rings. Xiaotie Deng, Yi Zhou, Guojun Li, Wenan Zang |
| 2000 | A Better Lower Bound for Two-Circle Point Labeling. Alexander Wolff, Michael Thon, Yin-Feng Xu |
| 2000 | A Near Optimal Algorithm for Vertex Connectivity Augmentation. Bill Jackson, Tibor Jordán |
| 2000 | A New Competitive Analysis of Randomized Caching. Ching Law, Charles E. Leiserson |
| 2000 | A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors. Jingui Huang, Jianer Chen, Songqiao Chen |
| 2000 | A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane. Norihiro Kubo, Shinichi Shimozono, Katsuhiro Muramoto |
| 2000 | Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings D. T. Lee, Shang-Hua Teng |
| 2000 | An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs. Seok-Hee Hong, Peter Eades |
| 2000 | An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree. Q. S. Wu, Chin Lung Lu, Richard C. T. Lee |
| 2000 | An Improved Algorithm for Subdivision Traversal without Extra Storage. Prosenjit Bose, Pat Morin |
| 2000 | An Intuitive and Effective New Representation for Interconnection Network Structures. Jianer Chen, Lihua Liu, Songqiao Chen, Weijia Jia |
| 2000 | Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits. Takao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda |
| 2000 | Characterization of Rooms Searchable by Two Guards. Sang-Min Park, Kyung-Yong Chwa, Jae-Ha Lee |
| 2000 | Classification of Various Neighborhood Operations for the Nurse Scheduling Problem. Takayuki Osogami, Hiroshi Imai |
| 2000 | Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array. Kunihiko Sadakane |
| 2000 | Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width. Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender |
| 2000 | Convex Grid Drwaings of Four-Connected Plane Graphs. Kazuyuki Miura, Takao Nishizeki, Shin-Ichi Nakano |
| 2000 | Derandomizing Arthur-Merlin Games under Uniform Assumptions. Chi-Jen Lu |
| 2000 | Deterministic Broadcasting Time with Partial Knowledge of the Network. Gianluca De Marco, Andrzej Pelc |
| 2000 | Efficient Minus and Signed Domination in Graphs. Chin Lung Lu, Sheng-Lung Peng, Chuan Yi Tang |
| 2000 | Essentially Every Unimodular Matrix Defines and Expander. Jin-Yi Cai |
| 2000 | Finding Independent Spanning Trees in Partial k-Trees. Xiao Zhou, Takao Nishizeki |
| 2000 | Finding a Two-Core of a Tree in Linear Time. Biing-Feng Wang, Jyh-Jye Lin |
| 2000 | Generalized Petter Kristiansen, Jan Arne Telle |
| 2000 | Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers. Wing-Kai Hon, Ming-Yang Kao, Tak Wah Lam |
| 2000 | Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets. Hiro Ito, Yuichiro Itatsu, Hideyuki Uehara, Mitsuo Yokoyama, Motoyasu Ito |
| 2000 | Maintenance of a Percing Set for Intervals with Applications. Matthew J. Katz, Frank Nielsen, Michael Segal |
| 2000 | Minimizing Makespan in Batch Machine Scheduling. Chung Keung Poon, Pixing Zhang |
| 2000 | On Approximating Minimum Vertex Cover for Graphs with Perfect Matching. Jianer Chen, Iyad A. Kanj |
| 2000 | On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER. Rolf Niedermeier, Peter Rossmanith |
| 2000 | Online Routing in Convex Subdivisions. Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, Alejandro López-Ortiz |
| 2000 | Optimal Beam Penetrations in Two and Three Dimensions. Danny Z. Chen, Xiaobo Hu, Jinhui Xu |
| 2000 | Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets. Yuyu Chen, Ming-Yang Kao, Hsueh-I Lu |
| 2000 | Optimal Polygon Cover Problems and Applcations. Danny Z. Chen, Xiaobo Hu, Xiaodong Wu |
| 2000 | Phylogenetic Guo-Hui Lin, Tao Jiang, Paul E. Kearney |
| 2000 | Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time. Klaus Jansen, Lorant Porkolab |
| 2000 | Randomized Leader Election Protocols in Radio Networks with No Collision Detection. Koji Nakano, Stephan Olariu |
| 2000 | Reasoning with Ordered Binary Decision Diagrams. Takashi Horiyama, Toshihide Ibaraki |
| 2000 | Searching a Simple Polygon by a Xuehou Tan |
| 2000 | Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures. Reina Yoshikawa, Shimin Guo, Kazuhiro Motegi, Yoshihide Igarashi |
| 2000 | Simple Algorithms for a Weighted Interval Selection Problem. Thomas Erlebach, Frits C. R. Spieksma |
| 2000 | Simultaneous Augmentation of Two Graphs to an Toshimasa Ishii, Hiroshi Nagamochi |
| 2000 | Some Formal Analysis of Roccio's Similarity-Based Relvance Feedback Algorithm. Zhixiang Chen, Binhai Zhu |
| 2000 | Strategies for Hotlink Assignments. Prosenjit Bose, Evangelos Kranakis, Danny Krizanc, Miguel Vargas Martin, Jurek Czyzowicz, Andrzej Pelc, Leszek Gasieniec |
| 2000 | Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison. Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting |
| 2000 | Undecidability Results for Monoids with Linear-Time Decidable Word Problems. Masashi Katsura, Yuji Kobayashi, Friedrich Otto |
| 2000 | Voronoi Diagram of a Circle Set Constructed from Voronoi Diagram of a Point Set. Deok-Soo Kim, Donguk Kim, Kokichi Sugihara |
| 2000 | Voronoi-Based Systems of Coordinates and Surface Reconstruction. Jean-Daniel Boissonnat |
| 2000 | coping with Delays and Time-Outs in Binary Search Procedures. Ferdinando Cicalese, Ugo Vaccaro |