Conferences in DBLP
Gianfranco Bilardi , Franco P. Preparata Lower Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. [Citation Graph (0, 0)][DBLP ] Conf ] Jerzy W. Jaromczyk , Miroslaw Kowaluk The Two-Line Center Problem from a Polar View: A New Algorithm and Data Structure. [Citation Graph (0, 0)][DBLP ] Conf ] Alex Glozman , Klara Kedem , Gregory Shpitalnik On Some Geometric Selection and Optimization Problems via Sorted Matrices. [Citation Graph (0, 0)][DBLP ] Conf ] Ron Holzman , Yosi Marcus , David Peleg Load Balancing in Quorum Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Brigitte Kröll , Peter Widmayer Balanced Distributed Search Trees Do Not Exist. [Citation Graph (0, 0)][DBLP ] Conf ] Vladimir Estivill-Castro , Jorge Urrutia Two-Floodlight Illumination of Convex Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Gautam Das , Michael T. Goodrich On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Conf ] Cynthia A. Phillips , Clifford Stein , Joel Wein Scheduling Jobs that Arrive Over Time (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Gudmund Skovbjerg Frandsen , Thore Husfeldt , Peter Bro Miltersen , Theis Rauhe , Søren Skyum Dynamic Algorithms for the Dyck Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Micha Sharir Arrangements in Higher Dimensions: Voronoi Diagrams, Motion Planning, and Other Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Svante Carlsson , Håkan Jonsson Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time. [Citation Graph (0, 0)][DBLP ] Conf ] Alejandro López-Ortiz , Sven Schuierer Going Home Through an Unknown Street. [Citation Graph (0, 0)][DBLP ] Conf ] Susanne Albers , Hisashi Koga Page Migration with Limited Local Memory Capacity. [Citation Graph (0, 0)][DBLP ] Conf ] Sandy Irani , Steven S. Seiden Randomized Algorithms for Metrical Task Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Gupta , Ravi Janardan , Jayanth Majhi , Tony C. Woo Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-Axis NC-Machining. [Citation Graph (0, 0)][DBLP ] Conf ] David G. Kirkpatrick , Jack Snoeyink Computing Common Tangents Without a Separating Line. [Citation Graph (0, 0)][DBLP ] Conf ] Edward F. Grove , Ming-Yang Kao , P. Krishnan , Jeffrey Scott Vitter Online Perfect Matching and Mobile Computing. [Citation Graph (0, 0)][DBLP ] Conf ] Giorgio Ausiello , Esteban Feuerstein , Stefano Leonardi , Leen Stougie , Maurizio Talamo Competitive Algorithms for the On-line Traveling Salesman. [Citation Graph (0, 0)][DBLP ] Conf ] Godfried T. Toussaint Quadrangulations of Planar Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Andrzej Lingas , Asish Mukhopadhyay A Linear-time Construction of the Relative Neighborhood Graph within a Histogram. [Citation Graph (0, 0)][DBLP ] Conf ] Giuseppe Liotta , Giuseppe Di Battista Computing Proximity Drawings of Trees in the 3-Dimemsional Space. [Citation Graph (0, 0)][DBLP ] Conf ] Alan Roberts , Antonios Symvonis , Louxin Zhang Routing on Trees via Matchings. [Citation Graph (0, 0)][DBLP ] Conf ] Fred S. Annexstein , Eugene A. Kuchko A Ranking Algorithm for Hamilton Paths in Shuffle-Exchange Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Joan Boyar , Rolf Fagerberg , Kim S. Larsen Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. [Citation Graph (0, 0)][DBLP ] Conf ] Gerth Stølting Brodal Fast Meldable Priority Queues. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitrios Kagaris , Spyros Tragoudas , Grammati E. Pantziou , Christos D. Zaroliagis On the Computation of Fast Data Transmissions in Networks with Capacities and Delays. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjoy K. Sanjoy , Gara Pruesse Routing with Delays when Storage is Costly. [Citation Graph (0, 0)][DBLP ] Conf ] Paul M. B. Vitányi , Ming Li Algorithmic Arguments in Physics of Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Arge The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract). [Citation Graph (5, 0)][DBLP ] Conf ] Yi-Jen Chiang Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep. [Citation Graph (2, 0)][DBLP ] Conf ] Derek G. Corneil , Stephan Olariu , Lorna Stewart Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time. [Citation Graph (0, 0)][DBLP ] Conf ] Hristo Djidjev A Linear Algorithm for the Maximal Planar Subgraph Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Paul B. Callahan , Michael T. Goodrich , Kumar Ramaiyer Topology B-Trees and Their Applications. [Citation Graph (1, 0)][DBLP ] Conf ] Alistair Moffat , Jyrki Katajainen In-Place Calculation of Minimum-Redundancy Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Damon Kaller , Arvind Gupta , Thomas C. Shermer Regular-Factors In The Complements Of Partial k-Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Kevin Cattell , Michael J. Dinneen , Michael R. Fellows Obstructions to Within a Few Vertices or Edges of Acyclic. [Citation Graph (0, 0)][DBLP ] Conf ] Ramesh Hariharan , Sanjiv Kapoor , Vijay Kumar Faster Enumeration of All Spanning Trees of a Directed Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Valerie King A Simpler Minimum Spanning Tree Verification Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Berman , Toshihiro Fujito On the Approximation Properties of Independent Set Problem in Degree 3 Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Hoong Chuin Lau Approximation of Constraint Satisfaction via Local Search (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Arne Andersson , Kurt Swanson On the Difficulty of Range Searching. [Citation Graph (0, 0)][DBLP ] Conf ] Faith E. Fich , Peter Bro Miltersen Tables Should Be Sorted (On Random Access Machines). [Citation Graph (0, 0)][DBLP ] Conf ] Chris Armen , Clifford Stein Improved Length Bounds for the Shortest Superstring Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Vineet Bafna , Babu O. Narayanan , R. Ravi Non-Overlapping Local Alignments (Weighted Independent Sets of Axis Parallel Rectangles). [Citation Graph (0, 0)][DBLP ] Conf ] Kurt Mehlhorn Experiences with the Implementation of Geometric Algorithms (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] 