Search dblp for Publications

export results for "toc:db/conf/swat/swat2006.bht:"

 download as .bib file

@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}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics