- John M. Boyer, Wendy J. Myrvold:
Stop Minding Your p's and q's: A Simplified O(n) Planar Embedding Algorithm. SODA 1999: 140-146 - Andrei Z. Broder, Michael Mitzenmacher, Laurent Moll:
Unscrambling Address Lines. SODA 1999: 870-871 - David Bryant, Mike A. Steel:
Fast Algorithms for Constructing Optimal Trees from Quartets. SODA 1999: 147-155 - Kathie Cameron, Jack Edmonds:
Some Graphic Uses of an Even Number of Odd Nodes. SODA 1999: 872 - Michael R. Capalbo:
A Small Universal Graph for Bounded-degree Planar Graphs. SODA 1999: 156-160 - Timothy M. Chan:
A Near-Linear Area Bound for Drawing Binary Trees. SODA 1999: 161-168 - Barun Chandra, Magnús M. Halldórsson:
Greedy Local Improvement and Weighted Set Packing Approximation. SODA 1999: 169-176 - Moses Charikar, Jon M. Kleinberg, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai, Andrew Tomkins:
Minimizing Wirelength in Zero and Bounded Skew Clock Trees. SODA 1999: 177-184 - Chandra Chekuri, Sanjeev Khanna:
On Multi-Dimensional Packing Problems. SODA 1999: 185-194 - Chandra Chekuri, Rajeev Motwani:
Minimizing Weighted Completion Time on a Single Machine. SODA 1999: 873-874 - Zhi-Zhong Chen, Xin He, Ming-Yang Kao:
Nonplanar Topological Inference and Political-Map Graphs. SODA 1999: 195-204 - Siu-Wing Cheng, Tamal K. Dey:
Approximate Minimum Weight Steiner Triangulation in Three Dimensions. SODA 1999: 205-214 - Yi-Jen Chiang, Joseph S. B. Mitchell:
Two-Point Euclidean Shortest Path Queries in the Plane. SODA 1999: 215-224 - Ka Wong Chong, Yijie Han, Tak Wah Lam:
On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning Trees. SODA 1999: 225-234 - Fabián A. Chudak, David B. Shmoys:
Improved Approximation Algorithms for a Capacitated Facility Location Problem. SODA 1999: 875-876 - Edward G. Coffman Jr., Alexander L. Stolyar:
Fluid Limits, Bin Packing, and Stochastic Analysis of Algorithms. SODA 1999: 877-878 - Johanne Cohen, Pierre Fraigniaud, Margarida Mitjana:
Scheduling Calls for Multicasting in Tree-Networks. SODA 1999: 881-882 - Edith Cohen, Haim Kaplan:
LP-based Analysis of Greedy-dual-size. SODA 1999: 879-880 - Richard Cole, Ramesh Hariharan:
Dynamic LCA Queries on Trees. SODA 1999: 235-244 - Richard Cole, Ramesh Hariharan, Piotr Indyk:
Tree Pattern Matching and Subset Matching in Deterministic O(n log3 n)-time. SODA 1999: 245-254 - Derek G. Corneil, Stephan Olariu, Lorna Stewart:
LBFS Orderings and Cocomparability Graphs. SODA 1999: 883-884 - Lenore Cowen:
Compact Routing with Minimum Stretch. SODA 1999: 255-260 - Lenore Cowen, Christopher G. Wagner:
Compact Roundtrip Routing for Digraphs. SODA 1999: 885-886 - Giovanni Di Crescenzo, Yair Frankel:
Existence of Multiplicative Secret Sharing Schemes with Polynomial Share Expansion. SODA 1999: 895-896 - Miklós Csürös, Ming-Yang Kao:
Recovering Evolutionary Trees Through Harmonic Greedy Triplets. SODA 1999: 261-270 - Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys:
Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes. SODA 1999: 271-280 - Artur Czumaj, Andrzej Lingas:
On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem. SODA 1999: 281-290 - Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari:
Parallel Virtual Memory. SODA 1999: 889-890 - Erik D. Demaine, Martin L. Demaine, Anna Lubiw:
Folding and One Straight Cut Suffice. SODA 1999: 891-892 - Tamal K. Dey, Piyush Kumar:
A Simple Provable Algorithm for Curve Reconstruction. SODA 1999: 893-894