معرفی
Professor Yann Disser is a faculty member in the Department of Mathematics at TU Darmstadt since 2021. He previously held an Assistant Professor (tenure-track) position at TU Darmstadt (2016-2021), a PostDoc position at TU Berlin (2012-2016), and a Visiting Professor role at Augsburg University (2015). His research spans Combinatorial Optimization, Online Algorithms, Graph Exploration, Computational Complexity, and Robust Optimization.
- Current position: Professor (W2), TU Darmstadt
- Previous: Assistant Professor (2016-2021), TU Darmstadt
- PostDoc & Habilitation: TU Berlin (2012-2016)
His research focuses on algorithmic approaches to optimization problems, including:
- Combinatorial Optimization for problems like Steiner trees and knapsack variants
- Online Algorithms with applications to scheduling and transportation
- Graph Exploration by mobile agents and complexity bounds
- Computational Complexity of linear programming pivot rules
- Network Flows and geometric reconstruction
Recent publications analyze incremental maximization with greedy methods, lower bounds for active-set methods, and universal circuit designs. His work appears in top venues like IPCO, ESA, and SODA.
He advises a team of researchers including David Weckbecker, Farehe Soheil, and Alexander Birx. Current and past advisees often focus on algorithmic theory, with placements at institutions like HPI Potsdam and Merck.
