8. SWAT 2002:
Turku,
Finland
Martti Penttonen, Erik Meineche Schmidt (Eds.):
Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings.
Lecture Notes in Computer Science 2368 Springer 2002, ISBN 3-540-43866-1 BibTeX
@proceedings{DBLP:conf/swat/2002,
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
booktitle = {SWAT},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2368},
year = {2002},
isbn = {3-540-43866-1},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Speakers
Scheduling
Computational Geometry
- Stephan Eidenbenz:
Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains.
60-68
Electronic Edition (Springer LINK) BibTeX
- Partha P. Goswami, Sandip Das, Subhas C. Nandy:
Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D.
69-79
Electronic Edition (Springer LINK) BibTeX
- Christos Levcopoulos, Andrzej Lingas, Joseph S. B. Mitchell:
Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains.
80-89
Electronic Edition (Springer LINK) BibTeX
- Nissan Lev-Tov, David Peleg:
Exact Algorithms and Approximation Schemes for Base Station Placement Problems.
90-99
Electronic Edition (Springer LINK) BibTeX
- Zhongping Qin, Binhai Zhu:
A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels.
100-109
Electronic Edition (Springer LINK) BibTeX
- Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy:
Optimal Algorithm for a Special Point-Labeling Problem.
110-120
Electronic Edition (Springer LINK) BibTeX
- Peter Sanders, Berthold Vöcking:
Random Arc Allocation and Applications.
121-130
Electronic Edition (Springer LINK) BibTeX
- Micha Sharir, Shakhar Smorodinsky:
On Neighbors in Geometric Permutations.
131-139
Electronic Edition (Springer LINK) BibTeX
Graph Algorithms
- Geir Agnarsson, Peter Damaschke, Magnús M. Halldórsson:
Powers of Geometric Intersection Graphs and Dispersion Algorithms.
140-149
Electronic Edition (Springer LINK) BibTeX
- Jochen Alber, Michael R. Fellows, Rolf Niedermeier:
Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case.
150-159
Electronic Edition (Springer LINK) BibTeX
- Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger:
Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous.
160-169
Electronic Edition (Springer LINK) BibTeX
- Miroslav Chlebík, Janka Chlebíková:
Approximation Hardness of the Steiner Tree Problem on Graphs.
170-179
Electronic Edition (Springer LINK) BibTeX
- John A. Ellis, Hongbing Fan, Michael R. Fellows:
The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus.
180-189
Electronic Edition (Springer LINK) BibTeX
- Harold N. Gabow, Seth Pettie:
The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms.
190-199
Electronic Edition (Springer LINK) BibTeX
- Alexander Golynski, Joseph Douglas Horton:
A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid.
200-209
Electronic Edition (Springer LINK) BibTeX
- Jochen Könemann, Yanjun Li, Ojas Parekh, Amitabh Sinha:
Approximation Algorithms for Edge-Dilation k-Center Problems.
210-219
Electronic Edition (Springer LINK) BibTeX
- Sarnath Ramnath:
Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead Speeds Up a Static Clustering Algorithm.
220-229
Electronic Edition (Springer LINK) BibTeX
- Ron Shamir, Dekel Tsur:
Improved Algorithms for the Random Cluster Graph Model.
230-239
Electronic Edition (Springer LINK) BibTeX
- San Skulrattanakulchai:
Delta-List Vertex Coloring in Linear Time.
240-248
Electronic Edition (Springer LINK) BibTeX
Robotics
Approximation Algorithms
Data Communication
Computational Biology
Data Storage and Manipulation
Copyright © Sat May 16 23:43:18 2009
by Michael Ley (ley@uni-trier.de)
