Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint. - Yann Disser; Max Klimm; David Weckbecker (WAOA, 2021)

An Improved Algorithm for Open Online Dial-a-Ride. - Júlia Baligács; Yann Disser; Nils Mosis; David Weckbecker (WAOA, 2022)

Tight analysis of lazy: an improved algorithm for open online dial-a-ride. - Júlia Baligács; Yann Disser; David Weckbecker (CoRR, 2022)

Incremental Maximization via Continuization. - Yann Disser; Max Klimm; Kevin Schewior; David Weckbecker (ICALP, 2023)

Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride. - Júlia Baligács; Yann Disser; Farehe Soheil; David Weckbecker (WADS, 2023)

Competitive Analysis for Incremental Maximization - David Weckbecker (2024)

Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows. - Yann Disser; Max Klimm; Annette Lutz; David Weckbecker (SIAM J. Discret. Math., 2024)

Unified Greedy Approximability beyond Submodular Maximization. - Yann Disser; David Weckbecker (SIAM J. Discret. Math., 2024)