Author of the publication

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Advice for Online Knapsack With Removable Items., , , and . CoRR, (2020)Moderately exponential time algorithms for the maximum bounded-degree-1 set problem., , , , , and . Discret. Appl. Math., (2018)Corrigendum: Decoding neuropathic pain: Can we predict fluctuations of propagation speed in stimulated peripheral nerve?, , , , , and . Frontiers Comput. Neurosci., (February 2023)Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs., , , , , and . J. Comput. Syst. Sci., (2019)Online Simple Knapsack with Bounded Predictions., , and . STACS, volume 289 of LIPIcs, page 37:1-37:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)The Secretary Problem with Reservation Costs., , , , and . COCOON, volume 13025 of Lecture Notes in Computer Science, page 553-564. Springer, (2021)Online Knapsack with Removal and Recourse., , , , , and . IWOCA, volume 13889 of Lecture Notes in Computer Science, page 123-135. Springer, (2023)Divide-and-Color, , , and . WG, volume 4271 of Lecture Notes in Computer Science, page 58-67. Springer, (2006)Optimal Average Case Sorting on Arrays., , , and . STACS, volume 900 of Lecture Notes in Computer Science, page 503-514. Springer, (1995)Online Node- and Edge-Deletion Problems with Advice., , , and . Algorithmica, 83 (9): 2719-2753 (2021)