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

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

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 | 104 | 2013 |

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 |

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 | 85 | 2014 |

Prophet inequalities made easy: stochastic optimization by pricing nonstochastic inputs P Dütting, M Feldman, T Kesselheim, B Lucier SIAM Journal on Computing 49 (3), 540-582, 2020 | 74 | 2020 |

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 | 74 | 2011 |

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

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

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

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

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

Secondary Spectrum Auctions for Symmetric and Submodular Bidders M Hoefer, T Kesselheim ACM Transactions on Economics and Computation, 2015 | 34 | 2015 |

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

Improved algorithms for latency minimization in wireless networks A Fanghänel, T Kesselheim, B Vöcking Theoretical Computer Science 412 (24), 2657-2667, 2011 | 22 | 2011 |

Submodular secretary problems: Cardinality, matching, and linear constraints T Kesselheim, A Tönnis arXiv preprint arXiv:1607.08805, 2016 | 18 | 2016 |

Jamming-resistant learning in wireless networks J Dams, M Hoefer, T Kesselheim IEEE/ACM Transactions on Networking 24 (5), 2809-2818, 2015 | 15 | 2015 |

Best-response dynamics in combinatorial auctions with item bidding P Dütting, T Kesselheim Games and Economic Behavior, 2020 | 13 | 2020 |

Algorithms against anarchy: Understanding non-truthful mechanisms P Dütting, T Kesselheim Proceedings of the Sixteenth ACM Conference on Economics and Computation …, 2015 | 13 | 2015 |