Conferences in DBLP
Juris Hartmanis , Richard Chang , Desh Ranjan , Pankaj Rohatgi Structural Complexity Theory: recent Surprises. [Citation Graph (0, 0)][DBLP ] Conf ] Ravi B. Boppana , Magnús M. Halldórsson Approximating Maximum Independent Sets by Excluding Subgraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Ingo Althöfer , Gautam Das , David P. Dobkin , Deborah Joseph Generating Sparse Spanners for Weighted Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein Finding the k Smallest Spanning Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Goos Kant , Jan van Leeuwen The File Distribution Problem for Processor Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Mark de Berg Translating Polygons with Applications to Hidden Surface Removal. [Citation Graph (0, 0)][DBLP ] Conf ] Franco P. Preparata , Jeffrey Scott Vitter , Mariette Yvinec Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds. [Citation Graph (0, 0)][DBLP ] Conf ] Michel Pocciola Graphics in Flatland Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Gert Vegter The Visibility Diagram: a Data Structure for Visibility Problems and Motion Planning. [Citation Graph (0, 0)][DBLP ] Conf ] Arne Andersson , Tony W. Lai Fast Updating of Well-Balanced Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Ottmann , Derick Wood How to Update a Balanced Binary Tree with a Constant Number of Rotations. [Citation Graph (0, 0)][DBLP ] Conf ] Samuel W. Bent Ranking Trees Generated by Rotations. [Citation Graph (0, 0)][DBLP ] Conf ] Ricardo A. Baeza-Yates , Gaston H. Gonnet , Nivio Ziviani Expected Behaviour Analysis of AVL Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Papadakis , J. Ian Munro , Patricio V. Poblete Analysis of the Expected Search Cost in Skip Lists. [Citation Graph (0, 0)][DBLP ] Conf ] Paul F. Dietz , Ju Zhang Lower Bounds for Monotonic List Labeling. [Citation Graph (0, 0)][DBLP ] Conf ] Christos Levcopoulos , Ola Petersson Sorting Shuffled Monotone Sequences. [Citation Graph (0, 0)][DBLP ] Conf ] Mikhail J. Atallah A Faster Parallel Algorithm for a Matrix Searching Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Dana S. Richards , Jeffrey S. Salowe A Rectilinear Steiner Minimal Tree Algorithm for Convex Point Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Mark de Berg , Marc J. van Kreveld , Bengt J. Nilsson , Mark H. Overmars Finding Shortest Paths in the Presence of Orthogonal Obstacles Using a Combined L1 and Link Metric. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Friedman , John Hershberger , Jack Snoeyink Input-Sensitive Compliant Motion in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Christos Levcopoulos , Andrzej Lingas Fast Algorithms for Greedy Triangulation. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Boris Aronov , Joseph O'Rourke , Catherine A. Schevon Star Unfolding of a Polytope with Applications (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] David Fernández-Baca Space-Sweep Algorithms for Parametric Optimization (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Nickolay M. Korneenko , Horst Martini Approximating Finite Weighted Point Sets by Hyperplanes. [Citation Graph (0, 0)][DBLP ] Conf ] David S. Johnson Data Structures for Traveling Salesmen (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Grammati E. Pantziou , Paul G. Spirakis , Christos D. Zaroliagis Efficient Parallel Algorithms for Shortest Paths in Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender , Rolf H. Möhring The Pathwidth and Treewidth of Cographs. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Arnborg , Andrzej Proskurowski Canonical Representation of Partial 2- and 3-Trees. [Citation Graph (0, 0)][DBLP ] Conf ] David Fernández-Baca , Mark A. Williams On Matroids and Hierarchical Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Ricardo A. Baeza-Yates , Mireille Régnier Fast Algorithms for Two Dimensional and Multiple Pattern Matching (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Jorma Tarhio , Esko Ukkonen Boyer-Moore Approach to Approximate String Matching (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Per Grape Complete Problems With L-samplable Distributions. [Citation Graph (0, 0)][DBLP ] Conf ] John Hershberger Upper Envelope Onion Peeling. [Citation Graph (0, 0)][DBLP ] Conf ] John Hershberger , Subhash Suri Applications of a Semi-Dynamic Convex Hull Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Marc J. van Kreveld , Mark H. Overmars , Pankaj K. Agarwal Intersection Queries in Sets of Disks. [Citation Graph (0, 0)][DBLP ] Conf ] Haijo Schipper , Mark H. Overmars Dynamic Partition Trees. [Citation Graph (0, 0)][DBLP ] Conf ] 