Conferences in DBLP
George Lake , Thomas Quinn , Derek C. Richardson From Sir Isaac to the Sloan Survey: Calculating the Structure and Chaos Owing to Gravity in the Universe. [Citation Graph (0, 0)][DBLP ] Conf ] Prabhakar Raghavan Information Retrieval Algorithms: A Survey. [Citation Graph (2, 0)][DBLP ] Conf ] Ross M. McConnell , Jeremy Spinrad Linear-Time Transitive Orientation. [Citation Graph (0, 0)][DBLP ] Conf ] Elias Dahlhaus , Jens Gustedt , Ross M. McConnell Efficient and Practical Modular Decomposition. [Citation Graph (0, 0)][DBLP ] Conf ] Jérôme Amilhastre , Philippe Janssen , Marie-Catherine Vilarem Computing a Minimum Biclique Cover is Polynomial for Bipartite Domino-Free Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Yair Bartal , Moses Charikar , Piotr Indyk On Page Migration and Other Related Task Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Ran Bachrach , Ran El-Yaniv Online List Accessing Algorithms and Their Applications: Recent Empirical Evidence. [Citation Graph (0, 0)][DBLP ] Conf ] Amos Fiat , Ziv Rosen Experimental Studies of Access Graph Based Heuristics: Beating the LRU Standard? [Citation Graph (0, 0)][DBLP ] Conf ] Houman Alborzi , Eric Torng , Patchrawat Uthaisombut , Stephen Wagner The k -Client Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Boris V. Cherkassky , Andrew V. Goldberg , Craig Silverstein Buckets, Heaps, Lists, and Monotone Priority Queues. [Citation Graph (0, 0)][DBLP ] Conf ] Edith Cohen , Uri Zwick All-Pairs Small-Stretch Paths. [Citation Graph (0, 0)][DBLP ] Conf ] Guy Kortsarz , David Peleg Approximating Shallow-Light Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Yehuda Afek , Anat Bremler-Barr Self-Stabilizing Unidirectional Network Algorithms by Power-Supply (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Christian A. Duncan , Michael T. Goodrich , Edgar A. Ramos Efficient Approximation and Optimization Algorithms for Computational Metrology. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein Faster Construction of Planar Two-Centers. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Pavan K. Desikan An Efficient Algorithm for Terraine Simplification. [Citation Graph (0, 0)][DBLP ] Conf ] Srinivas Doddi , Madhav V. Marathe , Andy Mirzaian , Bernard M. E. Moret , Binhai Zhu Map Labeling and Its Generalizations. [Citation Graph (0, 0)][DBLP ] Conf ] Gordon T. Wilfong On-line Algorithms for Compressing Planar Curves. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Hoffmann , Christian Icking , Rolf Klein , Klaus Kriegel A Competitive Strategy for Learning a Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Ming-Yang Kao , Stephen R. Tate On-Line Difference Maximization. [Citation Graph (0, 0)][DBLP ] Conf ] Leslie Ann Goldberg , Mark Jerrum Randomly Sampling Molecules. [Citation Graph (0, 0)][DBLP ] Conf ] Ravi Kannan , Prasad Tetali , Santosh Vempala Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Stephen Guattery , Frank Thomson Leighton , Gary L. Miller The Path Resistance Method for Bounding lambda2 of a Laplacian. [Citation Graph (0, 0)][DBLP ] Conf ] Esther M. Arkin , Yi-Jen Chiang , Joseph S. B. Mitchell , Steven Skiena , Tae-Cheon Yang On the Maximum Scatter TSP (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Alok Aggarwal , Don Coppersmith , Sanjeev Khanna , Rajeev Motwani , Baruch Schieber The Angular-Metric Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Xin He , Zhi-Zhong Chen Shortest Path in Complete Bipartite Digraph Problem and its Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Felsner , Lorenz Wernisch Markov Chains for Linear Extensions, the Two-Dimensional Case. [Citation Graph (0, 0)][DBLP ] Conf ] Russ Bubley , Martin E. Dyer Graph Orientations with No Sink and an Approximation for a Hard Case of #SAT. [Citation Graph (0, 0)][DBLP ] Conf ] David Bruce Wilson Determinant Algorithms for Random Planar Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Yanjun Zhang The Variance of Two Game Tree Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] David A. Grable , Alessandro Panconesi Nearly Optimal Distributed Edge Colouring in O(log log n) Rounds. [Citation Graph (0, 0)][DBLP ] Conf ] Sandy Irani , Vitus J. Leung Probabilistic Analysis for Scheduling with Conflicts. [Citation Graph (0, 0)][DBLP ] Conf ] Claudia Bertram-Kretzberg , Hanno Lefmann The Algorithmic Aspects of Uncrowded Hypergraphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Mikkel Thorup Decremental Dynamic Connectivity. [Citation Graph (0, 0)][DBLP ] Conf ] Giuseppe Amato II , Giuseppe Cattaneo , Giuseppe F. Italiano Experimental Analysis of Dynamic Minimum Spanning Tree Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Chandra Chekuri , Andrew V. Goldberg , David R. Karger , Matthew S. Levine , Clifford Stein Experimental Study of Minimum Cut Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] David R. Karger , Ray P. Tai Implementing a Fully Polynomial Time Approximation Scheme for All Terminal Network Reliability. [Citation Graph (0, 0)][DBLP ] Conf ] Haim Kaplan , Ron Shamir , Robert Endre Tarjan Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. [Citation Graph (0, 0)][DBLP ] Conf ] Mikkel Thorup Randomized sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-Wise Boolean Operations. [Citation Graph (0, 0)][DBLP ] Conf ] Jon Louis Bentley , Robert Sedgewick Fast Algorithms for Sorting and Searching Strings. [Citation Graph (1, 0)][DBLP ] Conf ] Anthony LaMarca , Richard E. Ladner The Influence of Caches on the Performance of Sorting. [Citation Graph (1, 0)][DBLP ] Conf ] Ulrich Finkler , Kurt Mehlhorn Runtime Prediction of Real Programs on Real Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Richa Agarwala , Serafim Batzoglou , Vlado Dancík , Scott E. Decatur , Martin Farach , Sridhar Hannenhalli , Steven Skiena Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model. [Citation Graph (0, 0)][DBLP ] Conf ] Tao Jiang , Richard M. Karp Mapping Clones with a Given Ordering or Interleaving (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Jaime Cohen , Martin Farach Numerical Taxonomy on Data: Experimental Results. [Citation Graph (0, 0)][DBLP ] Conf ] Paul E. Kearney , Ryan Hayward , Henk Meijer Inferring Evolutionary Trees from Ordinal Data. [Citation Graph (0, 0)][DBLP ] Conf ] Bhaskar DasGupta , Xin He , Tao Jiang , Ming Li , John Tromp , Louxin Zhang On Distances between Phylogenetic Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Vijay Kumar , Eric J. Schwabe Improved Access to Optimal Bandwidth in Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Louxin Zhang Optimal Bounds for Matching Routing on Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Wun-Tat Chan , Francis Y. L. Chin Efficient Algorithms for Finding Disjoint Paths in Grids (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Timothy M. Chan Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming. [Citation Graph (0, 0)][DBLP ] Conf ] David M. Mount , Nathan S. Netanyahu , Kathleen Romanik , Ruth Silverman , Angela Y. Wu A Practical Approximation Algorithm for the LMS Line Estimator. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Boris Aronov , Micha Sharir Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Yossi Azar , Gerhard J. Woeginger , Tal Yadid Approximation Schemes for Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Skutella Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem. [Citation Graph (0, 0)][DBLP ] Conf ] S. Thomas McCormick , Scott R. Smallwood , Frits C. R. Spieksma Polynomial Algorithms for Multiprocessor Scheduling with a Small Number of Job Lengths. [Citation Graph (0, 0)][DBLP ] Conf ] Christos Levcopoulos , Drago Krznaric A Near-Optimal Heuristic for Minimum Weight Triangulation of Convex Polygons (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Nina Amenta , Marshall W. Bern , David Eppstein Optimal Point Placement for Mesh Smoothing. [Citation Graph (0, 0)][DBLP ] Conf ] Gary L. Miller , Dafna Talmor , Shang-Hua Teng Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes. [Citation Graph (0, 0)][DBLP ] Conf ] Lenore Cowen , Wayne Goddard , C. E. Jesurum Coloring with Defect. [Citation Graph (0, 0)][DBLP ] Conf ] Amitabh Chaudhary , Sundar Vishwanathan Approximation Algorithms for the Achromatic Number. [Citation Graph (0, 0)][DBLP ] Conf ] László Babai The Growth Rate of Vertex-Transitive Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Eugene Neufeld , Wendy J. Myrvold Practical Toroidality Testing. [Citation Graph (0, 0)][DBLP ] Conf ] Fabián A. Chudak , David B. Shmoys Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines That Run at Fifferent Speeds (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Michel X. Goemans Improved Approximation Algorithms for Scheduling with Release Dates. [Citation Graph (0, 0)][DBLP ] Conf ] Leslie Ann Goldberg , Mike Paterson , Aravind Srinivasan , Elizabeth Sweedyk Better Approximation Guarantees for Job-shop Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Chandra Chekuri , Rajeev Motwani , B. Natarajan , Clifford Stein Approximation Techniques for Average Completion Time Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] F. Sibel Salman , Joseph Cheriyan , R. Ravi , S. Subramanian Buy-at-Bulk Network Design: Approximating the Single-Sink Edge Installation Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Cristina G. Fernandes A Better Approximation Ratio for the Minimum k-Edge-Connected Spanning Subgraph Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Guy Even , Joseph Naor , Satish Rao , Baruch Schieber Fast Approximate Graph Partitioning Algorithms. [Citation Graph (1, 0)][DBLP ] Conf ] Hiroshi Nagamochi , Takashi Shiraki , Toshihide Ibaraki Computing Edge-Connectivity Augmentation Function in Õ(nm) Time. [Citation Graph (0, 0)][DBLP ] Conf ] Greg N. Frederickson , Roberto Solis-Oba Efficient Algorithms for Robustness in Matroid Optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Leonard J. Schulman , David Zuckerman Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Dan Boneh , Ramarathnam Venkatesan Rounding in Lattices and its Cryptographic Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Edith Cohen , David D. Lewis Approximating Matrix Multiplication for Pattern Recognition Tasks. [Citation Graph (0, 0)][DBLP ] Conf ] Aravind Srinivasan Improving the Discrepancy Bound for Sparse Matrices: Better Approximations for Sparse Lattice Approximation Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Burnikel , Rudolf Fleischer , Kurt Mehlhorn , Stefan Schirra A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots. [Citation Graph (0, 0)][DBLP ] Conf ] Chung-Piaw Teo , Jay Sethuraman LP Based Approach to Optimal Stable Matchings. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaotie Deng , Toshihide Ibaraki , Hiroshi Nagamochi Combinatorial Optimization Games. [Citation Graph (0, 0)][DBLP ] Conf ] Meena Mahajan , V. Vinay A Combinatorial Algorithm for the Determinant. [Citation Graph (0, 0)][DBLP ] Conf ] Yosi Ben-Asher , Eitan Farchi , Ilan Newman Optimal Search in Trees: Extended Abstract + Appendix. [Citation Graph (0, 0)][DBLP ] Conf ] Julien Basch , Leonidas J. Guibas , John Hershberger Data Structures for Mobile Data. [Citation Graph (3, 0)][DBLP ] Conf ] Michael T. Goodrich , Mark W. Orletsky , Kumar Ramaiyer Methods for Achieving Fast Query Times in Point Location Data Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Michael T. Goodrich Randomized Fully-Scalable BSP Techniques for Multi-Searching and Convex Hull Construction (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Scott D. Cohen , Leonidas J. Guibas Partial Matching of Planar Polylines Under Similarity Transformations. [Citation Graph (0, 0)][DBLP ] Conf ] 