Conferences in DBLP
Pankaj K. Agarwal , Matthew J. Katz , Micha Sharir Computing Depth Orders and Related Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Sandeep Sen Selection in Monotone Matrices and Computing kth Nearest Neighbors. [Citation Graph (0, 0)][DBLP ] Conf ] Susanne Albers , Hisashi Koga New On-Line Algorithms for the Page Replication Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Giorgio Ausiello , Esteban Feuerstein , Stefano Leonardi , Leen Stougie , Maurizio Talamo Serving Requests with On-line Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Becker A New Algorithm for the Construction of Optimal B-Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Mark de Berg , Marko de Groot , Mark H. Overmars New Results on Binary Space Partitions in the Plane (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Berman , Andrzej Lingas A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Therese C. Biedl , Goos Kant , Michael Kaufmann On Triangulating Planar Graphs under the Four-Connectivity Constraint. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Leszek Gasieniec , Marek Piotrów , Wojciech Rytter Parallel and Sequential Approximations of Shortest Superstrings. [Citation Graph (0, 0)][DBLP ] Conf ] Jurek Czyzowicz , Hazel Everett , Jean-Marc Robert Separating Translates in the Plane: Combinatorial Bounds and an Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Gautam Das , Paul J. Heffernan , Giri Narasimhan Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Paul F. Dietz , Joel I. Seiferas , Ju Zhang A Tight Lower Bound for On-line Monotonic List Labeling. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Felsner , Rudolf Müller , Lorenz Wernisch Trapezoid Graphs and Generalizations, Geometry and Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] David Fernández-Baca , Giora Slutzki Optimal Parametric Search on Graphs of Bounded Tree-Width. [Citation Graph (0, 0)][DBLP ] Conf ] Michael L. Fredman Lower Bounds for Dynamic Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Arvind Gupta , Naomi Nishimura Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Gupta , Ravi Janardan , Michiel H. M. Smid On Intersection Searching Problems Involving Curved Objects. [Citation Graph (0, 0)][DBLP ] Conf ] Magnús M. Halldórsson , Jaikumar Radhakrishnan Improved Approximations of Independent Sets in Bounded-Degree Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Lisa Higham , Teresa M. Przytycka Asymptotically Optimal Election on Weighted Rings. [Citation Graph (0, 0)][DBLP ] Conf ] Juraj Hromkovic , Ralf Klasing , Walter Unger , Hubert Wagener Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Johan Håstad Recent Results in Hardness of Approximation. [Citation Graph (0, 0)][DBLP ] Conf ] Ben H. H. Juurlink , Harry A. G. Wijshoff The Parallel Hierarchical Memory Model. [Citation Graph (0, 0)][DBLP ] Conf ] Ketan Mulmuley Randomized Geometric Algorithms (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Leonidas Palios Connecting the Maximum Number of Grid Nodes to the Boundary with Non-Intersecting Line Segments. [Citation Graph (0, 0)][DBLP ] Conf ] Marina Papatriantafilou , Philippas Tsigas On Self-Stabilizing Wait-Free Clock Synchronization. [Citation Graph (0, 0)][DBLP ] Conf ] Marcus Peinado Hard Graphs for Randomized Subgraph Exclusion Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Cynthia A. Phillips , Clifford Stein , Joel Wein Task Scheduling in Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Erik Schenk Parallel Dynamic Lowest Common Ancestors. [Citation Graph (0, 0)][DBLP ] Conf ] Sven Schuierer An O(log N) Algorithm to Compute the Kernel of a Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Sven Schuierer Computing the L1 -Diameter and Center of a Simple Rectilinear Polygon in Parallel. [Citation Graph (0, 0)][DBLP ] Conf ] Jop F. Sibeyn , Tim J. Harris Exploiting Locality in LT-RAM Computations. [Citation Graph (0, 0)][DBLP ] Conf ] Mikkel Thorup Efficient Preprocessing of Simple Binary Pattern Forests. [Citation Graph (0, 0)][DBLP ] Conf ] Xiao Zhou , Shin-Ichi Nakano , Takao Nishizeki A Parallel Algorithm for Edge-Coloring Partial k-Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Feodor F. Dragan Dominating Cliques in Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] 