9. SWAT 2004:
Humlebæk,
Denmark
Torben Hagerup, Jyrki Katajainen (Eds.):
Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings.
Lecture Notes in Computer Science 3111 Springer 2004, ISBN 3-540-22339-8 BibTeX
Invited Contributions
Refereed Contributions
- Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woeginger:
Getting the Best Response for Your Erg.
14-25
Electronic Edition (link) BibTeX
- Nir Andelman, Yishay Mansour:
Auctions with Budget Constraints.
26-38
Electronic Edition (link) BibTeX
- Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao:
Tight Approximability Results for Test Set Problems in Bioinformatics.
39-50
Electronic Edition (link) BibTeX
- Refael Hassin, Danny Segev:
Robust Subgraphs for Trees and Paths.
51-63
Electronic Edition (link) BibTeX
- Feodor F. Dragan, Chenyu Yan, Irina Lomonosov:
Collective Tree Spanners of Graphs.
64-76
Electronic Edition (link) BibTeX
- Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga:
Optimally Competitive List Batching.
77-89
Electronic Edition (link) BibTeX
- Joan Boyar, Paul Medvedev:
The Relative Worst Order Ratio Applied to Seat Reservation.
90-101
Electronic Edition (link) BibTeX
- Rudolf Fleischer, Mordecai J. Golin, Yan Zhang:
Online Maintenance of k-Medians and k-Covers on a Line.
102-113
Electronic Edition (link) BibTeX
- Vladlen Koltun, Carola Wenk:
Matching Polyhedral Terrains Using Overlays of Envelopes.
114-126
Electronic Edition (link) BibTeX
- Pankaj K. Agarwal, Nabil H. Mustafa:
Independent Set of Intersection Graphs of Convex Objects in 2D.
127-137
Electronic Edition (link) BibTeX
- Mark de Berg, Sergio Cabello, Panos Giannopoulos, Christian Knauer, René van Oostrum, Remco C. Veltkamp:
Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion.
138-149
Electronic Edition (link) BibTeX
- Mee Yee Chan, Danny Z. Chen, Francis Y. L. Chin, Cao An Wang:
Construction of the Nearest Neighbor Embracing Graph of a Point Set.
150-160
Electronic Edition (link) BibTeX
- Norbert Zeh:
Connectivity of Graphs Under Edge Flips.
161-173
Electronic Edition (link) BibTeX
- Miroslav Chlebík, Janka Chlebíková:
Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity.
174-186
Electronic Edition (link) BibTeX
- Michel Habib, Fabien de Montgolfier, Christophe Paul:
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension.
187-198
Electronic Edition (link) BibTeX
- Michael Gatto, Björn Glaus, Riko Jacob, Leon Peeters, Peter Widmayer:
Railway Delay Management: Exploring Its Algorithmic Complexity.
199-211
Electronic Edition (link) BibTeX
- Amr Elmasry:
Layered Heaps.
212-222
Electronic Edition (link) BibTeX
- Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick:
Melding Priority Queues.
223-235
Electronic Edition (link) BibTeX
- Zdenek Dvorak, Jan Kára, Daniel Král, Ondrej Pangrác:
An Algorithm for Cyclic Edge Connectivity of Cubic Graphs.
236-247
Electronic Edition (link) BibTeX
- Anders Dessmark, Andrzej Lingas, Eva-Marta Lundell:
Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices.
248-259
Electronic Edition (link) BibTeX
- Kazuhisa Makino, Takeaki Uno:
New Algorithms for Enumerating All Maximal Cliques.
260-272
Electronic Edition (link) BibTeX
- Adi Avidor, Michael Langberg:
The Multi-multiway Cut Problem.
273-284
Electronic Edition (link) BibTeX
- Andrew Lim, Zhou Xu:
The Bottleneck Problem with Minimum Quantity Commitments.
285-297
Electronic Edition (link) BibTeX
- Yossi Azar, Shai Taub:
All-Norm Approximation for Scheduling on Identical Machines.
298-310
Electronic Edition (link) BibTeX
- Klaus Jansen:
Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler.
311-322
Electronic Edition (link) BibTeX
- Andrew Lim, Brian Rodrigues, Zhou Xu:
Approximation Schemes for the Crane Scheduling Problem.
323-335
Electronic Edition (link) BibTeX
- Raja Jothi, Balaji Raghavachari:
Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems.
336-348
Electronic Edition (link) BibTeX
- Kazuo Iwama, Shuichi Miyazaki, Kazuya Okamoto:
A (2-c(log N/N))-Approximation Algorithm for the Stable Marriage Problem.
349-361
Electronic Edition (link) BibTeX
- Klaus Jansen, Guochuan Zhang:
Maximizing the Number of Packed Rectangles.
362-371
Electronic Edition (link) BibTeX
- Giovanni Manzini:
Two Space Saving Tricks for Linear Time LCP Array Computation.
372-383
Electronic Edition (link) BibTeX
- Mikkel Thorup:
Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles.
384-396
Electronic Edition (link) BibTeX
- Leszek Gasieniec, Tomasz Radzik, Qin Xin:
Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks.
397-407
Electronic Edition (link) BibTeX
- Leah Epstein, Rob van Stee:
Online Scheduling of Splittable Tasks in Peer-to-Peer Networks.
408-419
Electronic Edition (link) BibTeX
- Patchrawat Uthaisombut:
The Optimal Online Algorithms for Minimizing Maximum Lateness.
420-430
Electronic Edition (link) BibTeX
- Paz Carmi, Matthew J. Katz:
Power Assignment in Radio Networks with Two Power Levels.
431-441
Electronic Edition (link) BibTeX
- Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth:
Pointed Binary Encompassing Trees.
442-454
Electronic Edition (link) BibTeX
- Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
On Geometric Structure of Global Roundings for Graphs and Range Spaces.
455-467
Electronic Edition (link) BibTeX
- Jop F. Sibeyn:
External Connected Components.
468-479
Electronic Edition (link) BibTeX
- Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh:
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths.
480-492
Electronic Edition (link) BibTeX
- Lars Arge, Laura Toma:
Simplified External Memory Algorithms for Planar DAGs.
493-503
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:43:18 2009
by Michael Ley (ley@uni-trier.de)
