From: tarhio@cs.Helsinki.FI (Jorma Tarhio)
Newsgroups: news.announce.conferences
Subject: SWAT '92 accepted papers
Date: 11 Apr 92 00:03:02 GMT
Organization: (none)


The Third Scandinavian Workshop on Algorithm Theory (SWAT '92) will be
held in July 8-10, 1992 in Helsinki, Finland.

121 papers were submitted, 34 papers were accepted.

ACCEPTED PAPERS (in the submission order)
-----------------------------------------

Parallel Algorithms for Priority Queue Operations
    Maria Cristina Pinotti and Geppino Pucci

Maintaining the Visibility Map of Spheres while Moving the Viewpoint
on a Circle at Infinity
    Hans-Peter Lenhof and Michiel Smid

Voronoi Diagrams of Moving Points in Higher Dimensional Spaces
    Thomas Roos and Gerhard Albers

Dynamic Closest Pairs - A Probabilistic Approach
    Mordecai J. Golin

Generating Sparse 2-Spanners
    Guy Kortsarz and David Peleg

A Framework for Adaptive Sorting
    Ola Petersson and Alistair Moffat

Heap Construction in the Parallel Comparison Tree Model
    Paul F. Dietz

Triangulating Planar Graphs While Minimizing the Maximum Degree
    Goos Kant and Hans L. Bodlaender

G$K$D-Trees: Binary Trees that Combine Multi-Dimensional Data Handling,
Node Size, and Fringe Reorganization
    Walter Cunto and Vicente Yriarte

Fully Dynamic 2-Connectivity in Planar Graphs
    John Hersberger, Monika Rauch and Subhash Suri

Parallel Algorithm for Cograph Recognition with Applications
    Xin He

The List Update Problem and the Retrieval of Sets
    Fabrizio d'Amore and Vincenzo Liberatore

Retrieval of Scattered Information by EREW, CREW and CRCW PRAMs
    Faith Fich, Miroslaw Kowaluk, Krzysztof Lorys,
    Miroslaw Kutylowski and Prabhakar Ragde

Parallel Algorithms for All Minimum Link Paths and Link Center Problems
    Subir Kumar Ghosh and Anil Maheshwari

Parametric Problems on Graphs of Bounded Tree-Width
    David Fernandez-Baca and Giora Slutzki

How to Draw a Series-Parallel Digraph
    Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista,
    Roberto Tamassia and Ioannis G. Tollis

Dynamic 2- and 3-Connectivity on Planar Graphs
    Dora Giammarresi and Giuseppe F. Italiano

Efficient Rebalancing of Chromatic Search Trees
    Joan Boyar and Kim S. Larsen

Obtainig Global Similarity from Local Similarity
    Deborach Joseph, Joao Meidanis and Prasoon Tiwari

Decomposing the Boundary of a Nonconvex Polytope
    Bernard Chazelle and Leonidas Palios

An Elementary Approach to Some Analytic Asymptotics
    Nicholas Pippenger

Two- and Three-Dimensional Point Location in Rectangular Subdivisions
    Mark de Berg, Marc van Kreveld and Jack Snoeyink

Convex Polygons Made from Few Lines and Convex Decompositions of
Polyhedra
    John Hersberger and Jack Snoeyink

Coloring Random Graphs
    Martin Fuerer and C. R. Subramanian

Testing Superperfection of $k$-Trees
    T. Kloks and H. Bodlaender

Fractional Cascading Simplified
    Sandeep Sen

Improvements on Approximate Pattern Matching Problems
    L. Paul Chew and Klara Kedem

An Optimal Parallel Algorithm for Computing a Near-Optimal Order
of Matrix Multiplications
    Artur Czumaj

Low Diameter Graph Decomposition is in NC
    Baruch Awerbuch, Bonnie Berger, Lenore Cowen and David Peleg

Optimal Multi-Packet Routing on the Torus
    Michael Kaufmann and Jop F. Sibeyn

Sorting Multisets Stably in Minimum Space
    Jyrki Katajainen and Tomi Pasanen

The Complexity of Scheduling Problems with Communication Delays for
Trees
    Andreas Jakoby and Ruediger Reischuk

Memory Limited Inductive Inference Machines
    Rusins Freivalds and Carl H. Smith

Non-Interfering Network Flows
    C. McDiarmid, B. Reed, A. Schrijver and B. Shepherd



For more information on SWAT '92 please contact

	Prof.Esko Ukkonen
	Department of Computer Science
	University of Helsinki
	Teollisuuskatu 23
	SF-00510 Helsinki
	Finland

Email:	swat@cs.helsinki.fi
tel.:	+358-0-7084172
fax:	+358-0-7084441