| 2001 | On the Minimum Local-Vertex-Connectivity Augmentation in Graphs. | Hiroshi Nagamochi, Toshimasa Ishii |
| 2001 | Application of M-Convex Submodular Flow Problem to Mathematical Economics. | Kazuo Murota, Akihisa Tamura |
| 2001 | Suffix Vector: A Space-Efficient Suffix Tree Representation. | Krisztin Monostori, Arkady B. Zaslavsky, Istvn Vajk |
| 2001 | Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups. | Takaaki Mizuki, Takao Nishizeki |
| 2001 | Complexity of Comparing Hidden Markov Models. | Rune B. Lyngs, Christian N. S. Pedersen |
| 2001 | Delay Optimizations in Quorum Consensus. | Xuemin Lin |
| 2001 | Randomized Shared Queues Applied to Distributed Optimization Algorithms. | Hyunyoung Lee, Jennifer L. Welch |
| 2001 | Optimization Algorithms for Sweeping a Polygonal Region with Mobile Guards. | Jae-Ha Lee, Sang-Min Park, Kyung-Yong Chwa |
| 2001 | Efficient Algorithms for Two Generalized 2-Median Problems on Trees. | Shan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang, Tzu-Chin Lin |
| 2001 | Approximate Hotlink Assignment. | Evangelos Kranakis, Danny Krizanc, Sunil M. Shende |
| 2001 | Approximation of a Geometric Set Covering Problem. | Sofia Kovaleva, Frits C. R. Spieksma |
| 2001 | Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata. | Takeshi Koshiba |
| 2001 | Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness. | Hisashi Koga |
| 2001 | Broadcasting with Universal Lists Revisited: Using Competitive Analysis. | Jae-Hoon Kim, Kyung-Yong Chwa |
| 2001 | A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times. | Yoshiyuki Karuno, Hiroshi Nagamochi |
| 2001 | DNA Self-Assembly For Constructing 3D Boxes. | Ming-Yang Kao, Vijay Ramachandran |
| 2001 | The Complexity of Some Basic Problems for Dynamic Process Graphs. | Andreas Jakoby, Maciej Liskiewicz |
| 2001 | On Removing the Pushdown Stack in Reachability Constructions. | Oscar H. Ibarra, Zhe Dang |
| 2001 | Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams. | Takashi Horiyama, Toshihide Ibaraki |
| 2001 | Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works. | Hideaki Hori, Shinichi Shimozono, Masayuki Takeda, Ayumi Shinohara |
| 2001 | On-Line Multicasting in All-Optical Networks. | Kenta Hashimoto, Toshinori Yamada, Shuichi Ueno |
| 2001 | Exact Solutions for CLOSEST STRING and Related Problems. | Jens Gramm, Rolf Niedermeier, Peter Rossmanith |
| 2001 | Shortest Path Algorithms: Engineering Aspects. | Andrew V. Goldberg |
| 2001 | Labeling Subway Lines. | Mara ngeles Garrido, Claudia Iturriaga, Alberto Mrquez, Jos Ramn Portillo, Pedro Reyes, Alexander Wolff |
| 2001 | Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths. | Anna Galluccio, Guido Proietti |