- Chandra Chekuri, Sanjeev Khanna, Joseph Naor:
A deterministic algorithm for the cost-distance problem. SODA 2001: 232-233 - Chandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin:
Approximation algorithms for the metric labeling problem via a new linear programming formulation. SODA 2001: 109-118 - Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Jack Snoeyink:
Polygonal path approximation with angle constraints. SODA 2001: 342-343 - Guangting Chen, Guoliang Xue:
K-pair delay constrained minimum cost routing in undirected networks. SODA 2001: 230-231 - Ho-Lun Cheng, Tamal K. Dey, Herbert Edelsbrunner, John Sullivan:
Dynamic skin triangulation. SODA 2001: 47-56 - Yi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu:
Orderly spanning trees with applications to graph encoding and graph drawing. SODA 2001: 506-515 - Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang:
Approximation for minimum triangulation of convex polyhedra. SODA 2001: 128-137 - Hana Chockler, Uri Zwick:
Which formulae shrink under random restrictions? SODA 2001: 702-708 - Fan R. K. Chung, Ronald L. Graham, Frank Thomson Leighton:
Guessing secrets. SODA 2001: 723-726 - Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
Selective families, superimposed codes, and broadcasting on unknown radio networks. SODA 2001: 709-718 - Edward G. Coffman Jr., George S. Lueker:
Approximation algorithms for extensible bin packing. SODA 2001: 586-588 - Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat:
A faster implementation of the Goemans-Williamson clustering algorithm. SODA 2001: 17-25 - János Csirik, David S. Johnson, Claire Kenyon:
Better approximation algorithms for bin covering. SODA 2001: 557-566 - Artur Czumaj, Christian Sohler:
Soft kinetic data structures. SODA 2001: 865-872 - Mirela Damian-Iordache, Sriram V. Pemmaraju:
Computing optimal alpha-fat and alpha-small decompositions. SODA 2001: 338-339 - Erik D. Demaine, Alejandro López-Ortiz:
A linear lower bound on index size for text retrieval. SODA 2001: 289-294 - Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro:
On universally easy classes for NP-complete problems. SODA 2001: 910-911 - Yevgeniy Dodis, Peter Winkler:
Universal configurations in light-flipping games. SODA 2001: 926-927 - Benjamin Doerr:
Lattice approximation and linear discrepency of totally unimodular matrices. SODA 2001: 119-125 - Vida Dujmovic, Sue Whitesides:
On validating planar worlds. SODA 2001: 791-792 - Adrian Dumitrescu, Joseph S. B. Mitchell:
Approximation algorithms for TSP with neighborhoods in the plane. SODA 2001: 38-46 - Christian A. Duncan, Stephen G. Kobourov, V. S. Anil Kumar:
Optimal constrained graph exploration. SODA 2001: 807-814 - Alon Efrat, Sariel Har-Peled, Leonidas J. Guibas, T. M. Murali:
Morphing between polylines. SODA 2001: 680-689 - Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian:
Pattern matching for sets of segments. SODA 2001: 295-304 - Daniel W. Engels, Jon Feldman, David R. Karger, Matthias Ruhl:
Parallel processor scheduling with delay constraints. SODA 2001: 577-585 - David Eppstein:
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. SODA 2001: 329-337 - David Eppstein, S. Muthukrishnan:
Internet packet filter management and rectangle geometry. SODA 2001: 827-835 - David Eppstein, Joseph Wang:
Fast approximation of centrality. SODA 2001: 228-229 - Thomas Erlebach, Klaus Jansen, Eike Seidel:
Polynomial-time approximation schemes for geometric graphs. SODA 2001: 671-679 - Paolo Ferragina, Giovanni Manzini:
An experimental study of an opportunistic index. SODA 2001: 269-278