Conferences in DBLP
Mikhail J. Atallah , Danny Z. Chen Computing the All-Pairs Longest Chain in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Allan Borodin Towards a Better Understanding of the Pure Packet Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Cole Tolerating Faults in Meshes and Other Networks (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Richard M. Karp A Generalization of Binary Search. [Citation Graph (1, 0)][DBLP ] Conf ] Andrew Chi-Chih Yao Groups and Algebraic Complexity (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Marc J. van Kreveld Connected Component and Simple Polygon Intersection Searching (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Nancy M. Amato An Optimal Algorithm for Finding the Separation of Simple Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Arne Andersson Balanced Search Trees Made Simple. [Citation Graph (0, 0)][DBLP ] Conf ] Yasukazu Aoki , Hiroshi Imai , Keiko Imai , David Rappaport Probing a Set of Hyperplanes by Lines and Related Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Arge , Mikael Knudsen , Kirsten Larsen A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms. [Citation Graph (1, 0)][DBLP ] Conf ] Esther M. Arkin , Michael T. Goodrich , Joseph S. B. Mitchell , David M. Mount , Christine D. Piatko , Steven Skiena Point Probe Decision Trees for Geometric Concept Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Deganit Armon , John H. Reif A Dynamic Separator Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Yossi Azar , Bala Kalyanasundaram , Serge A. Plotkin , Kirk Pruhs , Orli Waarts Online Load Balancing of Temporary Tasks. [Citation Graph (0, 0)][DBLP ] Conf ] Hari Balakrishnan , Anand Rajaraman , C. Pandu Rangan Connected Domination and Steiner Set on Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] R. Balasubramanian , Venkatesh Raman , G. Srinivasaraghavan The Complexity of Finding Certain Trees in Tournaments. [Citation Graph (0, 0)][DBLP ] Conf ] Giuseppe Di Battista , Giuseppe Liotta , Francesco Vargiu Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and 3-Planar Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Paul Beame , Faith E. Fich , Rakesh K. Sinha Separating the Power of EREW and CREW PRAMs with Small Communication Width. [Citation Graph (0, 0)][DBLP ] Conf ] Omer Berkman , Yossi Matias , Prabhakar Ragde Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs. [Citation Graph (0, 0)][DBLP ] Conf ] Marshall W. Bern , David Eppstein , Shang-Hua Teng Parallel Construction of Quadtrees and Quality Triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , Jonathan F. Buss , Anna Lubiw Pattern Matching for Permutations. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , Marc J. van Kreveld , Godfried T. Toussaint Filling Polyhedral Molds. [Citation Graph (0, 0)][DBLP ] Conf ] Maw-Shang Chang , Sheng-Lung Peng , Jenn-Liang Liaw Deferred-Query - An Efficient Approach for Problems on interval and Circular-Arc Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Jianer Chen , Saroja P. Kanchi , Arkady Kanevsky On the Complexity of Graph Embeddings (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Kenneth L. Clarkson Algorithms for Polytope Covering and Approximation. [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Codenotti , Giovanni Manzini , Luciano Margara , Giovanni Resta Global Strategies for Augmenting the Efficiency of TSP Heuristics. [Citation Graph (0, 0)][DBLP ] Conf ] Amitava Datta , Hans-Peter Lenhof , Christian Schwarz , Michiel H. M. Smid Static and Dynamic Algorithms for k-Point Clustering Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Devillers , Andreas Fabri Scalable Algorithms for Bichromatic Line Segment Intersection Problems on Coarse Grained Multicomputers. [Citation Graph (0, 0)][DBLP ] Conf ] Paul F. Dietz , Rajeev Raman Persistence, Randomization and Parallelization: On Some Combinatorial Games and their Applications (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Yuzheng Ding , Mark Allen Weiss The K-D Heap: An Efficient Multi-dimensional Priority Queue. [Citation Graph (0, 0)][DBLP ] Conf ] Katrin Dobrindt , Kurt Mehlhorn , Mariette Yvinec A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron. [Citation Graph (0, 0)][DBLP ] Conf ] Alon Efrat , Micha Sharir , Alon Ziv Computing the Smallest k-Enclosing Circle and Related Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Raffaele Giancarlo An Index Data Structure For Matrices, with Applications to Fast Two-Dimensional Pattern Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Thorsten Graf , Klaus Hinrichs A Plane-Sweep Algorithm for the All-Nearest-Neighbors Problem for a Set of Convex Planar Objects. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Gupta , Ravi Janardan , Michiel H. M. Smid Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. [Citation Graph (0, 0)][DBLP ] Conf ] Paul J. Heffernan Generalized Approzimate Algorithms for Point Set Congruence. [Citation Graph (0, 0)][DBLP ] Conf ] Tao Jiang , Ming Li Approximating Shortest Superstrings with Constraints (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Sampath Kannan , Tandy Warnow Tree Reconstruction from Partial Orders. [Citation Graph (0, 0)][DBLP ] Conf ] Ming-Yang Kao , Shang-Hua Teng , Kentaro Toyama Improved Parallel Depth-First Search in Undirected Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] David R. Karger , Rajeev Motwani , G. D. S. Ramkumar On Approximating the Longest Path in a Graph (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Samir Khuller , Balaji Raghavachari , Neal E. Young Designing Multi-Commodity Flow Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Philip N. Klein , Sairam Subramanian A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Marc J. van Kreveld On Fat Partitioning, Fat Covering and the Union Size of Polygons (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Danny Krizanc A Time-Randomness Tradeoff for Selection in Parallel. [Citation Graph (0, 0)][DBLP ] Conf ] Hsueh-I Lu , Philip N. Klein , Robert H. B. Netzer Detecting Race Conditions in Parallel Programs that Use One Semaphore. [Citation Graph (0, 0)][DBLP ] Conf ] Bruce M. Maggs , Monika Rauch An Algorithm for Finding Predecessors in Integer Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Robert S. Maier , René Schott The Exhaustion of Shared Memory: Stochastic Results. [Citation Graph (0, 0)][DBLP ] Conf ] Andy Mirzaian Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Pinaki Mitra , Binay K. Bhattacharya Efficient Approximate Shortest-Path Queries Among Isothetic Rectangular Obstacles. [Citation Graph (0, 0)][DBLP ] Conf ] Larry Palazzi , Jack Snoeyink Counting and Reporting Red/Blue Segment Intersections. [Citation Graph (0, 0)][DBLP ] Conf ] Marco Pellegrini Repetivive Hidden-Surface-Removal for Polyhedral Scenes. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto De Prisco , Angelo Monti On Reconfigurability of VLSI Linear Arrays. [Citation Graph (0, 0)][DBLP ] Conf ] Steven Skiena , Gopalakrishnan Sundaram Reconstructing Strings from Substrings (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Diane L. Souvaine , Chee-Keng Yap Combinatorial Complexity of Signed Discs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Matthias F. M. Stallmann , Thomas A. Hughes Fast Algorithms for One-Dimensional Compaction with Jog Insertion. [Citation Graph (0, 0)][DBLP ] Conf ] Kurt Swanson An Optimal Algorithm for Roundness Determination on Convex Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Arne Telle , Andrzej Proskurowski Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Jeffery Westbrook , Dicky C. K. Yan Greedy Algorithms for the On-Line Steiner Tree and Generalized Steiner Problems. [Citation Graph (0, 0)][DBLP ] Conf ] 