Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4. WADS 1995: Kingston, Ontario, Canada
- Selim G. Akl, Frank K. H. A. Dehne, Jörg-Rüdiger Sack
, Nicola Santoro:
Algorithms and Data Structures, 4th International Workshop, WADS '95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings. Lecture Notes in Computer Science 955, Springer 1995, ISBN 3-540-60220-8
- Gianfranco Bilardi, Franco P. Preparata:
Lower Bounds to Processor-Time Tradeoffs under Bounded-Speed Message Propagation. 1-12 - Jerzy W. Jaromczyk, Miroslaw Kowaluk:
The Two-Line Center Problem from a Polar View: A New Algorithm and Data Structure. 13-25 - Alex Glozman, Klara Kedem, Gregory Shpitalnik:
On Some Geometric Selection and Optimization Problems via Sorted Matrices. 26-37 - Ron Holzman, Yosi Marcus, David Peleg:
Load Balancing in Quorum Systems (Extended Abstract). 38-49 - Brigitte Kröll, Peter Widmayer:
Balanced Distributed Search Trees Do Not Exist. 50-61 - Vladimir Estivill-Castro, Jorge Urrutia:
Two-Floodlight Illumination of Convex Polygons. 62-73 - Gautam Das, Michael T. Goodrich:
On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra (Preliminary Version). 74-85 - Cynthia A. Phillips, Clifford Stein, Joel Wein:
Scheduling Jobs that Arrive Over Time (Extended Abstract). 86-97 - Gudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Søren Skyum:
Dynamic Algorithms for the Dyck Languages. 98-108 - Micha Sharir:
Arrangements in Higher Dimensions: Voronoi Diagrams, Motion Planning, and Other Applications. 109-121 - Svante Carlsson, Håkan Jonsson:
Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time. 122-134 - Alejandro López-Ortiz, Sven Schuierer:
Going Home Through an Unknown Street. 135-146 - Susanne Albers, Hisashi Koga:
Page Migration with Limited Local Memory Capacity. 147-158 - Sandy Irani, Steven S. Seiden:
Randomized Algorithms for Metrical Task Systems. 159-170 - Prosenjit Gupta, Ravi Janardan, Jayanth Majhi, Tony C. Woo:
Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-Axis NC-Machining. 171-182 - David G. Kirkpatrick, Jack Snoeyink:
Computing Common Tangents Without a Separating Line. 183-193 - Edward F. Grove, Ming-Yang Kao, P. Krishnan, Jeffrey Scott Vitter:
Online Perfect Matching and Mobile Computing. 194-205 - Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo:
Competitive Algorithms for the On-line Traveling Salesman. 206-217 - Godfried T. Toussaint:
Quadrangulations of Planar Sets. 218-227 - Andrzej Lingas, Asish Mukhopadhyay:
A Linear-time Construction of the Relative Neighborhood Graph within a Histogram. 228-238 - Giuseppe Liotta, Giuseppe Di Battista:
Computing Proximity Drawings of Trees in the 3-Dimemsional Space. 239-250 - Alan Roberts, Antonios Symvonis, Louxin Zhang:
Routing on Trees via Matchings. 251-262 - Fred S. Annexstein, Eugene A. Kuchko:
A Ranking Algorithm for Hamilton Paths in Shuffle-Exchange Graphs. 263-269 - Joan Boyar, Rolf Fagerberg, Kim S. Larsen:
Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. 270-281 - Gerth Stølting Brodal:
Fast Meldable Priority Queues. 282-290 - Dimitrios Kagaris, Spyros Tragoudas, Grammati E. Pantziou, Christos D. Zaroliagis:
On the Computation of Fast Data Transmissions in Networks with Capacities and Delays. 291-302 - Sanjoy K. Sanjoy, Gara Pruesse:
Routing with Delays when Storage is Costly. 303-314 - Paul M. B. Vitányi, Ming Li:
Algorithmic Arguments in Physics of Computation. 315-333 - Lars Arge:
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract). 334-345 - Yi-Jen Chiang:
Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep. 346-357 - Derek G. Corneil, Stephan Olariu, Lorna Stewart:
Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time. 358-368 - Hristo N. Djidjev:
A Linear Algorithm for the Maximal Planar Subgraph Problem. 369-380 - Paul B. Callahan, Michael T. Goodrich, Kumar Ramaiyer:
Topology B-Trees and Their Applications. 381-392 - Alistair Moffat, Jyrki Katajainen:
In-Place Calculation of Minimum-Redundancy Codes. 393-402 - Damon Kaller, Arvind Gupta, Thomas C. Shermer:
Regular-Factors In The Complements Of Partial k-Trees. 403-414 - Kevin Cattell, Michael J. Dinneen, Michael R. Fellows:
Obstructions to Within a Few Vertices or Edges of Acyclic. 415-427 - Ramesh Hariharan, Sanjiv Kapoor, Vijay Kumar:
Faster Enumeration of All Spanning Trees of a Directed Graph. 428-439 - Valerie King:
A Simpler Minimum Spanning Tree Verification Algorithm. 440-448 - Piotr Berman, Toshihiro Fujito:
On the Approximation Properties of Independent Set Problem in Degree 3 Graphs. 449-460 - Hoong Chuin Lau:
Approximation of Constraint Satisfaction via Local Search (Extended Abstract). 461-472 - Arne Andersson, Kurt Swanson:
On the Difficulty of Range Searching. 473-481 - Faith E. Fich, Peter Bro Miltersen:
Tables Should Be Sorted (On Random Access Machines). 482-493 - Chris Armen, Clifford Stein:
Improved Length Bounds for the Shortest Superstring Problem (Extended Abstract). 494-505 - Vineet Bafna, Babu O. Narayanan, R. Ravi:
Non-Overlapping Local Alignments (Weighted Independent Sets of Axis Parallel Rectangles). 506-517 - Kurt Mehlhorn:
Experiences with the Implementation of Geometric Algorithms (Abstract). 518
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2023-06-09 20:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
