Yann Disser
Technische Universität Darmstadt
H-index: 18
Europe-Germany
Top articles of Yann Disser
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows
SIAM Journal on Discrete Mathematics
2024/3/31
Yann Disser
H-Index: 12
Max Klimm
H-Index: 14
Unified greedy approximability beyond submodular maximization
SIAM Journal on Discrete Mathematics
2024/3/31
Yann Disser
H-Index: 12
A -Approximation for Tricolored Non-crossing Euclidean TSP
arXiv preprint arXiv:2402.13938
2024/2/21
Yann Disser
H-Index: 12
Andreas Emil Feldmann
H-Index: 9
Tight analysis of the lazy algorithm for open online dial-a-ride
2023/7/28
Yann Disser
H-Index: 12
Incremental maximization via continuization
2023
An exponential lower bound for Zadeh’s pivot rule
Mathematical Programming
2023/5
Yann Disser
H-Index: 12
Oliver Friedmann
H-Index: 10
Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition
Annals of Operations Research
2023/3
The Space Complexity of Undirected Graph Exploration
2023/1/18
Yann Disser
H-Index: 12
Max Klimm
H-Index: 14
Breaking the Size Barrier: Universal Circuits meet Lookup Tables
2023/12/4
A unified worst case for classical simplex and policy iteration pivot rules
arXiv preprint arXiv:2309.14034
2023/9/25
Yann Disser
H-Index: 12
Exploration of graphs with excluded minors
arXiv preprint arXiv:2308.06823
2023/8/13
Yann Disser
H-Index: 12
An improved algorithm for open online dial-a-ride
2022/9/8
Yann Disser
H-Index: 12
On sparse hitting sets: From fair vertex cover to highway dimension
arXiv preprint arXiv:2208.14132
2022/8/30
Johannes Blum
H-Index: 3
Yann Disser
H-Index: 12
Andreas Emil Feldmann
H-Index: 9
Siddharth Gupta
H-Index: 4
General bounds for incremental maximization
Mathematical Programming
2022/2
Aaron Bernstein
H-Index: 17
Yann Disser
H-Index: 12
An improved lower bound for competitive graph exploration
Theoretical Computer Science
2021/5/8
Yann Disser
H-Index: 12
Collaborative delivery on a fixed path with homogeneous energy-constrained agents
2019/7/1
Travelling on graphs with small highway dimension
Algorithmica
2021/5
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles
arXiv preprint arXiv:2006.00571
2020/6
Collaborative delivery with energy-constrained mobile robots
Theoretical Computer Science
2020/3/2
Co-Authors
