| A constant-factor approximation for wireless capacity maximization with power control in the SINR model T Kesselheim 22nd ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, 1549-1559, 2010 | 172 | 2010 |
| An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions T Kesselheim, K Radke, A Tönnis, B Vöcking Algorithms–ESA 2013: 21st Annual European Symposium, Sophia Antipolis …, 2013 | 156 | 2013 |
| Prophet inequalities made easy: Stochastic optimization by pricing nonstochastic inputs P Dutting, M Feldman, T Kesselheim, B Lucier SIAM Journal on Computing 49 (3), 540-582, 2020 | 141 | 2020 |
| Primal beats dual on online packing LPs in the random-order model T Kesselheim, A Tönnis, K Radke, B Vöcking Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 129 | 2014 |
| Distributed contention resolution in wireless networks T Kesselheim, B Vöcking Distributed Computing, 163-178, 2010 | 121 | 2010 |
| Prophet secretary for combinatorial auctions and matroids S Ehsani, MT Hajiaghayi, T Kesselheim, S Singla Proceedings of the twenty-ninth annual acm-siam symposium on discrete …, 2018 | 106 | 2018 |
| Oblivious interference scheduling A Fanghänel, T Kesselheim, H Räcke, B Vöcking Proceedings of the 28th ACM symposium on Principles of distributed computing …, 2009 | 101 | 2009 |
| Approximation algorithms for secondary spectrum auctions M Hoefer, T Kesselheim, B Vöcking Proceedings of the 23rd ACM symposium on Parallelism in algorithms and …, 2011 | 83 | 2011 |
| Improved algorithms for latency minimization in wireless networks A Fanghänel, T Kesselheim, B Vöcking Automata, Languages and Programming, 447-458, 2009 | 83 | 2009 |
| Scheduling in wireless networks with Rayleigh-fading interference J Dams, M Hoefer, T Kesselheim Proceedings of the 24th ACM symposium on Parallelism in algorithms and …, 2012 | 53 | 2012 |
| Online independent set beyond the worst-case: Secretaries, prophets, and periods O Göbel, M Hoefer, T Kesselheim, T Schleiden, B Vöcking Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014 | 49 | 2014 |
| Secretary Problems with Non-Uniform Arrival Order T Kesselheim, R Kleinberg, R Niazadeh Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015 | 45 | 2015 |
| Dynamic packet scheduling in wireless networks T Kesselheim Proceedings of the 2012 ACM symposium on Principles of distributed computing …, 2012 | 42 | 2012 |
| Approximation algorithms for wireless link scheduling with flexible data rates T Kesselheim Algorithms–ESA 2012: 20th Annual European Symposium, Ljubljana, Slovenia …, 2012 | 42 | 2012 |
| An o (log log m) prophet inequality for subadditive combinatorial auctions P Dütting, T Kesselheim, B Lucier ACM SIGecom Exchanges 18 (2), 32-37, 2020 | 37 | 2020 |
| Secondary Spectrum Auctions for Symmetric and Submodular Bidders M Hoefer, T Kesselheim ACM Transactions on Economics and Computation, 2015 | 37 | 2015 |
| Primal beats dual on online packing LPs in the random-order model T Kesselheim, K Radke, A Tonnis, B Vocking SIAM Journal on Computing 47 (5), 1939-1964, 2018 | 27 | 2018 |
| Algorithms against anarchy: Understanding non-truthful mechanisms P Dütting, T Kesselheim Proceedings of the Sixteenth ACM Conference on Economics and Computation …, 2015 | 22 | 2015 |
| Submodular secretary problems: Cardinality, matching, and linear constraints T Kesselheim, A Tönnis arXiv preprint arXiv:1607.08805, 2016 | 21 | 2016 |
| Improved truthful mechanisms for subadditive combinatorial auctions: Breaking the logarithmic barrier S Assadi, T Kesselheim, S Singla Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 17 | 2021 |
Berthold VöckingProfessor of Computer Science, RWTH Aachen UniversityZweryfikowany adres z cs.rwth-aachen.de
