An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions T Kesselheim, K Radke, A Tönnis, B Vöcking European symposium on algorithms, 589-600, 2013 | 174 | 2013 |

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 | 171 | 2010 |

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 | 167 | 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 | 138 | 2014 |

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 | 126 | 2018 |

Distributed contention resolution in wireless networks T Kesselheim, B Vöcking Distributed Computing, 163-178, 2010 | 126 | 2010 |

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 | 102 | 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 | 85 | 2011 |

Improved algorithms for latency minimization in wireless networks A Fanghänel, T Kesselheim, B Vöcking Automata, Languages and Programming, 447-458, 2009 | 85 | 2009 |

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 | 55 | 2020 |

Online independent set beyond the worst-case: Secretaries, prophets, and periods O Göbel, M Hoefer, T Kesselheim, T Schleiden, B Vöcking International Colloquium on Automata, Languages, and Programming, 508-519, 2014 | 54 | 2014 |

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 | 54 | 2012 |

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 | 49 | 2015 |

Dynamic packet scheduling in wireless networks T Kesselheim Proceedings of the 2012 ACM symposium on Principles of distributed computing …, 2012 | 44 | 2012 |

Combinatorial contracts P Dütting, T Ezra, M Feldman, T Kesselheim 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 42 | 2022 |

Approximation algorithms for wireless link scheduling with flexible data rates T Kesselheim European Symposium on Algorithms, 659-670, 2012 | 42 | 2012 |

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 | 35 | 2018 |

Multi-agent contracts P Dütting, T Ezra, M Feldman, T Kesselheim Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1311-1324, 2023 | 30 | 2023 |

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 | 26 | 2021 |