5. SWAT 1996: Reykjavík, Iceland

Rolf G. Karlsson, Andrzej Lingas (Eds.): Algorithm Theory - SWAT '96, 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996, Proceedings. Lecture Notes in Computer Science 1097 Springer 1996, ISBN 3-540-61422-2 BibTeX

@proceedings{DBLP:conf/swat/1996,
  editor    = {Rolf G. Karlsson and
               Andrzej Lingas},
  title     = {Algorithm Theory - SWAT '96, 5th Scandinavian Workshop on Algorithm
               Theory, Reykjav\'{\i}k, Iceland, July 3-5, 1996, Proceedings},
  booktitle = {SWAT},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1097},
  year      = {1996},
  isbn      = {3-540-61422-2},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Noga Alon: Derandomization Via Small Sample Spaces (Abstract). 1-3 BibTeX
Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan: The Randomized Complexity of Maintaining the Minimum. 4-15 BibTeX
Monika Rauch Henzinger, Jan Arne Telle: Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning. 16-27 BibTeX
Madhav V. Marathe, R. Ravi, Ravi Sundaram: Service-Constrained Network Design Problems. 28-40 BibTeX
Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan: Approximate Hypergraph Coloring. 41-52 BibTeX
Barun Chandra, Magnús M. Halldórsson: Facility Dispersion and Remote Subgraphs. 53-65 BibTeX
R. Ravi, Michel X. Goemans: The Constrained Minimum Spanning Tree Problem (Extended Abstract). 66-75 BibTeX
Hoong Chuin Lau, Osamu Watanabe: Randomized Approximation of the Constraint Satisfaction Problem (Extended Abstract). 76-87 BibTeX
Hartmut Klauck: On the Hardness of Global and Local Approximation. 88-99 BibTeX
Takao Asano, Takao Ono, Tomio Hirata: Approximation Algorithms for the Maximum Satisfiability Problem. 100-111 BibTeX
Kouichi Hirata, Shinichi Shimozono, Ayumi Shinohara: On the Hardness of Approximating the Minimum Consistent OBDD Problem. 112-123 BibTeX
Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting: Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time. 124-135 BibTeX
Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama: Greedily Finding a Dense Subgraph. 136-148 BibTeX
David Fernández-Baca, Giora Slutzki, David Eppstein: Using Sparsification for Parametric Minimum Spanning Tree Problems. 149-160 BibTeX
Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Thomas C. Shermer: Vertex Partitioning Problems On Partial k-Trees. 161-172 BibTeX
Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle: Making an Arbitrary Filled Graph Minimal by Removing Fill Edges. 173-184 BibTeX
Arne Andersson: Sorting and Searching Revisted. 185-197 BibTeX
Thore Husfeldt, Theis Rauhe, Søren Skyum: Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching. 198-211 BibTeX
Stephen Alstrup, Mikkel Thorup: Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. 212-222 BibTeX
Pierre Kelsen: Neighborhood Graphs and Distributed Delta+1-Coloring. 223-233 BibTeX
Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro: Communication Complexity of Gossiping by Packets. 234-245 BibTeX
Teresa M. Przytycka, Lisa Higham: Optimal Cost-Sensitive Distributed Minimum Spanning Tree Algorithm. 246-258 BibTeX
Vincenzo Auletta, Angelo Monti, Domenico Parente, Giuseppe Persiano: A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees. 259-270 BibTeX
Christos Levcopoulos, Anna Östlin: Linear-Time Heuristics for Minimum Weight Rectangulation (Extended Abstract). 271-283 BibTeX
Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad: Visibility with Multiple Reflections. 284-295 BibTeX
Christos Levcopoulos, Drago Krznaric: A Fast Heuristic for Approximating the Minimum Weight Triangulation (Extended Abstract). 296-308 BibTeX
Andrej Brodnik, J. Ian Munro: Neighbours on a Grid. 309-320 BibTeX
Yossi Azar, Leah Epstein: On Two Dimensional Packing. 321-332 BibTeX
Therese C. Biedl: Optimal Orthogonal Drawings of Triconnected Plane Graphs. 333-344 BibTeX
Alejandro López-Ortiz, Sven Schuierer: Walking Streets Faster. 345-356 BibTeX
Sonne Preminger, Eli Upfal: Safe and Efficient Traffic Laws for Mobile Robots. 357-367 BibTeX
Mike Paterson: Progress in Selection. 368-379 BibTeX
Gaston H. Gonnet, Steven A. Benner: Probabilistic Ancestral Sequences and Multiple Alignments. 380-391 BibTeX
Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter: Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract). 392-403 BibTeX
Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina: The Deterministic Complexity of Parallel Multisearch (Extended Abstract). 404-415 BibTeX
Gerth Stølting Brodal: Priority Queues on Parallel Machines. 416-427 BibTeX
Rolf Fagerberg: Binary Search Trees: How Low Can You Go? 428-439 BibTeX
Endre Boros, Toshihide Ibaraki, Kazuhisa Makino: Boolean Analysis of Incomplete Examples. 440-451 BibTeX