Conferences in DBLP
Gianfranco Bilardi , Franco P. Preparata Lower Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:1-12 [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 ] WADS, 1995, pp:13-25 [Conf ] Alex Glozman , Klara Kedem , Gregory Shpitalnik On Some Geometric Selection and Optimization Problems via Sorted Matrices. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:26-37 [Conf ] Ron Holzman , Yosi Marcus , David Peleg Load Balancing in Quorum Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:38-49 [Conf ] Brigitte Kröll , Peter Widmayer Balanced Distributed Search Trees Do Not Exist. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:50-61 [Conf ] Vladimir Estivill-Castro , Jorge Urrutia Two-Floodlight Illumination of Convex Polygons. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:62-73 [Conf ] Gautam Das , Michael T. Goodrich On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra (Preliminary Version). [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:74-85 [Conf ] Cynthia A. Phillips , Clifford Stein , Joel Wein Scheduling Jobs that Arrive Over Time (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:86-97 [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 ] WADS, 1995, pp:98-108 [Conf ] Micha Sharir Arrangements in Higher Dimensions: Voronoi Diagrams, Motion Planning, and Other Applications. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:109-121 [Conf ] Svante Carlsson , Håkan Jonsson Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:122-134 [Conf ] Alejandro López-Ortiz , Sven Schuierer Going Home Through an Unknown Street. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:135-146 [Conf ] Susanne Albers , Hisashi Koga Page Migration with Limited Local Memory Capacity. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:147-158 [Conf ] Sandy Irani , Steven S. Seiden Randomized Algorithms for Metrical Task Systems. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:159-170 [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 ] WADS, 1995, pp:171-182 [Conf ] David G. Kirkpatrick , Jack Snoeyink Computing Common Tangents Without a Separating Line. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:183-193 [Conf ] Edward F. Grove , Ming-Yang Kao , P. Krishnan , Jeffrey Scott Vitter Online Perfect Matching and Mobile Computing. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:194-205 [Conf ] Giorgio Ausiello , Esteban Feuerstein , Stefano Leonardi , Leen Stougie , Maurizio Talamo Competitive Algorithms for the On-line Traveling Salesman. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:206-217 [Conf ] Godfried T. Toussaint Quadrangulations of Planar Sets. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:218-227 [Conf ] Andrzej Lingas , Asish Mukhopadhyay A Linear-time Construction of the Relative Neighborhood Graph within a Histogram. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:228-238 [Conf ] Giuseppe Liotta , Giuseppe Di Battista Computing Proximity Drawings of Trees in the 3-Dimemsional Space. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:239-250 [Conf ] Alan Roberts , Antonios Symvonis , Louxin Zhang Routing on Trees via Matchings. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:251-262 [Conf ] Fred S. Annexstein , Eugene A. Kuchko A Ranking Algorithm for Hamilton Paths in Shuffle-Exchange Graphs. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:263-269 [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 ] WADS, 1995, pp:270-281 [Conf ] Gerth Stølting Brodal Fast Meldable Priority Queues. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:282-290 [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 ] WADS, 1995, pp:291-302 [Conf ] Sanjoy K. Sanjoy , Gara Pruesse Routing with Delays when Storage is Costly. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:303-314 [Conf ] Paul M. B. Vitányi , Ming Li Algorithmic Arguments in Physics of Computation. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:315-333 [Conf ] Lars Arge The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract). [Citation Graph (5, 0)][DBLP ] WADS, 1995, pp:334-345 [Conf ] Yi-Jen Chiang Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep. [Citation Graph (2, 0)][DBLP ] WADS, 1995, pp:346-357 [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 ] WADS, 1995, pp:358-368 [Conf ] Hristo Djidjev A Linear Algorithm for the Maximal Planar Subgraph Problem. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:369-380 [Conf ] Paul B. Callahan , Michael T. Goodrich , Kumar Ramaiyer Topology B-Trees and Their Applications. [Citation Graph (1, 0)][DBLP ] WADS, 1995, pp:381-392 [Conf ] Alistair Moffat , Jyrki Katajainen In-Place Calculation of Minimum-Redundancy Codes. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:393-402 [Conf ] Damon Kaller , Arvind Gupta , Thomas C. Shermer Regular-Factors In The Complements Of Partial k-Trees. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:403-414 [Conf ] Kevin Cattell , Michael J. Dinneen , Michael R. Fellows Obstructions to Within a Few Vertices or Edges of Acyclic. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:415-427 [Conf ] Ramesh Hariharan , Sanjiv Kapoor , Vijay Kumar Faster Enumeration of All Spanning Trees of a Directed Graph. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:428-439 [Conf ] Valerie King A Simpler Minimum Spanning Tree Verification Algorithm. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:440-448 [Conf ] Piotr Berman , Toshihiro Fujito On the Approximation Properties of Independent Set Problem in Degree 3 Graphs. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:449-460 [Conf ] Hoong Chuin Lau Approximation of Constraint Satisfaction via Local Search (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:461-472 [Conf ] Arne Andersson , Kurt Swanson On the Difficulty of Range Searching. [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:473-481 [Conf ] Faith E. Fich , Peter Bro Miltersen Tables Should Be Sorted (On Random Access Machines). [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:482-493 [Conf ] Chris Armen , Clifford Stein Improved Length Bounds for the Shortest Superstring Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:494-505 [Conf ] Vineet Bafna , Babu O. Narayanan , R. Ravi Non-Overlapping Local Alignments (Weighted Independent Sets of Axis Parallel Rectangles). [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:506-517 [Conf ] Kurt Mehlhorn Experiences with the Implementation of Geometric Algorithms (Abstract). [Citation Graph (0, 0)][DBLP ] WADS, 1995, pp:518- [Conf ]