Search results for "WADS"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Chris Armen, Clifford Stein 0001	Improved Length Bounds for the Shortest Superstring Problem (Extended Abstract).	WADS	1995	DBLP DOI BibTeX RDF
1	Yi-Jen Chiang	Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep.	WADS	1995	DBLP DOI BibTeX RDF
1	Arne Andersson, Kurt Swanson	On the Difficulty of Range Searching.	WADS	1995	DBLP DOI BibTeX RDF
1	Alejandro López-Ortiz, Sven Schuierer	Going Home Through an Unknown Street.	WADS	1995	DBLP DOI BibTeX RDF
1	Ramesh Hariharan, Sanjiv Kapoor, Vijay Kumar	Faster Enumeration of All Spanning Trees of a Directed Graph.	WADS	1995	DBLP DOI BibTeX RDF
1	Paul M. B. Vitányi, Ming Li 0001	Algorithmic Arguments in Physics of Computation.	WADS	1995	DBLP DOI BibTeX RDF
1	Micha Sharir	Arrangements in Higher Dimensions: Voronoi Diagrams, Motion Planning, and Other Applications.	WADS	1995	DBLP DOI BibTeX RDF
1	Paul B. Callahan, Michael T. Goodrich, Kumar Ramaiyer	Topology B-Trees and Their Applications.	WADS	1995	DBLP DOI BibTeX RDF
1	Fred S. Annexstein, Eugene A. Kuchko	A Ranking Algorithm for Hamilton Paths in Shuffle-Exchange Graphs.	WADS	1995	DBLP DOI BibTeX RDF
1	Piotr Berman, Toshihiro Fujito	On the Approximation Properties of Independent Set Problem in Degree 3 Graphs.	WADS	1995	DBLP DOI BibTeX RDF
1	Jerzy W. Jaromczyk, Miroslaw Kowaluk	The Two-Line Center Problem from a Polar View: A New Algorithm and Data Structure.	WADS	1995	DBLP DOI BibTeX RDF
1	Giuseppe Liotta, Giuseppe Di Battista	Computing Proximity Drawings of Trees in the 3-Dimemsional Space.	WADS	1995	DBLP DOI BibTeX RDF
1	Brigitte Kröll, Peter Widmayer	Balanced Distributed Search Trees Do Not Exist.	WADS	1995	DBLP DOI BibTeX RDF
1	Sanjoy K. Sanjoy, Gara Pruesse	Routing with Delays when Storage is Costly.	WADS	1995	DBLP DOI BibTeX RDF
1	Svante Carlsson, Håkan Jonsson 0001	Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time.	WADS	1995	DBLP DOI BibTeX RDF
1	Cynthia A. Phillips, Clifford Stein 0001, Joel Wein	Scheduling Jobs that Arrive Over Time (Extended Abstract).	WADS	1995	DBLP DOI BibTeX RDF
1	Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi 0001, Leen Stougie, Maurizio Talamo	Competitive Algorithms for the On-line Traveling Salesman.	WADS	1995	DBLP DOI BibTeX RDF
1	Alistair Moffat, Jyrki Katajainen	In-Place Calculation of Minimum-Redundancy Codes.	WADS	1995	DBLP DOI BibTeX RDF
1	Lars Arge	The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract).	WADS	1995	DBLP DOI BibTeX RDF
1	Faith E. Fich, Peter Bro Miltersen	Tables Should Be Sorted (On Random Access Machines).	WADS	1995	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Marc J. van Kreveld	Connected Component and Simple Polygon Intersection Searching (Extended Abstract).	WADS	1993	DBLP DOI BibTeX RDF
1	Paul Beame, Faith E. Fich, Rakesh K. Sinha	Separating the Power of EREW and CREW PRAMs with Small Communication Width.	WADS	1993	DBLP DOI BibTeX RDF
1	Kenneth L. Clarkson	Algorithms for Polytope Covering and Approximation.	WADS	1993	DBLP DOI BibTeX RDF
1	Hari Balakrishnan, Anand Rajaraman, C. Pandu Rangan	Connected Domination and Steiner Set on Asteroidal Triple-Free Graphs.	WADS	1993	DBLP DOI BibTeX RDF
1	Omer Berkman, Yossi Matias, Prabhakar Ragde	Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs.	WADS	1993	DBLP DOI BibTeX RDF
1	Roberto De Prisco, Angelo Monti	On Reconfigurability of VLSI Linear Arrays.	WADS	1993	DBLP DOI BibTeX RDF
1	Hsueh-I Lu, Philip N. Klein, Robert H. B. Netzer	Detecting Race Conditions in Parallel Programs that Use One Semaphore.	WADS	1993	DBLP DOI BibTeX RDF
1	Jeffery R. Westbrook, Dicky C. K. Yan	Greedy Algorithms for the On-Line Steiner Tree and Generalized Steiner Problems.	WADS	1993	DBLP DOI BibTeX RDF
1	Richard Cole 0001	Tolerating Faults in Meshes and Other Networks (Abstract).	WADS	1993	DBLP DOI BibTeX RDF
1	Andrew Chi-Chih Yao	Groups and Algebraic Complexity (Abstract).	WADS	1993	DBLP DOI BibTeX RDF
1	Arne Andersson	Balanced Search Trees Made Simple.	WADS	1993	DBLP DOI BibTeX RDF
1	Kurt Swanson	An Optimal Algorithm for Roundness Determination on Convex Polygons.	WADS	1993	DBLP DOI BibTeX RDF
1	Mikhail J. Atallah, Danny Z. Chen	Computing the All-Pairs Longest Chain in the Plane.	WADS	1993	DBLP DOI BibTeX RDF
1	Raffaele Giancarlo	An Index Data Structure For Matrices, with Applications to Fast Two-Dimensional Pattern Matching.	WADS	1993	DBLP DOI BibTeX RDF
1	David R. Karger, Rajeev Motwani 0001, G. D. S. Ramkumar	On Approximating the Longest Path in a Graph (Preliminary Version).	WADS	1993	DBLP DOI BibTeX RDF
1	Paul F. Dietz, Rajeev Raman	Persistence, Randomization and Parallelization: On Some Combinatorial Games and their Applications (Abstract).	WADS	1993	DBLP DOI BibTeX RDF
1	Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, Sue Whitesides (eds.)	Algorithms and Data Structures, Third Workshop, WADS '93, Montréal, Canada, August 11-13, 1993, Proceedings	WADS	1993	DBLP DOI BibTeX RDF
1	Alon Efrat, Micha Sharir, Alon Ziv	Computing the Smallest k-Enclosing Circle and Related Problems.	WADS	1993	DBLP DOI BibTeX RDF
1	Robert S. Maier 0001, René Schott	The Exhaustion of Shared Memory: Stochastic Results.	WADS	1993	DBLP DOI BibTeX RDF
1	Lars Arge, Mikael B. Knudsen, Kirsten Larsen	A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms.	WADS	1993	DBLP DOI BibTeX RDF
1	Yasukazu Aoki, Hiroshi Imai, Keiko Imai, David Rappaport	Probing a Set of Hyperplanes by Lines and Related Problems.	WADS	1993	DBLP DOI BibTeX RDF
1	Ming-Yang Kao, Shang-Hua Teng, Kentaro Toyama	Improved Parallel Depth-First Search in Undirected Planar Graphs.	WADS	1993	DBLP DOI BibTeX RDF
1	Diane L. Souvaine, Chee-Keng Yap	Combinatorial Complexity of Signed Discs (Extended Abstract).	WADS	1993	DBLP DOI BibTeX RDF
1	Bruce M. Maggs, Monika Rauch	An Algorithm for Finding Predecessors in Integer Sets.	WADS	1993	DBLP DOI BibTeX RDF
1	Allan Borodin	Towards a Better Understanding of the Pure Packet Routing.	WADS	1993	DBLP DOI BibTeX RDF
1	Olivier Devillers, Andreas Fabri	Scalable Algorithms for Bichromatic Line Segment Intersection Problems on Coarse Grained Multicomputers.	WADS	1993	DBLP DOI BibTeX RDF
1	Giuseppe Di Battista, Giuseppe Liotta, Francesco Vargiu	Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and 3-Planar Graphs (Extended Abstract).	WADS	1993	DBLP DOI BibTeX RDF
1	Bruno Codenotti, Giovanni Manzini, Luciano Margara, Giovanni Resta	Global Strategies for Augmenting the Efficiency of TSP Heuristics.	WADS	1993	DBLP DOI BibTeX RDF
1	Richard M. Karp	A Generalization of Binary Search.	WADS	1993	DBLP DOI BibTeX RDF
1	Prosenjit Bose, Jonathan F. Buss, Anna Lubiw	Pattern Matching for Permutations.	WADS	1993	DBLP DOI BibTeX RDF
1	Sampath Kannan, Tandy J. Warnow	Tree Reconstruction from Partial Orders.	WADS	1993	DBLP DOI BibTeX RDF
1	Katrin Dobrindt, Kurt Mehlhorn, Mariette Yvinec	A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron.	WADS	1993	DBLP DOI BibTeX RDF
1	Marshall W. Bern, David Eppstein, Shang-Hua Teng	Parallel Construction of Quadtrees and Quality Triangulations.	WADS	1993	DBLP DOI BibTeX RDF
1	Amitava Datta, Hans-Peter Lenhof, Christian Schwarz 0002, Michiel H. M. Smid	Static and Dynamic Algorithms for k-Point Clustering Problems.	WADS	1993	DBLP DOI BibTeX RDF
1	R. Balasubramanian, Venkatesh Raman 0001, G. Srinivasaraghavan 0001	The Complexity of Finding Certain Trees in Tournaments.	WADS	1993	DBLP DOI BibTeX RDF
1	Prosenjit Bose, Marc J. van Kreveld, Godfried T. Toussaint	Filling Polyhedral Molds.	WADS	1993	DBLP DOI BibTeX RDF
1	Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid	Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization.	WADS	1993	DBLP DOI BibTeX RDF
1	Danny Krizanc	A Time-Randomness Tradeoff for Selection in Parallel.	WADS	1993	DBLP DOI BibTeX RDF
1	Maw-Shang Chang, Sheng-Lung Peng, Jenn-Liang Liaw	Deferred-Query - An Efficient Approach for Problems on interval and Circular-Arc Graphs (Extended Abstract).	WADS	1993	DBLP DOI BibTeX RDF
1	Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts	Online Load Balancing of Temporary Tasks.	WADS	1993	DBLP DOI BibTeX RDF
1	Marco Pellegrini 0001	Repetivive Hidden-Surface-Removal for Polyhedral Scenes.	WADS	1993	DBLP DOI BibTeX RDF
1	Paul J. Heffernan	Generalized Approzimate Algorithms for Point Set Congruence.	WADS	1993	DBLP DOI BibTeX RDF
1	Andy Mirzaian	Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs.	WADS	1993	DBLP DOI BibTeX RDF
1	Deganit Armon, John H. Reif	A Dynamic Separator Algorithm.	WADS	1993	DBLP DOI BibTeX RDF
1	Yuzheng Ding, Mark Allen Weiss	The K-D Heap: An Efficient Multi-dimensional Priority Queue.	WADS	1993	DBLP DOI BibTeX RDF
1	Jan Arne Telle, Andrzej Proskurowski	Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems.	WADS	1993	DBLP DOI BibTeX RDF
1	Larry F. Palazzi, Jack Snoeyink	Counting and Reporting Red/Blue Segment Intersections.	WADS	1993	DBLP DOI BibTeX RDF
1	Pinaki Mitra, Binay K. Bhattacharya	Efficient Approximate Shortest-Path Queries Among Isothetic Rectangular Obstacles.	WADS	1993	DBLP DOI BibTeX RDF
1	Samir Khuller, Balaji Raghavachari, Neal E. Young	Designing Multi-Commodity Flow Trees.	WADS	1993	DBLP DOI BibTeX RDF
1	Tao Jiang 0001, Ming Li 0001	Approximating Shortest Superstrings with Constraints (Extended Abstract).	WADS	1993	DBLP DOI BibTeX RDF
1	Nancy M. Amato	An Optimal Algorithm for Finding the Separation of Simple Polygons.	WADS	1993	DBLP DOI BibTeX RDF
1	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.	WADS	1993	DBLP DOI BibTeX RDF
1	Philip N. Klein, Sairam Subramanian	A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs.	WADS	1993	DBLP DOI BibTeX RDF
1	Thorsten Graf 0002, Klaus H. Hinrichs	A Plane-Sweep Algorithm for the All-Nearest-Neighbors Problem for a Set of Convex Planar Objects.	WADS	1993	DBLP DOI BibTeX RDF
1	Jianer Chen, Saroja P. Kanchi, Arkady Kanevsky	On the Complexity of Graph Embeddings (Extended Abstract).	WADS	1993	DBLP DOI BibTeX RDF
1	Matthias F. M. Stallmann, Thomas A. Hughes	Fast Algorithms for One-Dimensional Compaction with Jog Insertion.	WADS	1993	DBLP DOI BibTeX RDF
1	Marc J. van Kreveld	On Fat Partitioning, Fat Covering and the Union Size of Polygons (Extended Abstract).	WADS	1993	DBLP DOI BibTeX RDF
1	Steven Skiena, Gopalakrishnan Sundaram	Reconstructing Strings from Substrings (Extended Abstract).	WADS	1993	DBLP DOI BibTeX RDF
1	Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro (eds.)	Algorithms and Data Structures, 2nd Workshop WADS '91, Ottawa, Canada, August 14-16, 1991, Proceedings	WADS	1991	DBLP DOI BibTeX RDF
1	Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint	A Linear Time Algorithm for Computing the Shortest Line Segment from Which a Polygon is Weakly Externally Visible.	WADS	1991	DBLP DOI BibTeX RDF
1	Olivier Devillers, Stefan Meiser, Monique Teillaud	Fully Dynamic Delauney Triangulation in Logarithmic Expected Time per Operation.	WADS	1991	DBLP DOI BibTeX RDF
1	Greg N. Frederickson	Parametric Search and Locating Supply Centers in Trees.	WADS	1991	DBLP DOI BibTeX RDF
1	F. Frances Yao	Neighborhood Graphs and Geometric Embedding.	WADS	1991	DBLP DOI BibTeX RDF
1	Paul F. Dietz	Finding Level-Ancestors in Dynamic Trees.	WADS	1991	DBLP DOI BibTeX RDF
1	Chung-Do Yang, D. T. Lee, C. K. Wong	On Bends and Lengths of Rectilinear Paths: A Graph-Theoretic Approach.	WADS	1991	DBLP DOI BibTeX RDF
1	Sanjiv Kapoor, H. Ramesh	Algorithms for Generating All Spanning Trees of Undirected, Directed and Weighted Graphs.	WADS	1991	DBLP DOI BibTeX RDF
1	Boris Aronov, Micha Sharir	On the Zone of a Surface in a Hyperplane Arrangement.	WADS	1991	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Micha Sharir	Applications of a New Space Partitioning Technique.	WADS	1991	DBLP DOI BibTeX RDF
1	Marco Pellegrini 0001	Ray-shooting and Isotopy Classes of Lines in 3-Dimensional Space.	WADS	1991	DBLP DOI BibTeX RDF
1	Giuseppe F. Italiano, Neil Sarnak	Fully Persistent Data Structures for Disjoint Set Union Problems.	WADS	1991	DBLP DOI BibTeX RDF
1	Walter Cunto, J. Ian Munro, Patricio V. Poblete	A Case Study in Comparison Based Complexity: Finding the Nearest Value(s).	WADS	1991	DBLP DOI BibTeX RDF
1	Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick	Probabilistic Leader Election on Rings of Known Size.	WADS	1991	DBLP DOI BibTeX RDF
1	Jurek Czyzowicz, Ivan Stojmenovic, Jorge Urrutia	Immobilizing a Polytope.	WADS	1991	DBLP DOI BibTeX RDF
1	Esther M. Arkin, Samir Khuller, Joseph S. B. Mitchell	Geometric Knapsack Problems.	WADS	1991	DBLP DOI BibTeX RDF
1	Dalit Naor, Vijay V. Vazirani	Representing and Enumerating Edge Connectivity Cuts in RNC.	WADS	1991	DBLP DOI BibTeX RDF
1	Judit Bar-Ilan, David Peleg	Approximation Algorithms for Selecting Network Centers (Preliminary Vesion).	WADS	1991	DBLP DOI BibTeX RDF
1	J. Ian Munro, Venkatesh Raman 0001	Sorting Multisets and Vectors In-Place.	WADS	1991	DBLP DOI BibTeX RDF
1	Naoki Katoh, Kazuo Iwano	Efficient Algorithms for the Minimum Range Cut Problem (Extended Abstract).	WADS	1991	DBLP DOI BibTeX RDF
1	Joseph S. B. Mitchell, Erik L. Wynters	Finding Optimal Bipartitions of Points and Polygons.	WADS	1991	DBLP DOI BibTeX RDF
1	S. S. Ravi, Daniel J. Rosenkrantz, Giri Kumar Tayi	Facility Dispersion Problems: Heuristics and Special Cases (Extended Abstract).	WADS	1991	DBLP DOI BibTeX RDF

Publications at "WADS"( http://dblp.L3S.de/Venues/WADS )