| 2001 | An Improved Upper Bound on the Size of Planar Convex-Hulls. | Abdullah N. Arslan, mer Egecioglu |
| 2001 | Graph Separators: A Parameterized View. | Jochen Alber, Henning Fernau, Rolf Niedermeier |
| 2001 | Towards Compatible Triangulations. | Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Ferran Hurtado |
| 2001 | Competitive Facility Location along a Highway. | Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, Ren van Oostrum |
| 2000 | Closure Properties of Real Number Classes under Limits and Computable Operators. | Xizhong Zheng |
| 2000 | One-Way Probabilistic Reversible and Quantum One-Counter Automata. | Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai |
| 2000 | On the Power of Input-Synchronized Alternating Finite Automata. | Hiroaki Yamamoto |
| 2000 | The Complexity of Physical Mapping with Strict Chimerism. | Stephan Weis, Rdiger Reischuk |
| 2000 | Tetrahedralization of Two Nested Convex Polyhedra. | Cao An Wang, Bo-Ting Yang |
| 2000 | Tripods Do Not Pack Densely. | Alexandre Tiskin |
| 2000 | Ordinal On-Line Scheduling on Two Uniform Machines. | Zhiyi Tan, Yong He |
| 2000 | Theory of Trinomial Heaps. | Tadao Takaoka |
| 2000 | A Fast Sorting Algorithm and Its Generalization on Broadcast Communications. | Shyue-Horng Shiau, Chang-Biau Yang |
| 2000 | A Combinatorial Approach to Asymmetric Traitor Tracing. | Reihaneh Safavi-Naini, Yejing Wang |
| 2000 | Generating Necklaces and Strings with Forbidden Substrings. | Frank Ruskey, Joe Sawada |
| 2000 | Some Results on Tries with Adaptive Branching. | Yuriy A. Reznik |
| 2000 | Rectangular Drawings of Plane Graphs Without Designated Corners. | Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki |
| 2000 | On Some Optimization Problems in Obnoxious Facility Location. | Zhongping Qin, Yin-Feng Xu, Binhai Zhu |
| 2000 | Theoretical Problems Related to the Internet. | Christos H. Papadimitriou |
| 2000 | Polyhedral Aspects of the Consecutive Ones Problem. | Marcus Oswald, Gerhard Reinelt |
| 2000 | Logical Analysis of Data with Decomposable Structures. | Hirotaka Ono, Kazuhisa Makino, Toshihide Ibaraki |
| 2000 | An Efficient k Nearest Neighbor Searching Algorithm for a Query Line. | Subhas C. Nandy |
| 2000 | Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction. | Masaki Nakanishi, Kiyoharu Hamaguchi, Toshinobu Kashiwabara |
| 2000 | Computing Optimal Embeddings for Planar Graphs. | Petra Mutzel, Ren Weiskircher |
| 2000 | On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree. | Mirka Miller, Slamin |