Volume 3,
Number 1,
Spring 1996
Volume 3,
Number 2,
Summer 1996
Volume 3,
Number 3,
Fall 1996
Volume 3,
Number 4,
Winter 1996
Selected Papers of the 5th Scandinavian Workshop on Algorithm Theory (SWAT'96),
- Rolf G. Karlsson, Andrzej Lingas:
Guest Editor's Foreword.
293-294 BibTeX
- Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time.
295-322 BibTeX
- Thore Husfeldt, Theis Rauhe, Søren Skyum:
Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parantheses Matching.
323-336 BibTeX
- Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan:
The Randomized Complexity of Maintaining the Minimum.
337-351 BibTeX
- David Fernández-Baca, Giora Slutzki, David Eppstein:
Using Sparsification for Parametric Minimum Spanning Tree Problems.
352-366 BibTeX
- Madhav V. Marathe, R. Ravi, Ravi Sundaram:
Service-Constrained Network Design Problems.
367-387 BibTeX
- Takao Asano, Takao Ono, Tomio Hirata:
Approximation Algorithms for the Maximum Satisfiability Problem.
388-404 BibTeX
- Hoong Chuin Lau, Osamu Watanabe:
Randomized Approximation of the Constraint Satisfaction Problem.
405-424 BibTeX
- Noga Alon, Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan:
Approximate Hypergraph Coloring.
425-439 BibTeX
Copyright © Sun May 17 00:15:31 2009
by Michael Ley (ley@uni-trier.de)