Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Kesselheim
Thomas Keßelheim
Person information
- affiliation: University of Bonn, Germany
- affiliation (former): TU Dortmund, Department of Computer Science, Germany
- affiliation (former): Max Planck Institute for Informatics, Saarbrücken, Germany
- affiliation (former): RWTH Aachen University, Department of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2012
[b1]Thomas Keßelheim:
Approximation algorithms for spectrum allocation and power control in wireless networks. RWTH Aachen University, 2012, pp. 1-162
Journal Articles
- 2022
- [j14]Paul Dütting
, Thomas Kesselheim:
Best-response dynamics in combinatorial auctions with item bidding. Games Econ. Behav. 134: 428-448 (2022) - 2021
- [j13]Paul Dütting, Thomas Kesselheim, Éva Tardos:
Algorithms as Mechanisms: The Price of Anarchy of Relax and Round. Math. Oper. Res. 46(1): 317-335 (2021) - 2020
- [j12]Paul Dütting, Michal Feldman, Thomas Kesselheim, Brendan Lucier:
Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs. SIAM J. Comput. 49(3): 540-582 (2020) - [j11]Paul Dütting, Thomas Kesselheim, Brendan Lucier:
An O(log log m) prophet inequality for subadditive combinatorial auctions. SIGecom Exch. 18(2): 32-37 (2020) - 2018
- [j10]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) - 2016
- [j9]Martin Hoefer, Thomas Kesselheim, Berthold Vöcking:
Truthfulness and Stochastic Dominance with Monetary Transfers. ACM Trans. Economics and Comput. 4(2): 11:1-11:18 (2016) - [j8]Johannes Dams, Martin Hoefer, Thomas Kesselheim:
Jamming-Resistant Learning in Wireless Networks. IEEE/ACM Trans. Netw. 24(5): 2809-2818 (2016) - 2015
- [j7]Paul Dütting, Thomas Kesselheim, Éva Tardos:
Algorithms as mechanisms: the price of anarchy of relax-and-round. SIGecom Exch. 14(2): 22-25 (2015) - [j6]Martin Hoefer, Thomas Kesselheim:
Secondary Spectrum Auctions for Symmetric and Submodular Bidders. ACM Trans. Economics and Comput. 3(2): 9:1-9:25 (2015) - [j5]Johannes Dams, Martin Hoefer, Thomas Kesselheim:
Scheduling in Wireless Networks with Rayleigh-Fading Interference. IEEE Trans. Mob. Comput. 14(7): 1503-1514 (2015) - 2014
- [j4]Lukas Belke, Thomas Kesselheim, Arie M. C. A. Koster, Berthold Vöcking:
Comparative study of approximation algorithms and heuristics for SINR scheduling with power control. Theor. Comput. Sci. 553: 64-73 (2014) - [j3]Martin Hoefer, Thomas Kesselheim, Berthold Vöcking:
Approximation Algorithms for Secondary Spectrum Auctions. ACM Trans. Internet Techn. 14(2-3): 16:1-16:24 (2014) - 2012
- [j2]Johannes Dams, Martin Hoefer, Thomas Kesselheim:
Convergence Time of Power-Control Dynamics. IEEE J. Sel. Areas Commun. 30(11): 2231-2237 (2012) - 2011
- [j1]Alexander Fanghänel, Thomas Kesselheim, Berthold Vöcking:
Improved algorithms for latency minimization in wireless networks. Theor. Comput. Sci. 412(24): 2657-2667 (2011)
Conference and Workshop Papers
- 2024
- [c46]Khashayar Gatmiry, Thomas Kesselheim, Sahil Singla, Yifan Wang:
Bandit Algorithms for Prophet Inequality and Pandora's Box. SODA 2024: 462-500 - 2023
- [c45]Thomas Kesselheim, Marco Molinaro, Sahil Singla:
Online and Bandit Algorithms Beyond ℓp Norms. SODA 2023: 1566-1593 - [c44]Alexander Braun, Thomas Kesselheim:
Simplified Prophet Inequalities for Combinatorial Auctions. SOSA 2023: 381-389 - [c43]Paul Dütting, Tomer Ezra, Michal Feldman, Thomas Kesselheim:
Multi-agent Contracts. STOC 2023: 1311-1324 - 2021
- [c42]Alexander Braun, Matthias Buttkus, Thomas Kesselheim:
Asymptotically Optimal Welfare of Posted Pricing for Multiple Items with MHR Distributions. ESA 2021: 22:1-22:16 - [c41]Paul Dütting, Tomer Ezra, Michal Feldman, Thomas Kesselheim:
Combinatorial Contracts. FOCS 2021: 815-826 - [c40]Alexander Braun, Thomas Kesselheim:
Truthful Mechanisms for Two-Sided Markets via Prophet Inequalities. EC 2021: 202-203 - [c39]Sepehr Assadi, Thomas Kesselheim, Sahil Singla:
Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier. SODA 2021: 653-661 - 2020
- [c38]Thomas Kesselheim, Sahil Singla:
Online Learning with Vector Costs and Bandits with Knapsacks. COLT 2020: 2286-2305 - [c37]Paul Dütting, Thomas Kesselheim, Brendan Lucier:
An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions. FOCS 2020: 306-317 - [c36]Thomas Kesselheim, Marco Molinaro:
Knapsack Secretary with Bursty Adversary. ICALP 2020: 72:1-72:15 - 2019
- [c35]Paul Dütting, Thomas Kesselheim:
Posted Pricing and Prophet Inequalities with Inaccurate Priors. EC 2019: 111-129 - [c34]Thomas Kesselheim, Alexandros Psomas, Shai Vardi:
How to Hire Secretaries with Stochastic Departures. WINE 2019: 343 - 2018
- [c33]Thomas Kesselheim, Bojana Kodric:
Price of Anarchy for Mechanisms with Risk-Averse Agents. ICALP 2018: 155:1-155:14 - [c32]Soheil Ehsani, MohammadTaghi Hajiaghayi, Thomas Kesselheim, Sahil Singla:
Prophet Secretary for Combinatorial Auctions and Matroids. SODA 2018: 700-714 - 2017
- [c31]Thomas Kesselheim, Andreas Tönnis:
Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints. APPROX-RANDOM 2017: 16:1-16:22 - [c30]Paul Duetting, Michal Feldman, Thomas Kesselheim, Brendan Lucier:
Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Non-Stochastic Inputs. FOCS 2017: 540-551 - [c29]Paul Dütting, Thomas Kesselheim:
Best-Response Dynamics in Combinatorial Auctions with Item Bidding. SODA 2017: 521-533 - 2016
- [c28]Thomas Kesselheim, Andreas Tönnis:
Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions. ESA 2016: 54:1-54:17 - [c27]Martin Hoefer, Thomas Kesselheim, Bojana Kodric:
Smoothness for Simultaneous Composition of Mechanisms with Admission. WINE 2016: 294-308 - 2015
- [c26]Oliver Göbel, Thomas Kesselheim, Andreas Tönnis:
Online Appointment Scheduling in the Random Order Model. ESA 2015: 680-692 - [c25]Paul Dütting, Thomas Kesselheim, Éva Tardos:
Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round. EC 2015: 187-201 - [c24]Thomas Kesselheim, Robert D. Kleinberg, Éva Tardos:
Smooth Online Mechanisms: A Game-Theoretic Problem in Renewable Energy Markets. EC 2015: 203-220 - [c23]Paul Dütting, Thomas Kesselheim:
Algorithms against Anarchy: Understanding Non-Truthful Mechanisms. EC 2015: 239-255 - [c22]Thomas Kesselheim, Robert D. Kleinberg, Rad Niazadeh:
Secretary Problems with Non-Uniform Arrival Order. STOC 2015: 879-888 - 2014
- [c21]Johannes Dams, Martin Hoefer, Thomas Kesselheim:
Jamming-Resistant Learning in Wireless Networks. ICALP (2) 2014: 447-458 - [c20]Oliver Göbel, Martin Hoefer, Thomas Kesselheim, Thomas Schleiden, Berthold Vöcking:
Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods. ICALP (2) 2014: 508-519 - [c19]Paul Dütting, Thomas Kesselheim, Éva Tardos:
Mechanism with unique learnable equilibria. EC 2014: 877-894 - [c18]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
- [c17]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 - [c16]Martin Hoefer, Thomas Kesselheim, Berthold Vöcking:
Truthfulness and stochastic dominance with monetary transfers. EC 2013: 567-582 - [c15]Martin Hoefer, Thomas Kesselheim:
Brief announcement: universally truthful secondary spectrum auctions. SPAA 2013: 99-101 - [c14]Johannes Dams, Martin Hoefer, Thomas Kesselheim:
Sleeping Experts in Wireless Networks. DISC 2013: 344-357 - 2012
- [c13]Thomas Kesselheim:
Approximation Algorithms for Wireless Spectrum Allocation with Power Control. ALGOSENSORS 2012: 1-3 - [c12]Lukas Belke, Thomas Kesselheim, Arie M. C. A. Koster, Berthold Vöcking:
Comparative Study of Approximation Algorithms and Heuristics for SINR Scheduling with Power Control. ALGOSENSORS 2012: 30-41 - [c11]Thomas Kesselheim:
Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates. ESA 2012: 659-670 - [c10]Thomas Kesselheim:
Dynamic packet scheduling in wireless networks. PODC 2012: 281-290 - [c9]Martin Hoefer, Thomas Kesselheim:
Secondary spectrum auctions for symmetric and submodular bidders. EC 2012: 657-671 - [c8]Johannes Dams, Martin Hoefer, Thomas Kesselheim:
Scheduling in wireless networks with rayleigh-fading interference. SPAA 2012: 327-335 - 2011
- [c7]Johannes Dams, Martin Hoefer, Thomas Kesselheim:
Convergence Time of Power-Control Dynamics. ICALP (2) 2011: 637-649 - [c6]Thomas Kesselheim:
A Constant-Factor Approximation for Wireless Capacity Maximization with Power Control in the SINR Model. SODA 2011: 1549-1559 - [c5]Martin Hoefer, Thomas Kesselheim, Berthold Vöcking:
Approximation algorithms for secondary spectrum auctions. SPAA 2011: 177-186 - 2010
- [c4]Thomas Kesselheim, Berthold Vöcking:
Brief announcement: distributed contention resolution in wireless networks. PODC 2010: 124-125 - [c3]Thomas Kesselheim, Berthold Vöcking:
Distributed Contention Resolution in Wireless Networks. DISC 2010: 163-178 - 2009
- [c2]Alexander Fanghänel, Thomas Keßelheim, Berthold Vöcking:
Improved Algorithms for Latency Minimization in Wireless Networks. ICALP (2) 2009: 447-458 - [c1]Alexander Fanghänel, Thomas Kesselheim, Harald Räcke, Berthold Vöcking:
Oblivious interference scheduling. PODC 2009: 220-229
Parts in Books or Collections
- 2012
- [p1]Thomas Keßelheim:
Approximationsalgorithmen für Spektrumsallokation und Power Control in Funknetzwerken. Ausgezeichnete Informatikdissertationen 2012: 161-170
Informal and Other Publications
- 2022
- [i30]Thomas Kesselheim, Marco Molinaro, Sahil Singla:
Online and Bandit Algorithms Beyond 𝓁p Norms. CoRR abs/2210.13755 (2022) - [i29]Alexander Braun, Thomas Kesselheim:
Simplified Prophet Inequalities for Combinatorial Auctions. CoRR abs/2211.00707 (2022) - [i28]Paul Duetting, Tomer Ezra, Michal Feldman, Thomas Kesselheim:
Multi-Agent Contracts. CoRR abs/2211.05434 (2022) - [i27]Khashayar Gatmiry, Thomas Kesselheim, Sahil Singla, Yifan Wang:
Bandit Algorithms for Prophet Inequality and Pandora's Box. CoRR abs/2211.08586 (2022) - 2021
- [i26]Alexander Braun, Thomas Kesselheim:
Truthful Mechanisms for Two-Sided Markets via Prophet Inequalities. CoRR abs/2105.15032 (2021) - [i25]Alexander Braun, Matthias Buttkus, Thomas Kesselheim:
Asymptotically Optimal Welfare of Posted Pricing for Multiple Items with MHR Distributions. CoRR abs/2107.00526 (2021) - [i24]Paul Duetting, Tomer Ezra, Michal Feldman, Thomas Kesselheim:
Combinatorial Contracts. CoRR abs/2109.14260 (2021) - 2020
- [i23]Paul Dütting, Thomas Kesselheim, Brendan Lucier:
An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions. CoRR abs/2004.09784 (2020) - [i22]Thomas Kesselheim, Marco Molinaro:
Knapsack Secretary with Bursty Adversary. CoRR abs/2006.11607 (2020) - [i21]Sepehr Assadi, Thomas Kesselheim, Sahil Singla:
Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier. CoRR abs/2010.01420 (2020) - [i20]Thomas Kesselheim, Sahil Singla:
Online Learning with Vector Costs and Bandits with Knapsacks. CoRR abs/2010.07346 (2020) - 2019
- [i19]Thomas Kesselheim, Alexandros Psomas, Shai Vardi:
How to Hire Secretaries with Stochastic Departures. CoRR abs/1909.08660 (2019) - 2018
- [i18]Thomas Kesselheim, Bojana Kodric:
Price of Anarchy for Mechanisms with Risk-Averse Agents. CoRR abs/1804.09468 (2018) - 2017
- [i17]Soheil Ehsani, MohammadTaghi Hajiaghayi, Thomas Kesselheim, Sahil Singla:
Prophet Secretary for Combinatorial Auctions and Matroids. CoRR abs/1710.11213 (2017) - 2016
- [i16]Thomas Kesselheim, Andreas Tönnis:
Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions. CoRR abs/1606.06926 (2016) - [i15]Paul Dütting, Thomas Kesselheim:
Best-Response Dynamics in Combinatorial Auctions with Item Bidding. CoRR abs/1607.04149 (2016) - [i14]Thomas Kesselheim, Andreas Tönnis:
Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints. CoRR abs/1607.08805 (2016) - [i13]Paul Dütting, Michal Feldman, Thomas Kesselheim, Brendan Lucier:
Posted Prices, Smoothness, and Combinatorial Prophet Inequalities. CoRR abs/1612.03161 (2016) - 2015
- [i12]Thomas Kesselheim, Robert D. Kleinberg, Rad Niazadeh:
Secretary Problems with Non-Uniform Arrival Order. CoRR abs/1502.02155 (2015) - [i11]Martin Hoefer, Thomas Kesselheim, Bojana Kodric:
Smoothness for Simultaneous Composition of Mechanisms with Admission. CoRR abs/1509.00337 (2015) - [i10]Paul Dütting, Thomas Kesselheim, Éva Tardos:
Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round. CoRR abs/1511.09208 (2015) - 2013
- [i9]Martin Hoefer, Thomas Kesselheim:
Universally Truthful Secondary Spectrum Auctions. CoRR abs/1305.2350 (2013) - [i8]Oliver Göbel, Martin Hoefer, Thomas Kesselheim, Thomas Schleiden, Berthold Vöcking:
Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods. CoRR abs/1307.3192 (2013) - [i7]Johannes Dams, Martin Hoefer, Thomas Kesselheim:
Jamming-Resistant Learning in Wireless Networks. CoRR abs/1307.5290 (2013) - [i6]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) - 2012
- [i5]Thomas Kesselheim:
Dynamic Packet Scheduling in Wireless Networks. CoRR abs/1203.1226 (2012) - [i4]Thomas Kesselheim:
Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates. CoRR abs/1205.1331 (2012) - 2011
- [i3]Martin Hoefer, Thomas Kesselheim:
Secondary Spectrum Auctions for Symmetric and Submodular Bidders. CoRR abs/1110.5753 (2011) - 2010
- [i2]Thomas Kesselheim:
A Constant-Factor Approximation for Wireless Capacity Maximization with Power Control in the SINR Model. CoRR abs/1007.1611 (2010) - [i1]Martin Hoefer, Thomas Kesselheim, Berthold Vöcking:
Approximation Algorithms for Secondary Spectrum Auctions. CoRR abs/1007.5032 (2010)
Coauthor Index
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.
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-05-08 23:39 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:
