default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Abels
Person information
- affiliation: University of Bonn, Department of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i9]Andreas Abels, Mariia Anapolska:
Interval-Constrained Bipartite Matching over Time. CoRR abs/2402.18469 (2024)- 2023
- [c11]Andreas Abels
, Elias Pitschmann, Daniel Schmand:
Prophet Inequalities over Time. EC 2023: 1-20 - 2022
- [c10]Andreas Abels, Leon Ladewig, Kevin Schewior, Moritz Stinzendörfer:
Knapsack Secretary Through Boosting. WAOA 2022: 61-81 - [i8]Andreas Abels, Leon Ladewig, Kevin Schewior, Moritz Stinzendörfer:
Knapsack Secretary Through Boosting. CoRR abs/2208.05396 (2022) - [i7]Andreas Abels, Elias Pitschmann, Daniel Schmand:
Prophet-Inequalities over Time. CoRR abs/2211.10471 (2022) - 2020
- [j2]Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis:
Hiring Secretaries over Time: The Benefit of Concurrent Employment. Math. Oper. Res. 45(1): 323-352 (2020)
2010 – 2019
- 2019
- [c9]Max Klimm, Daniel Schmand, Andreas Tönnis:
The Online Best Reply Algorithm for Resource Allocation Problems. SAGT 2019: 200-215 - 2018
- [j1]Thomas Kesselheim, Klaus Radke, Andreas Tönnis, Berthold Vöcking:
Primal Beats Dual on Online Packing LPs in the Random-Order Model. SIAM J. Comput. 47(5): 1939-1964 (2018) - [c8]Fábio Botler, Andrés Cristi, Ruben Hoeksma, Kevin Schewior, Andreas Tönnis:
SUPERSET: A (Super)Natural Variant of the Card Game SET. FUN 2018: 12:1-12:17 - [c7]Antonios Antoniadis, Carsten Fischer, Andreas Tönnis:
A Collection of Lower Bounds for Online Matching on the Line. LATIN 2018: 52-65 - [i6]Max Klimm, Daniel Schmand, Andreas Tönnis:
Online Best Reply Algorithms for Resource Allocation Problems. CoRR abs/1805.02526 (2018) - 2017
- [c6]Thomas Kesselheim, Andreas Tönnis:
Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints. APPROX-RANDOM 2017: 16:1-16:22 - [i5]Antonios Antoniadis, Carsten Fischer, Andreas Tönnis:
A Collection of Lower Bounds for Online Matching on the Line. CoRR abs/1712.07099 (2017) - 2016
- [c5]Thomas Kesselheim, Andreas Tönnis:
Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions. ESA 2016: 54:1-54:17 - [i4]Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis:
Hiring Secretaries over Time: The Benefit of Concurrent Employment. CoRR abs/1604.08125 (2016) - [i3]Thomas Kesselheim, Andreas Tönnis:
Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions. CoRR abs/1606.06926 (2016) - [i2]Thomas Kesselheim, Andreas Tönnis:
Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints. CoRR abs/1607.08805 (2016) - 2015
- [c4]Oliver Göbel, Thomas Kesselheim, Andreas Tönnis:
Online Appointment Scheduling in the Random Order Model. ESA 2015: 680-692 - 2014
- [c3]Andreas Tönnis:
Mechanism Design for Combinatorial Auctions. Joint Workshop of the German Research Training Groups in Computer Science 2014: 49 - [c2]Thomas Kesselheim, Klaus Radke, Andreas Tönnis, Berthold Vöcking:
Primal beats dual on online packing LPs in the random-order model. STOC 2014: 303-312 - 2013
- [c1]Thomas Kesselheim, Klaus Radke, Andreas Tönnis, Berthold Vöcking:
An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions. ESA 2013: 589-600 - [i1]Thomas Kesselheim, Klaus Radke, Andreas Tönnis, Berthold Vöcking:
Primal Beats Dual on Online Packing LPs in the Random-Order Model. CoRR abs/1311.2578 (2013)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
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:
