Conferences in DBLP
Sundar Vishwanathan An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Aravind Srinivasan An Extension of the Lovász Local Lemma, and its Applications to Integer Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Gruia Calinescu , Cristina G. Fernandes , Ulrich Finkler , Howard J. Karloff A Better Approximation Algorithm for Finding Planar Subgraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Ka Wong Chong , Tak Wah Lam Improving Biconnectivity Approximation via Local Optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Karpinski , Lawrence L. Larmore , Wojciech Rytter Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees. [Citation Graph (0, 0)][DBLP ] Conf ] S. Muthukrishnan , Martin Müller 0002 Time and Space Efficient Method-Lookup for Object-Oriented Programs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Gerth Stølting Brodal Worst-Case Efficient Priority Queues. [Citation Graph (0, 0)][DBLP ] Conf ] Mikkel Thorup On RAM Priority Queues. [Citation Graph (1, 0)][DBLP ] Conf ] Baruch Awerbuch , Yossi Azar , Yair Bartal On-line Generalized Steiner Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Berman , Avrim Blum , Amos Fiat , Howard J. Karloff , Adi Rosén , Michael E. Saks Randomized Robot Navigation Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Sandy Irani , Vitus J. Leung Scheduling with Conflicts, and Applications to Traffic Signal Control. [Citation Graph (0, 0)][DBLP ] Conf ] Yair Bartal , Stefano Leonardi , Alberto Marchetti-Spaccamela , Jiri Sgall , Leen Stougie Multiprocessor Scheduling with Rejection. [Citation Graph (0, 0)][DBLP ] Conf ] Tetsuo Asano , Danny Z. Chen , Naoki Katoh , Takeshi Tokuyama Polynomial-Time Solutions to Image Segmentation. [Citation Graph (3, 0)][DBLP ] Conf ] Matthew Dickerson , Daniel Scharstein Optimal Placement of Convex Polygons to Maximize Point Containment. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Mark de Berg , Dan Halperin , Micha Sharir Efficient Generation of k-Directional Assembly Sequences. [Citation Graph (0, 0)][DBLP ] Conf ] Michael T. Goodrich Fixed-Dimensional Parallel Linesr Programming via epsilon-Relative-Approximations. [Citation Graph (0, 0)][DBLP ] Conf ] Leslie A. Hall , David B. Shmoys , Joel Wein Scheduling to Minimize Average Completion Time: Off-line and On-line Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Michel X. Goemans , Jon M. Kleinberg An Improved Approximation Ratio for the Minimum Latency Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaotie Deng , Nian Gu , Tim Brecht , KaiCheng Lu Preemptive Scheduling of Parallel Jobs on Multiprocessors. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Rémila Tiling a Figure Using a Height in a Tree. [Citation Graph (0, 0)][DBLP ] Conf ] Marshall W. Bern , Barry Hayes The Complexity of Flat Origami. [Citation Graph (0, 0)][DBLP ] Conf ] Marco Pellegrini Electrostatic Fields without Singularities: Theory and Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] David Alberts , Giuseppe Cattaneo , Giuseppe F. Italiano An Empirical Study of Dynamic Graph Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Siu-Wing Cheng , Moon-Pun Ng Isomorphism Testing and Display of Symmetries in Dynamic Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Daniele Frigioni , Alberto Marchetti-Spaccamela , Umberto Nanni Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Sanjeev Khanna , Rajeev Motwani , Randall H. Wilson On Certificates and Lookahead in Dynamic Graph Problems. [Citation Graph (0, 0)][DBLP ] Conf ] János Komlós , Yuan Ma , Endre Szemerédi Matching Nuts and Bolts in O(n log n) Time (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Marek Piotrów Depth Optimal Sorting Networks Resistant to k Passive Faults. [Citation Graph (0, 0)][DBLP ] Conf ] Mordecai J. Golin Limit Theorems for Minimum-Weight Triangulations, Other Euclidean Functionals, and Probabilistic Recurrence Relations (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Andrei Z. Broder , Alan M. Frieze , Stephen Suen , Eli Upfal An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Anil Kamath , Omri Palmon , Serge A. Plotkin Routing and Admission Control in General Topology Networks with Poisson Arrivals. [Citation Graph (0, 0)][DBLP ] Conf ] Milena Mihail , David Shallcross , Nate Dean , Marco Mostrel A Commercial Application of Survivable Network Design: ITP/INPLANS CCS Network Topology Analyzer. [Citation Graph (0, 0)][DBLP ] Conf ] Adam L. Buchsbaum , Jan P. H. van Santen Selecting Training Inputs via Greedy Rank Covering. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Lupton , F. Miller Maley , Neal E. Young Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic. [Citation Graph (0, 0)][DBLP ] Conf ] Sridhar Hannenhalli , Pavel A. Pevzner To Cut... or Not to Cut (Applications of Comparative Physical Maps in Molecular Evolution). [Citation Graph (0, 0)][DBLP ] Conf ] Tandy Warnow , Donald Ringe , Ann Taylor Reconstructing the Evolutionary History of Natural Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Cole , Ramesh Hariharan An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Monika Rauch Henzinger , Valerie King , Tandy Warnow Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology. [Citation Graph (0, 0)][DBLP ] Conf ] David S. Johnson , Lyle A. McGeoch , Edward E. Rothberg Asymptotic Experimental Analysis for the Held-Karp Traveling Salesman Bound. [Citation Graph (0, 0)][DBLP ] Conf ] Claire Kenyon , Yuval Rabani , Alistair Sinclair Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Claire Kenyon Best-Fit Bin-Packing with Random Order. [Citation Graph (0, 0)][DBLP ] Conf ] Richa Agarwala , Vineet Bafna , Martin Farach , Babu O. Narayanan , Mike Paterson , Mikkel Thorup On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). [Citation Graph (0, 0)][DBLP ] Conf ] Paolo Ferragina , Roberto Grossi Fast String Searching in Secondary Storage: Theoretical Developments And Experimental Results. [Citation Graph (1, 0)][DBLP ] Conf ] David R. Clark , J. Ian Munro Efficient Suffix Trees on Secondary Storage (extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Christos Levcopoulos , Drago Krznaric Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph S. B. Mitchell Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple New Method for the Geometric k-MST Problem. [Citation Graph (1, 0)][DBLP ] Conf ] Hongyan Wang , Pankaj K. Agarwal Approximation Algorithms for Curvature-Constrained Shortest Paths. [Citation Graph (0, 0)][DBLP ] Conf ] Esther M. Arkin , Martin Held , Christopher L. Smith Optimization Problems Related to Zigzag Pocket Machining (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Michele Zito , Ida Pu , Martyn Amos , Alan Gibbons RNC Algorithms for the Uniform Generation of Combinatorial Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Shay Halperin , Uri Zwick Optimal randomized EREW PRAM Algorithms for Finding Spanning Forests and for other Basic Graph Connectivity Problems. [Citation Graph (0, 0)][DBLP ] Conf ] David Bruce Wilson , James Gary Propp How to Get an Exact Sample From a Generic Markov Chain and Sample a Random Spanning Tree From a Directed Graph, Both Within the Cover Time. [Citation Graph (0, 0)][DBLP ] Conf ] Richard M. Karp , Claire Kenyon , Orli Waarts Error-Resilient DNA Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Ehud Kalai Games, Computers, and O.R. [Citation Graph (0, 0)][DBLP ] Conf ] James B. Orlin A Polynomial Time Primal Network Simplex Algorithm for Minimum Cost Flows (An Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Satoru Iwata A Capacity Scaling Algorithm for Convex Cost Submodular Flows. [Citation Graph (0, 0)][DBLP ] Conf ] S. Thomas McCormick A Polynomial Algorithm for Abstract Maximum Flow. [Citation Graph (0, 0)][DBLP ] Conf ] László Babai , Robert Beals , Jin-yi Cai , Gábor Ivanyos , Eugene M. Luks Multiplicative Equations over Commuting Matrices. [Citation Graph (0, 0)][DBLP ] Conf ] Ming-Deh A. Huang , Ashwin J. Rao Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Victor Y. Pan A New Approach to Parallel Computation of Polynomial GCD and to Related Parallel Computations over Fields and Integer Rings. [Citation Graph (0, 0)][DBLP ] Conf ] Harold N. Gabow Perfect Arborescence Packing in Preflow Mincut Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Greg N. Frederickson , Roberto Solis-Oba Increasing the Weight of Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Donald Aingworth , Chandra Chekuri , Rajeev Motwani Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication). [Citation Graph (0, 0)][DBLP ] Conf ] Leslie Ann Goldberg , Philip D. MacKenzie Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers. [Citation Graph (0, 0)][DBLP ] Conf ] Alain J. Mayer , Rafail Ostrovsky , Moti Yung Self-Stabilizing Algorithms for Synchronous Unidirectional Rings. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Yair Bartal , Amos Fiat Distributed Paging for General Networks. [Citation Graph (0, 0)][DBLP ] Conf ] 