( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods.

, , , , и . ICALP (2), том 8573 из Lecture Notes in Computer Science, стр. 508-519. Springer, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Thomas Keßelheim

Christoph Kesselheim

Jürgen Kesselheim

Michael Kesselheim

Walter Kesselheim

 

Другие публикации лиц с тем же именем

Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates.. ESA, том 7501 из Lecture Notes in Computer Science, стр. 659-670. Springer, (2012)Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round., , и . EC, стр. 187-201. ACM, (2015)Simplified Prophet Inequalities for Combinatorial Auctions., и . SOSA, стр. 381-389. SIAM, (2023)Supermodular Approximation of Norms and Applications., , и . CoRR, (2024)Asymptotically Optimal Welfare of Posted Pricing for Multiple Items with MHR Distributions., , и . ESA, том 204 из LIPIcs, стр. 22:1-22:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Dynamic packet scheduling in wireless networks.. PODC, стр. 281-290. ACM, (2012)A Constant-Factor Approximation for Wireless Capacity Maximization with Power Control in the SINR Model.. SODA, стр. 1549-1559. SIAM, (2011)Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier., , и . SODA, стр. 653-661. SIAM, (2021)Knapsack Secretary with Bursty Adversary., и . ICALP, том 168 из LIPIcs, стр. 72:1-72:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Multi-agent Contracts., , , и . STOC, стр. 1311-1324. ACM, (2023)