default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/waoa/waoa2018.bht:"
download as .bib file
@inproceedings{DBLP:conf/waoa/0001MS18,
author = {George Christodoulou and
Themistoklis Melissourgos and
Paul G. Spirakis},
editor = {Leah Epstein and
Thomas Erlebach},
title = {Strategic Contention Resolution in Multiple Channels},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {165--180},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_11},
doi = {10.1007/978-3-030-04693-4\_11},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/0001MS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/AzarF18,
author = {Yossi Azar and
Amit Jacob Fanani},
editor = {Leah Epstein and
Thomas Erlebach},
title = {Deterministic Min-Cost Matching with Delays},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {21--35},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_2},
doi = {10.1007/978-3-030-04693-4\_2},
timestamp = {Mon, 03 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/AzarF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BensmailMINP18,
author = {Julien Bensmail and
Dorian Mazauric and
Fionn Mc Inerney and
Nicolas Nisse and
St{\'{e}}phane P{\'{e}}rennes},
editor = {Leah Epstein and
Thomas Erlebach},
title = {Sequential Metric Dimension},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {36--50},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_3},
doi = {10.1007/978-3-030-04693-4\_3},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/BensmailMINP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BienkowskiKLS18,
author = {Marcin Bienkowski and
Artur Kraska and
Hsiang{-}Hsuan Liu and
Pawel Schmidt},
editor = {Leah Epstein and
Thomas Erlebach},
title = {A Primal-Dual Online Deterministic Algorithm for Matching with Delays},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {51--68},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_4},
doi = {10.1007/978-3-030-04693-4\_4},
timestamp = {Wed, 14 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BienkowskiKLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BockenhauerFU18,
author = {Hans{-}Joachim B{\"{o}}ckenhauer and
Janosch Fuchs and
Walter Unger},
editor = {Leah Epstein and
Thomas Erlebach},
title = {Exploring Sparse Graphs with Advice (Extended Abstract)},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {102--117},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_7},
doi = {10.1007/978-3-030-04693-4\_7},
timestamp = {Mon, 03 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/BockenhauerFU18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BockenhauerKW18,
author = {Hans{-}Joachim B{\"{o}}ckenhauer and
Dennis Komm and
Raphael Wegner},
editor = {Leah Epstein and
Thomas Erlebach},
title = {Call Admission Problems on Grids with Advice (Extended Abstract)},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {118--133},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_8},
doi = {10.1007/978-3-030-04693-4\_8},
timestamp = {Mon, 03 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/BockenhauerKW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BorodinBLP18,
author = {Allan Borodin and
Joan Boyar and
Kim S. Larsen and
Denis Pankratov},
editor = {Leah Epstein and
Thomas Erlebach},
title = {Advice Complexity of Priority Algorithms},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {69--86},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_5},
doi = {10.1007/978-3-030-04693-4\_5},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BorodinBLP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BousquetM18,
author = {Nicolas Bousquet and
Arnaud Mary},
editor = {Leah Epstein and
Thomas Erlebach},
title = {Reconfiguration of Graphs with Connectivity Constraints},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {295--309},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_18},
doi = {10.1007/978-3-030-04693-4\_18},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BousquetM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/ByrkaLS18,
author = {Jaroslaw Byrka and
Mateusz Lewandowski and
Joachim Spoerhase},
editor = {Leah Epstein and
Thomas Erlebach},
title = {Approximating Node-Weighted k-MST on Planar Graphs},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {87--101},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_6},
doi = {10.1007/978-3-030-04693-4\_6},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/ByrkaLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/CalinescuKN18,
author = {Gruia C{u{a}}linescu and
Guy Kortsarz and
Zeev Nutov},
editor = {Leah Epstein and
Thomas Erlebach},
title = {Improved Approximation Algorithms for Minimum Power Covering Problems},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {134--148},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_9},
doi = {10.1007/978-3-030-04693-4\_9},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/CalinescuKN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/ChangHSV18,
author = {Minjun Chang and
Dorit S. Hochbaum and
Quico Spaen and
Mark Velednitsky},
editor = {Leah Epstein and
Thomas Erlebach},
title = {{DISPATCH:} An Optimally-Competitive Algorithm for Maximum Online
Perfect Bipartite Matching with i.i.d. Arrivals},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {149--164},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_10},
doi = {10.1007/978-3-030-04693-4\_10},
timestamp = {Wed, 26 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/ChangHSV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/CzumajMV18,
author = {Artur Czumaj and
Yishay Mansour and
Shai Vardi},
editor = {Leah Epstein and
Thomas Erlebach},
title = {Sublinear Graph Augmentation for Fast Query Implementation},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {181--203},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_12},
doi = {10.1007/978-3-030-04693-4\_12},
timestamp = {Mon, 03 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/CzumajMV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/DosaKT18,
author = {Gy{\"{o}}rgy D{\'{o}}sa and
Hans Kellerer and
Zsolt Tuza},
editor = {Leah Epstein and
Thomas Erlebach},
title = {Bin Packing Games with Weight Decision: How to Get a Small Value for
the Price of Anarchy},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {204--217},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_13},
doi = {10.1007/978-3-030-04693-4\_13},
timestamp = {Mon, 03 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/DosaKT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/DriemelK18,
author = {Anne Driemel and
Amer Krivosija},
editor = {Leah Epstein and
Thomas Erlebach},
title = {Probabilistic Embeddings of the Fr{\'{e}}chet Distance},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {218--237},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_14},
doi = {10.1007/978-3-030-04693-4\_14},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/DriemelK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/FairsteinNR18,
author = {Yaron Fairstein and
Seffi Naor and
Danny Raz},
editor = {Leah Epstein and
Thomas Erlebach},
title = {Algorithms for Dynamic {NFV} Workload},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {238--258},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_15},
doi = {10.1007/978-3-030-04693-4\_15},
timestamp = {Mon, 03 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/FairsteinNR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/Geissmann18,
author = {Barbara Geissmann},
editor = {Leah Epstein and
Thomas Erlebach},
title = {Longest Increasing Subsequence Under Persistent Comparison Errors},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {259--276},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_16},
doi = {10.1007/978-3-030-04693-4\_16},
timestamp = {Mon, 03 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/Geissmann18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/IkedaT18,
author = {Motoki Ikeda and
Shin{-}ichi Tanigawa},
editor = {Leah Epstein and
Thomas Erlebach},
title = {Cut Sparsifiers for Balanced Digraphs},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {277--294},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_17},
doi = {10.1007/978-3-030-04693-4\_17},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/IkedaT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/OlverPSSS18,
author = {Neil Olver and
Kirk Pruhs and
Kevin Schewior and
Ren{\'{e}} Sitters and
Leen Stougie},
editor = {Leah Epstein and
Thomas Erlebach},
title = {The Itinerant List Update Problem},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {310--326},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_19},
doi = {10.1007/978-3-030-04693-4\_19},
timestamp = {Mon, 03 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/OlverPSSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/SagnolWT18,
author = {Guillaume Sagnol and
Daniel Schmidt genannt Waldschmidt and
Alexander Tesch},
editor = {Leah Epstein and
Thomas Erlebach},
title = {The Price of Fixed Assignments in Stochastic Extensible Bin Packing},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {327--347},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_20},
doi = {10.1007/978-3-030-04693-4\_20},
timestamp = {Mon, 03 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/SagnolWT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/Woeginger18,
author = {Gerhard J. Woeginger},
editor = {Leah Epstein and
Thomas Erlebach},
title = {Some Easy and Some Not so Easy Geometric Optimization Problems},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {3--18},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_1},
doi = {10.1007/978-3-030-04693-4\_1},
timestamp = {Mon, 03 Dec 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/Woeginger18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/waoa/2018,
editor = {Leah Epstein and
Thomas Erlebach},
title = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4},
doi = {10.1007/978-3-030-04693-4},
isbn = {978-3-030-04692-7},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/2018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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 2025-02-10 04:12 CET 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:
