10. SWAT 2006:
Riga,
Latvia
Lars Arge, Rusins Freivalds (Eds.):
Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings.
Lecture Notes in Computer Science 4059 Springer 2006, ISBN 3-540-35753-X BibTeX
Invited Papers
Contributed Papers
- Yossi Azar, Nir Levy:
Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers.
5-16
Electronic Edition (link) BibTeX
- Joan Boyar, Lene M. Favrholdt:
Scheduling Jobs on Grid Processors.
17-28
Electronic Edition (link) BibTeX
- Leah Epstein, Thomas Erlebach, Asaf Levin:
Variable Sized Online Interval Coloring with Bandwidth.
29-40
Electronic Edition (link) BibTeX
- Haim Kaplan, Yahav Nussbaum:
A Simpler Linear-Time Recognition of Circular-Arc Graphs.
41-52
Electronic Edition (link) BibTeX
- Deepak Ajwani, Tobias Friedrich, Ulrich Meyer:
An O(n2.75) Algorithm for Online Topological Ordering.
53-64
Electronic Edition (link) BibTeX
- David J. Abraham, Telikepalli Kavitha:
Dynamic Matching Markets and Voting Paths.
65-76
Electronic Edition (link) BibTeX
- Gianni Franceschini:
Sorting by Merging or Merging by Sorting?
77-89
Electronic Edition (link) BibTeX
- Haim Kaplan, Ely Porat, Nira Shafrir:
Finding the Position of the k-Mismatch and Approximate Tandem Repeats.
90-101
Electronic Edition (link) BibTeX
- Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild:
Unbiased Matrix Rounding.
102-112
Electronic Edition (link) BibTeX
- Michael H. Goldwasser, Mark Pedigo:
Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines.
113-123
Electronic Edition (link) BibTeX
- Leah Epstein, Rob van Stee, Tami Tamir:
Paging with Request Sets.
124-135
Electronic Edition (link) BibTeX
- Birgit Heydenreich, Rudolf Müller, Marc Uetz:
Decentralization and Mechanism Design for Online Machine Scheduling.
136-147
Electronic Edition (link) BibTeX
- Serge Gaspers, Dieter Kratsch, Mathieu Liedloff:
Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes.
148-159
Electronic Edition (link) BibTeX
- Igor Razgon:
Exact Computation of Maximum Induced Forest.
160-171
Electronic Edition (link) BibTeX
- Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos:
Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus.
172-183
Electronic Edition (link) BibTeX
- Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke:
On the Approximation Hardness of Some Generalizations of TSP.
184-195
Electronic Edition (link) BibTeX
- Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of Minimum and Maximum Traveling Salesman's Tours.
196-207
Electronic Edition (link) BibTeX
- Spyros Angelopoulos:
The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights.
208-219
Electronic Edition (link) BibTeX
- Matthew J. Katz, Gabriel S. Roisman:
On Guarding Rectilinear Domains.
220-231
Electronic Edition (link) BibTeX
- Christian Knauer, Andreas Spillner:
Approximation Algorithms for the Minimum Convex Partition Problem.
232-241
Electronic Edition (link) BibTeX
- Matthias Müller-Hannemann, Anna Schulze:
Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles.
242-254
Electronic Edition (link) BibTeX
- Frank Kammer:
Simultaneous Embedding with Two Bends per Edge in Polynomial Area.
255-267
Electronic Edition (link) BibTeX
- Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote:
Acyclic Orientation of Drawings.
268-279
Electronic Edition (link) BibTeX
- Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond Harry Putra, Shigeru Yamashita:
Improved Algorithms for Quantum Identification of Boolean Oracles.
280-291
Electronic Edition (link) BibTeX
- Jan Arpe, Bodo Manthey:
Approximability of Minimum AND-Circuits.
292-303
Electronic Edition (link) BibTeX
- Venkatesh Raman, Saket Saurabh:
Triangles, 4-Cycles and Parameterized (In-)Tractability.
304-315
Electronic Edition (link) BibTeX
- Erik Jan van Leeuwen:
Better Approximation Schemes for Disk Graphs.
316-327
Electronic Edition (link) BibTeX
- Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie:
An Approximation Algorithm for the Wireless Gathering Problem.
328-338
Electronic Edition (link) BibTeX
- Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke:
Minimum Membership Set Covering and the Consecutive Ones Property.
339-350
Electronic Edition (link) BibTeX
- José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi:
Approximating Rational Objectives Is as Easy as Approximating Linear Ones.
351-362
Electronic Edition (link) BibTeX
- Henrik Blunck, Jan Vahrenhold:
In-Place Algorithms for Computing (Layers of) Maxima.
363-374
Electronic Edition (link) BibTeX
- Maarten Löffler, Marc J. van Kreveld:
Largest and Smallest Tours and Convex Hulls for Imprecise Points.
375-387
Electronic Edition (link) BibTeX
- Joachim Gudmundsson, Michiel H. M. Smid:
On Spanners of Geometric Graphs.
388-399
Electronic Edition (link) BibTeX
- Josiah Carlson, David Eppstein:
The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems.
400-410
Electronic Edition (link) BibTeX
- Maw-Shang Chang, Ming-Tat Ko, Hsueh-I Lu:
Linear-Time Algorithms for Tree Root Problems.
411-422
Electronic Edition (link) BibTeX
- Andreas Brandstädt, Feodor F. Dragan, Yang Xiang, Chenyu Yan:
Generalized Powers of Graphs and Their Algorithmic Use.
423-434
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:43:18 2009
by Michael Ley (ley@uni-trier.de)