| 2001 | A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model. James Aspnes, Julia Hartling, Ming-Yang Kao, Junhyong Kim, Gauri Shah |
| 2001 | A Fast Algorithm for Enumerating Bipartite Perfect Matchings. Takeaki Uno |
| 2001 | A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2. Toshihiro Fujito, Tsuyoshi Okumura |
| 2001 | A New Recognition Algorithm for Extended Regular Expressions. Hiroaki Yamamoto |
| 2001 | A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling. Xiaotie Deng, Haodi Feng, Pixing Zhang, Hong Zhu |
| 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 | A Unified Framework for Approximating Multiway Partition Problems. Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki |
| 2001 | Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings Peter Eades, Tadao Takaoka |
| 2001 | Algorithms for Pattern Involvement in Permutations. Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Derek A. Holton |
| 2001 | An Index for the Data Size to Extract Decomposable Structures in LAD. Hirotaka Ono, Mutsunori Yagiura, Toshihide Ibaraki |
| 2001 | Application of M-Convex Submodular Flow Problem to Mathematical Economics. Kazuo Murota, Akihisa Tamura |
| 2001 | Approximate Hotlink Assignment. Evangelos Kranakis, Danny Krizanc, Sunil M. Shende |
| 2001 | Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees. Francis Y. L. Chin, Stanley P. Y. Fung |
| 2001 | Approximation of a Geometric Set Covering Problem. Sofia Kovaleva, Frits C. R. Spieksma |
| 2001 | BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean Spaces. Zheng Sun, John H. Reif |
| 2001 | Baire Category and Nowhere Differentiability for Feasible Real Functions. Josef M. Breutzmann, David W. Juedes, Jack H. Lutz |
| 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 | Chain Reconfiguration. The INs and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages. Sue Whitesides |
| 2001 | Complexity Study on Two Clustering Problems. Louxin Zhang, Song Zhu |
| 2001 | Complexity of Comparing Hidden Markov Models. Rune B. Lyngsø, Christian N. S. Pedersen |
| 2001 | Complexity of Partial Covers of Graphs. Jirí Fiala, Jan Kratochvíl |
| 2001 | Computing the Quartet Distance between Evolutionary Trees in Time O(n log Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen |
| 2001 | Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number. Takayuki Nagoya |
| 2001 | DNA Self-Assembly For Constructing 3D Boxes. Ming-Yang Kao, Vijay Ramachandran |
| 2001 | Delay Optimizations in Quorum Consensus. Xuemin Lin |
| 2001 | Efficient Algorithms for Two Generalized 2-Median Problems on Trees. Shan-Chyun Ku, Chi-Jen Lu, Biing-Feng Wang, Tzu-Chin Lin |
| 2001 | Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs. Xiao Zhou, Takao Nishizeki |
| 2001 | Efficient Algorithms for k-Terminal Cuts on Planar Graphs. Danny Z. Chen, Xiaodong Wu |
| 2001 | Enumerating Floorplans with n Rooms. Shin-Ichi Nakano |
| 2001 | Exact Solutions for CLOSEST STRING and Related Problems. Jens Gramm, Rolf Niedermeier, Peter Rossmanith |
| 2001 | Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works. Hideaki Hori, Shinichi Shimozono, Masayuki Takeda, Ayumi Shinohara |
| 2001 | Generic Algorithms and Key Agreement Protocols Based on Group Actions. Akihiro Yamamura, Kaoru Kurosawa |
| 2001 | Go with the Winners Algorithms for Cliques in Random Graphs. Marcus Peinado |
| 2001 | How to Color a Checkerboard with a Given Distribution - Matrix Rounding Achieving Low 2×2-Discrepancy. Tetsuo Asano, Takeshi Tokuyama |
| 2001 | Image Segmentation with Monotonicity and Smoothness Constraints. Danny Z. Chen, Jie Wang, Xiaodong Wu |
| 2001 | Labeling Points with Weights. Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Alexander Wolff |
| 2001 | Labeling Subway Lines. María Ángeles Garrido, Claudia Iturriaga, Alberto Márquez, José Ramón Portillo, Pedro Reyes, Alexander Wolff |
| 2001 | Multiprocess Time Queue. Andrej Brodnik, Johan Karlsson |
| 2001 | Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups. Takaaki Mizuki, Takao Nishizeki |
| 2001 | On Adaptive Fault Diagnosis for Multiprocessor Systems. Kumiko Nomura, Toshinori Yamada, Shuichi Ueno |
| 2001 | On Game-Theoretic Models of Networks. Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov |
| 2001 | On Min-Max Cycle Bases. Giulia Galbiati |
| 2001 | On Removing the Pushdown Stack in Reachability Constructions. Oscar H. Ibarra, Zhe Dang |
| 2001 | On the Complexity of Train Assignment Problems. Thomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer |
| 2001 | On the Minimum Local-Vertex-Connectivity Augmentation in Graphs. Hiroshi Nagamochi, Toshimasa Ishii |
| 2001 | On-Line Algorithms for Cardinality Constrained Bin Packing Problems. Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov |
| 2001 | On-Line Multicasting in All-Optical Networks. Kenta Hashimoto, Toshinori Yamada, Shuichi Ueno |
| 2001 | On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time. Bo Chen, Xiaotie Deng, Wenan Zang |
| 2001 | Optimization Algorithms for Sweeping a Polygonal Region with Mobile Guards. Jae-Ha Lee, Sang-Min Park, Kyung-Yong Chwa |
| 2001 | Parameterized Complexity: The Main Ideas and Some Research Frontiers. Michael R. Fellows |
| 2001 | Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths. Anna Galluccio, Guido Proietti |
| 2001 | Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata. Takeshi Koshiba |
| 2001 | Quantum Algorithms for Intersection and Proximity Problems. Kunihiko Sadakane, Norito Sugawara, Takeshi Tokuyama |
| 2001 | Randomized Shared Queues Applied to Distributed Optimization Algorithms. Hyunyoung Lee, Jennifer L. Welch |
| 2001 | Recognition and Orientation Algorithms for P Stavros D. Nikolopoulos, Leonidas Palios |
| 2001 | Semi-normal Schedulings: Improvement on Goemans' Algorithm. Jianer Chen, Jingui Huang |
| 2001 | Shortest Path Algorithms: Engineering Aspects. Andrew V. Goldberg |
| 2001 | Small Convex Quadrangulations of Point Sets. David Bremner, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristán |
| 2001 | Suffix Vector: A Space-Efficient Suffix Tree Representation. Krisztián Monostori, Arkady B. Zaslavsky, István Vajk |
| 2001 | The Cent-dian Path Problem on Tree Networks. Ronald I. Becker, Yen-I Chiang, Isabella Lari, Andrea Scozzari |
| 2001 | The Complexity of Some Basic Problems for Dynamic Process Graphs. Andreas Jakoby, Maciej Liskiewicz |
| 2001 | Tight Bounds on Maximal and Maximum Matchings. Therese Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov |
| 2001 | Topological Peeling and Implementation. Danny Z. Chen, Shuang Luan, Jinhui Xu |
| 2001 | Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams. Takashi Horiyama, Toshihide Ibaraki |
| 2001 | Tree-Approximations for the Weighted Cost-Distance Problem. Christian Schindelhauer, Birgitta Weber |