David Weckbecker

According to our database, David Weckbecker authored at least 9 papers between 2021 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

Incremental Maximization for a Broad Class of Objectives.

Yann Disser, David Weckbecker

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

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., March, 2024

Competitive Analysis for Incremental Maximization

David Weckbecker

PhD thesis, 2024

2023

Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride.

Júlia Baligács, Yann Disser, Farehe Soheil, David Weckbecker

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Incremental Maximization via Continuization.

Yann Disser, Max Klimm, Kevin Schewior, David Weckbecker

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Tight analysis of lazy: an improved algorithm for open online dial-a-ride.

Júlia Baligács, Yann Disser, David Weckbecker

CoRR, 2022

An Improved Algorithm for Open Online Dial-a-Ride.

Júlia Baligács, Yann Disser, Nils Mosis, David Weckbecker

Proceedings of the Approximation and Online Algorithms - 20th International Workshop, 2022

Unified Greedy Approximability Beyond Submodular Maximization.

Yann Disser, David Weckbecker

Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

2021

Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint.

Yann Disser, Max Klimm, David Weckbecker

Proceedings of the Approximation and Online Algorithms - 19th International Workshop, 2021