| 2001 | Some Results on Orthogonal Factorizations. | Haodi Feng |
| 2001 | Membership for Core of LP Games and Other Games. | Qizhi Fang, Shanfeng Zhu, Mao-cheng Cai, Xiaotie Deng |
| 2001 | On-Line Variable Sized Covering. | Leah Epstein |
| 2001 | The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points. | Ding-Zhu Du, Lusheng Wang, Baogang Xu |
| 2001 | Polynomial Time Algorithms for Three-Label Point Labeling. | Rob Duncan, Jianbo Qian, Binhai Zhu |
| 2001 | Counting H-Colorings of Partial k-Trees. | Josep Daz, Maria J. Serna, Dimitrios M. Thilikos |
| 2001 | A Notion of Cross-Perfect Bipartite Graphs. | Milind Dawande |
| 2001 | Decidable Approximations on Generalized and Parameterized Discrete Timed Automata. | Zhe Dang, Oscar H. Ibarra, Richard A. Kemmerer |
| 2001 | Optimizing a Computational Method for Length Lower Bounds for Reflecting Sequences. | H. K. Dai |
| 2001 | Cluttered Orderings for the Complete Graph. | Myra B. Cohen, Charles J. Colbourn, Dalibor Froncek |
| 2001 | A Randomized Algorithm for Gossiping in Radio Networks. | Marek Chrobak, Leszek Gasieniec, Wojciech Rytter |
| 2001 | Computing Farthest Neighbors on a Convex Polytope. | Otfried Cheong, Chan-Su Shin, Antoine Vigneron |
| 2001 | An FPTAS for Weight-Constrained Steiner Trees in Series-Parallel Graphs. | Guangting Chen, Guoliang Xue |
| 2001 | Maximum Red/Blue Interval Matching with Applications. | Danny Z. Chen, Xiaobo Hu, Xiaodong Wu |
| 2001 | Multiplicative Adaptive Algorithms for User Preference Retrieval. | Zhixiang Chen |
| 2001 | Improved On-Line Stream Merging: From a Restricted to a General Setting. | Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong |
| 2001 | Competitive Online Scheduling with Level of Service. | Ee-Chien Chang, Chee-Keng Yap |
| 2001 | Edge Connectivity vs Vertex Connectivity in Chordal Graphs. | L. Sunil Chandran |
| 2001 | A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph. | L. Sunil Chandran |
| 2001 | Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM. | Carla Denise Castanho, Wei Chen, Koichi Wada, Akihiro Fujiwara |
| 2001 | On Testing for Zero Polynomials by a Set of Points with Bounded Precision. | Jin-yi Cai, Eric Bach |
| 2001 | Strong Solutions to the Identification Problem. | Pino Caballero-Gil, Candelaria Hernndez-Goya |
| 2001 | Packing Two Disks into a Polygonal Environment. | Prosenjit Bose, Pat Morin, Antoine Vigneron |
| 2001 | Complete Problems for Valiant's Class of qp-Computable Families of Polynomials. | Markus Blser |
| 2001 | On the Planar Two-Watchtower Problem. | Sergei Bespamyatnikh, Zhixiang Chen, Kanliang Wang, Binhai Zhu |