default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Andreas Abels
@article{DBLP:journals/corr/abs-2402-18469,
author = {Andreas Abels and
Mariia Anapolska},
title = {Interval-Constrained Bipartite Matching over Time},
journal = {CoRR},
volume = {abs/2402.18469},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.18469},
doi = {10.48550/ARXIV.2402.18469},
eprinttype = {arXiv},
eprint = {2402.18469},
timestamp = {Tue, 26 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-18469.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/AbelsPS23,
author = {Andreas Abels and
Elias Pitschmann and
Daniel Schmand},
editor = {Kevin Leyton{-}Brown and
Jason D. Hartline and
Larry Samuelson},
title = {Prophet Inequalities over Time},
booktitle = {Proceedings of the 24th {ACM} Conference on Economics and Computation,
{EC} 2023, London, United Kingdom, July 9-12, 2023},
pages = {1--20},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3580507.3597741},
doi = {10.1145/3580507.3597741},
timestamp = {Fri, 21 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sigecom/AbelsPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/AbelsLSS22,
author = {Andreas Abels and
Leon Ladewig and
Kevin Schewior and
Moritz Stinzend{\"{o}}rfer},
editor = {Parinya Chalermsook and
Bundit Laekhanukit},
title = {Knapsack Secretary Through Boosting},
booktitle = {Approximation and Online Algorithms - 20th International Workshop,
{WAOA} 2022, Potsdam, Germany, September 8-9, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13538},
pages = {61--81},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-18367-6\_4},
doi = {10.1007/978-3-031-18367-6\_4},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/AbelsLSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-05396,
author = {Andreas Abels and
Leon Ladewig and
Kevin Schewior and
Moritz Stinzend{\"{o}}rfer},
title = {Knapsack Secretary Through Boosting},
journal = {CoRR},
volume = {abs/2208.05396},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.05396},
doi = {10.48550/ARXIV.2208.05396},
eprinttype = {arXiv},
eprint = {2208.05396},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-05396.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-10471,
author = {Andreas Abels and
Elias Pitschmann and
Daniel Schmand},
title = {Prophet-Inequalities over Time},
journal = {CoRR},
volume = {abs/2211.10471},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.10471},
doi = {10.48550/ARXIV.2211.10471},
eprinttype = {arXiv},
eprint = {2211.10471},
timestamp = {Thu, 24 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-10471.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/DisserFGGKSST20,
author = {Yann Disser and
John Fearnley and
Martin Gairing and
Oliver G{\"{o}}bel and
Max Klimm and
Daniel Schmand and
Alexander Skopalik and
Andreas T{\"{o}}nnis},
title = {Hiring Secretaries over Time: The Benefit of Concurrent Employment},
journal = {Math. Oper. Res.},
volume = {45},
number = {1},
pages = {323--352},
year = {2020},
url = {https://doi.org/10.1287/moor.2019.0993},
doi = {10.1287/MOOR.2019.0993},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/DisserFGGKSST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/KlimmST19,
author = {Max Klimm and
Daniel Schmand and
Andreas T{\"{o}}nnis},
editor = {Dimitris Fotakis and
Evangelos Markakis},
title = {The Online Best Reply Algorithm for Resource Allocation Problems},
booktitle = {Algorithmic Game Theory - 12th International Symposium, {SAGT} 2019,
Athens, Greece, September 30 - October 3, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11801},
pages = {200--215},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-30473-7\_14},
doi = {10.1007/978-3-030-30473-7\_14},
timestamp = {Thu, 24 Mar 2022 11:08:57 +0100},
biburl = {https://dblp.org/rec/conf/sagt/KlimmST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KesselheimRTV18,
author = {Thomas Kesselheim and
Klaus Radke and
Andreas T{\"{o}}nnis and
Berthold V{\"{o}}cking},
title = {Primal Beats Dual on Online Packing LPs in the Random-Order Model},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {5},
pages = {1939--1964},
year = {2018},
url = {https://doi.org/10.1137/15M1033708},
doi = {10.1137/15M1033708},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KesselheimRTV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/BotlerCHST18,
author = {F{\'{a}}bio Botler and
Andr{\'{e}}s Cristi and
Ruben Hoeksma and
Kevin Schewior and
Andreas T{\"{o}}nnis},
editor = {Hiro Ito and
Stefano Leonardi and
Linda Pagli and
Giuseppe Prencipe},
title = {{SUPERSET:} {A} (Super)Natural Variant of the Card Game {SET}},
booktitle = {9th International Conference on Fun with Algorithms, {FUN} 2018, June
13-15, 2018, La Maddalena, Italy},
series = {LIPIcs},
volume = {100},
pages = {12:1--12:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.FUN.2018.12},
doi = {10.4230/LIPICS.FUN.2018.12},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/fun/BotlerCHST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/AntoniadisFT18,
author = {Antonios Antoniadis and
Carsten Fischer and
Andreas T{\"{o}}nnis},
editor = {Michael A. Bender and
Martin Farach{-}Colton and
Miguel A. Mosteiro},
title = {A Collection of Lower Bounds for Online Matching on the Line},
booktitle = {{LATIN} 2018: Theoretical Informatics - 13th Latin American Symposium,
Buenos Aires, Argentina, April 16-19, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10807},
pages = {52--65},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-77404-6\_5},
doi = {10.1007/978-3-319-77404-6\_5},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/AntoniadisFT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-02526,
author = {Max Klimm and
Daniel Schmand and
Andreas T{\"{o}}nnis},
title = {Online Best Reply Algorithms for Resource Allocation Problems},
journal = {CoRR},
volume = {abs/1805.02526},
year = {2018},
url = {http://arxiv.org/abs/1805.02526},
eprinttype = {arXiv},
eprint = {1805.02526},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-02526.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/KesselheimT17,
author = {Thomas Kesselheim and
Andreas T{\"{o}}nnis},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {16:1--16:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.16},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.16},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/KesselheimT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-07099,
author = {Antonios Antoniadis and
Carsten Fischer and
Andreas T{\"{o}}nnis},
title = {A Collection of Lower Bounds for Online Matching on the Line},
journal = {CoRR},
volume = {abs/1712.07099},
year = {2017},
url = {http://arxiv.org/abs/1712.07099},
eprinttype = {arXiv},
eprint = {1712.07099},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-07099.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KesselheimT16,
author = {Thomas Kesselheim and
Andreas T{\"{o}}nnis},
editor = {Piotr Sankowski and
Christos D. Zaroliagis},
title = {Think Eternally: Improved Algorithms for the Temp Secretary Problem
and Extensions},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {57},
pages = {54:1--54:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ESA.2016.54},
doi = {10.4230/LIPICS.ESA.2016.54},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/KesselheimT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DisserFG0KSST16,
author = {Yann Disser and
John Fearnley and
Martin Gairing and
Oliver G{\"{o}}bel and
Max Klimm and
Daniel Schmand and
Alexander Skopalik and
Andreas T{\"{o}}nnis},
title = {Hiring Secretaries over Time: The Benefit of Concurrent Employment},
journal = {CoRR},
volume = {abs/1604.08125},
year = {2016},
url = {http://arxiv.org/abs/1604.08125},
eprinttype = {arXiv},
eprint = {1604.08125},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DisserFG0KSST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KesselheimT16,
author = {Thomas Kesselheim and
Andreas T{\"{o}}nnis},
title = {Think Eternally: Improved Algorithms for the Temp Secretary Problem
and Extensions},
journal = {CoRR},
volume = {abs/1606.06926},
year = {2016},
url = {http://arxiv.org/abs/1606.06926},
eprinttype = {arXiv},
eprint = {1606.06926},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KesselheimT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KesselheimT16a,
author = {Thomas Kesselheim and
Andreas T{\"{o}}nnis},
title = {Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints},
journal = {CoRR},
volume = {abs/1607.08805},
year = {2016},
url = {http://arxiv.org/abs/1607.08805},
eprinttype = {arXiv},
eprint = {1607.08805},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KesselheimT16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/0002KT15,
author = {Oliver G{\"{o}}bel and
Thomas Kesselheim and
Andreas T{\"{o}}nnis},
editor = {Nikhil Bansal and
Irene Finocchi},
title = {Online Appointment Scheduling in the Random Order Model},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
Greece, September 14-16, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9294},
pages = {680--692},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48350-3\_57},
doi = {10.1007/978-3-662-48350-3\_57},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/esa/0002KT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dfg/Tonnis14,
author = {Andreas T{\"{o}}nnis},
editor = {Anja Jentzsch and
Tobias Pape and
Sebastian Pasewaldt},
title = {Mechanism Design for Combinatorial Auctions},
booktitle = {Proceedings of the 8th Joint Workshop of the German Research Training
Groups in Computer Science - Dagstuhl 2014, Dagstuhl, Germany, June
15-18, 2014},
pages = {49},
publisher = {Pro Business GmbH},
year = {2014},
timestamp = {Wed, 03 Jun 2020 14:50:52 +0200},
biburl = {https://dblp.org/rec/conf/dfg/Tonnis14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KesselheimTRV14,
author = {Thomas Kesselheim and
Klaus Radke and
Andreas T{\"{o}}nnis and
Berthold V{\"{o}}cking},
editor = {David B. Shmoys},
title = {Primal beats dual on online packing LPs in the random-order model},
booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
May 31 - June 03, 2014},
pages = {303--312},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2591796.2591810},
doi = {10.1145/2591796.2591810},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KesselheimTRV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KesselheimRTV13,
author = {Thomas Kesselheim and
Klaus Radke and
Andreas T{\"{o}}nnis and
Berthold V{\"{o}}cking},
editor = {Hans L. Bodlaender and
Giuseppe F. Italiano},
title = {An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions
to Combinatorial Auctions},
booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
France, September 2-4, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8125},
pages = {589--600},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40450-4\_50},
doi = {10.1007/978-3-642-40450-4\_50},
timestamp = {Mon, 03 Jan 2022 22:19:39 +0100},
biburl = {https://dblp.org/rec/conf/esa/KesselheimRTV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KesselheimRTV13,
author = {Thomas Kesselheim and
Klaus Radke and
Andreas T{\"{o}}nnis and
Berthold V{\"{o}}cking},
title = {Primal Beats Dual on Online Packing LPs in the Random-Order Model},
journal = {CoRR},
volume = {abs/1311.2578},
year = {2013},
url = {http://arxiv.org/abs/1311.2578},
eprinttype = {arXiv},
eprint = {1311.2578},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KesselheimRTV13.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.
last updated on 2024-08-05 21:17 CEST 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:
