Conferences in DBLP
Torben Hagerup Fast Deterministic Processor Allocation. [Citation Graph (0, 0)][DBLP ] Conf ] Ka Wong Chong , Tak Wah Lam Finding Connected Components in O(log n log log n) Time on the EREW PRAM. [Citation Graph (0, 0)][DBLP ] Conf ] David R. Karger Global Min-cuts in RNC, and Other Ramifications of a Simple Min-Cut Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Cheriyan Random Weighted Laplacians, Lovász Minimum Digraphs and Finding Minimum Separators. [Citation Graph (0, 0)][DBLP ] Conf ] Donald E. Knuth The Stanford GraphBase: A Platform for Combinatorial Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Yi-Jen Chiang , Franco P. Preparata , Roberto Tamassia A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps. [Citation Graph (0, 0)][DBLP ] Conf ] John Hershberger , Subhash Suri A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein , Jeff Erickson Iterated Nearest Neighbors and Finding Minimal Polytopes. [Citation Graph (0, 0)][DBLP ] Conf ] Jirí Matousek , David M. Mount , Nathan S. Netanyahu Efficient Randomized Algorithms for the Repeated Median Line Estimator. [Citation Graph (0, 0)][DBLP ] Conf ] Jim Ruppert A New and Simple Algorithm for Quality 2-Dimensional Mesh Generation. [Citation Graph (0, 0)][DBLP ] Conf ] John D. Hobby Polygonal Approximations that Minimize the Number of Inflections. [Citation Graph (0, 0)][DBLP ] Conf ] Naveen Garg , Santosh Vempala , Aman Singla Improved Approximation Algorithms for Biconnected Subgraphs via Better Lower Bounding Techniques. [Citation Graph (0, 0)][DBLP ] Conf ] Heike Ripphausen-Lipa , Dorothea Wagner , Karsten Weihe The Vertex-Disjoint Menger Problem in Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Fred R. McMorris , Tandy Warnow , Thomas Wimer Triangulating Vertex Colored Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Elaine M. Eschen , Jeremy Spinrad An O(n2 ) Algorithm for Circular-Arc Graph Recognition. [Citation Graph (0, 0)][DBLP ] Conf ] Pilar de la Torre , Raymond Greenlaw , Alejandro A. Schäffer Optimal Edge Ranking of Trees in Polynomial Time. [Citation Graph (0, 0)][DBLP ] Conf ] Michael L. Fredman , David S. Johnson , Lyle A. McGeoch , G. Ostheimer Data Structures for Traveling Salesmen. [Citation Graph (0, 0)][DBLP ] Conf ] Adam L. Buchsbaum , Robert Endre Tarjan Confluently Persistent Deques via Data Structural Bootstrapping. [Citation Graph (0, 0)][DBLP ] Conf ] Igal Galperin , Ronald L. Rivest Scapegoat Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Greg N. Frederickson A Data Structure for Dynamically Maintaining Rooted Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Maria M. Klawe , Brendan Mumey Upper and Lower Bounds on Constructing Alphabetic Binary Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Paul F. Dietz , Kurt Mehlhorn , Rajeev Raman , Christian Uhrig Lower Bounds for Set Intersection Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Harold N. Gabow A Representation for Crossing Set Families with Applications to Submodular Flow Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Kevin Lang , Satish Rao Finding Near-Optimal Cuts: An Empirical Evaluation. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew V. Goldberg Scaling Algorithms for the Shortest Paths Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Egon Balas , Sebastián Ceria , Gérard Cornuéjols Solving Mixed 0-1 Programs by a Lift-and-Project Method. [Citation Graph (0, 0)][DBLP ] Conf ] Samir Khuller , Balaji Raghavachari , Neal E. Young Balancing Minimum Spanning and Shortest Path Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Jörg Heistermann , Thomas Lengauer Efficient Automatic Part Nesting on Irregular and Inhomogeneous Surfaces. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Micha Sharir Ray Shooting Amidst Convex Polytopes in Three Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Sunil Arya , David M. Mount Approximate Nearest Neighbor Queries in Fixed Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle , Jirí Matousek On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Paul B. Callahan , S. Rao Kosaraju Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Mordecai J. Golin , Rajeev Raman , Christian Schwarz , Michiel H. M. Smid Randomized Data Structures for the Dynamic Closest-Pair Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Peter N. Yianilos Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces. [Citation Graph (2, 0)][DBLP ] Conf ] Andrei Z. Broder , Alan M. Frieze , Eli Upfal On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas. [Citation Graph (1, 0)][DBLP ] Conf ] Jeanette P. Schmidt , Alan Siegel , Aravind Srinivasan Chernoff-Hoeffding Bounds for Applications with Limited Independence. [Citation Graph (0, 0)][DBLP ] Conf ] Alan M. Frieze , A. J. Radcliffe , Stephen Suen Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Mordecai J. Golin Maxima in Convex Regions. [Citation Graph (0, 0)][DBLP ] Conf ] Yossi Matias , Jeffrey Scott Vitter , Wen-Chun Ni Dynamic Generation of Discrete Random Variates. [Citation Graph (0, 0)][DBLP ] Conf ] Farid Alizadeh , Richard M. Karp , Lee Aaron Newberg , Deborah K. Weisser Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology. [Citation Graph (0, 0)][DBLP ] Conf ] Tandy Warnow Tree Compatibility and Inferring Evoluationary History. [Citation Graph (0, 0)][DBLP ] Conf ] Amihood Amir , Martin Farach , Ramana M. Idury , Johannes A. La Poutré , Alejandro A. Schäffer Improved Dynamic Dictionary Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Raffaele Giancarlo The Suffix of a Square Matrix, with Applications. [Citation Graph (0, 0)][DBLP ] Conf ] H. Ramesh On Traversing Layered Graphs On-line. [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Motwani , Steven J. Phillips , Eric Torng Non-Clairvoyant Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Yossi Azar , Andrei Z. Broder , Mark S. Manasse On-line Choice of On-line Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Ming-Yang Kao , John H. Reif , Stephen R. Tate Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem. [Citation Graph (0, 0)][DBLP ] Conf ] David B. Shmoys , Éva Tardos Scheduling Unrelated Machines with Costs. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaotie Deng , Elias Koutsoupias Competitive Implementation of Parallel Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy Law Snyder , J. Michael Steele Equidistribution of Point Sets for the Traveling Salesman and Related Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Peter M. McIlroy Optimistic Sorting and Information Theoretic Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Michael J. Fischer , Rebecca N. Wright An Efficient Protocol for Unconditionally Secure Secret Key Exchange. [Citation Graph (0, 0)][DBLP ] Conf ] Victor Shoup Fast Construction of Irreducible Polynomials over Finite Fields. [Citation Graph (0, 0)][DBLP ] Conf ] Franz Höfting , Egon Wanke Polynomial Algorithms for Minimum Cost Paths in Periodic Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] David W. Matula A Linear Time 2+epsilon Approximation Algorithm for Edge Connectivity. [Citation Graph (0, 0)][DBLP ] Conf ] 