| 2001 | A 7/8-Approximation Algorithm for Metric Max TSP. Refael Hassin, Shlomi Rubinstein |
| 2001 | A Decomposition-Based Approach to Layered Manufacturing. Ivaylo Ilinkin, Ravi Janardan, Jayanth Majhi, Jörg Schwerdt, Michiel H. M. Smid, Ram D. Sriram |
| 2001 | A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study. David A. Bader, Bernard M. E. Moret, Mi Yan |
| 2001 | A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs. Xin He |
| 2001 | Admission Control to Minimize Rejections. Avrim Blum, Adam Kalai, Jon M. Kleinberg |
| 2001 | Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Roberto Tamassia |
| 2001 | An Approach for Mixed Upward Planarization. Markus Eiglsperger, Michael Kaufmann |
| 2001 | Approximating Multi-objective Knapsack Problems. Thomas Erlebach, Hans Kellerer, Ulrich Pferschy |
| 2001 | Approximation of Multiobjective Optimization Problems. Mihalis Yannakakis |
| 2001 | Bin Packing with Item Fragmentation. Nir Menakerman, Raphael Rom |
| 2001 | Competitive Analysis of the LRFU Paging Algorithm. Edith Cohen, Haim Kaplan, Uri Zwick |
| 2001 | Complexity Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions. Vladlen Koltun |
| 2001 | Computing Phylogenetic Roots with Bounded Degrees and Errors. Zhi-Zhong Chen, Tao Jiang, Guo-Hui Lin |
| 2001 | Deciding Clique-Width for Graphs of Bounded Tree-Width. Wolfgang Espelage, Frank Gurski, Egon Wanke |
| 2001 | Fast Boolean Matrix Multiplication for Highly Clustered Data. Andreas Björklund, Andrzej Lingas |
| 2001 | Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos |
| 2001 | Higher-Dimensional Packing with Order Constraints. Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich |
| 2001 | I/O-Efficient Shortest Path Queries in Geometric Spanners. Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh |
| 2001 | Movement Planning in the Presence of Flows. John H. Reif, Zheng Sun |
| 2001 | On External-Memory Planar Depth First Search. Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh |
| 2001 | On the Complexity of Scheduling Conditional Real-Time Code. Samarjit Chakraborty, Thomas Erlebach, Lothar Thiele |
| 2001 | On the Reflexivity of Point Sets. Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristán, Saurabh Sethia |
| 2001 | Optimal Algorithms for Two-Guard Walkability of Simple Polygons. Binay K. Bhattacharya, Asish Mukhopadhyay, Giri Narasimhan |
| 2001 | Optimal Möbius Transformations for Information Visualization and Meshing. Marshall W. Bern, David Eppstein |
| 2001 | Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs. Ferran Hurtado, Giuseppe Liotta, Henk Meijer |
| 2001 | Optimization over Zonotopes and Training Support Vector Machines. Marshall W. Bern, David Eppstein |
| 2001 | Partitioning Colored Point Sets into Monochromatic Parts. Adrian Dumitrescu, János Pach |
| 2001 | Practical Approximation Algorithms for Separable Packing Linear Programs. Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky |
| 2001 | Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold |
| 2001 | Search Trees with Relaxed Balance and Near-Optimal Height. Rolf Fagerberg, Rune E. Jensen, Kim S. Larsen |
| 2001 | Secure Multi-party Computational Geometry. Mikhail J. Atallah, Wenliang Du |
| 2001 | Seller-Focused Algorithms for Online Auctioning. Amitabha Bagchi, Amitabh Chaudhary, Rahul Garg, Michael T. Goodrich, Vijay Kumar |
| 2001 | Short and Simple Labels for Small Distances and Other Functions. Haim Kaplan, Tova Milo |
| 2001 | Small Maximal Independent Sets and Faster Exact Graph Coloring. David Eppstein |
| 2001 | Succinct Dynamic Data Structures. Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
| 2001 | The Analysis of a Probabilistic Approach to Nearest Neighbor Searching. Songrit Maneewongvatana, David M. Mount |
| 2001 | The Challenges of Delivering Content on the Internet. Frank Thomson Leighton |
| 2001 | The Grid Placement Problem. Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison |
| 2001 | Time Responsive External Data Structures for Moving Points. Pankaj K. Agarwal, Lars Arge, Jan Vahrenhold |
| 2001 | Upward Embeddings and Orientations of Undirected Planar Graphs. Walter Didimo, Maurizio Pizzonia |
| 2001 | Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming. Philip M. Long |
| 2001 | Visual Ranking of Link Structures. Ulrik Brandes, Sabine Cornelsen |
| 2001 | Voronoi Diagrams for Moving Disks and Applications. Menelaos I. Karavelas |
| 2001 | When Can You Fold a Map? Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Martin L. Demaine, Joseph S. B. Mitchell, Saurabh Sethia, Steven Skiena |