Oblivious interference scheduling. - Alexander Fanghänel; Thomas Kesselheim; Harald Räcke; Berthold Vöcking (PODC, 2009)

Brief announcement: distributed contention resolution in wireless networks. - Thomas Kesselheim; Berthold Vöcking (PODC, 2010)

Distributed Contention Resolution in Wireless Networks. - Thomas Kesselheim; Berthold Vöcking (DISC, 2010)

A Constant-Factor Approximation for Wireless Capacity Maximization with Power Control in the SINR Model. - Thomas Kesselheim (SODA, 2011)

Improved algorithms for latency minimization in wireless networks. - Alexander Fanghänel; Thomas Kesselheim; Berthold Vöcking (Theor. Comput. Sci., 2011)

Approximation Algorithms for Wireless Spectrum Allocation with Power Control. - Thomas Kesselheim (ALGOSENSORS, 2012)

Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates. - Thomas Kesselheim (ESA, 2012)

Approximationsalgorithmen für Spektrumsallokation und Power Control in Funknetzwerken. - Thomas Keßelheim (Ausgezeichnete Informatikdissertationen, 2012)

Dynamic packet scheduling in wireless networks. - Thomas Kesselheim (PODC, 2012)

Convergence Time of Power-Control Dynamics. - Johannes Dams; Martin Hoefer 001; Thomas Kesselheim (IEEE J. Sel. Areas Commun., 2012)

Approximation algorithms for spectrum allocation and power control in wireless networks. - Thomas Keßelheim (2012)

An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions. - Thomas Kesselheim; Klaus Radke; Andreas Tönnis; Berthold Vöcking (ESA, 2013)

Brief announcement: universally truthful secondary spectrum auctions. - Martin Hoefer 001; Thomas Kesselheim (SPAA, 2013)

Sleeping Experts in Wireless Networks. - Johannes Dams; Martin Hoefer 001; Thomas Kesselheim (DISC, 2013)

Universally Truthful Secondary Spectrum Auctions - Martin Hoefer 001; Thomas Kesselheim (CoRR, 2013)

Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods. - Oliver Göbel 002; Martin Hoefer 001; Thomas Kesselheim; Thomas Schleiden; Berthold Vöcking (ICALP (2), 2014)

Mechanism with unique learnable equilibria. - Paul Dütting; Thomas Kesselheim; Éva Tardos (EC, 2014)

Comparative study of approximation algorithms and heuristics for SINR scheduling with power control. - Lukas Belke; Thomas Kesselheim; Arie M. C. A. Koster; Berthold Vöcking (Theor. Comput. Sci., 2014)

Approximation Algorithms for Secondary Spectrum Auctions. - Martin Hoefer 001; Thomas Kesselheim; Berthold Vöcking (ACM Trans. Internet Techn., 2014)

Online Appointment Scheduling in the Random Order Model. - Oliver Göbel 002; Thomas Kesselheim; Andreas Tönnis (ESA, 2015)

Algorithms against Anarchy: Understanding Non-Truthful Mechanisms. - Paul Dütting; Thomas Kesselheim (EC, 2015)

Smooth Online Mechanisms: A Game-Theoretic Problem in Renewable Energy Markets. - Thomas Kesselheim; Robert D. Kleinberg; Éva Tardos (EC, 2015)

Secretary Problems with Non-Uniform Arrival Order. - Thomas Kesselheim; Robert D. Kleinberg; Rad Niazadeh (STOC, 2015)

Secondary Spectrum Auctions for Symmetric and Submodular Bidders. - Martin Hoefer 001; Thomas Kesselheim (ACM Trans. Economics and Comput., 2015)

Scheduling in Wireless Networks with Rayleigh-Fading Interference. - Johannes Dams; Martin Hoefer 001; Thomas Kesselheim (IEEE Trans. Mob. Comput., 2015)

Think Eternally: Improved Algorithms for the Temp Secretary Problem and Extensions. - Thomas Kesselheim; Andreas Tönnis (ESA, 2016)

Smoothness for Simultaneous Composition of Mechanisms with Admission. - Martin Hoefer 001; Thomas Kesselheim; Bojana Kodric (WINE, 2016)

Posted Prices, Smoothness, and Combinatorial Prophet Inequalities. - Paul Dütting; Michal Feldman; Thomas Kesselheim; Brendan Lucier (CoRR, 2016)

Truthfulness and Stochastic Dominance with Monetary Transfers. - Martin Hoefer 001; Thomas Kesselheim; Berthold Vöcking (ACM Trans. Economics and Comput., 2016)

Jamming-Resistant Learning in Wireless Networks. - Johannes Dams; Martin Hoefer 001; Thomas Kesselheim (IEEE/ACM Trans. Netw., 2016)

Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints. - Thomas Kesselheim; Andreas Tönnis (APPROX-RANDOM, 2017)

Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Non-Stochastic Inputs. - Paul Duetting; Michal Feldman; Thomas Kesselheim; Brendan Lucier (FOCS, 2017)

Price of Anarchy for Mechanisms with Risk-Averse Agents. - Thomas Kesselheim; Bojana Kodric (ICALP, 2018)

Primal Beats Dual on Online Packing LPs in the Random-Order Model. - Thomas Kesselheim; Klaus Radke; Andreas Tönnis; Berthold Vöcking (SIAM J. Comput., 2018)

Posted Pricing and Prophet Inequalities with Inaccurate Priors. - Paul Dütting; Thomas Kesselheim (EC, 2019)

How to Hire Secretaries with Stochastic Departures. - Thomas Kesselheim; Alexandros Psomas 001; Shai Vardi (WINE, 2019)

Online Learning with Vector Costs and Bandits with Knapsacks. - Thomas Kesselheim; Sahil Singla 001 (COLT, 2020)

Knapsack Secretary with Bursty Adversary. - Thomas Kesselheim; Marco Molinaro 001 (ICALP, 2020)

Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs. - Paul Dütting; Michal Feldman; Thomas Kesselheim; Brendan Lucier (SIAM J. Comput., 2020)

Asymptotically Optimal Welfare of Posted Pricing for Multiple Items with MHR Distributions. - Alexander Braun; Matthias Buttkus; Thomas Kesselheim (ESA, 2021)

Combinatorial Contracts. - Paul Dütting; Tomer Ezra; Michal Feldman; Thomas Kesselheim (FOCS, 2021)

Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier. - Sepehr Assadi; Thomas Kesselheim; Sahil Singla 001 (SODA, 2021)

Algorithms as Mechanisms: The Price of Anarchy of Relax and Round. - Paul Dütting; Thomas Kesselheim; Éva Tardos (Math. Oper. Res., 2021)

Online and Bandit Algorithms Beyond 𝓁p Norms. - Thomas Kesselheim; Marco Molinaro 001; Sahil Singla 001 (CoRR, 2022)

Best-response dynamics in combinatorial auctions with item bidding. - Paul Dütting; Thomas Kesselheim (Games Econ. Behav., 2022)

Online and Bandit Algorithms Beyond ℓp Norms. - Thomas Kesselheim; Marco Molinaro 001; Sahil Singla 001 (SODA, 2023)

Simplified Prophet Inequalities for Combinatorial Auctions. - Alexander Braun; Thomas Kesselheim (SOSA, 2023)

Multi-agent Contracts. - Paul Dütting; Tomer Ezra; Michal Feldman; Thomas Kesselheim (STOC, 2023)

Truthful Mechanisms for Two-Sided Markets via Prophet Inequalities. - Alexander Braun; Thomas Kesselheim (Math. Oper. Res., 2023)

Online Combinatorial Allocations and Auctions with Few Samples. - Paul Dütting; Thomas Kesselheim; Brendan Lucier; Rebecca Reiffenhäuser; Sahil Singla 001 (FOCS, 2024)

Sample Complexity of Posted Pricing for a Single Item. - Billy Jin; Thomas Kesselheim; Will Ma; Sahil Singla 001 (NeurIPS, 2024)

Approximating Optimum Online for Capacitated Resource Allocation. - Alexander Braun; Thomas Kesselheim; Tristan Pollner; Amin Saberi (EC, 2024)

Bandit Algorithms for Prophet Inequality and Pandora's Box. - Khashayar Gatmiry; Thomas Kesselheim; Sahil Singla 001; Yifan Wang (SODA, 2024)

Supermodular Approximation of Norms and Applications. - Thomas Kesselheim; Marco Molinaro 001; Sahil Singla 001 (STOC, 2024)

Technical Note - On Hiring Secretaries with Stochastic Departures. - Thomas Kesselheim; Christos-Alexandros Psomas; Shai Vardi (Oper. Res., 2024)

An $O( log log m)$ Prophet Inequality for Subadditive Combinatorial Auctions. - Paul Dütting; Thomas Kesselheim; Brendan Lucier (SIAM J. Comput., 2024)

Prophet Secretary for Combinatorial Auctions and Matroids. - Soheil Ehsani; MohammadTaghi Hajiaghayi; Thomas Kesselheim; Sahil Singla 001 (SIAM J. Comput., 2024)

Contextual Learning for Stochastic Optimization. - Anna Heuser; Thomas Kesselheim (EC, 2025)

Multi-Agent Combinatorial Contracts. - Paul Dütting; Tomer Ezra; Michal Feldman; Thomas Kesselheim (SODA, 2025)