| 2001 | On Min-Max Cycle Bases. | Giulia Galbiati |
| 2001 | A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2. | Toshihiro Fujito, Tsuyoshi Okumura |
| 2001 | Complexity of Partial Covers of Graphs. | Jir Fiala, Jan Kratochvl |
| 2001 | Parameterized Complexity: The Main Ideas and Some Research Frontiers. | Michael R. Fellows |
| 2001 | On the Complexity of Train Assignment Problems. | Thomas Erlebach, Martin Gantenbein, Daniel Hrlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhfel, David Scot Taylor, Peter Widmayer |
| 2001 | A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling. | Xiaotie Deng, Haodi Feng, Pixing Zhang, Hong Zhu |
| 2001 | Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees. | Francis Y. L. Chin, Stanley P. Y. Fung |
| 2001 | Image Segmentation with Monotonicity and Smoothness Constraints. | Danny Z. Chen, Jie Wang, Xiaodong Wu |
| 2001 | Efficient Algorithms for k-Terminal Cuts on Planar Graphs. | Danny Z. Chen, Xiaodong Wu |
| 2001 | Topological Peeling and Implementation. | Danny Z. Chen, Shuang Luan, Jinhui Xu |
| 2001 | Semi-normal Schedulings: Improvement on Goemans' Algorithm. | Jianer Chen, Jingui Huang |
| 2001 | On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time. | Bo Chen, Xiaotie Deng, Wenan Zang |
| 2001 | Multiprocess Time Queue. | Andrej Brodnik, Johan Karlsson |
| 2001 | Computing the Quartet Distance between Evolutionary Trees in Time O(n log | Gerth Stlting Brodal, Rolf Fagerberg, Christian N. S. Pedersen |
| 2001 | Baire Category and Nowhere Differentiability for Feasible Real Functions. | Josef M. Breutzmann, David W. Juedes, Jack H. Lutz |
| 2001 | Small Convex Quadrangulations of Point Sets. | David Bremner, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristn |
| 2001 | On Game-Theoretic Models of Networks. | Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov |
| 2001 | Tight Bounds on Maximal and Maximum Matchings. | Therese Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov |
| 2001 | The Cent-dian Path Problem on Tree Networks. | Ronald I. Becker, Yen-I Chiang, Isabella Lari, Andrea Scozzari |
| 2001 | On-Line Algorithms for Cardinality Constrained Bin Packing Problems. | Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov |
| 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 | How to Color a Checkerboard with a Given Distribution - Matrix Rounding Achieving Low 2×2-Discrepancy. | Tetsuo Asano, Takeshi Tokuyama |
| 2001 | Algorithms for Pattern Involvement in Permutations. | Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Derek A. Holton |
| 2000 | Finding Independent Spanning Trees in Partial k-Trees. | Xiao Zhou, Takao Nishizeki |
| 2000 | Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures. | Reina Yoshikawa, Shimin Guo, Kazuhiro Motegi, Yoshihide Igarashi |