Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/waoa/waoa2021.bht:"
download as .bib file
@inproceedings{DBLP:conf/waoa/BansalC21,
author = {Nikhil Bansal and
Ilan Reuven Cohen},
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {Contention Resolution, Matrix Scaling and Fair Allocation},
booktitle = {Approximation and Online Algorithms - 19th International Workshop,
{WAOA} 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12982},
pages = {252--274},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8\_16},
doi = {10.1007/978-3-030-92702-8\_16},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/BansalC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BienkowskiBKRSV21,
author = {Marcin Bienkowski and
Martin B{\"{o}}hm and
Martin Kouteck{\'{y}} and
Thomas Rothvo{\ss} and
Jir{\'{\i}} Sgall and
Pavel Vesel{\'{y}}},
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {Improved Analysis of Online Balanced Clustering},
booktitle = {Approximation and Online Algorithms - 19th International Workshop,
{WAOA} 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12982},
pages = {224--233},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8\_14},
doi = {10.1007/978-3-030-92702-8\_14},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/BienkowskiBKRSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BlazejCKKSV21,
author = {V{\'{a}}clav Blazej and
Pratibha Choudhary and
Dusan Knop and
Jan Maty{\'{a}}s Kristan and
Ondrej Such{\'{y}} and
Tom{\'{a}}s Valla},
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {Constant Factor Approximation for Tracking Paths and Fault Tolerant
Feedback Vertex Set},
booktitle = {Approximation and Online Algorithms - 19th International Workshop,
{WAOA} 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12982},
pages = {23--38},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8\_2},
doi = {10.1007/978-3-030-92702-8\_2},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/BlazejCKKSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/CohenCZ21,
author = {Ilan Reuven Cohen and
Izack Cohen and
Iyar Zaks},
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {Weighted Completion Time Minimization for Capacitated Parallel Machines},
booktitle = {Approximation and Online Algorithms - 19th International Workshop,
{WAOA} 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12982},
pages = {130--143},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8\_9},
doi = {10.1007/978-3-030-92702-8\_9},
timestamp = {Fri, 14 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/CohenCZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/DisserKW21,
author = {Yann Disser and
Max Klimm and
David Weckbecker},
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {Fractionally Subadditive Maximization Under an Incremental Knapsack
Constraint},
booktitle = {Approximation and Online Algorithms - 19th International Workshop,
{WAOA} 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12982},
pages = {206--223},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8\_13},
doi = {10.1007/978-3-030-92702-8\_13},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/DisserKW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/DudyczMM21,
author = {Szymon Dudycz and
Pasin Manurangsi and
Jan Marcinkowski},
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs
and Related Problems},
booktitle = {Approximation and Online Algorithms - 19th International Workshop,
{WAOA} 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12982},
pages = {48--64},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8\_4},
doi = {10.1007/978-3-030-92702-8\_4},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/DudyczMM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/Epstein21,
author = {Leah Epstein},
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {Several Methods of Analysis for Cardinality Constrained Bin Packing},
booktitle = {Approximation and Online Algorithms - 19th International Workshop,
{WAOA} 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12982},
pages = {117--129},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8\_8},
doi = {10.1007/978-3-030-92702-8\_8},
timestamp = {Fri, 14 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/Epstein21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/FujitoT21,
author = {Toshihiro Fujito and
Takumi Tatematsu},
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {On b-Matchings and b-Edge Dominating Sets: {A} 2-Approximation Algorithm
for the 4-Edge Dominating Set Problem},
booktitle = {Approximation and Online Algorithms - 19th International Workshop,
{WAOA} 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12982},
pages = {65--79},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8\_5},
doi = {10.1007/978-3-030-92702-8\_5},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/FujitoT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/GalvezSS21,
author = {Waldo G{\'{a}}lvez and
Francisco Sanhueza{-}Matamala and
Jos{\'{e}} A. Soto},
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {Approximation Algorithms for Vertex-Connectivity Augmentation on the
Cycle},
booktitle = {Approximation and Online Algorithms - 19th International Workshop,
{WAOA} 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12982},
pages = {1--22},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8\_1},
doi = {10.1007/978-3-030-92702-8\_1},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/GalvezSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/GilibertiK21,
author = {Jeff Giliberti and
Andreas Karrenbauer},
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {Improved Online Algorithm for Fractional Knapsack in the Random Order
Model},
booktitle = {Approximation and Online Algorithms - 19th International Workshop,
{WAOA} 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12982},
pages = {188--205},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8\_12},
doi = {10.1007/978-3-030-92702-8\_12},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/GilibertiK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/HuizingS21,
author = {Dylan Huizing and
Guido Sch{\"{a}}fer},
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {The Traveling k-Median Problem: Approximating Optimal Network Coverage},
booktitle = {Approximation and Online Algorithms - 19th International Workshop,
{WAOA} 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12982},
pages = {80--98},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8\_6},
doi = {10.1007/978-3-030-92702-8\_6},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/HuizingS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/JaykrishnanL21,
author = {G. Jaykrishnan and
Asaf Levin},
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {{EPTAS} for Load Balancing Problem on Parallel Machines with a Non-renewable
Resource},
booktitle = {Approximation and Online Algorithms - 19th International Workshop,
{WAOA} 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12982},
pages = {99--116},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8\_7},
doi = {10.1007/978-3-030-92702-8\_7},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/JaykrishnanL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/KolliopoulosS21,
author = {Stavros G. Kolliopoulos and
Antonis Skarlatos},
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {Precedence-Constrained Covering Problems with Multiplicity Constraints},
booktitle = {Approximation and Online Algorithms - 19th International Workshop,
{WAOA} 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12982},
pages = {234--251},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8\_15},
doi = {10.1007/978-3-030-92702-8\_15},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/KolliopoulosS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/MaackHP21,
author = {Marten Maack and
Friedhelm Meyer auf der Heide and
Simon Pukrop},
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {Server Cloud Scheduling},
booktitle = {Approximation and Online Algorithms - 19th International Workshop,
{WAOA} 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12982},
pages = {144--164},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8\_10},
doi = {10.1007/978-3-030-92702-8\_10},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/MaackHP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/Sun21,
author = {Hao Sun},
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {An Improved Approximation Bound for Minimum Weight Dominating Set
on Graphs of Bounded Arboricity},
booktitle = {Approximation and Online Algorithms - 19th International Workshop,
{WAOA} 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12982},
pages = {39--47},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8\_3},
doi = {10.1007/978-3-030-92702-8\_3},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/Sun21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/TauerK21,
author = {Bjoern Tauer and
Laura Vargas Koch},
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {{FIFO} and Randomized Competitive Packet Routing Games},
booktitle = {Approximation and Online Algorithms - 19th International Workshop,
{WAOA} 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12982},
pages = {165--187},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8\_11},
doi = {10.1007/978-3-030-92702-8\_11},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/TauerK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/waoa/2021,
editor = {Jochen K{\"{o}}nemann and
Britta Peis},
title = {Approximation and Online Algorithms - 19th International Workshop,
{WAOA} 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12982},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92702-8},
doi = {10.1007/978-3-030-92702-8},
isbn = {978-3-030-92701-1},
timestamp = {Fri, 14 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/2021.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-06-06 05:13 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:
