Author of the publication

Incremental Maximization via Continuization.

, , , and . ICALP, volume 261 of LIPIcs, page 47:1-47:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

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

Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition., , and . Ann. Oper. Res., 322 (1): 467-496 (March 2023)Undirected Graph Exploration with ⊝(log log n) Pebbles., , and . SODA, page 25-39. SIAM, (2016)Exploration of Graphs with Excluded Minors., , , and . ESA, volume 274 of LIPIcs, page 11:1-11:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Incremental Maximization via Continuization., , , and . ICALP, volume 261 of LIPIcs, page 47:1-47:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Evacuating Two Robots from a Disk: A Second Cut., and . SIROCCO, volume 11639 of Lecture Notes in Computer Science, page 200-214. Springer, (2019)Unified greedy approximability beyond submodular maximization., and . CoRR, (2020)Improved Universal Circuits using Lookup Tables., , , , , and . IACR Cryptol. ePrint Arch., (2022)On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule., and . IPCO, volume 11480 of Lecture Notes in Computer Science, page 168-180. Springer, (2019)Recoloring Interval Graphs with Limited Recourse Budget., , , , and . SWAT, volume 162 of LIPIcs, page 17:1-17:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Tight Bounds for Online TSP on the Line., , , , , , , , and . ACM Trans. Algorithms, 17 (1): 3:1-3:58 (2021)