8. WADS 2003:
Ottawa,
Ontario,
Canada
Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Michiel H. M. Smid (Eds.):
Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings.
Lecture Notes in Computer Science 2748 Springer 2003, ISBN 3-540-40545-3 BibTeX
- Gilles Brassard, Anne Broadbent, Alain Tapp:
Multi-party Pseudo-Telepathy.
1-11
Electronic Edition (link) BibTeX
- Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser:
Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips.
12-24
Electronic Edition (link) BibTeX
- Tamal K. Dey, Joachim Giesen, Samrat Goswami:
Shape Segmentation and Matching with Flow Discretization.
25-36
Electronic Edition (link) BibTeX
- Jijun Tang, Bernard M. E. Moret:
Phylogenetic Reconstruction from Gene-Rearrangement Data with Unequal Gene Content.
37-46
Electronic Edition (link) BibTeX
- Patricia A. Evans, Andrew D. Smith:
Toward Optimal Motif Enumeration.
47-58
Electronic Edition (link) BibTeX
- Behdad Esfahbod, Mohammad Ghodsi, Ali Sharifi:
Common-Deadline Lazy Bureaucrat Scheduling Problems.
59-66
Electronic Edition (link) BibTeX
- Anshul Kothari, Subhash Suri, Yunhong Zhou:
Bandwidth-Constrained Allocation in Grid Computing.
67-78
Electronic Edition (link) BibTeX
- Sudipta Sengupta:
Algorithms and Approximation Schemes for Minimum Lateness/Tardiness Scheduling with Rejection.
79-90
Electronic Edition (link) BibTeX
- Qingmin Shi, Joseph JáJá:
Fast Algorithms for a Class of Temporal Range Queries.
91-102
Electronic Edition (link) BibTeX
- Amr Elmasry:
Distribution-Sensitive Binomial Queues.
103-113
Electronic Edition (link) BibTeX
- Gianni Franceschini, Roberto Grossi:
Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees.
114-126
Electronic Edition (link) BibTeX
- Micha Sharir, Shakhar Smorodinsky:
Extremal Configurations and Levels in Pseudoline Arrangements.
127-139
Electronic Edition (link) BibTeX
- Martin Ziegler:
Fast Relative Approximation of Potential Fields.
140-149
Electronic Edition (link) BibTeX
- Sándor P. Fekete, Henk Meijer:
The One-Round Voronoi Game Replayed.
150-171
Electronic Edition (link) BibTeX
- Susanne Albers, Markus Büttner:
Integrated Prefetching and Caching with Read and Write Requests.
162-173
Electronic Edition (link) BibTeX
- Jens S. Frederiksen, Kim S. Larsen:
Online Seat Reservations via Offine Seating Arrangements.
174-185
Electronic Edition (link) BibTeX
- R. Sai Anand, Thomas Erlebach:
Routing and Call Control Algorithms for Ring Networks.
186-197
Electronic Edition (link) BibTeX
- Dorothea Wagner:
Algorithms and Models for Railway Optimization.
198-206
Electronic Edition (link) BibTeX
- Matthias Müller-Hannemann, Sven Peyer:
Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles.
207-218
Electronic Edition (link) BibTeX
- Christian A. Duncan:
Multi-way Space Partitioning Trees.
219-230
Electronic Edition (link) BibTeX
- Keith B. Frikken, Mikhail J. Atallah:
Cropping-Resilient Segmented Multiple Watermarking.
231-242
Electronic Edition (link) BibTeX
- Peter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell:
On Simultaneous Planar Graph Embeddings.
243-255
Electronic Edition (link) BibTeX
- Daniel A. Spielman, Shang-Hua Teng:
Smoothed Analysis (Motivation and Discrete Models).
256-270
Electronic Edition (link) BibTeX
- Rachel Matichin, David Peleg:
Approximation Algorithm for Hotlink Assignments in Web Directories.
271-280
Electronic Edition (link) BibTeX
- Gill Barequet, Michael T. Goodrich, Chris Riley:
Drawing Graphs with Large Vertices and Thick Edges.
281-293
Electronic Edition (link) BibTeX
- Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir:
Semi-matchings for Bipartite Graphs and Load Balancing.
294-308
Electronic Edition (link) BibTeX
- David Eppstein:
The Traveling Salesman Problem for Cubic Graphs.
307-318
Electronic Edition (link) BibTeX
- Andrew Solomon, Paul Sutcliffe, Raymond Lister:
Sorting Circular Permutations by Reversal. .
319-328
Electronic Edition (link) BibTeX
- Leszek Gasieniec, Andrzej Lingas:
An Improved Bound on Boolean Matrix Multiplication for Highly Clustered Data.
329-339
Electronic Edition (link) BibTeX
- Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol:
Dynamic Text and Static Pattern Matching.
340-352
Electronic Edition (link) BibTeX
- Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat:
Real Two Dimensional Scaled Matching.
353-364
Electronic Edition (link) BibTeX
- Sanjiv Kapoor, Xiang-Yang Li:
Proximity Structures for Geometric Graphs.
365-376
Electronic Edition (link) BibTeX
- Oswin Aichholzer, Günter Rote, Bettina Speckmann, Ileana Streinu:
The Zigzag Path of a Pseudo-Triangulation.
377-388
Electronic Edition (link) BibTeX
- Csaba D. Tóth:
Alternating Paths along Orthogonal Segments.
389-400
Electronic Edition (link) BibTeX
- Marek Karpinski, Ion I. Mandoiu, Alexander Olshevsky, Alexander Zelikovsky:
Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem.
401-411
Electronic Edition (link) BibTeX
- Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos:
Chips on Wafers.
412-423
Electronic Edition (link) BibTeX
- Vinhthuy T. Phan, Steven Skiena, Pavel Sumazin:
A Model for Analyzing Black-Box Optimization.
424-438
Electronic Edition (link) BibTeX
- Evanthia Papadopoulou:
On the Hausdorff Voronoi Diagram of Point Clusters in the Plane.
439-450
Electronic Edition (link) BibTeX
- David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint:
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries.
451-461
Electronic Edition (link) BibTeX
- Mark de Berg, Herman J. Haverkort:
Significant-Presence Range Queries in Categorical Data.
462-473
Electronic Edition (link) BibTeX
- Elena Prieto, Christian Sloper:
Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms - The Case of k-Internal Spanning Tree.
474-483
Electronic Edition (link) BibTeX
- Venkatesh Raman, Saket Saurabh:
Parameterized Complexity of Directed Feedback Set Problems in Tournaments.
484-492
Electronic Edition (link) BibTeX
- Huaming Zhang, Xin He:
Compact Visibility Representation and Straight-Line Grid Embedding of Plane Graphs.
493-504
Electronic Edition (link) BibTeX
- Michael R. Fellows:
New Directions and New Challenges in Algorithm Design and Complexity, Parameterized.
505-520
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:47:10 2009
by Michael Ley (ley@uni-trier.de)
