Conferences in DBLP
Ran Adler , Yossi Azar Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:1-10 [Conf ] Pankaj K. Agarwal , Lars Arge , Gerth Stølting Brodal , Jeffrey Scott Vitter I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:11-20 [Conf ] Pankaj K. Agarwal , Micha Sharir Motion Planning of a Ball Amid Segments in Three Dimensions. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:21-30 [Conf ] Susanne Albers , Sanjeev Arora , Sanjeev Khanna Page Replacement for General Caching Problems. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:31-40 [Conf ] Gunnar Andersson , Lars Engebretsen , Johan Håstad A New Way to Use Semidefinite Programming with Applications to Linear Equations mod p . [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:41-50 [Conf ] Javed A. Aslam , Katya Pelekhov , Daniela Rus A Practical Clustering Algorithm for Static and Dynamic Information Organization. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:51-60 [Conf ] Yonatan Aumann , Avivit Kapah-Levy Cooperative Sharing and Asynchronous Consensus Using Single-Reader Single-Writer Registers. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:61-70 [Conf ] Reuven Bar-Yehuda Using Homogenous Weights for Approximating the Partial Cover Problem. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:71-75 [Conf ] Gill Barequet A Lower Bound for Hellbronn's Triangle Problem in d Dimensions. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:76-81 [Conf ] Gill Barequet , Sariel Har-Peled Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:82-91 [Conf ] Yair Bartal , Martin Farach-Colton , Shibu Yooseph , Lisa Zhang Fast, Fair, and Frugal Bandwidth Allocation in ATM Networks. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:92-101 [Conf ] Julien Basch , Jeff Erickson , Leonidas J. Guibas , John Hershberger , Li Zhang Kinetic Collision Detection Between Two Simple Polygons. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:102-111 [Conf ] Petra Berenbrink , Christian Scheideler Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:112-121 [Conf ] Sergei Bespamyatnikh , Jack Snoeyink Queries with Segments in Voronoi Diagrams. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:122-129 [Conf ] Therese C. Biedl , Prosenjit Bose , Erik D. Demaine , Anna Lubiw Efficient Algorithms for Petersen's Matching Theorem. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:130-139 [Conf ] John M. Boyer , Wendy J. Myrvold Stop Minding Your p's and q's: A Simplified O (n ) Planar Embedding Algorithm. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:140-146 [Conf ] David Bryant , Mike A. Steel Fast Algorithms for Constructing Optimal Trees from Quartets. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:147-155 [Conf ] Michael R. Capalbo A Small Universal Graph for Bounded-degree Planar Graphs. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:156-160 [Conf ] Timothy M. Chan A Near-Linear Area Bound for Drawing Binary Trees. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:161-168 [Conf ] Barun Chandra , Magnús M. Halldórsson Greedy Local Improvement and Weighted Set Packing Approximation. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:169-176 [Conf ] Moses Charikar , Jon M. Kleinberg , Ravi Kumar , Sridhar Rajagopalan , Amit Sahai , Andrew Tomkins Minimizing Wirelength in Zero and Bounded Skew Clock Trees. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:177-184 [Conf ] Chandra Chekuri , Sanjeev Khanna On Multi-Dimensional Packing Problems. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:185-194 [Conf ] Zhi-Zhong Chen , Xin He , Ming-Yang Kao Nonplanar Topological Inference and Political-Map Graphs. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:195-204 [Conf ] Siu-Wing Cheng , Tamal K. Dey Approximate Minimum Weight Steiner Triangulation in Three Dimensions. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:205-214 [Conf ] Yi-Jen Chiang , Joseph S. B. Mitchell Two-Point Euclidean Shortest Path Queries in the Plane. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:215-224 [Conf ] Ka Wong Chong , Yijie Han , Tak Wah Lam On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:225-234 [Conf ] Richard Cole , Ramesh Hariharan Dynamic LCA Queries on Trees. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:235-244 [Conf ] Richard Cole , Ramesh Hariharan , Piotr Indyk Tree Pattern Matching and Subset Matching in Deterministic O (n log3 n )-time. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:245-254 [Conf ] Lenore Cowen Compact Routing with Minimum Stretch. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:255-260 [Conf ] Miklós Csürös , Ming-Yang Kao Recovering Evolutionary Trees Through Harmonic Greedy Triplets. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:261-270 [Conf ] Artur Czumaj , Przemyslawa Kanarek , Miroslaw Kutylowski , Krzysztof Lorys Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:271-280 [Conf ] Artur Czumaj , Andrzej Lingas On Approximability of the Minimum-Cost k -Connected Spanning Subgraph Problem. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:281-290 [Conf ] Petros Drineas , Alan M. Frieze , Ravi Kannan , Santosh Vempala , V. Vinay Clustering in Large Graphs and Matrices. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:291-299 [Conf ] Christian A. Duncan , Michael T. Goodrich , Stephen G. Kobourov Balanced Aspect Ratio Trees: Combining the Advantages of k -d Trees and Octrees. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:300-309 [Conf ] David Eppstein , David Hart Shortest Paths in an Arrangement with k Line Orientations. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:310-316 [Conf ] Leah Epstein , John Noga , Steven S. Seiden , Jiri Sgall , Gerhard J. Woeginger Randomized Online Scheduling on Two Uniform Machines. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:317-326 [Conf ] Jeff Erickson , Leonidas J. Guibas , Jorge Stolfi , Li Zhang Separation-Sensitive Collision Detection for Convex Objects. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:327-336 [Conf ] Sándor P. Fekete Simplicity and Hardness of the Maximum Traveling Salesman Problem Under Geometric Distances. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:337-345 [Conf ] Alan M. Frieze , Lei Zhao Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:346-355 [Conf ] Harold N. Gabow , Tibor Jordán How to Make a Square Grid Framework with Cables Rigid. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:356-365 [Conf ] Michel X. Goemans , David P. Williamson Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:366-375 [Conf ] Paul W. Goldberg , Pavel A. Pevzner , Süleyman Cenk Sahinalp , Elizabeth Sweedyk , Andrew V. Goldberg , Kostas Tsioutsiouliklis Cut Tree Algorithms. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:376-385 [Conf ] Leslie Ann Goldberg , Paul W. Goldberg , Mike Paterson , Pavel A. Pevzner , Süleyman Cenk Sahinalp , Elizabeth Sweedyk The Complexity of Gene Placement. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:386-395 [Conf ] Michael H. Goldwasser Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:396-405 [Conf ] Stephen Guattery , Gary L. Miller , Noel Walkington Estimating Interpolation Error: A Combinatorial Approach. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:406-413 [Conf ] Torben Hagerup Fast Deterministic Construction of Static Dictionaries. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:414-418 [Conf ] Yijie Han , Xiaojun Shen Parallel Integer Sorting is More Efficient than Parallel Comparison Sorting on Exclusive Write PRAMs. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:419-428 [Conf ] Lenwood S. Heath , Nicholas A. Loehr New Algorithms for Generating Conway Polynomials Over Finite Fields. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:429-437 [Conf ] Monika Rauch Henzinger , Stefano Leonardi Scheduling Multicasts on Unit-Capacity Trees and Meshes. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:438-447 [Conf ] Stefan Hougardy , Hans Jürgen Prömel A 1.598 Approximation Algorithm for the Steiner Problem in Graphs. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:448-453 [Conf ] Piotr Indyk A Small Approximately min-wise Independent Family of Hash Functions. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:454-456 [Conf ] Piotr Indyk , Rajeev Motwani , Suresh Venkatasubramanian Geometric Matching Under Noise: Combinatorial Bounds and Algorithms. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:457-465 [Conf ] Kazuo Iwama , Eiji Miyano An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:466-475 [Conf ] Satoru Iwata Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:476-483 [Conf ] Kamal Jain , Ion I. Mandoiu , Vijay V. Vazirani , David P. Williamson A Primal-Dual Schema Based Approximation Algorithm for the Element Connectivity Problem. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:484-489 [Conf ] Klaus Jansen , Lorant Porkolab Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:490-498 [Conf ] Bala Kalyanasundaram , Kirk Pruhs Eliminating Migration in Multi-Processor Scheduling. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:499-506 [Conf ] Haim Kaplan , Mario Szegedy On-line Complexity of Monotone Set Systems. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:507-516 [Conf ] Naoki Katoh , Hisao Tamaki , Takeshi Tokuyama Parametric Polymatroid Optimization and Its Geometric Applications. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:517-526 [Conf ] Hiroshi Kawazoe , Tetsuo Shibuya , Takeshi Tokuyama Optimal On-line Algorithms for an Electronic Commerce Money Distribution System. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:527-536 [Conf ] Paul E. Kearney , Ming Li , John Tsang , Tao Jiang Recovering Branches on the Tree of Life: An Approximation Algorithm. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:537-546 [Conf ] Claire Kenyon , Nicolas Schabanel The Data Broadcast Problem with Non-Uniform Transmission Rimes. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:547-556 [Conf ] Tracy Kimbrel Interleaved Prefetching. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:557-565 [Conf ] Jon M. Kleinberg , Amit Kumar Wavelength Conversion in Optical Networks. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:566-575 [Conf ] Anton J. Kleywegt , Vijay S. Nori , Martin W. P. Savelsbergh , Craig A. Tovey Online Resource Minimization. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:576-585 [Conf ] Madhukar R. Korupolu , C. Greg Plaxton , Rajmohan Rajaraman Placement Algorithms for Hierarchical Cooperative Caching. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:586-595 [Conf ] Elias Koutsoupias , David Scot Taylor Indexing Schemes for Random Points. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:596-602 [Conf ] Ravi Kumar , D. Sivakumar Roundness Estimation via Random Sampling. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:603-612 [Conf ] Richard E. Ladner , James D. Fix , Anthony LaMarca Cache Performance Analysis of Traversals and Random Accesses. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:613-622 [Conf ] Tak Wah Lam , Kar-Keung To Trade-offs Between Speed and Processor in Hard-Deadline Scheduling. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:623-632 [Conf ] J. Kevin Lanctot , Ming Li , Bin Ma , Shaojiu Wang , Louxin Zhang Distinguishing String Selection Problems. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:633-642 [Conf ] Frank Thomson Leighton , Satish Rao , Aravind Srinivasan New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:643-652 [Conf ] Vincenzo Liberatore Empirical Investigation of the Markov Reference Model. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:653-662 [Conf ] Chi-Jen Lu A Deterministic Approximation Algorithm for a Minmax Integer Programming Problem. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:663-668 [Conf ] Giovanni Manzini An Analysis of the Burrows-Wheeler Transform. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:669-677 [Conf ] Waleed Meleis , Edward S. Davidson Dual-Issue Scheduling with Spills for Binary Trees. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:678-686 [Conf ] Kamesh Munagala , Abhiram G. Ranade I/O-Complexity of Graph Algorithms. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:687-694 [Conf ] Lata Narayanan , Jaroslav Opatrny , Dominique Sotteau All-to-All Optical Routing in Optimal Chordal Rings of Degree Four. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:695-703 [Conf ] Jeffrey D. Oldham Combinatorial Approximation Algorithms for Generalized Flow Problems. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:704-714 [Conf ] Victor Y. Pan , Yanqiang Yu Certified Computation of the Sign of a Matrix Determinant. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:715-724 [Conf ] Marco Pellegrini Rendering Equation Revisited: How to Avoid Explicit Visibility Computations. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:725-733 [Conf ] Balaji Raghavachari , Jeyakesavan Veerasamy Approximation Algorithms for the Asymmetric Postman Problem. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:734-741 [Conf ] Sridhar Rajagopalan , Vijay V. Vazirani On the Bidirected Cut Relaxation for the Metric Steiner Tree Problem. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:742-751 [Conf ] Joe Sawada , Frank Ruskey An Efficient Algorithm for Generating Necklaces with Fixed Density. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:752-758 [Conf ] Petra Schuurman , Gerhard J. Woeginger Preemptive Scheduling with Job-Dependent Setup Times. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:759-767 [Conf ] Jeffrey Shallit , David Swart An Efficient Algorithm for Computing the i th letter of 4n a. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:768-775 [Conf ] Alan Siegel Median Bounds and Their Application. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:776-785 [Conf ] Adam Smith , Subhash Suri Rectangular Tiling in Multi-dimensional Arrays. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:786-794 [Conf ] C. R. Subramanian A Generalization of Janson Inequalities and its Application to Finding Shortest Paths. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:795-804 [Conf ] Kasturi R. Varadarajan , Pankaj K. Agarwal Approximation Algorithms for Bipartite and Non-Bipartite Matching in the Plane. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:805-814 [Conf ] Kevin D. Wayne A New Property and a Faster Algorithm for Baseball Elimination. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:815-819 [Conf ] Gerhard J. Woeginger When Does a Dynamic Programming Formulation Guarantee the Existence of an FPTAS? [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:820-829 [Conf ] Yunhong Zhou , Subhash Suri Analysis of a Bounding Box Heuristic for Object Intersection. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:830-839 [Conf ] Richa Agarwala , Leslie G. Biesecker , Alejandro A. Schäffer Inverse Inbreeding Coefficient Problems with an Application to Linkage Analysis of Recessive Diseases in Inbred Populations. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:840-841 [Conf ] Susanne Albers , Klaus Kursawe , Sven Schuierer Exploring Unknown Environments with Obstacles. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:842-843 [Conf ] Andris Ambainis , Stephen A. Bloch , David L. Schweizer Playing Twenty Questions with a Procrastinator. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:844-845 [Conf ] Javed A. Aslam , April Rasala , Clifford Stein , Neal E. Young Improved Bicriteria Existence Theorems for Scheduling. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:846-847 [Conf ] Giuseppe Ateniese , Gene Tsudik Group Signatures Á la carte . [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:848-849 [Conf ] Ulrike Axen Computing Morse Functions on Triangulated Manifolds. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:850-851 [Conf ] Ivan D. Baev , Waleed Meleis , Alexandre E. Eichenberger Algorithms for Total Weighted Completion Time Scheduling. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:852-853 [Conf ] Brenda S. Baker Parameterized diff. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:854-855 [Conf ] Richard Beigel Finding Maximum Independent Sets in Sparse and General Graphs. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:856-857 [Conf ] Tanya Y. Berger-Wolf , Edward M. Reingold Optimal Multichannel Communication Under Failure. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:858-859 [Conf ] Anne Berry A Wide-Range Efficient Algorithm for Minimal Triangulation. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:860-861 [Conf ] Gill Barequet , Sariel Har-Peled Polygon-containment and Translational min-Hausdorff-Distance between segment Sets are 3SUM-hard. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:862-863 [Conf ] Randeep Bhatia , Samir Khuller , Robert Pless , Yoram J. Sussmann The Full Degree Spanning Tree Problem. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:864-865 [Conf ] Therese C. Biedl , Erik D. Demaine , Martin L. Demaine , Sylvain Lazard , Anna Lubiw , Joseph O'Rourke , Mark H. Overmars , Steve Robbins , Ileana Streinu , Godfried T. Toussaint , Sue Whitesides Locked and Unlocked Polygonal Chains in 3D. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:866-867 [Conf ] Matt Blaze , Joan Feigenbaum , Moni Naor A Formal Treatment of Remotely Keyed Encryption. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:868-869 [Conf ] Andrei Z. Broder , Michael Mitzenmacher , Laurent Moll Unscrambling Address Lines. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:870-871 [Conf ] Kathie Cameron , Jack Edmonds Some Graphic Uses of an Even Number of Odd Nodes. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:872- [Conf ] Chandra Chekuri , Rajeev Motwani Minimizing Weighted Completion Time on a Single Machine. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:873-874 [Conf ] Fabián A. Chudak , David B. Shmoys Improved Approximation Algorithms for a Capacitated Facility Location Problem. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:875-876 [Conf ] Edward G. Coffman Jr. , Alexander L. Stolyar Fluid Limits, Bin Packing, and Stochastic Analysis of Algorithms. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:877-878 [Conf ] Edith Cohen , Haim Kaplan LP-based Analysis of Greedy-dual-size. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:879-880 [Conf ] Johanne Cohen , Pierre Fraigniaud , Margarida Mitjana Scheduling Calls for Multicasting in Tree-Networks. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:881-882 [Conf ] Derek G. Corneil , Stephan Olariu , Lorna Stewart LBFS Orderings and Cocomparability Graphs. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:883-884 [Conf ] Lenore Cowen , Christopher G. Wagner Compact Roundtrip Routing for Digraphs. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:885-886 [Conf ] Celina M. Herrera de Figueiredo , Luerbio Faria , Candido Ferreira Xavier de Mendonça Neto Optimal Node-Degree Bounds for the Complexity of Nonplanarity Parameters. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:887-888 [Conf ] Frank K. H. A. Dehne , Wolfgang Dittrich , David A. Hutchinson , Anil Maheshwari Parallel Virtual Memory. [Citation Graph (1, 0)][DBLP ] SODA, 1999, pp:889-890 [Conf ] Erik D. Demaine , Martin L. Demaine , Anna Lubiw Folding and One Straight Cut Suffice. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:891-892 [Conf ] Tamal K. Dey , Piyush Kumar A Simple Provable Algorithm for Curve Reconstruction. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:893-894 [Conf ] Giovanni Di Crescenzo , Yair Frankel Existence of Multiplicative Secret Sharing Schemes with Polynomial Share Expansion. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:895-896 [Conf ] Yevgeniy Dodis , Venkatesan Guruswami , Sanjeev Khanna The 2-Catalog Segmentation Problem. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:897-898 [Conf ] David Eppstein Incremental and Decremental Maintenance of Planar Width. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:899-900 [Conf ] Ulrich Finkler , Kurt Mehlhorn Checking Priority Queues. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:901-902 [Conf ] Martin Fürer Randomized Splay Trees. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:903-904 [Conf ] Leszek Gasieniec , Jesper Jansson , Andrzej Lingas Efficient Approximation Algorithms for the Hamming Center Problem. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:905-906 [Conf ] Jordan Gergov Algorithms for Compile-Time Memory Optimization. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:907-908 [Conf ] Phillip B. Gibbons , Yossi Matias Synopsis Data Structures for Massive Data Sets. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:909-910 [Conf ] Ashish Goel Stability of Networks and Protocols in the Adversarial Queueing Model for Packet Routing. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:911-912 [Conf ] Andrew V. Goldberg , Bernard M. E. Moret Combinatorial Algorithms Test Sets [CATS]: The ACM/EATCS Platform for Experimental Research. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:913-914 [Conf ] Vladimir Grebinski , Gregory Kucherov Reconstructing Set Partitions. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:915-916 [Conf ] Magnús M. Halldórsson Online Coloring Known Graphs. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:917-918 [Conf ] Gregory L. Heileman , Chaouki T. Abdallah , Bernard M. E. Moret , Bradley J. Smith Dynamical System Representation of Open Address Hash Functions. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:919-920 [Conf ] Mark Huber Efficient Exact Sampling from the Ising Model Using Swendsen-Wang. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:921-922 [Conf ] Louis Ibarra Fully Dynamic Algorithms for Chordal Graphs. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:923-924 [Conf ] Gabriel Istrate The Phase Transition in Random Horn Satisfiability and Its Algorithmic Implications. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:925-926 [Conf ] David S. Johnson , Mario Szegedy What are the Least Tractable Instances of max Tndependent Set? [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:927-928 [Conf ] Anna M. Johnston A Generalized q th Root Algorithm. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:929-930 [Conf ] Tapas Kanungo , David M. Mount , Nathan S. Netanyahu , Christine D. Piatko , Ruth Silverman , Angela Y. Wu Computing Nearest Neighbors for Moving Points and Applications to Clustering. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:931-932 [Conf ] Ming-Yang Kao , Stephen R. Tate Designing Proxies for Stock Market Indices is Computationally Hard. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:933-934 [Conf ] Haim Kaplan , Martin Strauss , Mario Szegedy Just the Fax - Differentiating Voice and Fax Phone Lines Using Call Billing Data. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:935-936 [Conf ] Samir Khuller , Balaji Raghavachari , An Zhu A Uniform Framework for Approximating Weighted Connectivity Problems. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:937-938 [Conf ] Gang Li , Frank Ruskey The Advantages of Forward Thinking in Generating Rooted and Free Trees. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:939-940 [Conf ] Luis-Miguel Lopez , Philippe Narbel An Algorithm to Symbolically Describe Flows on Surfaces. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:941-942 [Conf ] Yossi Matias , Süleyman Cenk Sahinalp On the Optimality of Parsing in Dynamic Dictionary Based Data Compression. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:943-944 [Conf ] Giancarlo Mauri , Giulio Pavesi , Antonio Piccolboni Approximation Algorithms for Protein Folding Prediction. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:945-946 [Conf ] Jacques Mazoyer , Codrin M. Nichitiu , Eric Rémila Compass Permits Leader Election. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:947-948 [Conf ] Matthias Müller-Hannemann Combinatorics Helps for Hexahedral Mesh Generation in CAD. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:949-950 [Conf ] Zeev Nutov Approximating Multiroot 3-Outconnected Subgraphs. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:951-952 [Conf ] Igor Pak Using Stopping Times to Bound Mixing Times. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:953-954 [Conf ] Allon G. Percus , David C. Torney Greedy Algorithms for Optimized DNA Sequencing. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:955-956 [Conf ] Vijaya Ramachandran , Brian Grayson , Michael Dahlin Emulations Between QSM, BSP, and LogP: A Framework for General-Purpose Parallel Algorithm Design. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:957-958 [Conf ] Dana Randall , David Wilson Sampling Spin Configurations of an Ising System. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:959-960 [Conf ] Mark Scharbrodt , Angelika Steger , Horst Weisser Approximability of Scheduling with Fixed Jobs. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:961-962 [Conf ] Jay Sethuraman , Mark S. Squillante Optimal Scheduling of Multiclass Parallel Machines. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:963-964 [Conf ] Ingo Schiermeyer , Bert Randerath Colouring Graphs with Prescribed Induced Cycle Lengths. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:965-966 [Conf ] Andreas S. Schulz , Robert Weismantel An Oracle-Polynomial Time Augmentation Algorithm for Integer Programming. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:967-968 [Conf ] Subhash Suri , George Varghese Packet Filtering in High Speed Networks. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:969-970 [Conf ] Mario Szegedy A Slique Size Bounding Technique with Application to Non-Linear Codes. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:971-972 [Conf ] Eric Torng , Patchrawat Uthaisombut Lower Bounds for SRPT-Subsequence Algorithms for Nonpreemptive Scheduling. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:973-974 [Conf ] Santosh Vempala , Mihalis Yannakakis A Convex Relaxation for the Asymmetric TSP. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:975-976 [Conf ] Narayan Vikas Computational Complexity of Compaction to Cycles. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:977-978 [Conf ] David M. Warme , Pawel Winter , Martin Zachariasen Exact Solutions to Large-scale Plane Steiner Tree Problems. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:979-980 [Conf ] Kevin D. Wayne , Lisa Fleischer Faster Approximation Algorithms for Generalized Flow. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:981-982 [Conf ] Rebecca N. Wright , Sara Spalding Experimental Performance of Shared RSA Modulus Generation. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:983-984 [Conf ] Xinyu Xiang , Martin Held , Joseph S. B. Mitchell Fast and Effective Stripification of Polygonal Surface Models. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:985-986 [Conf ]