10. WADS 2007:
Halifax,
Canada
Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Norbert Zeh (Eds.):
Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings.
Lecture Notes in Computer Science 4619 Springer 2007, ISBN 978-3-540-73948-7 BibTeX
- Jeff Erickson:
Finding Small Holes.
1
Electronic Edition (link) BibTeX
- Guilherme Dias da Fonseca:
Approximate Range Searching: The Absolute Model.
2-14
Electronic Edition (link) BibTeX
- Yakov Nekrich:
Orthogonal Range Searching in Linear and Almost-Linear Space.
15-26
Electronic Edition (link) BibTeX
- Kengo Terasawa, Yuzuru Tanaka:
Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere.
27-38
Electronic Edition (link) BibTeX
- Prabhakar Gubbala, Balaji Raghavachari:
A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity.
39-51
Electronic Edition (link) BibTeX
- Amitabh Chaudhary, Danny Z. Chen, Rudolf Fleischer, Xiaobo Sharon Hu, Jian Li, Michael T. Niemier, Zhiyi Xie, Hong Zhu:
Approximating the Maximum Sharing Problem.
52-63
Electronic Edition (link) BibTeX
- Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann:
The Stackelberg Minimum Spanning Tree Game.
64-76
Electronic Edition (link) BibTeX
- David Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann:
Edges and Switches, Tunnels and Bridges.
77-88
Electronic Edition (link) BibTeX
- Giuseppe Di Battista, Guido Drovandi, Fabrizio Frati:
How to Draw a Clustered Tree.
89-101
Electronic Edition (link) BibTeX
- Melanie Badent, Emilio Di Giacomo, Giuseppe Liotta:
Drawing Colored Graphs on Colored Points.
102-113
Electronic Edition (link) BibTeX
- Mikhail J. Atallah, Marina Blanton, Michael T. Goodrich, Stanislas Polu:
Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric.
114-126
Electronic Edition (link) BibTeX
- Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave:
Priority Queues Resilient to Memory Faults.
127-138
Electronic Edition (link) BibTeX
- Fabiano C. Botelho, Rasmus Pagh, Nivio Ziviani:
Simple and Space-Efficient Minimal Perfect Hash Functions.
139-150
Electronic Edition (link) BibTeX
- Matthias Müller-Hannemann, Siamak Tazari:
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane.
151-162
Electronic Edition (link) BibTeX
- Ajay Deshpande, Taejung Kim, Erik D. Demaine, Sanjay E. Sarma:
A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems.
163-174
Electronic Edition (link) BibTeX
- Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira:
Optimization for First Order Delaunay Triangulations.
175-187
Electronic Edition (link) BibTeX
- Tobias Jacobs:
Constant Factor Approximations for the Hotlink Assignment Problem.
188-200
Electronic Edition (link) BibTeX
- Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
Approximation Algorithms for the Sex-Equal Stable Marriage Problem.
201-213
Electronic Edition (link) BibTeX
- Staal A. Vinterbo:
A Stab at Approximating Minimum Subadditive Join.
214-225
Electronic Edition (link) BibTeX
- Michael A. Langston:
Algorithmic Challenges for Systems-Level Correlational Analysis: A Tale of Two Datasets.
226
Electronic Edition (link) BibTeX
- Rodrigo I. Silveira, René van Oostrum:
Flooding Countries and Destroying Dams.
227-238
Electronic Edition (link) BibTeX
- Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma:
I/O-Efficient Flow Modeling on Fat Terrains.
239-250
Electronic Edition (link) BibTeX
- Mark de Berg, Chris Gray:
Computing the Visibility Map of Fat Objects.
251-262
Electronic Edition (link) BibTeX
- Magnús M. Halldórsson, Elena Losievskaja:
Independent Sets in Bounded-Degree Hypergraphs.
263-274
Electronic Edition (link) BibTeX
- Glencora Borradaile, Philip N. Klein, Claire Mathieu:
Steiner Tree in Planar Graphs: An O ( n log n ) Approximation Scheme with Singly-Exponential Dependence on Epsilon.
275-286
Electronic Edition (link) BibTeX
- Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani:
Computing a Minimum-Depth Planar Graph Embedding in O ( n 4) Time.
287-299
Electronic Edition (link) BibTeX
- Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu:
On a Family of Strong Geometric Spanners That Admit Local Routing Strategies.
300-311
Electronic Edition (link) BibTeX
- Martin Fürer, Shiva Prasad Kasiviswanathan:
Spanners for Geometric Intersection Graphs.
312-324
Electronic Edition (link) BibTeX
- Prosenjit Bose, Aaron Lee, Michiel H. M. Smid:
On Generalized Diamond Spanners.
325-336
Electronic Edition (link) BibTeX
- Marcin Bienkowski, Jaroslaw Kutylowski:
The k -Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces.
337-348
Electronic Edition (link) BibTeX
- Michael Gatto, Peter Widmayer:
On the Robustness of Graham's Algorithm for Online Scheduling.
349-361
Electronic Edition (link) BibTeX
- Leah Epstein, Rob van Stee:
Improved Results for a Memory Allocation Problem.
362-373
Electronic Edition (link) BibTeX
- Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Margot Oberneder, Zbynek Sír:
Computational and Structural Advantages of Circular Boundary Representation.
374-385
Electronic Edition (link) BibTeX
- Dominique Attali, Herbert Edelsbrunner, John Harer, Yuriy Mileyko:
Alpha-Beta Witness Complexes.
386-397
Electronic Edition (link) BibTeX
- Therese C. Biedl, Anna Lubiw, Michael J. Spriggs:
Cauchy's Theorem and Edge Lengths of Convex Polyhedra.
398-409
Electronic Edition (link) BibTeX
- Magnús M. Halldórsson, Christian Knauer, Andreas Spillner, Takeshi Tokuyama:
Fixed-Parameter Tractability for Non-Crossing Spanning Trees.
410-421
Electronic Edition (link) BibTeX
- Jianer Chen, Fedor V. Fomin, Yang Liu, Songjian Lu, Yngve Villanger:
Improved Algorithms for the Feedback Vertex Set Problems.
422-433
Electronic Edition (link) BibTeX
- Faisal N. Abu-Khzam:
Kernelization Algorithms for d-Hitting Set Problems.
434-445
Electronic Edition (link) BibTeX
- Maarten Löffler, Marc J. van Kreveld:
Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points.
446-457
Electronic Edition (link) BibTeX
- Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos, Bettina Speckmann, Birgit Vogtenhuber:
Maximizing Maximal Angles for Plane Straight-Line Graphs.
458-469
Electronic Edition (link) BibTeX
- Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth:
Cuttings for Disks and Axis-Aligned Rectangles.
470-482
Electronic Edition (link) BibTeX
- Jiong Guo, Johannes Uhlmann:
Kernelization and Complexity Results for Connectivity Augmentation Problems.
483-494
Electronic Edition (link) BibTeX
- Jianer Chen, Yang Liu, Songjian Lu:
An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem.
495-506
Electronic Edition (link) BibTeX
- Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Branch and Recharge: Exact Algorithms for Generalized Domination.
507-518
Electronic Edition (link) BibTeX
- Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans Raj Tiwary:
On Computing the Centroid of the Vertices of an Arrangement and Related Problems.
519-528
Electronic Edition (link) BibTeX
- Binay K. Bhattacharya, Qiaosheng Shi:
Optimal Algorithms for the Weighted p -Center Problems on the Real Line for Small p.
529-540
Electronic Edition (link) BibTeX
- Piotr Berman, Shiva Prasad Kasiviswanathan:
Faster Approximation of Distances in Graphs.
541-552
Electronic Edition (link) BibTeX
- Jörg Derungs, Riko Jacob, Peter Widmayer:
Approximate Shortest Paths Guided by a Small Index.
553-564
Electronic Edition (link) BibTeX
- Martin Farach-Colton, Miguel A. Mosteiro:
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model.
565-576
Electronic Edition (link) BibTeX
- Senjuti Basu Roy, Gautam Das, Sajal Das:
Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field.
577-588
Electronic Edition (link) BibTeX
- Lukasz Kowalik, Marcin Mucha:
35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality.
589-600
Electronic Edition (link) BibTeX
- Jan Remy, Reto Spöhel, Andreas Weißl:
On Euclidean Vehicle Routing with Allocation.
601-612
Electronic Edition (link) BibTeX
- Ge Nong, Sen Zhang:
Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets.
613-624
Electronic Edition (link) BibTeX
- Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein:
Range Non-overlapping Indexing and Successive List Indexing.
625-636
Electronic Edition (link) BibTeX
- David Eppstein, Michael T. Goodrich:
Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton's Identities and Invertible Bloom Filters.
637-648
Electronic Edition (link) BibTeX
- Hisashi Koga:
Dynamic TCP Acknowledgment with Sliding Window.
649-660
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:47:10 2009
by Michael Ley (ley@uni-trier.de)
