Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "stream:streams/conf/swat:"
download as .bib file
@inproceedings{DBLP:conf/swat/000122,
author = {Haitao Wang},
editor = {Artur Czumaj and
Qin Xin},
title = {Unit-Disk Range Searching and Applications},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {32:1--32:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.32},
doi = {10.4230/LIPICS.SWAT.2022.32},
timestamp = {Thu, 23 Jun 2022 13:34:22 +0200},
biburl = {https://dblp.org/rec/conf/swat/000122.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/0002V22,
author = {Tanmay Inamdar and
Kasturi R. Varadarajan},
editor = {Artur Czumaj and
Qin Xin},
title = {Non-Uniform k-Center and Greedy Clustering},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {28:1--28:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.28},
doi = {10.4230/LIPICS.SWAT.2022.28},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/0002V22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AdjiashviliHMS22,
author = {David Adjiashvili and
Felix Hommelsheim and
Moritz M{\"{u}}hlenthaler and
Oliver Schaudt},
editor = {Artur Czumaj and
Qin Xin},
title = {Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {5:1--5:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.5},
doi = {10.4230/LIPICS.SWAT.2022.5},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AdjiashviliHMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AgarwalRSS22,
author = {Pankaj K. Agarwal and
Sharath Raghvendra and
Pouyan Shirzadian and
Rachita Sowle},
editor = {Artur Czumaj and
Qin Xin},
title = {An Improved {\(\epsilon\)}-Approximation Algorithm for Geometric Bipartite
Matching},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {6:1--6:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.6},
doi = {10.4230/LIPICS.SWAT.2022.6},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AgarwalRSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AkitayaDKKPSSUW22,
author = {Hugo A. Akitaya and
Erik D. Demaine and
Matias Korman and
Irina Kostitsyna and
Irene Parada and
Willem Sonke and
Bettina Speckmann and
Ryuhei Uehara and
Jules Wulms},
editor = {Artur Czumaj and
Qin Xin},
title = {Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding
Squares},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {4:1--4:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.4},
doi = {10.4230/LIPICS.SWAT.2022.4},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AkitayaDKKPSSUW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AmeerGK022,
author = {Safwa Ameer and
Matt Gibson{-}Lopez and
Erik Krohn and
Qing Wang},
editor = {Artur Czumaj and
Qin Xin},
title = {On the Visibility Graphs of Pseudo-Polygons: Recognition and Reconstruction},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {7:1--7:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.7},
doi = {10.4230/LIPICS.SWAT.2022.7},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AmeerGK022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AngeliniBLGMT22,
author = {Patrizio Angelini and
Michael A. Bekos and
Giordano Da Lozzo and
Martin Gronemann and
Fabrizio Montecchiani and
Alessandra Tappini},
editor = {Artur Czumaj and
Qin Xin},
title = {Recognizing Map Graphs of Bounded Treewidth},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {8:1--8:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.8},
doi = {10.4230/LIPICS.SWAT.2022.8},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AngeliniBLGMT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AntoniadisGS22,
author = {Antonios Antoniadis and
Peyman Jabbarzade Ganje and
Golnoosh Shahkarami},
editor = {Artur Czumaj and
Qin Xin},
title = {A Novel Prediction Setup for Online Speed-Scaling},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {9:1--9:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.9},
doi = {10.4230/LIPICS.SWAT.2022.9},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AntoniadisGS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AntoniadisKL022,
author = {Antonios Antoniadis and
S{\'{a}}ndor Kisfaludi{-}Bak and
Bundit Laekhanukit and
Daniel Vaz},
editor = {Artur Czumaj and
Qin Xin},
title = {On the Approximability of the Traveling Salesman Problem with Line
Neighborhoods},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {10:1--10:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.10},
doi = {10.4230/LIPICS.SWAT.2022.10},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AntoniadisKL022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AronovK22,
author = {Boris Aronov and
Matthew J. Katz},
editor = {Artur Czumaj and
Qin Xin},
title = {Dynamic Approximate Multiplicatively-Weighted Nearest Neighbors},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {11:1--11:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.11},
doi = {10.4230/LIPICS.SWAT.2022.11},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AronovK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BannachFS22,
author = {Max Bannach and
Pamela Fleischmann and
Malte Skambath},
editor = {Artur Czumaj and
Qin Xin},
title = {MaxSAT with Absolute Value Functions: {A} Parameterized Perspective},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {12:1--12:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.12},
doi = {10.4230/LIPICS.SWAT.2022.12},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BannachFS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Bar-NoyBPR22,
author = {Amotz Bar{-}Noy and
Toni B{\"{o}}hnlein and
David Peleg and
Dror Rawitz},
editor = {Artur Czumaj and
Qin Xin},
title = {On Realizing a Single Degree Sequence by a Bipartite Graph (Invited
Paper)},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {1:1--1:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.1},
doi = {10.4230/LIPICS.SWAT.2022.1},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Bar-NoyBPR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BazganCC22,
author = {Cristina Bazgan and
Katrin Casel and
Pierre Cazals},
editor = {Artur Czumaj and
Qin Xin},
title = {Dense Graph Partitioning on Sparse and Dense Graphs},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {13:1--13:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.13},
doi = {10.4230/LIPICS.SWAT.2022.13},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BazganCC22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Berendsohn22,
author = {Benjamin Aram Berendsohn},
editor = {Artur Czumaj and
Qin Xin},
title = {The Diameter of Caterpillar Associahedra},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {14:1--14:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.14},
doi = {10.4230/LIPICS.SWAT.2022.14},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Berendsohn22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BergSS22,
author = {Mark de Berg and
Arpan Sadhukhan and
Frits C. R. Spieksma},
editor = {Artur Czumaj and
Qin Xin},
title = {Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment
Problem},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {15:1--15:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.15},
doi = {10.4230/LIPICS.SWAT.2022.15},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BergSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BergoldBGMS22,
author = {Helena Bergold and
Daniel Bertschinger and
Nicolas Grelier and
Wolfgang Mulzer and
Patrick Schnider},
editor = {Artur Czumaj and
Qin Xin},
title = {Well-Separation and Hyperplane Transversals in High Dimensions},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {16:1--16:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.16},
doi = {10.4230/LIPICS.SWAT.2022.16},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/BergoldBGMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BertschingerRM22,
author = {Daniel Bertschinger and
Meghana M. Reddy and
Enrico Mann},
editor = {Artur Czumaj and
Qin Xin},
title = {Lions and Contamination: Monotone Clearings},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {17:1--17:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.17},
doi = {10.4230/LIPICS.SWAT.2022.17},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BertschingerRM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BilleGS22,
author = {Philip Bille and
Inge Li G{\o}rtz and
Tord Stordalen},
editor = {Artur Czumaj and
Qin Xin},
title = {Predecessor on the Ultra-Wide Word {RAM}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {18:1--18:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.18},
doi = {10.4230/LIPICS.SWAT.2022.18},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/BilleGS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoseMO22,
author = {Prosenjit Bose and
Pat Morin and
Saeed Odak},
editor = {Artur Czumaj and
Qin Xin},
title = {An Optimal Algorithm for Product Structure in Planar Graphs},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {19:1--19:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.19},
doi = {10.4230/LIPICS.SWAT.2022.19},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoseMO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoyarFL22,
author = {Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen},
editor = {Artur Czumaj and
Qin Xin},
title = {Online Unit Profit Knapsack with Untrusted Predictions},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {20:1--20:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.20},
doi = {10.4230/LIPICS.SWAT.2022.20},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoyarFL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CleveGKLMP22,
author = {Jonas Cleve and
Nicolas Grelier and
Kristin Knorr and
Maarten L{\"{o}}ffler and
Wolfgang Mulzer and
Daniel Perz},
editor = {Artur Czumaj and
Qin Xin},
title = {Nearest-Neighbor Decompositions of Drawings},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {21:1--21:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.21},
doi = {10.4230/LIPICS.SWAT.2022.21},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/CleveGKLMP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Dvorak22,
author = {Zdenek Dvor{\'{a}}k},
editor = {Artur Czumaj and
Qin Xin},
title = {Approximation Metatheorems for Classes with Bounded Expansion},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {22:1--22:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.22},
doi = {10.4230/LIPICS.SWAT.2022.22},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/Dvorak22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ElkinGN22,
author = {Michael Elkin and
Yuval Gitlitz and
Ofer Neiman},
editor = {Artur Czumaj and
Qin Xin},
title = {Almost Shortest Paths with Near-Additive Error in Weighted Graphs},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {23:1--23:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.23},
doi = {10.4230/LIPICS.SWAT.2022.23},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ElkinGN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FioravantesMT22,
author = {Foivos Fioravantes and
Nikolaos Melissinos and
Theofilos Triommatis},
editor = {Artur Czumaj and
Qin Xin},
title = {Complexity of Finding Maximum Locally Irregular Induced Subgraphs},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {24:1--24:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.24},
doi = {10.4230/LIPICS.SWAT.2022.24},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/FioravantesMT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GanWZ22,
author = {Junhao Gan and
Anthony Wirth and
Xin Zhang},
editor = {Artur Czumaj and
Qin Xin},
title = {An Almost Optimal Algorithm for Unbounded Search with Noisy Information},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {25:1--25:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.25},
doi = {10.4230/LIPICS.SWAT.2022.25},
timestamp = {Wed, 31 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/GanWZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GasieniecS22,
author = {Leszek Gasieniec and
Grzegorz Stachowiak},
editor = {Artur Czumaj and
Qin Xin},
title = {Time, Clocks and Efficiency of Population Protocols (Invited Paper)},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {2:1--2:2},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.2},
doi = {10.4230/LIPICS.SWAT.2022.2},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GasieniecS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Gibson-LopezZ22,
author = {Matt Gibson{-}Lopez and
Serge Zamarripa},
editor = {Artur Czumaj and
Qin Xin},
title = {Optimal Bounds for Weak Consistent Digital Rays in 2D},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {26:1--26:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.26},
doi = {10.4230/LIPICS.SWAT.2022.26},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Gibson-LopezZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HuangS22,
author = {Chien{-}Chung Huang and
Fran{\c{c}}ois Sellier},
editor = {Artur Czumaj and
Qin Xin},
title = {Matroid-Constrained Maximum Vertex Cover: Approximate Kernels and
Streaming Algorithms},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {27:1--27:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.27},
doi = {10.4230/LIPICS.SWAT.2022.27},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HuangS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KunzFNR22,
author = {Pascal Kunz and
Till Fluschnik and
Rolf Niedermeier and
Malte Renken},
editor = {Artur Czumaj and
Qin Xin},
title = {Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs
and Their Relatives},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {29:1--29:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.29},
doi = {10.4230/LIPICS.SWAT.2022.29},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KunzFNR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/RaghvendraS22,
author = {Sharath Raghvendra and
Rachita Sowle},
editor = {Artur Czumaj and
Qin Xin},
title = {A Scalable Work Function Algorithm for the k-Server Problem},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {30:1--30:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.30},
doi = {10.4230/LIPICS.SWAT.2022.30},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/RaghvendraS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Rahman022,
author = {Md Lutfar Rahman and
Thomas Watson},
editor = {Artur Czumaj and
Qin Xin},
title = {Erd{\H{o}}s-Selfridge Theorem for Nonmonotone CNFs},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {31:1--31:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.31},
doi = {10.4230/LIPICS.SWAT.2022.31},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Rahman022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Thorup22,
author = {Mikkel Thorup},
editor = {Artur Czumaj and
Qin Xin},
title = {Reconstructing the Tree of Life (Fitting Distances by Tree Metrics)
(Invited Paper)},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {3:1--3:2},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.3},
doi = {10.4230/LIPICS.SWAT.2022.3},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Thorup22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/X22,
editor = {Artur Czumaj and
Qin Xin},
title = {Front Matter, Table of Contents, Preface, Conference Organization},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {0:1--0:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.0},
doi = {10.4230/LIPICS.SWAT.2022.0},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/X22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/YanagitaCSS22,
author = {Tatsuya Yanagita and
Sankardeep Chakraborty and
Kunihiko Sadakane and
Srinivasa Rao Satti},
editor = {Artur Czumaj and
Qin Xin},
title = {Space-Efficient Data Structure for Posets with Applications},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {33:1--33:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.33},
doi = {10.4230/LIPICS.SWAT.2022.33},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/YanagitaCSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/2022,
editor = {Artur Czumaj and
Qin Xin},
title = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-236-5},
isbn = {978-3-95977-236-5},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/2022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/0001ST20,
author = {Saket Saurabh and
U{\'{e}}verton dos Santos Souza and
Prafullkumar Tale},
editor = {Susanne Albers},
title = {On the Parameterized Complexity of Grid Contraction},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {34:1--34:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.34},
doi = {10.4230/LIPICS.SWAT.2020.34},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/0001ST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/000220,
author = {L{\'{a}}szl{\'{o}} Kozma},
editor = {Susanne Albers},
title = {Exact Exponential Algorithms for Two Poset Problems},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {30:1--30:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.30},
doi = {10.4230/LIPICS.SWAT.2020.30},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/000220.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AbamBFMS20,
author = {Mohammad Ali Abam and
Mark de Berg and
Sina Farahzad and
Mir Omid Haji Mirsadeghi and
Morteza Saghafian},
editor = {Susanne Albers},
title = {Preclustering Algorithms for Imprecise Points},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {3:1--3:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.3},
doi = {10.4230/LIPICS.SWAT.2020.3},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AbamBFMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AgrawalKZ20,
author = {Akanksha Agrawal and
Sudeshna Kolay and
Meirav Zehavi},
editor = {Susanne Albers},
title = {Parameter Analysis for Guarding Terrains},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {4:1--4:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.4},
doi = {10.4230/LIPICS.SWAT.2020.4},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/AgrawalKZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AissiC020,
author = {Hassene Aissi and
Da Qi Chen and
R. Ravi},
editor = {Susanne Albers},
title = {Vertex Downgrading to Minimize Connectivity},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {5:1--5:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.5},
doi = {10.4230/LIPICS.SWAT.2020.5},
timestamp = {Fri, 12 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AissiC020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ArgeRRSY20,
author = {Lars Arge and
Mathias Rav and
Morten Revsb{\ae}k and
Yujin Shin and
Jungwoo Yang},
editor = {Susanne Albers},
title = {Sea-Rise Flooding on Massive Dynamic Terrains},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {6:1--6:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.6},
doi = {10.4230/LIPICS.SWAT.2020.6},
timestamp = {Fri, 12 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ArgeRRSY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ArkinSEFFKM20,
author = {Esther M. Arkin and
Faryad Darabi Sahneh and
Alon Efrat and
Fabian Frank and
Radoslav Fulek and
Stephen G. Kobourov and
Joseph S. B. Mitchell},
editor = {Susanne Albers},
title = {Computing {\(\beta\)}-Stretch Paths in Drawings of Graphs},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {7:1--7:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.7},
doi = {10.4230/LIPICS.SWAT.2020.7},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ArkinSEFFKM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BackursH20,
author = {Arturs Backurs and
Sariel Har{-}Peled},
editor = {Susanne Albers},
title = {Submodular Clustering in Low Dimensions},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {8:1--8:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.8},
doi = {10.4230/LIPICS.SWAT.2020.8},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BackursH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BannachST20,
author = {Max Bannach and
Malte Skambath and
Till Tantau},
editor = {Susanne Albers},
title = {Kernelizing the Hitting Set Problem in Linear Sequential and Constant
Parallel Time},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {9:1--9:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.9},
doi = {10.4230/LIPICS.SWAT.2020.9},
timestamp = {Fri, 12 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BannachST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Bar-NoyCPR20,
author = {Amotz Bar{-}Noy and
Keerti Choudhary and
David Peleg and
Dror Rawitz},
editor = {Susanne Albers},
title = {Graph Realizations: Maximum Degree in Vertex Neighborhoods},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {10:1--10:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.10},
doi = {10.4230/LIPICS.SWAT.2020.10},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Bar-NoyCPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BerceaE20,
author = {Ioana O. Bercea and
Guy Even},
editor = {Susanne Albers},
title = {A Dynamic Space-Efficient Filter with Constant Time Operations},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {11:1--11:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.11},
doi = {10.4230/LIPICS.SWAT.2020.11},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BerceaE20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BhardwajLS20,
author = {Nalin Bhardwaj and
Antonio Molina Lovett and
Bryce Sandlund},
editor = {Susanne Albers},
title = {A Simple Algorithm for Minimum Cuts in Near-Linear Time},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {12:1--12:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.12},
doi = {10.4230/LIPICS.SWAT.2020.12},
timestamp = {Fri, 12 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BhardwajLS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BhoreCKZ20,
author = {Sujoy Bhore and
Paz Carmi and
Sudeshna Kolay and
Meirav Zehavi},
editor = {Susanne Albers},
title = {Parameterized Study of Steiner Tree on Unit Disk Graphs},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {13:1--13:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.13},
doi = {10.4230/LIPICS.SWAT.2020.13},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BhoreCKZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BiniazBLM20,
author = {Ahmad Biniaz and
Prosenjit Bose and
Anna Lubiw and
Anil Maheshwari},
editor = {Susanne Albers},
title = {Bounded-Angle Minimum Spanning Trees},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {14:1--14:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.14},
doi = {10.4230/LIPICS.SWAT.2020.14},
timestamp = {Fri, 12 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BiniazBLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BorradaileCEMN20,
author = {Glencora Borradaile and
Erin Wolf Chambers and
David Eppstein and
William Maxwell and
Amir Nayyeri},
editor = {Susanne Albers},
title = {Low-Stretch Spanning Trees of Graphs with Bounded Width},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {15:1--15:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.15},
doi = {10.4230/LIPICS.SWAT.2020.15},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BorradaileCEMN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Bose0M20,
author = {Prosenjit Bose and
Saeed Mehrabi and
Debajyoti Mondal},
editor = {Susanne Albers},
title = {Parameterized Complexity of Two-Interval Pattern Problem},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {16:1--16:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.16},
doi = {10.4230/LIPICS.SWAT.2020.16},
timestamp = {Fri, 12 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Bose0M20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BosekDFPZ20,
author = {Bartlomiej Bosek and
Yann Disser and
Andreas Emil Feldmann and
Jakub Pawlewicz and
Anna Zych{-}Pawlewicz},
editor = {Susanne Albers},
title = {Recoloring Interval Graphs with Limited Recourse Budget},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {17:1--17:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.17},
doi = {10.4230/LIPICS.SWAT.2020.17},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BosekDFPZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BshoutyHBMNNZ20,
author = {Nader H. Bshouty and
Catherine A. Haddad{-}Zaknoon and
Raghd Boulos and
Foad Moalem and
Jalal Nada and
Elias Noufi and
Yara Zaknoon},
editor = {Susanne Albers},
title = {Optimal Randomized Group Testing Algorithm to Determine the Number
of Defectives},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {18:1--18:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.18},
doi = {10.4230/LIPICS.SWAT.2020.18},
timestamp = {Fri, 12 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BshoutyHBMNNZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BuchinDS20,
author = {Kevin Buchin and
Anne Driemel and
Martijn Struijs},
editor = {Susanne Albers},
title = {On the Hardness of Computing an Average Curve},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {19:1--19:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.19},
doi = {10.4230/LIPICS.SWAT.2020.19},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BuchinDS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CardinalO20,
author = {Jean Cardinal and
Aur{\'{e}}lien Ooms},
editor = {Susanne Albers},
title = {Sparse Regression via Range Counting},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {20:1--20:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.20},
doi = {10.4230/LIPICS.SWAT.2020.20},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/CardinalO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ChaplickFK020,
author = {Steven Chaplick and
Henry F{\"{o}}rster and
Myroslav Kryven and
Alexander Wolff},
editor = {Susanne Albers},
title = {Drawing Graphs with Circular Arcs and Right-Angle Crossings},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {21:1--21:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.21},
doi = {10.4230/LIPICS.SWAT.2020.21},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ChaplickFK020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DurocherH20,
author = {Stephane Durocher and
Md Yeakub Hassan},
editor = {Susanne Albers},
title = {Clustering Moving Entities in Euclidean Space},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {22:1--22:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.22},
doi = {10.4230/LIPICS.SWAT.2020.22},
timestamp = {Fri, 12 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DurocherH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/EadesHLS20,
author = {Patrick Eades and
Ivor {van der Hoog} and
Maarten L{\"{o}}ffler and
Frank Staals},
editor = {Susanne Albers},
title = {Trajectory Visibility},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {23:1--23:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.23},
doi = {10.4230/LIPICS.SWAT.2020.23},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/EadesHLS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/EppsteinFH20,
author = {David Eppstein and
Daniel Frishberg and
Elham Havvaei},
editor = {Susanne Albers},
title = {Simplifying Activity-On-Edge Graphs},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {24:1--24:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.24},
doi = {10.4230/LIPICS.SWAT.2020.24},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/EppsteinFH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FanGRSB20,
author = {Chenglin Fan and
Anna C. Gilbert and
Benjamin Raichel and
Rishi Sonthalia and
Gregory Van Buskirk},
editor = {Susanne Albers},
title = {Generalized Metric Repair on Graphs},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {25:1--25:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.25},
doi = {10.4230/LIPICS.SWAT.2020.25},
timestamp = {Fri, 12 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/FanGRSB20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FominGS20,
author = {Fedor V. Fomin and
Petr A. Golovach and
Kirill Simonov},
editor = {Susanne Albers},
title = {Parameterized Complexity of {PCA} (Invited Talk)},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {1:1--1:5},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.1},
doi = {10.4230/LIPICS.SWAT.2020.1},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/FominGS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GruttemeierKM20,
author = {Niels Gr{\"{u}}ttemeier and
Christian Komusiewicz and
Nils Morawietz},
editor = {Susanne Albers},
title = {Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized
by Distance to Low-Degree Graphs},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {26:1--26:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.26},
doi = {10.4230/LIPICS.SWAT.2020.26},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GruttemeierKM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/JansenK20,
author = {Bart M. P. Jansen and
Jari J. H. de Kroon},
editor = {Susanne Albers},
title = {Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties
by Low-Rank Adjacencies},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {27:1--27:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.27},
doi = {10.4230/LIPICS.SWAT.2020.27},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/JansenK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KaplanT20,
author = {Haim Kaplan and
Jay Tenenbaum},
editor = {Susanne Albers},
title = {Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {28:1--28:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.28},
doi = {10.4230/LIPICS.SWAT.2020.28},
timestamp = {Fri, 12 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KaplanT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KoivistoR20,
author = {Mikko Koivisto and
Antti R{\"{o}}ysk{\"{o}}},
editor = {Susanne Albers},
title = {Fast Multi-Subset Transform and Weighted Sums over Acyclic Digraphs},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {29:1--29:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.29},
doi = {10.4230/LIPICS.SWAT.2020.29},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KoivistoR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/MunroSS20,
author = {J. Ian Munro and
Bryce Sandlund and
Corwin Sinnamon},
editor = {Susanne Albers},
title = {Space-Efficient Data Structures for Lattices},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {31:1--31:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.31},
doi = {10.4230/LIPICS.SWAT.2020.31},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/MunroSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/NewmanR20,
author = {Ilan Newman and
Yuri Rabinovich},
editor = {Susanne Albers},
title = {Online Embedding of Metrics},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {32:1--32:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.32},
doi = {10.4230/LIPICS.SWAT.2020.32},
timestamp = {Fri, 12 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/NewmanR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Rathinam0BS20,
author = {Sivakumar Rathinam and
R. Ravi and
J. Bae and
Kaarthik Sundar},
editor = {Susanne Albers},
title = {Primal-Dual 2-Approximation Algorithm for the Monotonic Multiple Depot
Heterogeneous Traveling Salesman Problem},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {33:1--33:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.33},
doi = {10.4230/LIPICS.SWAT.2020.33},
timestamp = {Fri, 12 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Rathinam0BS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/SpoerhaseSZ20,
author = {Joachim Spoerhase and
Sabine Storandt and
Johannes Zink},
editor = {Susanne Albers},
title = {Simplification of Polyline Bundles},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {35:1--35:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.35},
doi = {10.4230/LIPICS.SWAT.2020.35},
timestamp = {Wed, 14 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/SpoerhaseSZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Suomela20,
author = {Jukka Suomela},
editor = {Susanne Albers},
title = {Landscape of Locality (Invited Talk)},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {2:1--2:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.2},
doi = {10.4230/LIPICS.SWAT.2020.2},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Suomela20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Tani20,
author = {Seiichiro Tani},
editor = {Susanne Albers},
title = {Quantum Algorithm for Finding the Optimal Variable Ordering for Binary
Decision Diagrams},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {36:1--36:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.36},
doi = {10.4230/LIPICS.SWAT.2020.36},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Tani20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/X20,
editor = {Susanne Albers},
title = {Front Matter, Table of Contents, Preface, Conference Organization},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
pages = {0:1--0:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2020.0},
doi = {10.4230/LIPICS.SWAT.2020.0},
timestamp = {Fri, 12 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/X20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/2020,
editor = {Susanne Albers},
title = {17th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2020, June 22-24, 2020, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {162},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-150-4},
isbn = {978-3-95977-150-4},
timestamp = {Fri, 12 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/2020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AbdelkaderM18,
author = {Ahmed Abdelkader and
David M. Mount},
editor = {David Eppstein},
title = {Economical Delone Sets for Approximating Convex Bodies},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {4:1--4:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.4},
doi = {10.4230/LIPICS.SWAT.2018.4},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AbdelkaderM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Agarwal0SS18,
author = {Pankaj K. Agarwal and
Neeraj Kumar and
Stavros Sintos and
Subhash Suri},
editor = {David Eppstein},
title = {Computing Shortest Paths in the Plane with Removable Obstacles},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {5:1--5:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.5},
doi = {10.4230/LIPICS.SWAT.2018.5},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Agarwal0SS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Ahn0SSS18,
author = {Hee{-}Kap Ahn and
Eunjin Oh and
Lena Schlipf and
Fabian Stehn and
Darren Strash},
editor = {David Eppstein},
title = {On Romeo and Juliet Problems: Minimizing Distance-to-Sight},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {6:1--6:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.6},
doi = {10.4230/LIPICS.SWAT.2018.6},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Ahn0SSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Amato18,
author = {Nancy M. Amato},
editor = {David Eppstein},
title = {Sampling-Based Motion Planning: From Intelligent {CAD} to Crowd Simulation
to Protein Folding (Invited Talk)},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {1:1--1:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.1},
doi = {10.4230/LIPICS.SWAT.2018.1},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Amato18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BampisELP18,
author = {Evripidis Bampis and
Bruno Escoffier and
Michael Lampis and
Vangelis Th. Paschos},
editor = {David Eppstein},
title = {Multistage Matchings},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {7:1--7:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.7},
doi = {10.4230/LIPICS.SWAT.2018.7},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BampisELP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Barba0KP18,
author = {Luis Barba and
Michael Hoffmann and
Matias Korman and
Alexander Pilz},
editor = {David Eppstein},
title = {Convex Hulls in Polygonal Domains},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {8:1--8:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.8},
doi = {10.4230/LIPICS.SWAT.2018.8},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Barba0KP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BentertMW18,
author = {Matthias Bentert and
Josef Mal{\'{\i}}k and
Mathias Weller},
editor = {David Eppstein},
title = {Tree Containment With Soft Polytomies},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {9:1--9:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.9},
doi = {10.4230/LIPICS.SWAT.2018.9},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BentertMW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BiedlBD18,
author = {Therese Biedl and
Ahmad Biniaz and
Martin Derka},
editor = {David Eppstein},
title = {On the Size of Outer-String Representations},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {10:1--10:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.10},
doi = {10.4230/LIPICS.SWAT.2018.10},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BiedlBD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BiniazBOV18,
author = {Ahmad Biniaz and
Prosenjit Bose and
Aur{\'{e}}lien Ooms and
Sander Verdonschot},
editor = {David Eppstein},
title = {Improved Bounds for Guarding Plane Graphs with Edges},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {14:1--14:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.14},
doi = {10.4230/LIPICS.SWAT.2018.14},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BiniazBOV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BiniazMS18,
author = {Ahmad Biniaz and
Anil Maheshwari and
Michiel H. M. Smid},
editor = {David Eppstein},
title = {Flip Distance to some Plane Configurations},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {11:1--11:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.11},
doi = {10.4230/LIPICS.SWAT.2018.11},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BiniazMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoseCK0M18,
author = {Prosenjit Bose and
Paz Carmi and
J. Mark Keil and
Saeed Mehrabi and
Debajyoti Mondal},
editor = {David Eppstein},
title = {Boundary Labeling for Rectangular Diagrams},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {12:1--12:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.12},
doi = {10.4230/LIPICS.SWAT.2018.12},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoseCK0M18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoseS18,
author = {Prosenjit Bose and
Thomas C. Shermer},
editor = {David Eppstein},
title = {Gathering by Repulsion},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {13:1--13:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.13},
doi = {10.4230/LIPICS.SWAT.2018.13},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoseS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ChakrabortyD18,
author = {Diptarka Chakraborty and
Debarati Das},
editor = {David Eppstein},
title = {Sparse Weight Tolerant Subgraph for Single Source Shortest Path},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {15:1--15:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.15},
doi = {10.4230/LIPICS.SWAT.2018.15},
timestamp = {Sun, 09 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/ChakrabortyD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ChenDGWXY18,
author = {Lijie Chen and
Erik D. Demaine and
Yuzhou Gu and
Virginia Vassilevska Williams and
Yinzhan Xu and
Yuancheng Yu},
editor = {David Eppstein},
title = {Nearly Optimal Separation Between Partially and Fully Retroactive
Data Structures},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {33:1--33:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.33},
doi = {10.4230/LIPICS.SWAT.2018.33},
timestamp = {Fri, 05 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/ChenDGWXY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ChenDWZZ18,
author = {Lijie Chen and
Ran Duan and
Ruosong Wang and
Hanrui Zhang and
Tianyi Zhang},
editor = {David Eppstein},
title = {An Improved Algorithm for Incremental {DFS} Tree in Undirected Graphs},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {16:1--16:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.16},
doi = {10.4230/LIPICS.SWAT.2018.16},
timestamp = {Fri, 05 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/ChenDWZZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DemaineR18,
author = {Erik D. Demaine and
Mikhail Rudoy},
editor = {David Eppstein},
title = {Tree-Residue Vertex-Breaking: a new tool for proving hardness},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {32:1--32:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.32},
doi = {10.4230/LIPICS.SWAT.2018.32},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DemaineR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/El-ZeinMN18,
author = {Hicham El{-}Zein and
J. Ian Munro and
Yakov Nekrich},
editor = {David Eppstein},
title = {Succinct Dynamic One-Dimensional Point Reporting},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {17:1--17:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.17},
doi = {10.4230/LIPICS.SWAT.2018.17},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/El-ZeinMN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ElbassioniM18,
author = {Khaled M. Elbassioni and
Kazuhisa Makino},
editor = {David Eppstein},
title = {Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally
Unimodular Matrices},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {18:1--18:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.18},
doi = {10.4230/LIPICS.SWAT.2018.18},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ElbassioniM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FeldmannM18,
author = {Andreas Emil Feldmann and
D{\'{a}}niel Marx},
editor = {David Eppstein},
title = {The Parameterized Hardness of the k-Center Problem in Transportation
Networks},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {19:1--19:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.19},
doi = {10.4230/LIPICS.SWAT.2018.19},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/FeldmannM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FiltserK18,
author = {Omrit Filtser and
Matthew J. Katz},
editor = {David Eppstein},
title = {Algorithms for the Discrete Fr{\'{e}}chet Distance Under Translation},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {20:1--20:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.20},
doi = {10.4230/LIPICS.SWAT.2018.20},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/FiltserK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FominGST18,
author = {Fedor V. Fomin and
Petr A. Golovach and
Torstein J. F. Str{\o}mme and
Dimitrios M. Thilikos},
editor = {David Eppstein},
title = {Partial Complementation of Graphs},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {21:1--21:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.21},
doi = {10.4230/LIPICS.SWAT.2018.21},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/FominGST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Friedler18,
author = {Sorelle A. Friedler},
editor = {David Eppstein},
title = {Optimizing Society? Ensuring Fairness in Automated Decision-Making
(Invited Talk)},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {2:1--2:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.2},
doi = {10.4230/LIPICS.SWAT.2018.2},
timestamp = {Sat, 12 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Friedler18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GayenV18,
author = {Sutanu Gayen and
N. V. Vinodchandran},
editor = {David Eppstein},
title = {New Algorithms for Distributed Sliding Windows},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {22:1--22:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.22},
doi = {10.4230/LIPICS.SWAT.2018.22},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GayenV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GolovachHKLP18,
author = {Petr A. Golovach and
Pinar Heggernes and
Athanasios L. Konstantinidis and
Paloma T. Lima and
Charis Papadopoulos},
editor = {David Eppstein},
title = {Parameterized Aspects of Strong Subgraph Closure},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {23:1--23:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.23},
doi = {10.4230/LIPICS.SWAT.2018.23},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GolovachHKLP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HanakaKLOS18,
author = {Tesshu Hanaka and
Ioannis Katsikarelis and
Michael Lampis and
Yota Otachi and
Florian Sikora},
editor = {David Eppstein},
title = {Parameterized Orientable Deletion},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {24:1--24:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.24},
doi = {10.4230/LIPICS.SWAT.2018.24},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HanakaKLOS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HuangJ018,
author = {Lingxiao Huang and
Yifei Jin and
Jian Li},
editor = {David Eppstein},
title = {{SVM} via Saddle Point Optimization: New Bounds and Distributed Algorithms},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {25:1--25:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.25},
doi = {10.4230/LIPICS.SWAT.2018.25},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HuangJ018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HuangP18,
author = {Shang{-}En Huang and
Seth Pettie},
editor = {David Eppstein},
title = {Lower Bounds on Sparse Spanners, Emulators, and Diameter-reducing
shortcuts},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {26:1--26:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.26},
doi = {10.4230/LIPICS.SWAT.2018.26},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HuangP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ItoO18,
author = {Takehiro Ito and
Yota Otachi},
editor = {David Eppstein},
title = {Reconfiguration of Colorable Sets in Classes of Perfect Graphs},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {27:1--27:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.27},
doi = {10.4230/LIPICS.SWAT.2018.27},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/ItoO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KowalikS18,
author = {Lukasz Kowalik and
Arkadiusz Socala},
editor = {David Eppstein},
title = {Tight Lower Bounds for List Edge Coloring},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {28:1--28:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.28},
doi = {10.4230/LIPICS.SWAT.2018.28},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KowalikS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/MitzenmacherPW18,
author = {Michael Mitzenmacher and
Konstantinos Panagiotou and
Stefan Walzer},
editor = {David Eppstein},
title = {Load Thresholds for Cuckoo Hashing with Double Hashing},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {29:1--29:9},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.29},
doi = {10.4230/LIPICS.SWAT.2018.29},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/MitzenmacherPW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Moitra18,
author = {Ankur Moitra},
editor = {David Eppstein},
title = {Robustness Meets Algorithms (Invited Talk)},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {3:1--3:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.3},
doi = {10.4230/LIPICS.SWAT.2018.3},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Moitra18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Pilz18,
author = {Alexander Pilz},
editor = {David Eppstein},
title = {Planar 3-SAT with a Clause/Variable Cycle},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {31:1--31:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.31},
doi = {10.4230/LIPICS.SWAT.2018.31},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Pilz18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Thang18,
author = {Kim Thang Nguyen},
editor = {David Eppstein},
title = {A Greedy Algorithm for Subspace Approximation Problem},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {30:1--30:7},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.30},
doi = {10.4230/LIPICS.SWAT.2018.30},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/Thang18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/X18,
editor = {David Eppstein},
title = {Front Matter, Table of Contents, Preface, Conference Organization},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {0:i--0:ix},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.0},
doi = {10.4230/LIPICS.SWAT.2018.0},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/X18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/2018,
editor = {David Eppstein},
title = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-068-2},
isbn = {978-3-95977-068-2},
timestamp = {Tue, 11 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/2018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/0002HS16,
author = {Arnab Ganguly and
Wing{-}Kai Hon and
Rahul Shah},
editor = {Rasmus Pagh},
title = {A Framework for Dynamic Parameterized Dictionary Matching},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {10:1--10:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.10},
doi = {10.4230/LIPICS.SWAT.2016.10},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/0002HS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AmaniBBCMS16,
author = {Mahdi Amani and
Ahmad Biniaz and
Prosenjit Bose and
Jean{-}Lou De Carufel and
Anil Maheshwari and
Michiel H. M. Smid},
editor = {Rasmus Pagh},
title = {A Plane 1.88-Spanner for Points in Convex Position},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {25:1--25:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.25},
doi = {10.4230/LIPICS.SWAT.2016.25},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/AmaniBBCMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AronovKPRR16,
author = {Boris Aronov and
Matias Korman and
Simon Pratt and
Andr{\'{e}} van Renssen and
Marcel Roeloffzen},
editor = {Rasmus Pagh},
title = {Time-Space Trade-offs for Triangulating a Simple Polygon},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {30:1--30:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.30},
doi = {10.4230/LIPICS.SWAT.2016.30},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AronovKPRR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BanerjeeR16,
author = {Indranil Banerjee and
Dana S. Richards},
editor = {Rasmus Pagh},
title = {Sorting Under Forbidden Comparisons},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {22:1--22:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.22},
doi = {10.4230/LIPICS.SWAT.2016.22},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BanerjeeR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BanikBDKS16,
author = {Aritra Banik and
Binay K. Bhattacharya and
Sandip Das and
Tsunehiko Kameda and
Zhao Song},
editor = {Rasmus Pagh},
title = {The p-Center Problem in Tree Networks Revisited},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {6:1--6:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.6},
doi = {10.4230/LIPICS.SWAT.2016.6},
timestamp = {Tue, 01 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/BanikBDKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Ben-BasatEFK16,
author = {Ran Ben{-}Basat and
Gil Einziger and
Roy Friedman and
Yaron Kassner},
editor = {Rasmus Pagh},
title = {Efficient Summing over Sliding Windows},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {11:1--11:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.11},
doi = {10.4230/LIPICS.SWAT.2016.11},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Ben-BasatEFK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Bjorklund16,
author = {Andreas Bj{\"{o}}rklund},
editor = {Rasmus Pagh},
title = {Coloring Graphs Having Few Colorings Over Path Decompositions},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {13:1--13:9},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.13},
doi = {10.4230/LIPICS.SWAT.2016.13},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Bjorklund16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Bjorklund16a,
author = {Andreas Bj{\"{o}}rklund},
editor = {Rasmus Pagh},
title = {Below All Subsets for Some Permutational Counting Problems},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {17:1--17:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.17},
doi = {10.4230/LIPICS.SWAT.2016.17},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Bjorklund16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoyarEFKL16,
author = {Joan Boyar and
Stephan J. Eidenbenz and
Lene M. Favrholdt and
Michal Kotrbc{\'{\i}}k and
Kim S. Larsen},
editor = {Rasmus Pagh},
title = {Online Dominating Set},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {21:1--21:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.21},
doi = {10.4230/LIPICS.SWAT.2016.21},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoyarEFKL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ByrkaLM16,
author = {Jaroslaw Byrka and
Mateusz Lewandowski and
Carsten Moldenhauer},
editor = {Rasmus Pagh},
title = {Approximation Algorithms for Node-Weighted Prize-Collecting Steiner
Tree Problems on Planar Graphs},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {2:1--2:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.2},
doi = {10.4230/LIPICS.SWAT.2016.2},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/ByrkaLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CarufelMS16,
author = {Jean{-}Lou De Carufel and
Carsten Grimm and
Anil Maheshwari and
Michiel H. M. Smid},
editor = {Rasmus Pagh},
title = {Minimizing the Continuous Diameter when Augmenting Paths and Cycles
with Shortcuts},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {27:1--27:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.27},
doi = {10.4230/LIPICS.SWAT.2016.27},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/CarufelMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ChanR16,
author = {Timothy M. Chan and
Zahed Rahmati},
editor = {Rasmus Pagh},
title = {A Clustering-Based Approach to Kinetic Closest Pair},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {28:1--28:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.28},
doi = {10.4230/LIPICS.SWAT.2016.28},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ChanR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Chuzhoy16,
author = {Julia Chuzhoy},
editor = {Rasmus Pagh},
title = {Excluded Grid Theorem: Improved and Simplified (Invited Talk)},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {31:1--31:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.31},
doi = {10.4230/LIPICS.SWAT.2016.31},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Chuzhoy16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CyganLPPS16,
author = {Marek Cygan and
Daniel Lokshtanov and
Marcin Pilipczuk and
Michal Pilipczuk and
Saket Saurabh},
editor = {Rasmus Pagh},
title = {Lower Bounds for Approximation Schemes for Closest String},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {12:1--12:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.12},
doi = {10.4230/LIPICS.SWAT.2016.12},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/CyganLPPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DabrowskiDP16,
author = {Konrad K. Dabrowski and
Fran{\c{c}}ois Dross and
Dani{\"{e}}l Paulusma},
editor = {Rasmus Pagh},
title = {Colouring Diamond-free Graphs},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {16:1--16:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.16},
doi = {10.4230/LIPICS.SWAT.2016.16},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DabrowskiDP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/EneMPR16,
author = {Alina Ene and
Matthias Mnich and
Marcin Pilipczuk and
Andrej Risteski},
editor = {Rasmus Pagh},
title = {On Routing Disjoint Paths in Bounded Treewidth Graphs},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {15:1--15:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.15},
doi = {10.4230/LIPICS.SWAT.2016.15},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/EneMPR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Eppstein16,
author = {David Eppstein},
editor = {Rasmus Pagh},
title = {Cuckoo Filter: Simplification and Analysis},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {8:1--8:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.8},
doi = {10.4230/LIPICS.SWAT.2016.8},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Eppstein16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FriggstadKS16,
author = {Zachary Friggstad and
Jochen K{\"{o}}nemann and
Mohammad Shadravan},
editor = {Rasmus Pagh},
title = {A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite
Graphs},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {3:1--3:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.3},
doi = {10.4230/LIPICS.SWAT.2016.3},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/FriggstadKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FriggstadRS16,
author = {Zachary Friggstad and
Mohsen Rezapour and
Mohammad R. Salavatipour},
editor = {Rasmus Pagh},
title = {Approximating Connected Facility Location with Lower and Upper Bounds
via {LP} Rounding},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {1:1--1:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.1},
doi = {10.4230/LIPICS.SWAT.2016.1},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/FriggstadRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GawrychowskiSU16,
author = {Pawel Gawrychowski and
Jukka Suomela and
Przemyslaw Uznanski},
editor = {Rasmus Pagh},
title = {Randomized Algorithms for Finding a Majority Element},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {9:1--9:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.9},
doi = {10.4230/LIPICS.SWAT.2016.9},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/GawrychowskiSU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GolovachKPS16,
author = {Petr A. Golovach and
Dieter Kratsch and
Dani{\"{e}}l Paulusma and
Anthony Stewart},
editor = {Rasmus Pagh},
title = {A Linear Kernel for Finding Square Roots of Almost Planar Graphs},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {4:1--4:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.4},
doi = {10.4230/LIPICS.SWAT.2016.4},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GolovachKPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GuptaIM16,
author = {Sushmita Gupta and
Kazuo Iwama and
Shuichi Miyazaki},
editor = {Rasmus Pagh},
title = {Total Stability in Stable Matching Games},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {23:1--23:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.23},
doi = {10.4230/LIPICS.SWAT.2016.23},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GuptaIM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/JansenLM16,
author = {Klaus Jansen and
Kati Land and
Marten Maack},
editor = {Rasmus Pagh},
title = {Estimating The Makespan of The Two-Valued Restricted Assignment Problem},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {24:1--24:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.24},
doi = {10.4230/LIPICS.SWAT.2016.24},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/JansenLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KanjKSL16,
author = {Iyad A. Kanj and
Christian Komusiewicz and
Manuel Sorge and
Erik Jan van Leeuwen},
editor = {Rasmus Pagh},
title = {Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable
Graphs},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {14:1--14:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.14},
doi = {10.4230/LIPICS.SWAT.2016.14},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KanjKSL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Karczmarz16,
author = {Adam Karczmarz},
editor = {Rasmus Pagh},
title = {A Simple Mergeable Dictionary},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {7:1--7:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.7},
doi = {10.4230/LIPICS.SWAT.2016.7},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Karczmarz16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KolmanKT16,
author = {Petr Kolman and
Martin Kouteck{\'{y}} and
Hans Raj Tiwary},
editor = {Rasmus Pagh},
title = {Extension Complexity, {MSO} Logic, and Treewidth},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {18:1--18:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.18},
doi = {10.4230/LIPICS.SWAT.2016.18},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KolmanKT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/LangetepeK16,
author = {Elmar Langetepe and
David K{\"{u}}bel},
editor = {Rasmus Pagh},
title = {Optimal Online Escape Path Against a Certificate},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {19:1--19:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.19},
doi = {10.4230/LIPICS.SWAT.2016.19},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/LangetepeK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/MaheshwariSS16,
author = {Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Christian Scheffer},
editor = {Rasmus Pagh},
title = {Approximating the Integral Fr{\'{e}}chet Distance},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {26:1--26:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.26},
doi = {10.4230/LIPICS.SWAT.2016.26},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/MaheshwariSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Marx16,
author = {D{\'{a}}niel Marx},
editor = {Rasmus Pagh},
title = {The Complexity Landscape of Fixed-Parameter Directed Steiner Network
Problems (Invited Talk)},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {32:1--32:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.32},
doi = {10.4230/LIPICS.SWAT.2016.32},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Marx16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/MnichRS16,
author = {Matthias Mnich and
Ignaz Rutter and
Jens M. Schmidt},
editor = {Rasmus Pagh},
title = {Linear-Time Recognition of Map Graphs with Outerplanar Witness},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {5:1--5:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.5},
doi = {10.4230/LIPICS.SWAT.2016.5},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/MnichRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/OhSA16,
author = {Eunjin Oh and
Wanbin Son and
Hee{-}Kap Ahn},
editor = {Rasmus Pagh},
title = {Constrained Geodesic Centers of a Simple Polygon},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {29:1--29:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.29},
doi = {10.4230/LIPICS.SWAT.2016.29},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/OhSA16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Papadimitriou16,
author = {Christos H. Papadimitriou},
editor = {Rasmus Pagh},
title = {Computation as a Scientific Weltanschauung (Invited Talk)},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {33:1--33:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.33},
doi = {10.4230/LIPICS.SWAT.2016.33},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Papadimitriou16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Thang16,
author = {Kim Thang Nguyen},
editor = {Rasmus Pagh},
title = {Lagrangian Duality based Algorithms in Online Energy-Efficient Scheduling},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {20:1--20:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.20},
doi = {10.4230/LIPICS.SWAT.2016.20},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/Thang16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/X16,
editor = {Rasmus Pagh},
title = {Front Matter, Table of Contents, Preface, Program Committee, Subreviewers},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {0:i--0:xiv},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.0},
doi = {10.4230/LIPICS.SWAT.2016.0},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/X16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/2016,
editor = {Rasmus Pagh},
title = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-011-8},
isbn = {978-3-95977-011-8},
timestamp = {Tue, 11 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/2016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AfshaniS14,
author = {Peyman Afshani and
Nodari Sitchinava},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {I/O-Efficient Range Minima Queries},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {1--12},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_1},
doi = {10.1007/978-3-319-08404-6\_1},
timestamp = {Sun, 02 Jun 2019 21:15:18 +0200},
biburl = {https://dblp.org/rec/conf/swat/AfshaniS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AlbersH14,
author = {Susanne Albers and
Matthias Hellwig},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Online Makespan Minimization with Parallel Schedules},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {13--25},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_2},
doi = {10.1007/978-3-319-08404-6\_2},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AlbersH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BelazzouguiBN14,
author = {Djamal Belazzougui and
Gerth St{\o}lting Brodal and
Jesper Sindahl Nielsen},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Expected Linear Time Sorting for Word Size {\(\Omega\)}(log2 n loglogn)},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {26--37},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_3},
doi = {10.1007/978-3-319-08404-6\_3},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BelazzouguiBN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BennettY14,
author = {Huck Bennett and
Chee Yap},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Amortized Analysis of Smooth Quadtrees in All Dimensions},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {38--49},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_4},
doi = {10.1007/978-3-319-08404-6\_4},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BennettY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BergMS14,
author = {Mark de Berg and
Ali D. Mehrabi and
Farnaz Sheikhi},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Separability of Imprecise Points},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {146--157},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_13},
doi = {10.1007/978-3-319-08404-6\_13},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BergMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BhattacharyaCMN14,
author = {Sayan Bhattacharya and
Parinya Chalermsook and
Kurt Mehlhorn and
Adrian Neumann},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {New Approximability Results for the Robust k-Median Problem},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {50--61},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_5},
doi = {10.1007/978-3-319-08404-6\_5},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BhattacharyaCMN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Biedl14,
author = {Therese Biedl},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {62--73},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_6},
doi = {10.1007/978-3-319-08404-6\_6},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Biedl14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BiloFM14,
author = {Vittorio Bil{\`{o}} and
Michele Flammini and
Gianpiero Monaco},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Approximating the Revenue Maximization Problem with Sharp Demands},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {74--85},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_7},
doi = {10.1007/978-3-319-08404-6\_7},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BiloFM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BonsmaKW14,
author = {Paul S. Bonsma and
Marcin Kaminski and
Marcin Wrochna},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Reconfiguring Independent Sets in Claw-Free Graphs},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {86--97},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_8},
doi = {10.1007/978-3-319-08404-6\_8},
timestamp = {Wed, 30 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BonsmaKW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoseCDT14,
author = {Prosenjit Bose and
Jean{-}Lou De Carufel and
Stephane Durocher and
Perouz Taslakian},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Competitive Online Routing on Delaunay Triangulations},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {98--109},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_9},
doi = {10.1007/978-3-319-08404-6\_9},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/BoseCDT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BrodalL14,
author = {Gerth St{\o}lting Brodal and
Kasper Green Larsen},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Optimal Planar Orthogonal Skyline Counting Queries},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {110--121},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_10},
doi = {10.1007/978-3-319-08404-6\_10},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BrodalL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Brown14,
author = {Trevor Brown},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {B-slack Trees: Space Efficient B-Trees},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {122--133},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_11},
doi = {10.1007/978-3-319-08404-6\_11},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Brown14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DahlgaardT14,
author = {S{\o}ren Dahlgaard and
Mikkel Thorup},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Approximately Minwise Independence with Twisted Tabulation},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {134--145},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_12},
doi = {10.1007/978-3-319-08404-6\_12},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DahlgaardT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DosaE14,
author = {Gy{\"{o}}rgy D{\'{o}}sa and
Leah Epstein},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Colorful Bin Packing},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {170--181},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_15},
doi = {10.1007/978-3-319-08404-6\_15},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DosaE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DraganKL14,
author = {Feodor F. Dragan and
Ekkehard K{\"{o}}hler and
Arne Leitert},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Line-Distortion, Bandwidth and Path-Length of a Graph},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {158--169},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_14},
doi = {10.1007/978-3-319-08404-6\_14},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DraganKL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DudekK0S14,
author = {Andrzej Dudek and
Marek Karpinski and
Andrzej Rucinski and
Edyta Szymanska},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Approximate Counting of Matchings in (3, 3)-Hypergraphs},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {380--391},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_33},
doi = {10.1007/978-3-319-08404-6\_33},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DudekK0S14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FominLMT14,
author = {Fedor V. Fomin and
Mathieu Liedloff and
Pedro Montealegre{-}Barba and
Ioan Todinca},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Algorithms Parameterized by Vertex Cover and Modular Width, through
Potential Maximal Cliques},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {182--193},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_16},
doi = {10.1007/978-3-319-08404-6\_16},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/FominLMT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FroeseNN14,
author = {Vincent Froese and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Win-Win Kernelization for Degree Sequence Completion Problems},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {194--205},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_17},
doi = {10.1007/978-3-319-08404-6\_17},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/FroeseNN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Fujito14,
author = {Toshihiro Fujito},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {On Matchings and b-Edge Dominating Sets: {A} 2-Approximation Algorithm
for the 3-Edge Dominating Set Problem},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {206--216},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_18},
doi = {10.1007/978-3-319-08404-6\_18},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Fujito14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Fukunaga14,
author = {Takuro Fukunaga},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Covering Problems in Edge- and Node-Weighted Graphs},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {217--228},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_19},
doi = {10.1007/978-3-319-08404-6\_19},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Fukunaga14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GallN14,
author = {Fran{\c{c}}ois Le Gall and
Harumichi Nishimura},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Quantum Algorithms for Matrix Products over Semirings},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {331--343},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_29},
doi = {10.1007/978-3-319-08404-6\_29},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GallN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GrossiV14,
author = {Roberto Grossi and
S{\o}ren Vind},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Colored Range Searching in Linear Space},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {229--240},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_20},
doi = {10.1007/978-3-319-08404-6\_20},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GrossiV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/IwataO14,
author = {Yoichi Iwata and
Keigo Oka},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Fast Dynamic Graph Algorithms for Parameterized Problems},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {241--252},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_21},
doi = {10.1007/978-3-319-08404-6\_21},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/IwataO14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/JoshiN14,
author = {Anup Joshi and
N. S. Narayanaswamy},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {357--367},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_31},
doi = {10.1007/978-3-319-08404-6\_31},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/JoshiN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KlavikKORSSV14,
author = {Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Yota Otachi and
Ignaz Rutter and
Toshiki Saitoh and
Maria Saumell and
Tom{\'{a}}s Vyskocil},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Extending Partial Representations of Proper and Unit Interval Graphs},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {253--264},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_22},
doi = {10.1007/978-3-319-08404-6\_22},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/KlavikKORSSV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KlemzMN14,
author = {Boris Klemz and
Tamara Mchedlidze and
Martin N{\"{o}}llenburg},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {265--276},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_23},
doi = {10.1007/978-3-319-08404-6\_23},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KlemzMN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Knudsen14,
author = {Mathias B{\ae}k Tejs Knudsen},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Additive Spanners: {A} Simple Construction},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {277--281},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_24},
doi = {10.1007/978-3-319-08404-6\_24},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Knudsen14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KohlerM14,
author = {Ekkehard K{\"{o}}hler and
Lalla Mouatadid},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Linear Time LexDFS on Cocomparability Graphs},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {319--330},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_28},
doi = {10.1007/978-3-319-08404-6\_28},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KohlerM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KowalikS14,
author = {Lukasz Kowalik and
Arkadiusz Socala},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Assigning Channels via the Meet-in-the-Middle Approach},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {282--293},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_25},
doi = {10.1007/978-3-319-08404-6\_25},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KowalikS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KutzkovP14,
author = {Konstantin Kutzkov and
Rasmus Pagh},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Consistent Subset Sampling},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {294--305},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_26},
doi = {10.1007/978-3-319-08404-6\_26},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KutzkovP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KutzkovP14a,
author = {Konstantin Kutzkov and
Rasmus Pagh},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Triangle Counting in Dynamic Graph Streams},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {306--318},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_27},
doi = {10.1007/978-3-319-08404-6\_27},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KutzkovP14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/MunroNST14,
author = {J. Ian Munro and
Gonzalo Navarro and
Rahul Shah and
Sharma V. Thankachan},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Ranked Document Selection},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {344--356},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_30},
doi = {10.1007/978-3-319-08404-6\_30},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/MunroNST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/OtachiS14,
author = {Yota Otachi and
Pascal Schweitzer},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Reduction Techniques for Graph Isomorphism in the Context of Width
Parameters},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {368--379},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_32},
doi = {10.1007/978-3-319-08404-6\_32},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/OtachiS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/2014,
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6},
doi = {10.1007/978-3-319-08404-6},
isbn = {978-3-319-08403-9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/2014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AbamRZ12,
author = {Mohammad Ali Abam and
Zahed Rahmati and
Alireza Zarei},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Kinetic Pie Delaunay Graph and Its Applications},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {48--58},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_5},
doi = {10.1007/978-3-642-31155-0\_5},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AbamRZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AntoniadisH12,
author = {Antonios Antoniadis and
Chien{-}Chung Huang},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Non-preemptive Speed Scaling},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {249--260},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_22},
doi = {10.1007/978-3-642-31155-0\_22},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AntoniadisH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AschnerKM12,
author = {Rom Aschner and
Matthew J. Katz and
Gila Morgenstern},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Do Directional Antennas Facilitate in Reducing Interferences?},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {201--212},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_18},
doi = {10.1007/978-3-642-31155-0\_18},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AschnerKM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AtminasLR12,
author = {Aistis Atminas and
Vadim V. Lozin and
Igor Razgon},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Linear Time Algorithm for Computing a Small Biclique in Graphs without
Long Induced Paths},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {142--152},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_13},
doi = {10.1007/978-3-642-31155-0\_13},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/AtminasLR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BehsazS12,
author = {Babak Behsaz and
Mohammad R. Salavatipour},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {On Minimum Sum of Radii and Diameters Clustering},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {71--82},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_7},
doi = {10.1007/978-3-642-31155-0\_7},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BehsazS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BehsazSS12,
author = {Babak Behsaz and
Mohammad R. Salavatipour and
Zoya Svitkina},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {New Approximation Algorithms for the Unsplittable Capacitated Facility
Location Problem},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {237--248},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_21},
doi = {10.1007/978-3-642-31155-0\_21},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BehsazSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BilleGVV12,
author = {Philip Bille and
Inge Li G{\o}rtz and
Hjalte Wedel Vildh{\o}j and
S{\o}ren Vind},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {String Indexing for Patterns with Wildcards},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {283--294},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_25},
doi = {10.1007/978-3-642-31155-0\_25},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BilleGVV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BlaserPR12,
author = {Markus Bl{\"{a}}ser and
Konstantinos Panagiotou and
B. V. Raghavendra Rao},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {A Probabilistic Analysis of Christofides' Algorithm},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {225--236},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_20},
doi = {10.1007/978-3-642-31155-0\_20},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BlaserPR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BodlaenderJK12,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Kernel Bounds for Structural Parameterizations of Pathwidth},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {352--363},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_31},
doi = {10.1007/978-3-642-31155-0\_31},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BodlaenderJK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BorradailePW12,
author = {Glencora Borradaile and
Seth Pettie and
Christian Wulff{-}Nilsen},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Connectivity Oracles for Planar Graphs},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {316--327},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_28},
doi = {10.1007/978-3-642-31155-0\_28},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BorradailePW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoyarGL12,
author = {Joan Boyar and
Sushmita Gupta and
Kim S. Larsen},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Access Graphs Results for {LRU} versus {FIFO} under Relative Worst
Order Analysis},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {328--339},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_29},
doi = {10.1007/978-3-642-31155-0\_29},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoyarGL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BrunerL12,
author = {Marie{-}Louise Bruner and
Martin Lackner},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {A Fast Algorithm for Permutation Pattern Matching Based on Alternating
Runs},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {261--270},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_23},
doi = {10.1007/978-3-642-31155-0\_23},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BrunerL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BusaryevCCDW12,
author = {Oleksiy Busaryev and
Sergio Cabello and
Chao Chen and
Tamal K. Dey and
Yusu Wang},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Annotating Simplices with a Homology Basis and Its Applications},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {189--200},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_17},
doi = {10.1007/978-3-642-31155-0\_17},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/BusaryevCCDW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ChanDSW12,
author = {Timothy M. Chan and
Stephane Durocher and
Matthew Skala and
Bryan T. Wilkinson},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Linear-Space Data Structures for Range Minority Query in Arrays},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {295--306},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_26},
doi = {10.1007/978-3-642-31155-0\_26},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ChanDSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ChenGLW12,
author = {Danny Z. Chen and
Yan Gu and
Jian Li and
Haitao Wang},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage
of a Linear Domain},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {177--188},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_16},
doi = {10.1007/978-3-642-31155-0\_16},
timestamp = {Sat, 06 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/ChenGLW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CleveIGNTTY12,
author = {Richard Cleve and
Kazuo Iwama and
Fran{\c{c}}ois Le Gall and
Harumichi Nishimura and
Seiichiro Tani and
Junichi Teruyama and
Shigeru Yamashita},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Reconstructing Strings from Substrings with Quantum Queries},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {388--397},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_34},
doi = {10.1007/978-3-642-31155-0\_34},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/CleveIGNTTY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Cygan12,
author = {Marek Cygan},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Deterministic Parameterized Connected Vertex Cover},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {95--106},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_9},
doi = {10.1007/978-3-642-31155-0\_9},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Cygan12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DoerrFF12,
author = {Benjamin Doerr and
Mahmoud Fouz and
Tobias Friedrich},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Asynchronous Rumor Spreading in Preferential Attachment Graphs},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {307--315},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_27},
doi = {10.1007/978-3-642-31155-0\_27},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DoerrFF12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DumitrescuHT12,
author = {Adrian Dumitrescu and
Sariel Har{-}Peled and
Csaba D. T{\'{o}}th},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Minimum Convex Partitions and Maximum Empty Polytopes},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {213--224},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_19},
doi = {10.1007/978-3-642-31155-0\_19},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DumitrescuHT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DumitrescuMZ12,
author = {Adrian Dumitrescu and
Joseph S. B. Mitchell and
Pawel Zylinski},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Watchman Routes for Lines and Segments},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {36--47},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_4},
doi = {10.1007/978-3-642-31155-0\_4},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DumitrescuMZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FischerGL12,
author = {Eldar Fischer and
Yonatan Goldhirsh and
Oded Lachish},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Testing Formula Satisfaction},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {376--387},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_33},
doi = {10.1007/978-3-642-31155-0\_33},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/FischerGL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GemsaLLW12,
author = {Andreas Gemsa and
D. T. Lee and
Chih{-}Hung Liu and
Dorothea Wagner},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Higher Order City Voronoi Diagrams},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {59--70},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_6},
doi = {10.1007/978-3-642-31155-0\_6},
timestamp = {Tue, 14 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GemsaLLW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GhodsiMNSZ12,
author = {Mohammad Ghodsi and
Anil Maheshwari and
Mostafa Nouri and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Hamid Zarrabi{-}Zadeh},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {{\(\alpha\)}-Visibility},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {1--12},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_1},
doi = {10.1007/978-3-642-31155-0\_1},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GhodsiMNSZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GhoshKKMPRR12,
author = {Esha Ghosh and
Sudeshna Kolay and
Mrinal Kumar and
Pranabendu Misra and
Fahad Panolan and
Ashutosh Rai and
M. S. Ramanujan},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Faster Parameterized Algorithms for Deletion to Split Graphs},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {107--118},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_10},
doi = {10.1007/978-3-642-31155-0\_10},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/GhoshKKMPRR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GiannakopoulosK12,
author = {Yiannis Giannakopoulos and
Elias Koutsoupias},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Competitive Analysis of Maintaining Frequent Items of a Stream},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {340--351},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_30},
doi = {10.1007/978-3-642-31155-0\_30},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GiannakopoulosK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GiannopoulouSZ12,
author = {Archontia C. Giannopoulou and
Iosif Salem and
Dimitris Zoros},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Effective Computation of Immersion Obstructions for Unions of Graph
Classes},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {165--176},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_15},
doi = {10.1007/978-3-642-31155-0\_15},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GiannopoulouSZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GolovachPL12,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Induced Disjoint Paths in AT-Free Graphs},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {153--164},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_14},
doi = {10.1007/978-3-642-31155-0\_14},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GolovachPL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HanT12,
author = {Yijie Han and
Tadao Takaoka},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {131--141},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_12},
doi = {10.1007/978-3-642-31155-0\_12},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HanT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HruzS12,
author = {Tomas Hruz and
Marcel Sch{\"{o}}ngens},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {A Simple Framework for the Generalized Nearest Neighbor Problem},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {83--94},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_8},
doi = {10.1007/978-3-642-31155-0\_8},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HruzS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ItoNOOUUU12,
author = {Takehiro Ito and
Shin{-}Ichi Nakano and
Yoshio Okamoto and
Yota Otachi and
Ryuhei Uehara and
Takeaki Uno and
Yushi Uno},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage
Problem on Unit Squares},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {24--35},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_3},
doi = {10.1007/978-3-642-31155-0\_3},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/ItoNOOUUU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KimPP12,
author = {Eun Jung Kim and
Christophe Paul and
Geevarghese Philip},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {A Single-Exponential {FPT} Algorithm for the {K} 4-Minor Cover Problem},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {119--130},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_11},
doi = {10.1007/978-3-642-31155-0\_11},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/KimPP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KratschPRR12,
author = {Stefan Kratsch and
Marcin Pilipczuk and
Ashutosh Rai and
Venkatesh Raman},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary
Subgraphs},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {364--375},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_32},
doi = {10.1007/978-3-642-31155-0\_32},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KratschPRR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/NekrichN12,
author = {Yakov Nekrich and
Gonzalo Navarro},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Sorted Range Reporting},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {271--282},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_24},
doi = {10.1007/978-3-642-31155-0\_24},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/NekrichN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/SheretteW12,
author = {Jessica Sherette and
Carola Wenk},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Partial Matching between Surfaces Using Fr{\'{e}}chet Distance},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {13--23},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_2},
doi = {10.1007/978-3-642-31155-0\_2},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/SheretteW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/2012,
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0},
doi = {10.1007/978-3-642-31155-0},
isbn = {978-3-642-31154-3},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/2012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Abu-AffashACK10,
author = {A. Karim Abu{-}Affash and
Rom Aschner and
Paz Carmi and
Matthew J. Katz},
editor = {Haim Kaplan},
title = {The {MST} of Symmetric Disk Graphs Is Light},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {236--247},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_23},
doi = {10.1007/978-3-642-13731-0\_23},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/Abu-AffashACK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AckermannB10,
author = {Marcel R. Ackermann and
Johannes Bl{\"{o}}mer},
editor = {Haim Kaplan},
title = {Bregman Clustering for Separable Instances},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {212--223},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_21},
doi = {10.1007/978-3-642-13731-0\_21},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AckermannB10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AdlerDFST10,
author = {Isolde Adler and
Frederic Dorn and
Fedor V. Fomin and
Ignasi Sau and
Dimitrios M. Thilikos},
editor = {Haim Kaplan},
title = {Faster Parameterized Algorithms for Minor Containment},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {322--333},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_31},
doi = {10.1007/978-3-642-13731-0\_31},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AdlerDFST10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Arora10,
author = {Sanjeev Arora},
editor = {Haim Kaplan},
title = {Semidefinite Programming and Approximation Algorithms: {A} Survey},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {25},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_3},
doi = {10.1007/978-3-642-13731-0\_3},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Arora10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BachmannHS10,
author = {Unnar Th. Bachmann and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Hadas Shachnai},
editor = {Haim Kaplan},
title = {Online Selection of Intervals and \emph{t}-Intervals},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {383--394},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_36},
doi = {10.1007/978-3-642-13731-0\_36},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/BachmannHS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BergG10,
author = {Mark de Berg and
Dirk H. P. Gerrits},
editor = {Haim Kaplan},
title = {Approximation Algorithms for Free-Label Maximization},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {297--308},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_28},
doi = {10.1007/978-3-642-13731-0\_28},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BergG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BienkowskiS10,
author = {Marcin Bienkowski and
Stefan Schmid},
editor = {Haim Kaplan},
title = {Online Function Tracking with Generalized Penalties},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {359--370},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_34},
doi = {10.1007/978-3-642-13731-0\_34},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BienkowskiS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoseCJMMS10,
author = {Prosenjit Bose and
Paz Carmi and
Dana Jansens and
Anil Maheshwari and
Pat Morin and
Michiel H. M. Smid},
editor = {Haim Kaplan},
title = {Improved Methods For Generating Quasi-gray Codes},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {224--235},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_22},
doi = {10.1007/978-3-642-13731-0\_22},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoseCJMMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoseDDF10,
author = {Prosenjit Bose and
Karim Dou{\"{\i}}eb and
Vida Dujmovic and
Rolf Fagerberg},
editor = {Haim Kaplan},
title = {An \emph{O}(log log \emph{n})-Competitive Binary Search Tree with
Optimal Worst-Case Access Times},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {38--49},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_5},
doi = {10.1007/978-3-642-13731-0\_5},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/BoseDDF10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BourgeoisEPR10,
author = {Nicolas Bourgeois and
Bruno Escoffier and
Vangelis Th. Paschos and
Johan M. M. van Rooij},
editor = {Haim Kaplan},
title = {A Bottom-Up Method and Fast Algorithms for max independent set},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {62--73},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_7},
doi = {10.1007/978-3-642-13731-0\_7},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/BourgeoisEPR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BundeG10,
author = {David P. Bunde and
Michael H. Goldwasser},
editor = {Haim Kaplan},
title = {Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {346--358},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_33},
doi = {10.1007/978-3-642-13731-0\_33},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BundeG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CaoCL10,
author = {Yixin Cao and
Jianer Chen and
Yang Liu},
editor = {Haim Kaplan},
title = {On Feedback Vertex Set New Measure and New Structures},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {93--104},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_10},
doi = {10.1007/978-3-642-13731-0\_10},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/CaoCL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ChenWW10,
author = {Danny Z. Chen and
Chao Wang and
Haitao Wang},
editor = {Haim Kaplan},
title = {Representing a Functional Curve by Curves with Fewer Peaks},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {200--211},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_20},
doi = {10.1007/978-3-642-13731-0\_20},
timestamp = {Tue, 27 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ChenWW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CrowstonGJKR10,
author = {Robert Crowston and
Gregory Z. Gutin and
Mark Jones and
Eun Jung Kim and
Imre Z. Ruzsa},
editor = {Haim Kaplan},
title = {Systems of Linear Equations over F\({}_{\mbox{2}}\) and Problems Parameterized
above Average},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {164--175},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_17},
doi = {10.1007/978-3-642-13731-0\_17},
timestamp = {Thu, 05 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/CrowstonGJKR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CyganPW10,
author = {Marek Cygan and
Marcin Pilipczuk and
Jakub Onufry Wojtaszczyk},
editor = {Haim Kaplan},
title = {Capacitated Domination Faster Than \emph{O}(2\({}^{\mbox{\emph{n}}}\))},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {74--80},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_8},
doi = {10.1007/978-3-642-13731-0\_8},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/CyganPW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CzyzowiczILP10,
author = {Jurek Czyzowicz and
David Ilcinkas and
Arnaud Labourel and
Andrzej Pelc},
editor = {Haim Kaplan},
title = {Optimal Exploration of Terrains with Obstacles},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {1--12},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_1},
doi = {10.1007/978-3-642-13731-0\_1},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/CzyzowiczILP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DellingGNP10,
author = {Daniel Delling and
Andreas Gemsa and
Martin N{\"{o}}llenburg and
Thomas Pajor},
editor = {Haim Kaplan},
title = {Path Schematization for Route Sketches},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {285--296},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_27},
doi = {10.1007/978-3-642-13731-0\_27},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DellingGNP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DemaineZ10,
author = {Erik D. Demaine and
Morteza Zadimoghaddam},
editor = {Haim Kaplan},
title = {Minimizing the Diameter of a Network Using Shortcut Edges},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {420--431},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_39},
doi = {10.1007/978-3-642-13731-0\_39},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DemaineZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DisserMW10,
author = {Yann Disser and
Mat{\'{u}}s Mihal{\'{a}}k and
Peter Widmayer},
editor = {Haim Kaplan},
title = {Reconstructing a Simple Polygon from Its Angles},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {13--24},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_2},
doi = {10.1007/978-3-642-13731-0\_2},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DisserMW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/EhmsenL10,
author = {Martin R. Ehmsen and
Kim S. Larsen},
editor = {Haim Kaplan},
title = {Better Bounds on Online Unit Clustering},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {371--382},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_35},
doi = {10.1007/978-3-642-13731-0\_35},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/EhmsenL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ElmasryJK10,
author = {Amr Elmasry and
Claus Jensen and
Jyrki Katajainen},
editor = {Haim Kaplan},
title = {Strictly-Regular Number System and Data Structures},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {26--37},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_4},
doi = {10.1007/978-3-642-13731-0\_4},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/ElmasryJK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FominGL10,
author = {Fedor V. Fomin and
Petr A. Golovach and
Daniel Lokshtanov},
editor = {Haim Kaplan},
title = {Cops and Robber Game without Recharging},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {273--284},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_26},
doi = {10.1007/978-3-642-13731-0\_26},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/FominGL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GaoZ10,
author = {Jie Gao and
Dengpan Zhou},
editor = {Haim Kaplan},
title = {The Emergence of Sparse Spanners and Greedy Well-Separated Pair Decomposition},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {50--61},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_6},
doi = {10.1007/978-3-642-13731-0\_6},
timestamp = {Wed, 03 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/GaoZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HeggernesKLRS10,
author = {Pinar Heggernes and
Dieter Kratsch and
Daniel Lokshtanov and
Venkatesh Raman and
Saket Saurabh},
editor = {Haim Kaplan},
title = {Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle
Stabbing},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {334--345},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_32},
doi = {10.1007/978-3-642-13731-0\_32},
timestamp = {Mon, 30 Oct 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/HeggernesKLRS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HoffmannMOZ10,
author = {Michael Hoffmann and
Jir{\'{\i}} Matousek and
Yoshio Okamoto and
Philipp Zumstein},
editor = {Haim Kaplan},
title = {Minimum and Maximum against \emph{k} Lies},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {139--149},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_14},
doi = {10.1007/978-3-642-13731-0\_14},
timestamp = {Thu, 24 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/HoffmannMOZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HorevKS10,
author = {Elad Horev and
Roi Krakovski and
Shakhar Smorodinsky},
editor = {Haim Kaplan},
title = {Conflict-Free Coloring Made Stronger},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {105--117},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_11},
doi = {10.1007/978-3-642-13731-0\_11},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/HorevKS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/IyengarPS10,
author = {Garud Iyengar and
David J. Phillips and
Clifford Stein},
editor = {Haim Kaplan},
title = {Feasible and Accurate Algorithms for Covering Semidefinite Programs},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {150--162},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_15},
doi = {10.1007/978-3-642-13731-0\_15},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/IyengarPS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Jansen10,
author = {Bart M. P. Jansen},
editor = {Haim Kaplan},
title = {Polynomial Kernels for Hard Problems on Disk Graphs},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {310--321},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_30},
doi = {10.1007/978-3-642-13731-0\_30},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Jansen10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/JansenKMS10,
author = {Klaus Jansen and
Stefan Kratsch and
D{\'{a}}niel Marx and
Ildik{\'{o}} Schlotter},
editor = {Haim Kaplan},
title = {Bin Packing with Fixed Number of Bins Revisited},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {260--272},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_25},
doi = {10.1007/978-3-642-13731-0\_25},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/JansenKMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KaminskiK10,
author = {Marcin Kaminski and
Lukasz Kowalik},
editor = {Haim Kaplan},
title = {Approximating the Maximum 3- and 4-Edge-Colorable Subgraph},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {395--407},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_37},
doi = {10.1007/978-3-642-13731-0\_37},
timestamp = {Wed, 30 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KaminskiK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KratschS10,
author = {Stefan Kratsch and
Pascal Schweitzer},
editor = {Haim Kaplan},
title = {Isomorphism for Graphs of Bounded Feedback Vertex Set Number},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {81--92},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_9},
doi = {10.1007/978-3-642-13731-0\_9},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KratschS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/LouisV10,
author = {Anand Louis and
Nisheeth K. Vishnoi},
editor = {Haim Kaplan},
title = {Improved Algorithm for Degree Bounded Survivable Network Design Problem},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {408--419},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_38},
doi = {10.1007/978-3-642-13731-0\_38},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/LouisV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Nonner10,
author = {Tim Nonner},
editor = {Haim Kaplan},
title = {Capacitated max -Batching with Interval Graph Compatibilities},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {176--187},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_18},
doi = {10.1007/978-3-642-13731-0\_18},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Nonner10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Patt-ShamirR10,
author = {Boaz Patt{-}Shamir and
Dror Rawitz},
editor = {Haim Kaplan},
title = {Vector Bin Packing with Multiple-Choice},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {248--259},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_24},
doi = {10.1007/978-3-642-13731-0\_24},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Patt-ShamirR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/PirwaniS10,
author = {Imran A. Pirwani and
Mohammad R. Salavatipour},
editor = {Haim Kaplan},
title = {A Weakly Robust {PTAS} for Minimum Clique Partition in Unit Disk Graphs},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {188--199},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_19},
doi = {10.1007/978-3-642-13731-0\_19},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/PirwaniS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Raghavan10,
author = {Prabhakar Raghavan},
editor = {Haim Kaplan},
title = {The Quantitative Analysis of User Behavior Online - Data, Models and
Algorithms},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {163},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_16},
doi = {10.1007/978-3-642-13731-0\_16},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Raghavan10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Randall10,
author = {Dana Randall},
editor = {Haim Kaplan},
title = {Phase Transitions in Sampling Algorithms and the Underlying Random
Structures},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {309},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_29},
doi = {10.1007/978-3-642-13731-0\_29},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Randall10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/SmorodinskyY10,
author = {Shakhar Smorodinsky and
Yelena Yuditsky},
editor = {Haim Kaplan},
title = {Polychromatic Coloring for Half-Planes},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {118--126},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_12},
doi = {10.1007/978-3-642-13731-0\_12},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/SmorodinskyY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/XuR10,
author = {Zhou Xu and
Brian Rodrigues},
editor = {Haim Kaplan},
title = {A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling
Salesman Problem},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {127--138},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_13},
doi = {10.1007/978-3-642-13731-0\_13},
timestamp = {Thu, 09 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/XuR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/2010,
editor = {Haim Kaplan},
title = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0},
doi = {10.1007/978-3-642-13731-0},
isbn = {978-3-642-13730-3},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/2010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Addario-BerryAST08,
author = {Louigi Addario{-}Berry and
Omid Amini and
Jean{-}S{\'{e}}bastien Sereni and
St{\'{e}}phan Thomass{\'{e}}},
editor = {Joachim Gudmundsson},
title = {Guarding Art Galleries: The Extra Cost for Sculptures Is Linear},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {41--52},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_6},
doi = {10.1007/978-3-540-69903-3\_6},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Addario-BerryAST08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AlthausCEKM08,
author = {Ernst Althaus and
Stefan Canzar and
Khaled M. Elbassioni and
Andreas Karrenbauer and
Juli{\'{a}}n Mestre},
editor = {Joachim Gudmundsson},
title = {Approximating the Interval Constrained Coloring Problem},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {210--221},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_20},
doi = {10.1007/978-3-540-69903-3\_20},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AlthausCEKM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AzarFG08,
author = {Yossi Azar and
Uriel Feige and
Daniel Glasner},
editor = {Joachim Gudmundsson},
title = {A Preemptive Algorithm for Maximizing Disjoint Paths on Trees},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {319--330},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_29},
doi = {10.1007/978-3-540-69903-3\_29},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AzarFG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BekosKNS08,
author = {Michael A. Bekos and
Michael Kaufmann and
Martin N{\"{o}}llenburg and
Antonios Symvonis},
editor = {Joachim Gudmundsson},
title = {Boundary Labeling with Octilinear Leaders},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {234--245},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_22},
doi = {10.1007/978-3-540-69903-3\_22},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BekosKNS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BeregDJ08,
author = {Sergey Bereg and
Adrian Dumitrescu and
Minghui Jiang},
editor = {Joachim Gudmundsson},
title = {On Covering Problems of Rado},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {294--305},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_27},
doi = {10.1007/978-3-540-69903-3\_27},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BeregDJ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BetzlerGN08,
author = {Nadja Betzler and
Jiong Guo and
Rolf Niedermeier},
editor = {Joachim Gudmundsson},
title = {Parameterized Computational Complexity of Dodgson and Young Elections},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {402--413},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_36},
doi = {10.1007/978-3-540-69903-3\_36},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BetzlerGN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BiloBHKMWZ08,
author = {Davide Bil{\`{o}} and
Hans{-}Joachim B{\"{o}}ckenhauer and
Juraj Hromkovic and
Richard Kr{\'{a}}lovic and
Tobias M{\"{o}}mke and
Peter Widmayer and
Anna Zych},
editor = {Joachim Gudmundsson},
title = {Reoptimization of Steiner Trees},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {258--269},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_24},
doi = {10.1007/978-3-540-69903-3\_24},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/BiloBHKMWZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BlellochGV08,
author = {Guy E. Blelloch and
Daniel Golovin and
Virginia Vassilevska},
editor = {Joachim Gudmundsson},
title = {Uniquely Represented Data Structures for Computational Geometry},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {17--28},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_4},
doi = {10.1007/978-3-540-69903-3\_4},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BlellochGV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BodlaenderTDL08,
author = {Hans L. Bodlaender and
Richard B. Tan and
Thomas C. van Dijk and
Jan van Leeuwen},
editor = {Joachim Gudmundsson},
title = {Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {102--113},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_11},
doi = {10.1007/978-3-540-69903-3\_11},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BodlaenderTDL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoseCC08,
author = {Prosenjit Bose and
Paz Carmi and
Mathieu Couture},
editor = {Joachim Gudmundsson},
title = {Spanners of Additively Weighted Point Sets},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {367--377},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_33},
doi = {10.1007/978-3-540-69903-3\_33},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/BoseCC08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoseCFMS08,
author = {Prosenjit Bose and
Paz Carmi and
Mohammad Farshi and
Anil Maheshwari and
Michiel H. M. Smid},
editor = {Joachim Gudmundsson},
title = {Computing the Greedy Spanner in Near-Quadratic Time},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {390--401},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_35},
doi = {10.1007/978-3-540-69903-3\_35},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/BoseCFMS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ChristHOU08,
author = {Tobias Christ and
Michael Hoffmann and
Yoshio Okamoto and
Takeaki Uno},
editor = {Joachim Gudmundsson},
title = {Improved Bounds for Wireless Localization},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {77--89},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_9},
doi = {10.1007/978-3-540-69903-3\_9},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/ChristHOU08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DegenerGL08,
author = {Bastian Degener and
Joachim Gehweiler and
Christiane Lammersen},
editor = {Joachim Gudmundsson},
title = {The Kinetic Facility Location Problem},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {378--389},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_34},
doi = {10.1007/978-3-540-69903-3\_34},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DegenerGL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DemaineLP08,
author = {Erik D. Demaine and
Stefan Langerman and
Eric Price},
editor = {Joachim Gudmundsson},
title = {Confluently Persistent Tries for Efficient Version Control},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {160--172},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_16},
doi = {10.1007/978-3-540-69903-3\_16},
timestamp = {Fri, 22 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DemaineLP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DumitrescuKSZ08,
author = {Adrian Dumitrescu and
Howi Kok and
Ichiro Suzuki and
Pawel Zylinski},
editor = {Joachim Gudmundsson},
title = {Vision-Based Pursuit-Evasion in a Grid},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {53--64},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_7},
doi = {10.1007/978-3-540-69903-3\_7},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DumitrescuKSZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DumitriuFKM08,
author = {Daniel Dumitriu and
Stefan Funke and
Martin Kutz and
Nikola Milosavljevic},
editor = {Joachim Gudmundsson},
title = {On the Locality of Extracting a 2-Manifold in},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {270--281},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_25},
doi = {10.1007/978-3-540-69903-3\_25},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DumitriuFKM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FarzanM08,
author = {Arash Farzan and
J. Ian Munro},
editor = {Joachim Gudmundsson},
title = {A Uniform Approach Towards Succinct Representation of Trees},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {173--184},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_17},
doi = {10.1007/978-3-540-69903-3\_17},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/FarzanM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FeketeHKK08,
author = {S{\'{a}}ndor P. Fekete and
Alexander Hall and
Ekkehard K{\"{o}}hler and
Alexander Kr{\"{o}}ller},
editor = {Joachim Gudmundsson},
title = {The Maximum Energy-Constrained Dynamic Flow Problem},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {114--126},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_12},
doi = {10.1007/978-3-540-69903-3\_12},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/FeketeHKK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GfellerMSVW08,
author = {Beat Gfeller and
Mat{\'{u}}s Mihal{\'{a}}k and
Subhash Suri and
Elias Vicari and
Peter Widmayer},
editor = {Joachim Gudmundsson},
title = {Angle Optimization in Target Tracking},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {65--76},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_8},
doi = {10.1007/978-3-540-69903-3\_8},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GfellerMSVW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GibsonKKPV08,
author = {Matt Gibson and
Gaurav Kanade and
Erik Krohn and
Imran A. Pirwani and
Kasturi R. Varadarajan},
editor = {Joachim Gudmundsson},
title = {On Metric Clustering to Minimize the Sum of Radii},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {282--293},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_26},
doi = {10.1007/978-3-540-69903-3\_26},
timestamp = {Thu, 01 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/GibsonKKPV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GolynskiRR08,
author = {Alexander Golynski and
Rajeev Raman and
S. Srinivasa Rao},
editor = {Joachim Gudmundsson},
title = {On the Redundancy of Succinct Data Structures},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {148--159},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_15},
doi = {10.1007/978-3-540-69903-3\_15},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GolynskiRR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HalldorssonS08,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Hadas Shachnai},
editor = {Joachim Gudmundsson},
title = {Batch Coloring Flat Graphs and Thin},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {198--209},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_19},
doi = {10.1007/978-3-540-69903-3\_19},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/HalldorssonS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HarrenS08,
author = {Rolf Harren and
Rob van Stee},
editor = {Joachim Gudmundsson},
title = {Packing Rectangles into 2OPT Bins Using Rotations},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {306--318},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_28},
doi = {10.1007/978-3-540-69903-3\_28},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HarrenS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HasunumaIOU08,
author = {Toru Hasunuma and
Toshimasa Ishii and
Hirotaka Ono and
Yushi Uno},
editor = {Joachim Gudmundsson},
title = {An Algorithm for L(2, 1)-Labeling of Trees},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {185--197},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_18},
doi = {10.1007/978-3-540-69903-3\_18},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/HasunumaIOU08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HeggernesMP08,
author = {Pinar Heggernes and
Daniel Meister and
Andrzej Proskurowski},
editor = {Joachim Gudmundsson},
title = {Minimum Distortion Embeddings into a Path of Bipartite Permutation
and Threshold Graphs},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {331--342},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_30},
doi = {10.1007/978-3-540-69903-3\_30},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HeggernesMP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HershbergerS08,
author = {John Hershberger and
Subhash Suri},
editor = {Joachim Gudmundsson},
title = {Simplified Planar Coresets for Data Streams},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {5--16},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_3},
doi = {10.1007/978-3-540-69903-3\_3},
timestamp = {Wed, 03 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/HershbergerS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HershcovitchK08,
author = {Moshe Hershcovitch and
Haim Kaplan},
editor = {Joachim Gudmundsson},
title = {{I/O} Efficient Dynamic Data Structures for Longest Prefix Queries},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {29--40},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_5},
doi = {10.1007/978-3-540-69903-3\_5},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HershcovitchK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HuangKMN08,
author = {Chien{-}Chung Huang and
Telikepalli Kavitha and
Dimitrios Michail and
Meghana Nasre},
editor = {Joachim Gudmundsson},
title = {Bounded Unpopularity Matchings},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {127--137},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_13},
doi = {10.1007/978-3-540-69903-3\_13},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HuangKMN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Kavitha08,
author = {Telikepalli Kavitha},
editor = {Joachim Gudmundsson},
title = {On a Special Co-cycle Basis of Graphs},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {343--354},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_31},
doi = {10.1007/978-3-540-69903-3\_31},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Kavitha08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KowalukLN08,
author = {Miroslaw Kowaluk and
Andrzej Lingas and
Johannes Nowak},
editor = {Joachim Gudmundsson},
title = {A Path Cover Technique for LCAs in Dags},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {222--233},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_21},
doi = {10.1007/978-3-540-69903-3\_21},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KowalukLN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/LinSS08,
author = {Min Chih Lin and
Francisco J. Soulignac and
Jayme Luiz Szwarcfiter},
editor = {Joachim Gudmundsson},
title = {A Simple Linear Time Algorithm for the Isomorphism Problem on Proper
Circular-Arc Graphs},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {355--366},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_32},
doi = {10.1007/978-3-540-69903-3\_32},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/LinSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/MansSW08,
author = {Bernard Mans and
Stefan Schmid and
Roger Wattenhofer},
editor = {Joachim Gudmundsson},
title = {Distributed Disaster Disclosure},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {246--257},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_23},
doi = {10.1007/978-3-540-69903-3\_23},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/MansSW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Meyer08,
author = {Ulrich Meyer},
editor = {Joachim Gudmundsson},
title = {On Trade-Offs in External-Memory Diameter-Approximation},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {426--436},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_38},
doi = {10.1007/978-3-540-69903-3\_38},
timestamp = {Mon, 14 Aug 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Meyer08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Mitzenmacher08,
author = {Michael Mitzenmacher},
editor = {Joachim Gudmundsson},
title = {A Survey of Results for Deletion Channels and Related Synchronization
Channels},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {1--3},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_1},
doi = {10.1007/978-3-540-69903-3\_1},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Mitzenmacher08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Nekrich08,
author = {Yakov Nekrich},
editor = {Joachim Gudmundsson},
title = {Data Structures with Local Update Operations},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {138--147},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_14},
doi = {10.1007/978-3-540-69903-3\_14},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/Nekrich08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/PlaxtonSTV08,
author = {C. Greg Plaxton and
Yu Sun and
Mitul Tiwari and
Harrick M. Vin},
editor = {Joachim Gudmundsson},
title = {Online Compression Caching},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {414--425},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_37},
doi = {10.1007/978-3-540-69903-3\_37},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/PlaxtonSTV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/RabaniS08,
author = {Yuval Rabani and
Gabriel Scalosub},
editor = {Joachim Gudmundsson},
title = {Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {90--101},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_10},
doi = {10.1007/978-3-540-69903-3\_10},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/RabaniS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Vazirani08,
author = {Vijay V. Vazirani},
editor = {Joachim Gudmundsson},
title = {Nash Bargaining Via Flexible Budget Markets},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {4},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_2},
doi = {10.1007/978-3-540-69903-3\_2},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Vazirani08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/2008,
editor = {Joachim Gudmundsson},
title = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3},
doi = {10.1007/978-3-540-69903-3},
isbn = {978-3-540-69900-2},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/2008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AbrahamK06,
author = {David J. Abraham and
Telikepalli Kavitha},
editor = {Lars Arge and
Rusins Freivalds},
title = {Dynamic Matching Markets and Voting Paths},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {65--76},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_9},
doi = {10.1007/11785293\_9},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/AbrahamK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AckermanBKR06,
author = {Eyal Ackerman and
Kevin Buchin and
Christian Knauer and
G{\"{u}}nter Rote},
editor = {Lars Arge and
Rusins Freivalds},
title = {Acyclic Orientation of Drawings},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {268--279},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_26},
doi = {10.1007/11785293\_26},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AckermanBKR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AjwaniFM06,
author = {Deepak Ajwani and
Tobias Friedrich and
Ulrich Meyer},
editor = {Lars Arge and
Rusins Freivalds},
title = {An O(n\({}^{\mbox{2.75}}\)) Algorithm for Online Topological Ordering},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {53--64},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_8},
doi = {10.1007/11785293\_8},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AjwaniFM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AmbainisIKPY06,
author = {Andris Ambainis and
Kazuo Iwama and
Akinori Kawachi and
Rudy Raymond Harry Putra and
Shigeru Yamashita},
editor = {Lars Arge and
Rusins Freivalds},
title = {Improved Algorithms for Quantum Identification of Boolean Oracles},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {280--291},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_27},
doi = {10.1007/11785293\_27},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AmbainisIKPY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Angelopoulos06,
author = {Spyros Angelopoulos},
editor = {Lars Arge and
Rusins Freivalds},
title = {The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {208--219},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_21},
doi = {10.1007/11785293\_21},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Angelopoulos06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ArpeM06,
author = {Jan Arpe and
Bodo Manthey},
editor = {Lars Arge and
Rusins Freivalds},
title = {Approximability of Minimum AND-Circuits},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {292--303},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_28},
doi = {10.1007/11785293\_28},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ArpeM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AusielloEMP06,
author = {Giorgio Ausiello and
Bruno Escoffier and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
editor = {Lars Arge and
Rusins Freivalds},
title = {Reoptimization of Minimum and Maximum Traveling Salesman's Tours},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {196--207},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_20},
doi = {10.1007/11785293\_20},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AusielloEMP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AzarL06,
author = {Yossi Azar and
Nir Levy},
editor = {Lars Arge and
Rusins Freivalds},
title = {Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {5--16},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_4},
doi = {10.1007/11785293\_4},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AzarL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BlunckV06,
author = {Henrik Blunck and
Jan Vahrenhold},
editor = {Lars Arge and
Rusins Freivalds},
title = {In-Place Algorithms for Computing (Layers of) Maxima},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {363--374},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_34},
doi = {10.1007/11785293\_34},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BlunckV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BockenhauerHKK06,
author = {Hans{-}Joachim B{\"{o}}ckenhauer and
Juraj Hromkovic and
Joachim Kneis and
Joachim Kupke},
editor = {Lars Arge and
Rusins Freivalds},
title = {On the Approximation Hardness of Some Generalizations of {TSP}},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {184--195},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_19},
doi = {10.1007/11785293\_19},
timestamp = {Fri, 01 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/BockenhauerHKK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BonifaciKMS06,
author = {Vincenzo Bonifaci and
Peter Korteweg and
Alberto Marchetti{-}Spaccamela and
Leen Stougie},
editor = {Lars Arge and
Rusins Freivalds},
title = {An Approximation Algorithm for the Wireless Gathering Problem},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {328--338},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_31},
doi = {10.1007/11785293\_31},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BonifaciKMS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoyarF06,
author = {Joan Boyar and
Lene M. Favrholdt},
editor = {Lars Arge and
Rusins Freivalds},
title = {Scheduling Jobs on Grid Processors},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {17--28},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_5},
doi = {10.1007/11785293\_5},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoyarF06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BrandstadtDXY06,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Yang Xiang and
Chenyu Yan},
editor = {Lars Arge and
Rusins Freivalds},
title = {Generalized Powers of Graphs and Their Algorithmic Use},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {423--434},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_39},
doi = {10.1007/11785293\_39},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BrandstadtDXY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CarlsonE06,
author = {Josiah Carlson and
David Eppstein},
editor = {Lars Arge and
Rusins Freivalds},
title = {The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {400--410},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_37},
doi = {10.1007/11785293\_37},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/CarlsonE06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ChangKL06,
author = {Maw{-}Shang Chang and
Ming{-}Tat Ko and
Hsueh{-}I Lu},
editor = {Lars Arge and
Rusins Freivalds},
title = {Linear-Time Algorithms for Tree Root Problems},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {411--422},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_38},
doi = {10.1007/11785293\_38},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ChangKL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CorreaFW06,
author = {Jos{\'{e}} R. Correa and
Cristina G. Fernandes and
Yoshiko Wakabayashi},
editor = {Lars Arge and
Rusins Freivalds},
title = {Approximating Rational Objectives Is as Easy as Approximating Linear
Ones},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {351--362},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_33},
doi = {10.1007/11785293\_33},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/CorreaFW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DoerrFKO06,
author = {Benjamin Doerr and
Tobias Friedrich and
Christian Klein and
Ralf Osbild},
editor = {Lars Arge and
Rusins Freivalds},
title = {Unbiased Matrix Rounding},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {102--112},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_12},
doi = {10.1007/11785293\_12},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DoerrFKO06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DomGNW06,
author = {Michael Dom and
Jiong Guo and
Rolf Niedermeier and
Sebastian Wernicke},
editor = {Lars Arge and
Rusins Freivalds},
title = {Minimum Membership Set Covering and the Consecutive Ones Property},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {339--350},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_32},
doi = {10.1007/11785293\_32},
timestamp = {Sun, 20 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/DomGNW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DornFT06,
author = {Frederic Dorn and
Fedor V. Fomin and
Dimitrios M. Thilikos},
editor = {Lars Arge and
Rusins Freivalds},
title = {Fast Subexponential Algorithm for Non-local Problems on Graphs of
Bounded Genus},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {172--183},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_18},
doi = {10.1007/11785293\_18},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DornFT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/EpsteinEL06,
author = {Leah Epstein and
Thomas Erlebach and
Asaf Levin},
editor = {Lars Arge and
Rusins Freivalds},
title = {Variable Sized Online Interval Coloring with Bandwidth},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {29--40},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_6},
doi = {10.1007/11785293\_6},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/EpsteinEL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/EpsteinST06,
author = {Leah Epstein and
Rob van Stee and
Tami Tamir},
editor = {Lars Arge and
Rusins Freivalds},
title = {Paging with Request Sets},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {124--135},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_14},
doi = {10.1007/11785293\_14},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/EpsteinST06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Franceschini06,
author = {Gianni Franceschini},
editor = {Lars Arge and
Rusins Freivalds},
title = {Sorting by Merging or Merging by Sorting?},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {77--89},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_10},
doi = {10.1007/11785293\_10},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Franceschini06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GaspersKL06,
author = {Serge Gaspers and
Dieter Kratsch and
Mathieu Liedloff},
editor = {Lars Arge and
Rusins Freivalds},
title = {Exponential Time Algorithms for the Minimum Dominating Set Problem
on Some Graph Classes},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {148--159},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_16},
doi = {10.1007/11785293\_16},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GaspersKL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GoldwasserP06,
author = {Michael H. Goldwasser and
Mark Pedigo},
editor = {Lars Arge and
Rusins Freivalds},
title = {Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical
Machines},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {113--123},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_13},
doi = {10.1007/11785293\_13},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GoldwasserP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GudmundssonS06,
author = {Joachim Gudmundsson and
Michiel H. M. Smid},
editor = {Lars Arge and
Rusins Freivalds},
title = {On Spanners of Geometric Graphs},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {388--399},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_36},
doi = {10.1007/11785293\_36},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GudmundssonS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HeydenreichMU06,
author = {Birgit Heydenreich and
Rudolf M{\"{u}}ller and
Marc Uetz},
editor = {Lars Arge and
Rusins Freivalds},
title = {Decentralization and Mechanism Design for Online Machine Scheduling},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {136--147},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_15},
doi = {10.1007/11785293\_15},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HeydenreichMU06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Iwama06,
author = {Kazuo Iwama},
editor = {Lars Arge and
Rusins Freivalds},
title = {Classic and Quantum Network Coding},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {3--4},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_3},
doi = {10.1007/11785293\_3},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Iwama06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Kammer06,
author = {Frank Kammer},
editor = {Lars Arge and
Rusins Freivalds},
title = {Simultaneous Embedding with Two Bends per Edge in Polynomial Area},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {255--267},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_25},
doi = {10.1007/11785293\_25},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Kammer06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KaplanN06,
author = {Haim Kaplan and
Yahav Nussbaum},
editor = {Lars Arge and
Rusins Freivalds},
title = {A Simpler Linear-Time Recognition of Circular-Arc Graphs},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {41--52},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_7},
doi = {10.1007/11785293\_7},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KaplanN06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KaplanPS06,
author = {Haim Kaplan and
Ely Porat and
Nira Shafrir},
editor = {Lars Arge and
Rusins Freivalds},
title = {Finding the Position of the \emph{k}-Mismatch and Approximate Tandem
Repeats},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {90--101},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_11},
doi = {10.1007/11785293\_11},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KaplanPS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KatzR06,
author = {Matthew J. Katz and
Gabriel S. Roisman},
editor = {Lars Arge and
Rusins Freivalds},
title = {On Guarding Rectilinear Domains},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {220--231},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_22},
doi = {10.1007/11785293\_22},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KatzR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KnauerS06,
author = {Christian Knauer and
Andreas Spillner},
editor = {Lars Arge and
Rusins Freivalds},
title = {Approximation Algorithms for the Minimum Convex Partition Problem},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {232--241},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_23},
doi = {10.1007/11785293\_23},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KnauerS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Leeuwen06,
author = {Erik Jan van Leeuwen},
editor = {Lars Arge and
Rusins Freivalds},
title = {Better Approximation Schemes for Disk Graphs},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {316--327},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_30},
doi = {10.1007/11785293\_30},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Leeuwen06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/LofflerK06,
author = {Maarten L{\"{o}}ffler and
Marc J. van Kreveld},
editor = {Lars Arge and
Rusins Freivalds},
title = {Largest and Smallest Tours and Convex Hulls for Imprecise Points},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {375--387},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_35},
doi = {10.1007/11785293\_35},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/LofflerK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Muller-HannemannS06,
author = {Matthias M{\"{u}}ller{-}Hannemann and
Anna Schulze},
editor = {Lars Arge and
Rusins Freivalds},
title = {Approximation of Octilinear Steiner Trees Constrained by Hard and
Soft Obstacles},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {242--254},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_24},
doi = {10.1007/11785293\_24},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Muller-HannemannS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/RamanS06,
author = {Venkatesh Raman and
Saket Saurabh},
editor = {Lars Arge and
Rusins Freivalds},
title = {Triangles, 4-Cycles and Parameterized (In-)Tractability},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {304--315},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_29},
doi = {10.1007/11785293\_29},
timestamp = {Mon, 30 Oct 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/RamanS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Razgon06,
author = {Igor Razgon},
editor = {Lars Arge and
Rusins Freivalds},
title = {Exact Computation of Maximum Induced Forest},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {160--171},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_17},
doi = {10.1007/11785293\_17},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Razgon06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Seidel06,
author = {Raimund Seidel},
editor = {Lars Arge and
Rusins Freivalds},
title = {Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann
Bound Naturally (and Easily)},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {1},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_1},
doi = {10.1007/11785293\_1},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Seidel06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Tarjan06,
author = {Robert Endre Tarjan},
editor = {Lars Arge and
Rusins Freivalds},
title = {Results and Problems on Self-adjusting Search Trees and Related Data
Structures},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {2},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_2},
doi = {10.1007/11785293\_2},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Tarjan06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/2006,
editor = {Lars Arge and
Rusins Freivalds},
title = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293},
doi = {10.1007/11785293},
isbn = {3-540-35753-X},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/2006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AgarwalM04,
author = {Pankaj K. Agarwal and
Nabil H. Mustafa},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Independent Set of Intersection Graphs of Convex Objects in 2D},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {127--137},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_12},
doi = {10.1007/978-3-540-27810-8\_12},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/AgarwalM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AndelmanM04,
author = {Nir Andelman and
Yishay Mansour},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Auctions with Budget Constraints},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {26--38},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_4},
doi = {10.1007/978-3-540-27810-8\_4},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AndelmanM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ArgeT04,
author = {Lars Arge and
Laura Toma},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Simplified External Memory Algorithms for Planar DAGs},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {493--503},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_42},
doi = {10.1007/978-3-540-27810-8\_42},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ArgeT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AsanoKTT04,
author = {Tetsuo Asano and
Naoki Katoh and
Hisao Tamaki and
Takeshi Tokuyama},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {On Geometric Structure of Global Roundings for Graphs and Range Spaces},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {455--467},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_39},
doi = {10.1007/978-3-540-27810-8\_39},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AsanoKTT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AvidorL04,
author = {Adi Avidor and
Michael Langberg},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {The Multi-multiway Cut Problem},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {273--284},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_24},
doi = {10.1007/978-3-540-27810-8\_24},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AvidorL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AzarT04,
author = {Yossi Azar and
Shai Taub},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {All-Norm Approximation for Scheduling on Identical Machines},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {298--310},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_26},
doi = {10.1007/978-3-540-27810-8\_26},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AzarT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BeinELN04,
author = {Wolfgang W. Bein and
Leah Epstein and
Lawrence L. Larmore and
John Noga},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Optimally Competitive List Batching},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {77--89},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_8},
doi = {10.1007/978-3-540-27810-8\_8},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BeinELN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BergCGKOV04,
author = {Mark de Berg and
Sergio Cabello and
Panos Giannopoulos and
Christian Knauer and
Ren{\'{e}} van Oostrum and
Remco C. Veltkamp},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Maximizing the Area of Overlap of Two Unions of Disks Under Rigid
Motion},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {138--149},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_13},
doi = {10.1007/978-3-540-27810-8\_13},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BergCGKOV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BermanDK04,
author = {Piotr Berman and
Bhaskar DasGupta and
Ming{-}Yang Kao},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Tight Approximability Results for Test Set Problems in Bioinformatics},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {39--50},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_5},
doi = {10.1007/978-3-540-27810-8\_5},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BermanDK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoyarM04,
author = {Joan Boyar and
Paul Medvedev},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {The Relative Worst Order Ratio Applied to Seat Reservation},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {90--101},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_9},
doi = {10.1007/978-3-540-27810-8\_9},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoyarM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Brodal04,
author = {Gerth St{\o}lting Brodal},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Cache-Oblivious Algorithms and Data Structures},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {3--13},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_2},
doi = {10.1007/978-3-540-27810-8\_2},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Brodal04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BrodalFMZ04,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Ulrich Meyer and
Norbert Zeh},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First
Search and Shortest Paths},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {480--492},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_41},
doi = {10.1007/978-3-540-27810-8\_41},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BrodalFMZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CarmiK04,
author = {Paz Carmi and
Matthew J. Katz},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Power Assignment in Radio Networks with Two Power Levels},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {431--441},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_37},
doi = {10.1007/978-3-540-27810-8\_37},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/CarmiK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ChanCCW04,
author = {Mee Yee Chan and
Danny Z. Chen and
Francis Y. L. Chin and
Cao An Wang},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Construction of the Nearest Neighbor Embracing Graph of a Point Set},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {150--160},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_14},
doi = {10.1007/978-3-540-27810-8\_14},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ChanCCW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ChlebikC04,
author = {Miroslav Chleb{\'{\i}}k and
Janka Chleb{\'{\i}}kov{\'{a}}},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized
Complexity},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {174--186},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_16},
doi = {10.1007/978-3-540-27810-8\_16},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ChlebikC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DessmarkLL04,
author = {Anders Dessmark and
Andrzej Lingas and
Eva{-}Marta Lundell},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Subexponential-Time Framework for Optimal Embeddings of Graphs in
Integer Lattices},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {248--259},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_22},
doi = {10.1007/978-3-540-27810-8\_22},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DessmarkLL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DraganYL04,
author = {Feodor F. Dragan and
Chenyu Yan and
Irina Lomonosov},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Collective Tree Spanners of Graphs},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {64--76},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_7},
doi = {10.1007/978-3-540-27810-8\_7},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DraganYL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DvorakKKP04,
author = {Zdenek Dvor{\'{a}}k and
Jan K{\'{a}}ra and
Daniel Kr{\'{a}}l and
Ondrej Pangr{\'{a}}c},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {An Algorithm for Cyclic Edge Connectivity of Cubic Graphs},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {236--247},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_21},
doi = {10.1007/978-3-540-27810-8\_21},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/DvorakKKP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Elmasry04,
author = {Amr Elmasry},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Layered Heaps},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {212--222},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_19},
doi = {10.1007/978-3-540-27810-8\_19},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Elmasry04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/EpsteinS04,
author = {Leah Epstein and
Rob van Stee},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Online Scheduling of Splittable Tasks in Peer-to-Peer Networks},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {408--419},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_35},
doi = {10.1007/978-3-540-27810-8\_35},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/EpsteinS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FleischerGZ04,
author = {Rudolf Fleischer and
Mordecai J. Golin and
Yan Zhang},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Online Maintenance of k-Medians and k-Covers on a Line},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {102--113},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_10},
doi = {10.1007/978-3-540-27810-8\_10},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/FleischerGZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GasieniecRX04,
author = {Leszek Gasieniec and
Tomasz Radzik and
Qin Xin},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {397--407},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_34},
doi = {10.1007/978-3-540-27810-8\_34},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GasieniecRX04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GattoGJPW04,
author = {Michael Gatto and
Bj{\"{o}}rn Glaus and
Riko Jacob and
Leon Peeters and
Peter Widmayer},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Railway Delay Management: Exploring Its Algorithmic Complexity},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {199--211},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_18},
doi = {10.1007/978-3-540-27810-8\_18},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GattoGJPW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HabibMP04,
author = {Michel Habib and
Fabien de Montgolfier and
Christophe Paul},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using
Order Extension},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {187--198},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_17},
doi = {10.1007/978-3-540-27810-8\_17},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HabibMP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HassinS04,
author = {Refael Hassin and
Danny Segev},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Robust Subgraphs for Trees and Paths},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {51--63},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_6},
doi = {10.1007/978-3-540-27810-8\_6},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HassinS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HoffmannST04,
author = {Michael Hoffmann and
Bettina Speckmann and
Csaba D. T{\'{o}}th},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Pointed Binary Encompassing Trees},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {442--454},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_38},
doi = {10.1007/978-3-540-27810-8\_38},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HoffmannST04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/IwamaMO04,
author = {Kazuo Iwama and
Shuichi Miyazaki and
Kazuya Okamoto},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {A (2-c(log N/N))-Approximation Algorithm for the Stable Marriage Problem},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {349--361},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_30},
doi = {10.1007/978-3-540-27810-8\_30},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/IwamaMO04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Jansen04,
author = {Klaus Jansen},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Approximation Algorithms for the General Max-min Resource Sharing
Problem: Faster and Simpler},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {311--322},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_27},
doi = {10.1007/978-3-540-27810-8\_27},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Jansen04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/JansenZ04,
author = {Klaus Jansen and
Guochuan Zhang},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Maximizing the Number of Packed Rectangles},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {362--371},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_31},
doi = {10.1007/978-3-540-27810-8\_31},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/JansenZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/JothiR04,
author = {Raja Jothi and
Balaji Raghavachari},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk
Network Design Problems},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {336--348},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_29},
doi = {10.1007/978-3-540-27810-8\_29},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/JothiR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KoltunW04,
author = {Vladlen Koltun and
Carola Wenk},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Matching Polyhedral Terrains Using Overlays of Envelopes},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {114--126},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_11},
doi = {10.1007/978-3-540-27810-8\_11},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KoltunW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Leiserson04,
author = {Charles E. Leiserson},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Design and Analysis of Dynamic Multithreaded Algorithms},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {1--2},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_1},
doi = {10.1007/978-3-540-27810-8\_1},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Leiserson04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/LimRX04,
author = {Andrew Lim and
Brian Rodrigues and
Zhou Xu},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Approximation Schemes for the Crane Scheduling Problem},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {323--335},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_28},
doi = {10.1007/978-3-540-27810-8\_28},
timestamp = {Thu, 01 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/LimRX04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/LimX04,
author = {Andrew Lim and
Zhou Xu},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {The Bottleneck Problem with Minimum Quantity Commitments},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {285--297},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_25},
doi = {10.1007/978-3-540-27810-8\_25},
timestamp = {Thu, 01 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/LimX04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/MakinoU04,
author = {Kazuhisa Makino and
Takeaki Uno},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {New Algorithms for Enumerating All Maximal Cliques},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {260--272},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_23},
doi = {10.1007/978-3-540-27810-8\_23},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/MakinoU04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Manzini04,
author = {Giovanni Manzini},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Two Space Saving Tricks for Linear Time {LCP} Array Computation},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {372--383},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_32},
doi = {10.1007/978-3-540-27810-8\_32},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Manzini04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/MendelsonTTZ04,
author = {Ran Mendelson and
Robert Endre Tarjan and
Mikkel Thorup and
Uri Zwick},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Melding Priority Queues},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {223--235},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_20},
doi = {10.1007/978-3-540-27810-8\_20},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/MendelsonTTZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/PruhsUW04,
author = {Kirk Pruhs and
Patchrawat Uthaisombut and
Gerhard J. Woeginger},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Getting the Best Response for Your Erg},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {14--25},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_3},
doi = {10.1007/978-3-540-27810-8\_3},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/PruhsUW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Sibeyn04,
author = {Jop F. Sibeyn},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {External Connected Components},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {468--479},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_40},
doi = {10.1007/978-3-540-27810-8\_40},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Sibeyn04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Thorup04,
author = {Mikkel Thorup},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative
Cycles},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {384--396},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_33},
doi = {10.1007/978-3-540-27810-8\_33},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Thorup04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Uthaisombut04,
author = {Patchrawat Uthaisombut},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {The Optimal Online Algorithms for Minimizing Maximum Lateness},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {420--430},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_36},
doi = {10.1007/978-3-540-27810-8\_36},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Uthaisombut04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Zeh04,
author = {Norbert Zeh},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Connectivity of Graphs Under Edge Flips},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {161--173},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_15},
doi = {10.1007/978-3-540-27810-8\_15},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Zeh04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/2004,
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/b98413},
doi = {10.1007/B98413},
isbn = {3-540-22339-8},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/2004.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AgnarssonDH02,
author = {Geir Agnarsson and
Peter Damaschke and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Powers of Geometric Intersection Graphs and Dispersion Algorithms},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {140--149},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_15},
doi = {10.1007/3-540-45471-3\_15},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/AgnarssonDH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AlberFN02,
author = {Jochen Alber and
Michael R. Fellows and
Rolf Niedermeier},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Efficient Data Reduction for {DOMINATING} {SET:} {A} Linear Problem
Kernel for the Planar Case},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {150--159},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_16},
doi = {10.1007/3-540-45471-3\_16},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AlberFN02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AlbertA02,
author = {Michael H. Albert and
Mike D. Atkinson},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Sorting with a Forklift},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {368--377},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_38},
doi = {10.1007/3-540-45471-3\_38},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AlbertA02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AlstrupBGR02,
author = {Stephen Alstrup and
Gerth St{\o}lting Brodal and
Inge Li G{\o}rtz and
Theis Rauhe},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Time and Space Efficient Multi-method Dispatching},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {20--29},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_3},
doi = {10.1007/3-540-45471-3\_3},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AlstrupBGR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AnandEHS02,
author = {R. Sai Anand and
Thomas Erlebach and
Alexander Hall and
Stamatis Stefanakos},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Call Control with k Rejections},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {308--317},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_32},
doi = {10.1007/3-540-45471-3\_32},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AnandEHS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ArkinHRS02,
author = {Esther M. Arkin and
Refael Hassin and
Shlomi Rubinstein and
Maxim Sviridenko},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Approximations for Maximum Transportation Problem with Permutable
Supply Vector and Other Capacitated Star Packing Problems},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {280--287},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_29},
doi = {10.1007/3-540-45471-3\_29},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ArkinHRS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AugustineS02,
author = {John E. Augustine and
Steven S. Seiden},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Linear Time Approximation Schemes for Vehicle Scheduling},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {30--39},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_4},
doi = {10.1007/3-540-45471-3\_4},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AugustineS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AzarERW02,
author = {Yossi Azar and
Leah Epstein and
Yossi Richter and
Gerhard J. Woeginger},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {All-Norm Approximation Algorithms},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {288--297},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_30},
doi = {10.1007/3-540-45471-3\_30},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AzarERW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BazganVK02,
author = {Cristina Bazgan and
Wenceslas Fernandez de la Vega and
Marek Karpinski},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Approximability of Dense Instances of {NEAREST} {CODEWORD} Problem},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {298--307},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_31},
doi = {10.1007/3-540-45471-3\_31},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BazganVK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BodlaenderF02,
author = {Hans L. Bodlaender and
Fedor V. Fomin},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Tree Decompositions with Small Cost},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {378--387},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_39},
doi = {10.1007/3-540-45471-3\_39},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BodlaenderF02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BodlaenderR02,
author = {Hans L. Bodlaender and
Udi Rotics},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {388--397},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_40},
doi = {10.1007/3-540-45471-3\_40},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BodlaenderR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BroersmaFKW02,
author = {Hajo Broersma and
Fedor V. Fomin and
Jan Kratochv{\'{\i}}l and
Gerhard J. Woeginger},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths
Are Dangerous},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {160--169},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_17},
doi = {10.1007/3-540-45471-3\_17},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BroersmaFKW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ChlebikC02,
author = {Miroslav Chleb{\'{\i}}k and
Janka Chleb{\'{\i}}kov{\'{a}}},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Approximation Hardness of the Steiner Tree Problem on Graphs},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {170--179},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_18},
doi = {10.1007/3-540-45471-3\_18},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ChlebikC02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DemaineLM02,
author = {Erik D. Demaine and
Alejandro L{\'{o}}pez{-}Ortiz and
J. Ian Munro},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Robot Localization without Depth Perception},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {249--259},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_26},
doi = {10.1007/3-540-45471-3\_26},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DemaineLM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Eidenbenz02,
author = {Stephan J. Eidenbenz},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Optimum Inapproximability Results for Finding Minimum Hidden Guard
Sets in Polygons and Terrains},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {60--68},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_7},
doi = {10.1007/3-540-45471-3\_7},
timestamp = {Wed, 11 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Eidenbenz02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/EllisFF02,
author = {John A. Ellis and
Hongbing Fan and
Michael R. Fellows},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {The Dominating Set Problem Is Fixed Parameter Tractable for Graphs
of Bounded Genus},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {180--189},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_19},
doi = {10.1007/3-540-45471-3\_19},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/EllisFF02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/EvenKS02,
author = {Guy Even and
Guy Kortsarz and
Wolfgang Slany},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {On Network Design Problems: Fixed Cost Flows and the Covering Steiner
Problem},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {318--327},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_33},
doi = {10.1007/3-540-45471-3\_33},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/EvenKS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FrederiksenL02,
author = {Jens S. Frederiksen and
Kim S. Larsen},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Packet Bundling},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {328--337},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_34},
doi = {10.1007/3-540-45471-3\_34},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/FrederiksenL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GabowP02,
author = {Harold N. Gabow and
Seth Pettie},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type
Approximation Algorithms},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {190--199},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_20},
doi = {10.1007/3-540-45471-3\_20},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GabowP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GolynskiH02,
author = {Alexander Golynski and
Joseph Douglas Horton},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular
Matroid},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {200--209},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_21},
doi = {10.1007/3-540-45471-3\_21},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GolynskiH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GoswamiDN02,
author = {Partha P. Goswami and
Sandip Das and
Subhas C. Nandy},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Simplex Range Searching and k Nearest Neighbors of a Line Segment
in 2D},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {69--79},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_8},
doi = {10.1007/3-540-45471-3\_8},
timestamp = {Sun, 24 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GoswamiDN02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HagerupR02,
author = {Torben Hagerup and
Rajeev Raman},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {An Efficient Quasidictionary},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {1--18},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_1},
doi = {10.1007/3-540-45471-3\_1},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/HagerupR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HepnerS02,
author = {Clint Hepner and
Clifford Stein},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Minimizing Makespan for the Lazy Bureaucrat Problem},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {40--50},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_5},
doi = {10.1007/3-540-45471-3\_5},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HepnerS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Karkkainen02,
author = {Juha K{\"{a}}rkk{\"{a}}inen},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Computing the Threshold for q-Gram Filters},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {348--357},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_36},
doi = {10.1007/3-540-45471-3\_36},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Karkkainen02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KatajainenM02,
author = {Jyrki Katajainen and
Jeppe Nejsum Madsen},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Performance Tuning an Algorithm for Compressing Relational Tables},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {398--407},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_41},
doi = {10.1007/3-540-45471-3\_41},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KatajainenM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KatajainenP02,
author = {Jyrki Katajainen and
Tomi Pasanen},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {A Randomized In-Place Algorithm for Positioning the kth Element in
a Multiset},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {408--417},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_42},
doi = {10.1007/3-540-45471-3\_42},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KatajainenP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KonemannLPS02,
author = {Jochen K{\"{o}}nemann and
Yanjun Li and
Ojas Parekh and
Amitabh Sinha},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Approximation Algorithms for Edge-Dilation k-Center Problems},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {210--219},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_22},
doi = {10.1007/3-540-45471-3\_22},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KonemannLPS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Lai02,
author = {Tony W. Lai},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Paging on a {RAM} with Limited Resources},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {418--427},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_43},
doi = {10.1007/3-540-45471-3\_43},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Lai02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Lev-TovP02,
author = {Nissan Lev{-}Tov and
David Peleg},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Exact Algorithms and Approximation Schemes for Base Station Placement
Problems},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {90--99},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_10},
doi = {10.1007/3-540-45471-3\_10},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Lev-TovP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/LevcopoulosLM02,
author = {Christos Levcopoulos and
Andrzej Lingas and
Joseph S. B. Mitchell},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Adaptive Algorithms for Constructing Convex Hulls and Triangulations
of Polygonal Chains},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {80--89},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_9},
doi = {10.1007/3-540-45471-3\_9},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/LevcopoulosLM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Lopez-OrtizS02,
author = {Alejandro L{\'{o}}pez{-}Ortiz and
Sven Schuierer},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Online Parallel Heuristics and Robot Searching under the Competitive
Framework},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {260--269},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_27},
doi = {10.1007/3-540-45471-3\_27},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Lopez-OrtizS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Mannila02,
author = {Heikki Mannila},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Combining Pattern Discovery and Probabilistic Modeling in Data Mining},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {19},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_2},
doi = {10.1007/3-540-45471-3\_2},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Mannila02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Mastrolilli02,
author = {Monaldo Mastrolilli},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {A {PTAS} for the Single Machine Scheduling Problem with Controllable
Processing Times},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {51--59},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_6},
doi = {10.1007/3-540-45471-3\_6},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Mastrolilli02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/PaluPR02,
author = {Alessandro Dal Pal{\`{u}} and
Enrico Pontelli and
Desh Ranjan},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {An Optimal Algorithm for Finding {NCA} on Pure Pointer Machines},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {428--438},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_44},
doi = {10.1007/3-540-45471-3\_44},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/PaluPR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/PeerSS02,
author = {Itsik Pe'er and
Ron Shamir and
Roded Sharan},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {On the Generality of Phylogenies from Incomplete Directed Characters},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {358--367},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_37},
doi = {10.1007/3-540-45471-3\_37},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/PeerSS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/PuriT02,
author = {Anuj Puri and
Stavros Tripakis},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Algorithms for the Multi-constrained Routing Problem},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {338--347},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_35},
doi = {10.1007/3-540-45471-3\_35},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/PuriT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/QinZ02,
author = {Zhongping Qin and
Binhai Zhu},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {A Factor-2 Approximation for Labeling Points with Maximum Sliding
Labels},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {100--109},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_11},
doi = {10.1007/3-540-45471-3\_11},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/QinZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Ramnath02,
author = {Sarnath Ramnath},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead
Speeds Up a Static Clustering Algorithm},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {220--229},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_23},
doi = {10.1007/3-540-45471-3\_23},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Ramnath02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/RoyGDN02,
author = {Sasanka Roy and
Partha P. Goswami and
Sandip Das and
Subhas C. Nandy},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Optimal Algorithm for a Special Point-Labeling Problem},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {110--120},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_12},
doi = {10.1007/3-540-45471-3\_12},
timestamp = {Sun, 24 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/RoyGDN02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/SandersV02,
author = {Peter Sanders and
Berthold V{\"{o}}cking},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Random Arc Allocation and Applications},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {121--130},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_13},
doi = {10.1007/3-540-45471-3\_13},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/SandersV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ShamirT02,
author = {Ron Shamir and
Dekel Tsur},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Improved Algorithms for the Random Cluster Graph Model},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {230--239},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_24},
doi = {10.1007/3-540-45471-3\_24},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ShamirT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/SharirS02,
author = {Micha Sharir and
Shakhar Smorodinsky},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {On Neighbors in Geometric Permutations},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {131--139},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_14},
doi = {10.1007/3-540-45471-3\_14},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/SharirS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Skulrattanakulchai02,
author = {San Skulrattanakulchai},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Delta-List Vertex Coloring in Linear Time},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {240--248},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_25},
doi = {10.1007/3-540-45471-3\_25},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Skulrattanakulchai02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Soisalon-SoininenW02,
author = {Eljas Soisalon{-}Soininen and
Peter Widmayer},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Amortized Complexity of Bulk Updates in AVL-Trees},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {439--448},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_45},
doi = {10.1007/3-540-45471-3\_45},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Soisalon-SoininenW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/SztainbergABM02,
author = {Marcelo O. Sztainberg and
Esther M. Arkin and
Michael A. Bender and
Joseph S. B. Mitchell},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Analysis of Heuristics for the Freeze-Tag Problem},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {270--279},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_28},
doi = {10.1007/3-540-45471-3\_28},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/SztainbergABM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/2002,
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3},
doi = {10.1007/3-540-45471-3},
isbn = {3-540-43866-1},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/2002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AgarwalGHRS00,
author = {Pankaj K. Agarwal and
Leonidas J. Guibas and
Sariel Har{-}Peled and
Alexander Rabinovitch and
Micha Sharir},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Computing the Penetration Depth of Two Convex Polytopes in 3D},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {328--338},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_29},
doi = {10.1007/3-540-44985-X\_29},
timestamp = {Fri, 27 Mar 2020 08:50:36 +0100},
biburl = {https://dblp.org/rec/conf/swat/AgarwalGHRS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AhalR00,
author = {Shlomo Ahal and
Yuri Rabinovich},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {On the Complexity of the Sub-permutation Problem},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {490--503},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_41},
doi = {10.1007/3-540-44985-X\_41},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AhalR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AlberBFN00,
author = {Jochen Alber and
Hans L. Bodlaender and
Henning Fernau and
Rolf Niedermeier},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Fixed Parameter Algorithms for {PLANAR} {DOMINATING} {SET} and Related
Problems},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {97--110},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_10},
doi = {10.1007/3-540-44985-X\_10},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AlberBFN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AleksandrovD00,
author = {Lyudmil Aleksandrov and
Hristo N. Djidjev},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {A Dynamic Algorithm for Maintaining Graph Partitions},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {71--82},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_8},
doi = {10.1007/3-540-44985-X\_8},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AleksandrovD00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AlstrupHT00,
author = {Stephen Alstrup and
Jacob Holm and
Mikkel Thorup},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Maintaining Center and Median in Dynamic Trees},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {46--56},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_6},
doi = {10.1007/3-540-44985-X\_6},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AlstrupHT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ArataIMF00,
author = {Kouji Arata and
Satoru Iwata and
Kazuhisa Makino and
Satoru Fujishige},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Locating Sources to Meet Flow Demands in Undirected Networks},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {300--313},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_27},
doi = {10.1007/3-540-44985-X\_27},
timestamp = {Wed, 16 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ArataIMF00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Arge00,
author = {Lars Arge and
Jakob Pagter},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {I/O-Space Trade-Offs},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {448--461},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_38},
doi = {10.1007/3-540-44985-X\_38},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Arge00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ArgeBT00,
author = {Lars Arge and
Gerth St{\o}lting Brodal and
Laura Toma},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {On External-Memory MST, SSSP, and Multi-way Planar Graph Separation},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {433--447},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_37},
doi = {10.1007/3-540-44985-X\_37},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ArgeBT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AryaCMR00,
author = {Sunil Arya and
Siu{-}Wing Cheng and
David M. Mount and
Ramesh Hariharan},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Efficient Expected-Case Algorithms for Planar Point Location},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {353--366},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_31},
doi = {10.1007/3-540-44985-X\_31},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AryaCMR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AsanoMT00,
author = {Tetsuo Asano and
Tomomi Matsui and
Takeshi Tokuyama},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {On the Complexities of the Optimal Rounding Problems of Sequences
and Matrices},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {476--489},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_40},
doi = {10.1007/3-540-44985-X\_40},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AsanoMT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AzarBFLN00,
author = {Yossi Azar and
Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen and
Morten N. Nielsen},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Fair versus Unrestricted Bin Packing},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {200--213},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_18},
doi = {10.1007/3-540-44985-X\_18},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AzarBFLN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AzarE00,
author = {Yossi Azar and
Leah Epstein},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {On-Line Scheduling with Precedence Constraints},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {164--174},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_15},
doi = {10.1007/3-540-44985-X\_15},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AzarE00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AzarES00,
author = {Yossi Azar and
Leah Epstein and
Rob van Stee},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Resource Augmentation in Load Balancing},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {189--199},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_17},
doi = {10.1007/3-540-44985-X\_17},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AzarES00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BenderSS00,
author = {Michael A. Bender and
Saurabh Sethia and
Steven Skiena},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Data Structures for Maintaining Set Partitions},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {83--96},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_9},
doi = {10.1007/3-540-44985-X\_9},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BenderSS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Berman00,
author = {Piotr Berman},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {A \emph{d}/2 Approximation for Maximum Weight Independent Set in \emph{d}-Claw
Free Graphs},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {214--219},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_19},
doi = {10.1007/3-540-44985-X\_19},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Berman00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BerryBH00,
author = {Anne Berry and
Jean Paul Bordat and
Pinar Heggernes},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Recognizing Weakly Triangulated Graphs by Edge Separability},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {139--149},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_13},
doi = {10.1007/3-540-44985-X\_13},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BerryBH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Bjorklund00,
author = {Andreas Bj{\"{o}}rklund},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Optimal Adaptive Fault Diagnosis of Hypercubes},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {527--534},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_44},
doi = {10.1007/3-540-44985-X\_44},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Bjorklund00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BrodalJ00,
author = {Gerth St{\o}lting Brodal and
Riko Jacob},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Dynamic Planar Convex Hull with Optimal Query Time},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {57--70},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_7},
doi = {10.1007/3-540-44985-X\_7},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BrodalJ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CicaleseVM00,
author = {Ferdinando Cicalese and
Ugo Vaccaro and
Daniele Mundici},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Least Adaptive Optimal Search with Unreliable Tests},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {549--562},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_46},
doi = {10.1007/3-540-44985-X\_46},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/CicaleseVM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Damaschke00,
author = {Peter Damaschke},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Parallel Attribute-Efficient Learning of Monotone Boolean Functions},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {504--512},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_42},
doi = {10.1007/3-540-44985-X\_42},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Damaschke00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DinitzN00,
author = {Yefim Dinitz and
Ronit Nossenson},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {272--285},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_25},
doi = {10.1007/3-540-44985-X\_25},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DinitzN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DoddiMRTW00,
author = {Srinivas Doddi and
Madhav V. Marathe and
S. S. Ravi and
David Scot Taylor and
Peter Widmayer},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Approximation Algorithms for Clustering to Minimize the Sum of Diameters},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {237--250},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_22},
doi = {10.1007/3-540-44985-X\_22},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DoddiMRTW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Feige00,
author = {Uriel Feige},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Coping with the NP-Hardness of the Graph Bandwidth Problem},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {10--19},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_2},
doi = {10.1007/3-540-44985-X\_2},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/Feige00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GudmundssonLN00,
author = {Joachim Gudmundsson and
Christos Levcopoulos and
Giri Narasimhan},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Improved Greedy Algorithms for Constructing Sparse Geometric Spanners},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {314--327},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_28},
doi = {10.1007/3-540-44985-X\_28},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GudmundssonLN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GuibasSZ00,
author = {Leonidas J. Guibas and
Jack Snoeyink and
Li Zhang},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Compact Voronoi Diagrams for Moving Convex Polygons},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {339--352},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_30},
doi = {10.1007/3-540-44985-X\_30},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GuibasSZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GuptaNPR00,
author = {Arvind Gupta and
Naomi Nishimura and
Andrzej Proskurowski and
Prabhakar Ragde},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Embeddings of \emph{k}-Connected Graphs of Pathwidth \emph{k}},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {111--124},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_11},
doi = {10.1007/3-540-44985-X\_11},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GuptaNPR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HassinR00,
author = {Refael Hassin and
Shlomi Rubinstein},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Approximation Algorithms for Maximum Linear Arrangement},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {231--236},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_21},
doi = {10.1007/3-540-44985-X\_21},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HassinR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HassinR00a,
author = {Refael Hassin and
Shlomi Rubinstein},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Robust Matchings and Maximum Clustering},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {251--258},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_23},
doi = {10.1007/3-540-44985-X\_23},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HassinR00a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Iacono00,
author = {John Iacono},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Improved Upper Bounds for Pairing Heaps},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {32--45},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_5},
doi = {10.1007/3-540-44985-X\_5},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/Iacono00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/IrvingMS00,
author = {Robert W. Irving and
David F. Manlove and
Sandy Scott},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {The Hospitals/Residents Problem with Ties},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {259--271},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_24},
doi = {10.1007/3-540-44985-X\_24},
timestamp = {Tue, 13 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/IrvingMS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/IshiiN00,
author = {Toshimasa Ishii and
Hiroshi Nagamochi},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {On the Minimum Augmentation of an \emph{l}-Connected Graph to a \emph{k}-Connected
Graph},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {286--299},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_26},
doi = {10.1007/3-540-44985-X\_26},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/IshiiN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KalyanasundaramNPW00,
author = {Bala Kalyanasundaram and
John Noga and
Kirk Pruhs and
Gerhard J. Woeginger},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Caching for Web Searching},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {150--163},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_14},
doi = {10.1007/3-540-44985-X\_14},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KalyanasundaramNPW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KaoSS00,
author = {Ming{-}Yang Kao and
Jared Samet and
Wing{-}Kin Sung},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {The Enhanced Double Digest Problem for {DNA} Physical Mapping},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {383--392},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_33},
doi = {10.1007/3-540-44985-X\_33},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KaoSS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Liberatore00,
author = {Vincenzo Liberatore},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Scheduling Jobs Before Shut-Down},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {175--188},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_16},
doi = {10.1007/3-540-44985-X\_16},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Liberatore00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/MakinoYK00,
author = {Kazuhisa Makino and
Masafumi Yamashita and
Tiko Kameda},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Max- and Min-Neighborhood Monopolies},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {513--526},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_43},
doi = {10.1007/3-540-44985-X\_43},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/MakinoYK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/NishimuraRT00,
author = {Naomi Nishimura and
Prabhakar Ragde and
Dimitrios M. Thilikos},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {On Graph Powers for Leaf-Labeled Trees},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {125--138},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_12},
doi = {10.1007/3-540-44985-X\_12},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/NishimuraRT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Pagh00,
author = {Rasmus Pagh},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {A New Trade-Off for Deterministic Dictionaries},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {22--31},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_4},
doi = {10.1007/3-540-44985-X\_4},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Pagh00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Palios00,
author = {Leonidas Palios},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {A New Competitive Strategy for Reaching the Kernel of an Unknown Polygon},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {367--382},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_32},
doi = {10.1007/3-540-44985-X\_32},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Palios00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Peleg00,
author = {David Peleg},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Approximation Algorithms for the Label-Cover\({}_{\mbox{MAX}}\) and
Red-Blue Set Cover Problems},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {220--230},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_20},
doi = {10.1007/3-540-44985-X\_20},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Peleg00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Rick00,
author = {Claus Rick},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Efficient Computation of All Longest Common Subsequences},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {407--418},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_35},
doi = {10.1007/3-540-44985-X\_35},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Rick00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Shibuya00,
author = {Tetsuo Shibuya},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Generalization of a Suffix Tree for {RNA} Structural Pattern Matching},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {393--406},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_34},
doi = {10.1007/3-540-44985-X\_34},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Shibuya00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Stachowiak00,
author = {Grzegorz Stachowiak},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Fibonacci Correction Networks},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {535--548},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_45},
doi = {10.1007/3-540-44985-X\_45},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Stachowiak00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/SuriSW00,
author = {Subhash Suri and
Tuomas Sandholm and
Priyank Ramesh Warkhede},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Optimal Flow Aggregation},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {462--475},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_39},
doi = {10.1007/3-540-44985-X\_39},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/SuriSW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Thorup00,
author = {Mikkel Thorup and
David R. Karger},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Dynamic Graph Algorithms with Applications},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {1--9},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_1},
doi = {10.1007/3-540-44985-X\_1},
timestamp = {Fri, 27 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Thorup00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Ukkonen00,
author = {Esko Ukkonen},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Toward Complete Genome Data Mining in Computational Biology},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {20--21},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_3},
doi = {10.1007/3-540-44985-X\_3},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Ukkonen00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/VenkataramanSM00,
author = {Gayathri Venkataraman and
Sartaj Sahni and
Srabani Mukhopadhyaya},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {A Blocked All-Pairs Shortest-Path Algorithm},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {419--432},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_36},
doi = {10.1007/3-540-44985-X\_36},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/VenkataramanSM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/2000,
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X},
doi = {10.1007/3-540-44985-X},
isbn = {3-540-67690-2},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/2000.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AleksandrovLMS98,
author = {Lyudmil Aleksandrov and
Mark Lanthier and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {An epsilon-Approximation for Weighted Shortest Paths on Polyhedral
Surfaces},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {11--22},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054351},
doi = {10.1007/BFB0054351},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AleksandrovLMS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AronovEHS98,
author = {Boris Aronov and
Alon Efrat and
Dan Halperin and
Micha Sharir},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {On the Number of Regular Vertices of the Union of Jordan Regions},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {322--334},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054379},
doi = {10.1007/BFB0054379},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AronovEHS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AspvallHM98,
author = {Bengt Aspvall and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Fredrik Manne},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Approximations for the General Block Distribution of a Matrix},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {47--58},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054354},
doi = {10.1007/BFB0054354},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/AspvallHM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AspvallPT98,
author = {Bengt Aspvall and
Andrzej Proskurowski and
Jan Arne Telle},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Memory Requirements for Table Computations in Partial k-tree Algorithms},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {222--233},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054370},
doi = {10.1007/BFB0054370},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AspvallPT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BarrettJM98,
author = {Christopher L. Barrett and
Riko Jacob and
Madhav V. Marathe},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Formal Language Constrained Path Problems},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {234--245},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054371},
doi = {10.1007/BFB0054371},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BarrettJM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BergKOSV98,
author = {Mark de Berg and
Matthew J. Katz and
Mark H. Overmars and
A. Frank van der Stappen and
Jules Vleugels},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Models and Motion Planning},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {83--94},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054357},
doi = {10.1007/BFB0054357},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BergKOSV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BermanC98,
author = {Piotr Berman and
Chris Coulston},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Speed is More Powerful than Claivoyance},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {255--263},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054373},
doi = {10.1007/BFB0054373},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BermanC98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BhatiaGKS98,
author = {Randeep Bhatia and
Sudipto Guha and
Samir Khuller and
Yoram J. Sussmann},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Facility Location with Dynamic Distance Function (Extended Abstract)},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {23--34},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054352},
doi = {10.1007/BFB0054352},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BhatiaGKS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BrodalK98,
author = {Gerth St{\o}lting Brodal and
Jyrki Katajainen},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Worst-Case External-Memory Priority Queues},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {107--118},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054359},
doi = {10.1007/BFB0054359},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BrodalK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BrodalP98,
author = {Gerth St{\o}lting Brodal and
Maria Cristina Pinotti},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Comparator Networks for Binary Heap Construction},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {158--168},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054364},
doi = {10.1007/BFB0054364},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BrodalP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ChenX98,
author = {Danny Z. Chen and
Jinhui Xu},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Two-Variable Linear Programming in Parallel},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {169--180},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054365},
doi = {10.1007/BFB0054365},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ChenX98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Dahlhaus98,
author = {Elias Dahlhaus},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Minimal Elimination of Planar Graphs},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {210--221},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054369},
doi = {10.1007/BFB0054369},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Dahlhaus98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Goldberg98,
author = {Andrew V. Goldberg},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Recent Developments in Maximum Flow Algorithms (Invited Lecture)},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {1--10},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054350},
doi = {10.1007/BFB0054350},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Goldberg98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GrafV98,
author = {Thorsten Graf and
Kamakoti Veezhinathan},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {An Optimal Algorithm for Computing Vissible Nearest Foreign Neighbors
Among Colored Line Segments},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {59--70},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054355},
doi = {10.1007/BFB0054355},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GrafV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GrossiPP98,
author = {Roberto Grossi and
Andrea Pietracaprina and
Geppino Pucci},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Optimal Deterministic Protocols for Mobile Robots on a Grid},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {181--192},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054366},
doi = {10.1007/BFB0054366},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/GrossiPP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Hastad98,
author = {Johan H{\aa}stad},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Some Recent Strong Inapproximability Results},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {205--209},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054368},
doi = {10.1007/BFB0054368},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Hastad98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Hirsch98,
author = {Edward A. Hirsch},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Local Search Algorithms for {SAT:} Worst-Case Analysis},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {246--254},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054372},
doi = {10.1007/BFB0054372},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Hirsch98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HoffmannIKK98,
author = {Frank Hoffmann and
Christian Icking and
Rolf Klein and
Klaus Kriegel},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Moving an Angle Around a Region},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {71--82},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054356},
doi = {10.1007/BFB0054356},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HoffmannIKK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Jansen98,
author = {Klaus Jansen},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {An Approximation Scheme for Bin Packing with Conflicts},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {35--46},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054353},
doi = {10.1007/BFB0054353},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Jansen98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KaplanOT98,
author = {Haim Kaplan and
Chris Okasaki and
Robert Endre Tarjan},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Simple Confluently Persistent Catenable Lists (Extended Abstract)},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {119--130},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054360},
doi = {10.1007/BFB0054360},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KaplanOT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KatzKS98,
author = {Matthew J. Katz and
Klara Kedem and
Michael Segal},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Constrained Square-Center Problems},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {95--106},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054358},
doi = {10.1007/BFB0054358},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/KatzKS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/MahajanV98,
author = {Meena Mahajan and
V. Vinay},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Determinant: Old Algorithms, New Insights (Extended Abstract)},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {276--287},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054375},
doi = {10.1007/BFB0054375},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/MahajanV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/MarcoGV98,
author = {Gianluca De Marco and
Luisa Gargano and
Ugo Vaccaro},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Concurrent Multicast in Weighted Networks},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {193--204},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054367},
doi = {10.1007/BFB0054367},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/MarcoGV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/RamanR98,
author = {Venkatesh Raman and
Sarnath Ramnath},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Improved Upper Bounds for Time-Space Tradeoffs for Selection with
Limited Storage},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {131--142},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054361},
doi = {10.1007/BFB0054361},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/RamanR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Seiden98,
author = {Steven S. Seiden},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Randomized Online Multi-threaded Paging},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {264--275},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054374},
doi = {10.1007/BFB0054374},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Seiden98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/SenG98,
author = {Sandeep Sen and
Neelima Gupta},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Distribution-Sensitive Algorithms},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {335--346},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054380},
doi = {10.1007/BFB0054380},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/SenG98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Sibeyn98,
author = {Jop F. Sibeyn},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Solving Fundamental Problems on Sparse-Meshes},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {288--299},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054376},
doi = {10.1007/BFB0054376},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Sibeyn98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Sleumer98,
author = {Nora Sleumer},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Output-Sensitive Cell Enumeration in Hyperplane Arrangements},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {300--309},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054377},
doi = {10.1007/BFB0054377},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Sleumer98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/SridharRR98,
author = {Sridhar Ramachandran and
K. Rajasekar and
C. Pandu Rangan},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Probabilistic Data Structures for Priority Queues (Extended Abstract)},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {143--154},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054362},
doi = {10.1007/BFB0054362},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/SridharRR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Will98,
author = {Hans{-}Martin Will},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Fast and Efficient Computation of Additively Weighted Voronoi Cells
for Applications in Molecular Biology},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {310--321},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054378},
doi = {10.1007/BFB0054378},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Will98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Zuckerman98,
author = {David Zuckerman},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Extractors for Weak Random Sources and Their Applications},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {155--157},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054363},
doi = {10.1007/BFB0054363},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Zuckerman98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/1998,
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054349},
doi = {10.1007/BFB0054349},
isbn = {3-540-64682-5},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/1998.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Alon96,
author = {Noga Alon},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Derandomization Via Small Sample Spaces (Abstract)},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {1--3},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_115},
doi = {10.1007/3-540-61422-2\_115},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/Alon96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AlstrupT96,
author = {Stephen Alstrup and
Mikkel Thorup},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Optimal Pointer Algorithms for Finding Nearest Common Ancestors in
Dynamic Trees},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {212--222},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_133},
doi = {10.1007/3-540-61422-2\_133},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AlstrupT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Andersson96,
author = {Arne Andersson},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Sorting and Searching Revisted},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {185--197},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_131},
doi = {10.1007/3-540-61422-2\_131},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Andersson96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AronovDDPP96,
author = {Boris Aronov and
Alan R. Davis and
Tamal K. Dey and
Sudebkumar Prasant Pal and
D. Chithra Prasad},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Visibility with Multiple Reflections},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {284--295},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_139},
doi = {10.1007/3-540-61422-2\_139},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AronovDDPP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AsahiroITT96,
author = {Yuichi Asahiro and
Kazuo Iwama and
Hisao Tamaki and
Takeshi Tokuyama},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Greedily Finding a Dense Subgraph},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {136--148},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_127},
doi = {10.1007/3-540-61422-2\_127},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AsahiroITT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AsanoOH96,
author = {Takao Asano and
Takao Ono and
Tomio Hirata},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Approximation Algorithms for the Maximum Satisfiability Problem},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {100--111},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_124},
doi = {10.1007/3-540-61422-2\_124},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AsanoOH96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AulettaMPP96,
author = {Vincenzo Auletta and
Angelo Monti and
Domenico Parente and
Giuseppe Persiano},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {259--270},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_137},
doi = {10.1007/3-540-61422-2\_137},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AulettaMPP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AzarE96,
author = {Yossi Azar and
Leah Epstein},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {On Two Dimensional Packing},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {321--332},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_142},
doi = {10.1007/3-540-61422-2\_142},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AzarE96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BaumkerDP96,
author = {Armin B{\"{a}}umker and
Wolfgang Dittrich and
Andrea Pietracaprina},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {The Deterministic Complexity of Parallel Multisearch (Extended Abstract)},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {404--415},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_149},
doi = {10.1007/3-540-61422-2\_149},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BaumkerDP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Biedl96,
author = {Therese C. Biedl},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Optimal Orthogonal Drawings of Triconnected Plane Graphs},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {333--344},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_143},
doi = {10.1007/3-540-61422-2\_143},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Biedl96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BlairHT96,
author = {Jean R. S. Blair and
Pinar Heggernes and
Jan Arne Telle},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Making an Arbitrary Filled Graph Minimal by Removing Fill Edges},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {173--184},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_130},
doi = {10.1007/3-540-61422-2\_130},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BlairHT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BorosIM96,
author = {Endre Boros and
Toshihide Ibaraki and
Kazuhisa Makino},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Boolean Analysis of Incomplete Examples},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {440--451},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_152},
doi = {10.1007/3-540-61422-2\_152},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BorosIM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Brodal96,
author = {Gerth St{\o}lting Brodal},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Priority Queues on Parallel Machines},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {416--427},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_150},
doi = {10.1007/3-540-61422-2\_150},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Brodal96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BrodalCR96,
author = {Gerth St{\o}lting Brodal and
Shiva Chaudhuri and
Jaikumar Radhakrishnan},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {The Randomized Complexity of Maintaining the Minimum},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {4--15},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_116},
doi = {10.1007/3-540-61422-2\_116},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BrodalCR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BrodnikM96,
author = {Andrej Brodnik and
J. Ian Munro},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Neighbours on a Grid},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {309--320},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_141},
doi = {10.1007/3-540-61422-2\_141},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BrodnikM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ChandraH96,
author = {Barun Chandra and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Facility Dispersion and Remote Subgraphs},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {53--65},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_120},
doi = {10.1007/3-540-61422-2\_120},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ChandraH96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Fagerberg96,
author = {Rolf Fagerberg},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Binary Search Trees: How Low Can You Go?},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {428--439},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_151},
doi = {10.1007/3-540-61422-2\_151},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Fagerberg96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Fernandez-BacaSE96,
author = {David Fern{\'{a}}ndez{-}Baca and
Giora Slutzki and
David Eppstein},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Using Sparsification for Parametric Minimum Spanning Tree Problems},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {149--160},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_128},
doi = {10.1007/3-540-61422-2\_128},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Fernandez-BacaSE96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GarganoRV96,
author = {Luisa Gargano and
Adele A. Rescigno and
Ugo Vaccaro},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Communication Complexity of Gossiping by Packets},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {234--245},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_135},
doi = {10.1007/3-540-61422-2\_135},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GarganoRV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GasieniecKPR96,
author = {Leszek Gasieniec and
Marek Karpinski and
Wojciech Plandowski and
Wojciech Rytter},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract)},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {392--403},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_148},
doi = {10.1007/3-540-61422-2\_148},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GasieniecKPR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GonnetB96,
author = {Gaston H. Gonnet and
Steven A. Benner},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Probabilistic Ancestral Sequences and Multiple Alignments},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {380--391},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_147},
doi = {10.1007/3-540-61422-2\_147},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GonnetB96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GuptaKMS96,
author = {Arvind Gupta and
Damon Kaller and
Sanjeev Mahajan and
Thomas C. Shermer},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Vertex Partitioning Problems On Partial k-Trees},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {161--172},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_129},
doi = {10.1007/3-540-61422-2\_129},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GuptaKMS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HenzingerT96,
author = {Monika Rauch Henzinger and
Jan Arne Telle},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Faster Algorithms for the Nonemptiness of Streett Automata and for
Communication Protocol Pruning},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {16--27},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_117},
doi = {10.1007/3-540-61422-2\_117},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HenzingerT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HirataSS96,
author = {Kouichi Hirata and
Shinichi Shimozono and
Ayumi Shinohara},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {On the Hardness of Approximating the Minimum Consistent {OBDD} Problem},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {112--123},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_125},
doi = {10.1007/3-540-61422-2\_125},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HirataSS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HusfeldtRS96,
author = {Thore Husfeldt and
Theis Rauhe and
S{\o}ren Skyum},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Lower Bounds for Dynamic Transitive Closure, Planar Point Location,
and Parentheses Matching},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {198--211},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_132},
doi = {10.1007/3-540-61422-2\_132},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HusfeldtRS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Kelsen96,
author = {Pierre Kelsen},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Neighborhood Graphs and Distributed Delta+1-Coloring},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {223--233},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_134},
doi = {10.1007/3-540-61422-2\_134},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Kelsen96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KelsenMR96,
author = {Pierre Kelsen and
Sanjeev Mahajan and
Ramesh Hariharan},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Approximate Hypergraph Coloring},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {41--52},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_119},
doi = {10.1007/3-540-61422-2\_119},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KelsenMR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Klauck96,
author = {Hartmut Klauck},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {On the Hardness of Global and Local Approximation},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {88--99},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_123},
doi = {10.1007/3-540-61422-2\_123},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Klauck96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/LamST96,
author = {Tak Wah Lam and
Wing{-}Kin Sung and
Hing{-}Fung Ting},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic
Time},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {124--135},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_126},
doi = {10.1007/3-540-61422-2\_126},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/LamST96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/LauW96,
author = {Hoong Chuin Lau and
Osamu Watanabe},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Randomized Approximation of the Constraint Satisfaction Problem (Extended
Abstract)},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {76--87},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_122},
doi = {10.1007/3-540-61422-2\_122},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/LauW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/LevcopoulosK96,
author = {Christos Levcopoulos and
Drago Krznaric},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {A Fast Heuristic for Approximating the Minimum Weight Triangulation
(Extended Abstract)},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {296--308},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_140},
doi = {10.1007/3-540-61422-2\_140},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/LevcopoulosK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/LevcopoulosO96,
author = {Christos Levcopoulos and
Anna {\"{O}}stlin},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Linear-Time Heuristics for Minimum Weight Rectangulation (Extended
Abstract)},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {271--283},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_138},
doi = {10.1007/3-540-61422-2\_138},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/LevcopoulosO96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Lopez-OrtizS96,
author = {Alejandro L{\'{o}}pez{-}Ortiz and
Sven Schuierer},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Walking Streets Faster},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {345--356},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_144},
doi = {10.1007/3-540-61422-2\_144},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Lopez-OrtizS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/MaratheRS96,
author = {Madhav V. Marathe and
R. Ravi and
Ravi Sundaram},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Service-Constrained Network Design Problems},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {28--40},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_118},
doi = {10.1007/3-540-61422-2\_118},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/MaratheRS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Paterson96,
author = {Mike Paterson},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Progress in Selection},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {368--379},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_146},
doi = {10.1007/3-540-61422-2\_146},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Paterson96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/PremingerU96,
author = {Sonne Preminger and
Eli Upfal},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Safe and Efficient Traffic Laws for Mobile Robots},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {357--367},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_145},
doi = {10.1007/3-540-61422-2\_145},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/PremingerU96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/PrzytyckaH96,
author = {Teresa M. Przytycka and
Lisa Higham},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Optimal Cost-Sensitive Distributed Minimum Spanning Tree Algorithm},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {246--258},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_136},
doi = {10.1007/3-540-61422-2\_136},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/PrzytyckaH96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/RaviG96,
author = {R. Ravi and
Michel X. Goemans},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {The Constrained Minimum Spanning Tree Problem (Extended Abstract)},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {66--75},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_121},
doi = {10.1007/3-540-61422-2\_121},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/RaviG96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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},
series = {Lecture Notes in Computer Science},
volume = {1097},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2},
doi = {10.1007/3-540-61422-2},
isbn = {3-540-61422-2},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/1996.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AgarwalKS94,
author = {Pankaj K. Agarwal and
Matthew J. Katz and
Micha Sharir},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Computing Depth Orders and Related Problems},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {1--12},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_1},
doi = {10.1007/3-540-58218-5\_1},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/AgarwalKS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AgarwalS94,
author = {Pankaj K. Agarwal and
Sandeep Sen},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Selection in Monotone Matrices and Computing k\({}^{\mbox{th}}\) Nearest
Neighbors},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {13--24},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_2},
doi = {10.1007/3-540-58218-5\_2},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AgarwalS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AlbersK94,
author = {Susanne Albers and
Hisashi Koga},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {New On-Line Algorithms for the Page Replication Problem},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {25--36},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_3},
doi = {10.1007/3-540-58218-5\_3},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AlbersK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AusielloFLST94,
author = {Giorgio Ausiello and
Esteban Feuerstein and
Stefano Leonardi and
Leen Stougie and
Maurizio Talamo},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Serving Requests with On-line Routing},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {37--48},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_4},
doi = {10.1007/3-540-58218-5\_4},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/AusielloFLST94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Becker94,
author = {Peter Becker},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {A New Algorithm for the Construction of Optimal B-Trees},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {49--60},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_5},
doi = {10.1007/3-540-58218-5\_5},
timestamp = {Thu, 23 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/Becker94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BergGO94,
author = {Mark de Berg and
Marko de Groot and
Mark H. Overmars},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {New Results on Binary Space Partitions in the Plane (Extended Abstract)},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {61--72},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_6},
doi = {10.1007/3-540-58218-5\_6},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BergGO94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BermanL94,
author = {Piotr Berman and
Andrzej Lingas},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex
Polygon},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {73--82},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_7},
doi = {10.1007/3-540-58218-5\_7},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BermanL94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BiedlKK94,
author = {Therese C. Biedl and
Goos Kant and
Michael Kaufmann},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {On Triangulating Planar Graphs under the Four-Connectivity Constraint},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {83--94},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_8},
doi = {10.1007/3-540-58218-5\_8},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BiedlKK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CzumajGPR94,
author = {Artur Czumaj and
Leszek Gasieniec and
Marek Piotr{\'{o}}w and
Wojciech Rytter},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Parallel and Sequential Approximations of Shortest Superstrings},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {95--106},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_9},
doi = {10.1007/3-540-58218-5\_9},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/CzumajGPR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DasHN94,
author = {Gautam Das and
Paul J. Heffernan and
Giri Narasimhan},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended
Abstract)},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {119--130},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_11},
doi = {10.1007/3-540-58218-5\_11},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/DasHN94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DietzSZ94,
author = {Paul F. Dietz and
Joel I. Seiferas and
Ju Zhang},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {A Tight Lower Bound for On-line Monotonic List Labeling},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {131--142},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_12},
doi = {10.1007/3-540-58218-5\_12},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DietzSZ94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Dragan94,
author = {Feodor F. Dragan},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Dominating Cliques in Distance-Hereditary Graphs},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {370--381},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_34},
doi = {10.1007/3-540-58218-5\_34},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Dragan94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DzyzowiczER94,
author = {Jurek Czyzowicz and
Hazel Everett and
Jean{-}Marc Robert},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Separating Translates in the Plane: Combinatorial Bounds and an Algorithm},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {107--118},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_10},
doi = {10.1007/3-540-58218-5\_10},
timestamp = {Fri, 24 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/DzyzowiczER94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FelsnerMW94,
author = {Stefan Felsner and
Rudolf M{\"{u}}ller and
Lorenz Wernisch},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Trapezoid Graphs and Generalizations, Geometry and Algorithms},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {143--154},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_13},
doi = {10.1007/3-540-58218-5\_13},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/FelsnerMW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Fernandez-BacaS94,
author = {David Fern{\'{a}}ndez{-}Baca and
Giora Slutzki},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Optimal Parametric Search on Graphs of Bounded Tree-Width},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {155--166},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_14},
doi = {10.1007/3-540-58218-5\_14},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Fernandez-BacaS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Fredman94,
author = {Michael L. Fredman},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Lower Bounds for Dynamic Algorithms},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {167--171},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_15},
doi = {10.1007/3-540-58218-5\_15},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Fredman94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GuptaJS94,
author = {Prosenjit Gupta and
Ravi Janardan and
Michiel H. M. Smid},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {On Intersection Searching Problems Involving Curved Objects},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {183--194},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_17},
doi = {10.1007/3-540-58218-5\_17},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GuptaJS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GuptaN94,
author = {Arvind Gupta and
Naomi Nishimura},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Sequential and Parallel Algorithms for Embedding Problems on Classes
of Partial k-Trees},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {172--182},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_16},
doi = {10.1007/3-540-58218-5\_16},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GuptaN94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HalldorssonR94,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Jaikumar Radhakrishnan},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Improved Approximations of Independent Sets in Bounded-Degree Graphs},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {195--206},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_18},
doi = {10.1007/3-540-58218-5\_18},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HalldorssonR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Hastad94,
author = {Johan H{\aa}stad},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Recent Results in Hardness of Approximation},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {231--239},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_21},
doi = {10.1007/3-540-58218-5\_21},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Hastad94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HighamP94,
author = {Lisa Higham and
Teresa M. Przytycka},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Asymptotically Optimal Election on Weighted Rings},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {207--218},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_19},
doi = {10.1007/3-540-58218-5\_19},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HighamP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HromkovicKUW94,
author = {Juraj Hromkovic and
Ralf Klasing and
Walter Unger and
Hubert Wagener},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path
Modes (Extended Abstract)},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {219--230},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_20},
doi = {10.1007/3-540-58218-5\_20},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HromkovicKUW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/JuurlinkW94,
author = {Ben H. H. Juurlink and
Harry A. G. Wijshoff},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {The Parallel Hierarchical Memory Model},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {240--251},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_22},
doi = {10.1007/3-540-58218-5\_22},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/JuurlinkW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Mulmuley94,
author = {Ketan Mulmuley},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Randomized Geometric Algorithms (Abstract)},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {252--254},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_23},
doi = {10.1007/3-540-58218-5\_23},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Mulmuley94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Palios94,
author = {Leonidas Palios},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Connecting the Maximum Number of Grid Nodes to the Boundary with Non-Intersecting
Line Segments},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {255--266},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_24},
doi = {10.1007/3-540-58218-5\_24},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Palios94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/PapatriantafilouT94,
author = {Marina Papatriantafilou and
Philippas Tsigas},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {On Self-Stabilizing Wait-Free Clock Synchronization},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {267--277},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_25},
doi = {10.1007/3-540-58218-5\_25},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/PapatriantafilouT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Peinado94,
author = {Marcus Peinado},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Hard Graphs for Randomized Subgraph Exclusion Algorithms},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {278--289},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_26},
doi = {10.1007/3-540-58218-5\_26},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Peinado94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/PhillipsSW94,
author = {Cynthia A. Phillips and
Clifford Stein and
Joel Wein},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Task Scheduling in Networks (Extended Abstract)},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {290--301},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_27},
doi = {10.1007/3-540-58218-5\_27},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/PhillipsSW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Schenk94,
author = {Erik Schenk},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Parallel Dynamic Lowest Common Ancestors},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {302--313},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_28},
doi = {10.1007/3-540-58218-5\_28},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Schenk94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Schuierer94,
author = {Sven Schuierer},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {An O(log {N)} Algorithm to Compute the Kernel of a Polygon},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {314--325},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_29},
doi = {10.1007/3-540-58218-5\_29},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Schuierer94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Schuierer94a,
author = {Sven Schuierer},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Computing the L\({}_{\mbox{1}}\)-Diameter and Center of a Simple Rectilinear
Polygon in Parallel},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {326--337},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_30},
doi = {10.1007/3-540-58218-5\_30},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Schuierer94a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/SibeynH94,
author = {Jop F. Sibeyn and
Tim J. Harris},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Exploiting Locality in {LT-RAM} Computations},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {338--349},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_31},
doi = {10.1007/3-540-58218-5\_31},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/SibeynH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Thorup94,
author = {Mikkel Thorup},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Efficient Preprocessing of Simple Binary Pattern Forests},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {350--358},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_32},
doi = {10.1007/3-540-58218-5\_32},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Thorup94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ZhouNN94,
author = {Xiao Zhou and
Shin{-}Ichi Nakano and
Takao Nishizeki},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {A Parallel Algorithm for Edge-Coloring Partial k-Trees},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {359--369},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_33},
doi = {10.1007/3-540-58218-5\_33},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ZhouNN94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/1994,
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5},
doi = {10.1007/3-540-58218-5},
isbn = {3-540-58218-5},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/1994.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AlbersR92,
author = {Gerhard Albers and
Thomas Roos},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Voronoi Diagrams of Moving Points in Higher Dimensional Spaces},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {399--409},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_36},
doi = {10.1007/3-540-55706-7\_36},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/AlbersR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AwerbuchBCP92,
author = {Baruch Awerbuch and
Bonnie Berger and
Lenore Cowen and
David Peleg},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Low-Diameter Graph Decomposition is in {NC}},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {83--93},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_8},
doi = {10.1007/3-540-55706-7\_8},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AwerbuchBCP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BergKS92,
author = {Mark de Berg and
Marc J. van Kreveld and
Jack Snoeyink},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Two- and Three-Dimensional Point Location in Rectangular Subdivisions
(Extended Abstract)},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {352--363},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_32},
doi = {10.1007/3-540-55706-7\_32},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BergKS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BertolazziCBTT92,
author = {Paola Bertolazzi and
Robert F. Cohen and
Giuseppe Di Battista and
Roberto Tamassia and
Ioannis G. Tollis},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {How to Draw a Series-Parallel Digraph (Extended Abstract)},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {272--283},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_23},
doi = {10.1007/3-540-55706-7\_23},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BertolazziCBTT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoyarL92,
author = {Joan Boyar and
Kim S. Larsen},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Efficient Rebalancing of Chromatic Search Trees},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {151--164},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_14},
doi = {10.1007/3-540-55706-7\_14},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoyarL92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ChazelleP92,
author = {Bernard Chazelle and
Leonidas Palios},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Decomposing the Boundary of a Nonconvex Polyhedron},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {364--375},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_33},
doi = {10.1007/3-540-55706-7\_33},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ChazelleP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ChewK92,
author = {L. Paul Chew and
Klara Kedem},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Improvements on Geometric Pattern Matching Problems},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {318--325},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_28},
doi = {10.1007/3-540-55706-7\_28},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ChewK92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CuntoY92,
author = {Walter Cunto and
Vicente Yriarte},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {GKD-Trees: Binary Trees that Combine Multi-dimensional Data Handling,
Node Size and Fringe Reorganization},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {192--211},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_17},
doi = {10.1007/3-540-55706-7\_17},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/CuntoY92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Czumaj92,
author = {Artur Czumaj},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {An Optimal Parallel Algorithm for Computing a Near-Optimal Order of
Matrix Multiplications},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {62--72},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_6},
doi = {10.1007/3-540-55706-7\_6},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Czumaj92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Dietz92,
author = {Paul F. Dietz},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Heap Construction in the Parallel Comparison Tree Model},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {140--150},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_13},
doi = {10.1007/3-540-55706-7\_13},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Dietz92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Fernandez-BacaS92,
author = {David Fern{\'{a}}ndez{-}Baca and
Giora Slutzki},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Parametric Problems on Graphs of Bounded Tree-Width},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {304--316},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_26},
doi = {10.1007/3-540-55706-7\_26},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Fernandez-BacaS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FichKLKR92,
author = {Faith E. Fich and
Miroslaw Kowaluk and
Krzysztof Lorys and
Miroslaw Kutylowski and
Prabhakar Ragde},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Retrieval of scattered information by EREW, {CREW} and {CRCW} PRAMs},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {30--41},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_3},
doi = {10.1007/3-540-55706-7\_3},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/FichKLKR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FreivaldsS92,
author = {Rusins Freivalds and
Carl H. Smith},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Memory Limited Inductive Inference Machines},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {19--29},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_2},
doi = {10.1007/3-540-55706-7\_2},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/FreivaldsS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FurerS92,
author = {Martin F{\"{u}}rer and
C. R. Subramanian},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Coloring Random Graphs},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {284--291},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_24},
doi = {10.1007/3-540-55706-7\_24},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/FurerS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GerbessiotisV92,
author = {Alexandros V. Gerbessiotis and
Leslie G. Valiant},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Direct Bulk-Synchronous Parallel Algorithms},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {1--18},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_1},
doi = {10.1007/3-540-55706-7\_1},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GerbessiotisV92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GhoshM92,
author = {Subir Kumar Ghosh and
Anil Maheshwari},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Parallel Algorithms for All Minimum Link Paths and Link Center Problems},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {106--117},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_10},
doi = {10.1007/3-540-55706-7\_10},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GhoshM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GiammarresiI92,
author = {Dora Giammarresi and
Giuseppe F. Italiano},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Dynamic 2- and 3-Connectivity on Planar Graphs (Preliminary Version)},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {221--232},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_19},
doi = {10.1007/3-540-55706-7\_19},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GiammarresiI92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Golin92,
author = {Mordecai J. Golin},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Dynamic Closest Pairs - {A} Probabilistic Approach},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {340--351},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_31},
doi = {10.1007/3-540-55706-7\_31},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Golin92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Gonnet92,
author = {Gaston H. Gonnet},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Efficient Two-dimensional Searching},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {317},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_27},
doi = {10.1007/3-540-55706-7\_27},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Gonnet92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/He92,
author = {Xin He},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Parallel Algorithm for Cograph Recognition with Applications},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {94--105},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_9},
doi = {10.1007/3-540-55706-7\_9},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/He92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HershbergerRS92,
author = {John Hershberger and
Monika Rauch and
Subhash Suri},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Fully Dynamic 2-Edge-Connectivity in Planar Graphs},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {233--244},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_20},
doi = {10.1007/3-540-55706-7\_20},
timestamp = {Wed, 03 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/HershbergerRS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HershbergerS92,
author = {John Hershberger and
Jack Snoeyink},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {376--387},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_34},
doi = {10.1007/3-540-55706-7\_34},
timestamp = {Wed, 03 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/HershbergerS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/JakobyR92,
author = {Andreas Jakoby and
R{\"{u}}diger Reischuk},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {The Complexity of Scheduling Problems with Communication Delays for
Trees},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {165--177},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_15},
doi = {10.1007/3-540-55706-7\_15},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/JakobyR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/JosephMT92,
author = {Deborah Joseph and
Joao Meidanis and
Prasoon Tiwari},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Determining {DNA} Sequence Similarity Using Maximum Independent Set
Algorithms for Interval Graphs},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {326--337},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_29},
doi = {10.1007/3-540-55706-7\_29},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/JosephMT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KantB92,
author = {Goos Kant and
Hans L. Bodlaender},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Triangulating Planar Graphs While Minimizing the Maximum Degree},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {258--271},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_22},
doi = {10.1007/3-540-55706-7\_22},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KantB92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KatajainenP92,
author = {Jyrki Katajainen and
Tomi Pasanen},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Sorting Multisets Stably in Minimum Space},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {410--421},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_37},
doi = {10.1007/3-540-55706-7\_37},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KatajainenP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KaufmannS92,
author = {Michael Kaufmann and
Jop F. Sibeyn},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Optimal Multi-Packet Routing on the Torus},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {118--129},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_11},
doi = {10.1007/3-540-55706-7\_11},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KaufmannS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KloksB92,
author = {Ton Kloks and
Hans L. Bodlaender},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Testing Superperfection of k-Trees},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {292--303},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_25},
doi = {10.1007/3-540-55706-7\_25},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KloksB92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KortsarzP92,
author = {Guy Kortsarz and
David Peleg},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Generating Sparse 2-spanners},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {73--82},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_7},
doi = {10.1007/3-540-55706-7\_7},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KortsarzP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/LenhofS92,
author = {Hans{-}Peter Lenhof and
Michiel H. M. Smid},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Maintaining the Visibility Map of Spheres while Moving the Viewpoint
on a Circle at Infinity},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {388--398},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_35},
doi = {10.1007/3-540-55706-7\_35},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/LenhofS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/McDiarmidRSS92,
author = {Colin McDiarmid and
Bruce A. Reed and
Alexander Schrijver and
F. Bruce Shepherd},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Non-Interfering Network Flows},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {245--257},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_21},
doi = {10.1007/3-540-55706-7\_21},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/McDiarmidRSS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/PeterssonM92,
author = {Ola Petersson and
Alistair Moffat},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {A Framework for Adaptive Sorting},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {422--433},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_38},
doi = {10.1007/3-540-55706-7\_38},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/PeterssonM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/PinottiP92,
author = {Maria Cristina Pinotti and
Geppino Pucci},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Parallel Algorithms for Priority Queue Operations},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {130--139},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_12},
doi = {10.1007/3-540-55706-7\_12},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/PinottiP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Pippenger92,
author = {Nicholas Pippenger},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {An Elementary Approach to Some Analytic Asymptotics},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {53--61},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_5},
doi = {10.1007/3-540-55706-7\_5},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Pippenger92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Razborov92,
author = {Alexander A. Razborov},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {On Small Depth Threshold Circuits},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {42--52},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_4},
doi = {10.1007/3-540-55706-7\_4},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Razborov92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Sen92,
author = {Sandeep Sen},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Fractional Cascading Simplified},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {212--220},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_18},
doi = {10.1007/3-540-55706-7\_18},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Sen92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Welzl92,
author = {Emo Welzl},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {New Results on Linear Programming and Related Problems},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {338--339},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_30},
doi = {10.1007/3-540-55706-7\_30},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Welzl92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/dAmoreL92,
author = {Fabrizio d'Amore and
Vincenzo Liberatore},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {The List Update Problem and the Retrieval of Sets},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {178--191},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_16},
doi = {10.1007/3-540-55706-7\_16},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/dAmoreL92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/1992,
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7},
doi = {10.1007/3-540-55706-7},
isbn = {3-540-55706-7},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/1992.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AgarwalAOS90,
author = {Pankaj K. Agarwal and
Boris Aronov and
Joseph O'Rourke and
Catherine A. Schevon},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Star Unfolding of a Polytope with Applications (Extended Abstract)},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {251--263},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_94},
doi = {10.1007/3-540-52846-6\_94},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AgarwalAOS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AlthoferDDJ90,
author = {Ingo Alth{\"{o}}fer and
Gautam Das and
David P. Dobkin and
Deborah Joseph},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Generating Sparse Spanners for Weighted Graphs},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {26--37},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_75},
doi = {10.1007/3-540-52846-6\_75},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/AlthoferDDJ90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AnderssonL90,
author = {Arne Andersson and
Tony W. Lai},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Fast Updating of Well-Balanced Trees},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {111--121},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_82},
doi = {10.1007/3-540-52846-6\_82},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AnderssonL90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ArnborgP90,
author = {Stefan Arnborg and
Andrzej Proskurowski},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Canonical Representation of Partial 2- and 3-Trees},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {310--319},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_100},
doi = {10.1007/3-540-52846-6\_100},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ArnborgP90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Atallah90,
author = {Mikhail J. Atallah},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {A Faster Parallel Algorithm for a Matrix Searching Problem},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {192--200},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_89},
doi = {10.1007/3-540-52846-6\_89},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Atallah90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Baeza-YatesGZ90,
author = {Ricardo A. Baeza{-}Yates and
Gaston H. Gonnet and
Nivio Ziviani},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Expected Behaviour Analysis of {AVL} Trees},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {143--159},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_85},
doi = {10.1007/3-540-52846-6\_85},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Baeza-YatesGZ90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Baeza-YatesR90,
author = {Ricardo A. Baeza{-}Yates and
Mireille R{\'{e}}gnier},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Fast Algorithms for Two Dimensional and Multiple Pattern Matching
(Preliminary Version)},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {332--347},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_102},
doi = {10.1007/3-540-52846-6\_102},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Baeza-YatesR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Bent90,
author = {Samuel W. Bent},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Ranking Trees Generated by Rotations},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {132--142},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_84},
doi = {10.1007/3-540-52846-6\_84},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Bent90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Berg90,
author = {Mark de Berg},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Translating Polygons with Applications to Hidden Surface Removal},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {60--70},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_78},
doi = {10.1007/3-540-52846-6\_78},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Berg90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BergKNO90,
author = {Mark de Berg and
Marc J. van Kreveld and
Bengt J. Nilsson and
Mark H. Overmars},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Finding Shortest Paths in the Presence of Orthogonal Obstacles Using
a Combined {L1} and Link Metric},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {213--224},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_91},
doi = {10.1007/3-540-52846-6\_91},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BergKNO90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BodlaenderM90,
author = {Hans L. Bodlaender and
Rolf H. M{\"{o}}hring},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {The Pathwidth and Treewidth of Cographs},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {301--309},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_99},
doi = {10.1007/3-540-52846-6\_99},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BodlaenderM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoppanaH90,
author = {Ravi B. Boppana and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Approximating Maximum Independent Sets by Excluding Subgraphs},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {13--25},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_74},
doi = {10.1007/3-540-52846-6\_74},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoppanaH90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DietzZ90,
author = {Paul F. Dietz and
Ju Zhang},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Lower Bounds for Monotonic List Labeling},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {173--180},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_87},
doi = {10.1007/3-540-52846-6\_87},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DietzZ90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Eppstein90,
author = {David Eppstein},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Finding the k Smallest Spanning Trees},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {38--47},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_76},
doi = {10.1007/3-540-52846-6\_76},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Eppstein90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Fernandez-Baca90,
author = {David Fern{\'{a}}ndez{-}Baca},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Space-Sweep Algorithms for Parametric Optimization (Extended Abstract)},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {264--275},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_95},
doi = {10.1007/3-540-52846-6\_95},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Fernandez-Baca90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Fernandez-BacaW90,
author = {David Fern{\'{a}}ndez{-}Baca and
Mark A. Williams},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {On Matroids and Hierarchical Graphs},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {320--331},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_101},
doi = {10.1007/3-540-52846-6\_101},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Fernandez-BacaW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FriedmanHS90,
author = {Joseph Friedman and
John Hershberger and
Jack Snoeyink},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Input-Sensitive Compliant Motion in the Plane},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {225--237},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_92},
doi = {10.1007/3-540-52846-6\_92},
timestamp = {Wed, 03 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/FriedmanHS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Grape90,
author = {Per Grape},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Complete Problems With L-samplable Distributions},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {360--367},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_104},
doi = {10.1007/3-540-52846-6\_104},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Grape90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HartmanisCRR90,
author = {Juris Hartmanis and
Richard Chang and
Desh Ranjan and
Pankaj Rohatgi},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Structural Complexity Theory: recent Surprises},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {1--12},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_73},
doi = {10.1007/3-540-52846-6\_73},
timestamp = {Tue, 14 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/HartmanisCRR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Hershberger90,
author = {John Hershberger},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Upper Envelope Onion Peeling},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {368--379},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_105},
doi = {10.1007/3-540-52846-6\_105},
timestamp = {Wed, 03 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/Hershberger90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HershbergerS90,
author = {John Hershberger and
Subhash Suri},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Applications of a Semi-Dynamic Convex Hull Algorithm},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {380--392},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_106},
doi = {10.1007/3-540-52846-6\_106},
timestamp = {Wed, 03 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/HershbergerS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Johnson90,
author = {David S. Johnson},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Data Structures for Traveling Salesmen (Abstract)},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {287},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_97},
doi = {10.1007/3-540-52846-6\_97},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Johnson90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KantL90,
author = {Goos Kant and
Jan van Leeuwen},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {The File Distribution Problem for Processor Networks},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {48--59},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_77},
doi = {10.1007/3-540-52846-6\_77},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KantL90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KorneenkoM90,
author = {Nickolay M. Korneenko and
Horst Martini},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Approximating Finite Weighted Point Sets by Hyperplanes},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {276--286},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_96},
doi = {10.1007/3-540-52846-6\_96},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KorneenkoM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KreveldOA90,
author = {Marc J. van Kreveld and
Mark H. Overmars and
Pankaj K. Agarwal},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Intersection Queries in Sets of Disks},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {393--403},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_107},
doi = {10.1007/3-540-52846-6\_107},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KreveldOA90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/LevcopoulosL90,
author = {Christos Levcopoulos and
Andrzej Lingas},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Fast Algorithms for Greedy Triangulation},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {238--250},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_93},
doi = {10.1007/3-540-52846-6\_93},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/LevcopoulosL90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/LevcopoulosP90,
author = {Christos Levcopoulos and
Ola Petersson},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Sorting Shuffled Monotone Sequences},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {181--191},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_88},
doi = {10.1007/3-540-52846-6\_88},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/LevcopoulosP90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/OttmannW90,
author = {Thomas Ottmann and
Derick Wood},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {How to Update a Balanced Binary Tree with a Constant Number of Rotations},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {122--131},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_83},
doi = {10.1007/3-540-52846-6\_83},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/OttmannW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/PantziouSZ90,
author = {Grammati E. Pantziou and
Paul G. Spirakis and
Christos D. Zaroliagis},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Efficient Parallel Algorithms for Shortest Paths in Planar Graphs},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {288--300},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_98},
doi = {10.1007/3-540-52846-6\_98},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/PantziouSZ90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/PapadakisMP90,
author = {Thomas Papadakis and
J. Ian Munro and
Patricio V. Poblete},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Analysis of the Expected Search Cost in Skip Lists},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {160--172},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_86},
doi = {10.1007/3-540-52846-6\_86},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/PapadakisMP90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Pocciola90,
author = {Michel Pocciola},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Graphics in Flatland Revisited},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {85--96},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_80},
doi = {10.1007/3-540-52846-6\_80},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Pocciola90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/PreparataVY90,
author = {Franco P. Preparata and
Jeffrey Scott Vitter and
Mariette Yvinec},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {71--84},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_79},
doi = {10.1007/3-540-52846-6\_79},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/PreparataVY90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/RichardsS90,
author = {Dana S. Richards and
Jeffrey S. Salowe},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {A Rectilinear Steiner Minimal Tree Algorithm for Convex Point Sets},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {201--212},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_90},
doi = {10.1007/3-540-52846-6\_90},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/RichardsS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/SchipperO90,
author = {Haijo Schipper and
Mark H. Overmars},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Dynamic Partition Trees},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {404--417},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_108},
doi = {10.1007/3-540-52846-6\_108},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/SchipperO90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/TarhioU90,
author = {Jorma Tarhio and
Esko Ukkonen},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {Boyer-Moore Approach to Approximate String Matching (Extended Abstract)},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {348--359},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_103},
doi = {10.1007/3-540-52846-6\_103},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/TarhioU90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Vegter90,
author = {Gert Vegter},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {The Visibility Diagram: a Data Structure for Visibility Problems and
Motion Planning},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {97--110},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_81},
doi = {10.1007/3-540-52846-6\_81},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Vegter90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/1990,
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6},
doi = {10.1007/3-540-52846-6},
isbn = {3-540-52846-6},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/1990.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Baeza-YatesCR88,
author = {Ricardo A. Baeza{-}Yates and
Joseph C. Culberson and
Gregory J. E. Rawlins},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Searching with Uncertainty (Extended Abstract)},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {176--189},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_20},
doi = {10.1007/3-540-19487-8\_20},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Baeza-YatesCR88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Bodlaender88,
author = {Hans L. Bodlaender},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Polynomial Algorithms for Graph Isomorphism and Chromatic Index on
Partial k-Trees},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {223--232},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_26},
doi = {10.1007/3-540-19487-8\_26},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Bodlaender88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CarlssonM88,
author = {Svante Carlsson and
Christer Mattsson},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {An Extrapolation on the Interpolation Search},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {24--33},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_3},
doi = {10.1007/3-540-19487-8\_3},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/CarlssonM88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CarlssonMP88,
author = {Svante Carlsson and
J. Ian Munro and
Patricio V. Poblete},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {An Implicit Binomial Queue with Constant Insertion Time},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {1--13},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_1},
doi = {10.1007/3-540-19487-8\_1},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/CarlssonMP88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/CuntoP88,
author = {Walter Cunto and
Patricio V. Poblete},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Two Hybrid Methods for Collision Resolution in Open Addressing Hashing},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {113--119},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_12},
doi = {10.1007/3-540-19487-8\_12},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/CuntoP88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DahlhausK88,
author = {Elias Dahlhaus and
Marek Karpinski},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph
and the Related Problems (Extended Abstract)},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {139--144},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_16},
doi = {10.1007/3-540-19487-8\_16},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DahlhausK88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DehneSS88,
author = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Ivan Stojmenovic},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {A Note on Determinig the 3-Dimensional Convex Hull of a Set of Points
on a Mesh of Processors},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {154--162},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_18},
doi = {10.1007/3-540-19487-8\_18},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DehneSS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DietzfelbingerMHR88,
author = {Martin Dietzfelbinger and
Kurt Mehlhorn and
Friedhelm Meyer auf der Heide and
Hans Rohnert},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Upper and Lower Bounds for the Dictionary Problem (Abstract)},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {214--215},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_24},
doi = {10.1007/3-540-19487-8\_24},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DietzfelbingerMHR88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Dijdjev88,
author = {Hristo N. Djidjev},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Linear Algorithms for Graph Separation Problems},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {216--222},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_25},
doi = {10.1007/3-540-19487-8\_25},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Dijdjev88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/DrawsEFHVS88,
author = {Lars Draws and
Patrik Eriksson and
Erik Forslund and
Leif H{\"{o}}glund and
S{\"{o}}ren Vallner and
Thomas Strothotte},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Two New Algorithms for Constructing Min-Max Heaps},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {43--50},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_5},
doi = {10.1007/3-540-19487-8\_5},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/DrawsEFHVS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Ghosh88,
author = {Subir Kumar Ghosh},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {On Recognizing and Characterizing Visibility Graphs of Simple Polygons},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {96--104},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_10},
doi = {10.1007/3-540-19487-8\_10},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Ghosh88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GilbertH88,
author = {John R. Gilbert and
Hj{\'{a}}lmtyr Hafsteinsson},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Parallel Solution of Space Linear Systems},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {145--153},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_17},
doi = {10.1007/3-540-19487-8\_17},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GilbertH88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GuibasOS88,
author = {Leonidas J. Guibas and
Mark H. Overmars and
Micha Sharir},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Intersecting Line Segments, Ray Shooting, and Other Applications of
Geometric Partitioning Techniques},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {64--73},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_7},
doi = {10.1007/3-540-19487-8\_7},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GuibasOS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Gunther88,
author = {Oliver G{\"{u}}nther},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {A Lower Bound and Two Approximate Algorithms for the K-Partitioning
of Rectilinear Polygons},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {86--95},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_9},
doi = {10.1007/3-540-19487-8\_9},
timestamp = {Mon, 25 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Gunther88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Hoyland88,
author = {Sven{-}Olai H{\o}yland},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Bin-Packing in 1.5 Dimension},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {129--137},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_14},
doi = {10.1007/3-540-19487-8\_14},
timestamp = {Mon, 07 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Hoyland88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Kei88,
author = {J. Mark Keil},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Approximating the Complete Euclidean Graph},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {208--213},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_23},
doi = {10.1007/3-540-19487-8\_23},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Kei88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KirousisS88,
author = {Lefteris M. Kirousis and
Paul G. Spirakis},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Probabilistic Log-Space Reductions and Problems Probabilistically
Hard for {P}},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {163--175},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_19},
doi = {10.1007/3-540-19487-8\_19},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KirousisS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KrishnaswamyK88,
author = {R. P. Krishnaswamy and
Chul E. Kim},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Problems of Posting Sentries: Variations on the Art Gallery Theorem},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {74--85},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_8},
doi = {10.1007/3-540-19487-8\_8},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KrishnaswamyK88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/LaiW88,
author = {Tony W. Lai and
Derick Wood},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Implicit Selection},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {14--23},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_2},
doi = {10.1007/3-540-19487-8\_2},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/LaiW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/LevcopoulosKL88,
author = {Christos Levcopoulos and
Jyrki Katajainen and
Andrzej Lingas},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {190--198},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_21},
doi = {10.1007/3-540-19487-8\_21},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/LevcopoulosKL88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/MannilaU88,
author = {Heikki Mannila and
Esko Ukkonen},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Time Parameter and Arbitrary Deunions in the Set Union Problem},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {34--42},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_4},
doi = {10.1007/3-540-19487-8\_4},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/MannilaU88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Overmars88,
author = {Mark H. Overmars},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Connectability Problems},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {105--112},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_11},
doi = {10.1007/3-540-19487-8\_11},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Overmars88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ProskurowskiR88,
author = {Andrzej Proskurowski and
Frank Ruskey},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Generating Binary Trees by Transpositions},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {199--207},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_22},
doi = {10.1007/3-540-19487-8\_22},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/ProskurowskiR88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/SysloW88,
author = {Maciej M. Syslo and
Pawel Winter},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Independent Covers in Outerplanar Graphs},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {243--254},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_28},
doi = {10.1007/3-540-19487-8\_28},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/SysloW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Szpankowski88,
author = {Wojciech Szpankowski},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {On an Alternative Sum Useful in the Analysis of Some Data Structures},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {120--128},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_13},
doi = {10.1007/3-540-19487-8\_13},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Szpankowski88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Vazirani88,
author = {Vijay V. Vazirani},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {{NC} Algorithms for Computing the Number of Perfect Matchings in K3,
3-free Graphs and Related Problems},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {233--242},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_27},
doi = {10.1007/3-540-19487-8\_27},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/Vazirani88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/WeissS88,
author = {Mark Allen Weiss and
Robert Sedgewick},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Tight Lower Bounds for Shellsort},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {255--262},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_29},
doi = {10.1007/3-540-19487-8\_29},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/WeissS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Wood88,
author = {Derick Wood},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Extremal Cost Tree Data Structures},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {51--63},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_6},
doi = {10.1007/3-540-19487-8\_6},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Wood88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Yap88,
author = {Chee{-}Keng Yap},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Applications of a Symbolic Perturbation Scheme (Abstract)},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {138},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_15},
doi = {10.1007/3-540-19487-8\_15},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Yap88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/swat/1988,
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8},
doi = {10.1007/3-540-19487-8},
isbn = {3-540-19487-8},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/1988.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-16 18:28 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
