Stefan Lendl

Stefan Lendl is a Researcher at the Institute of Discrete Mathematics of Graz University of Technology, Austria. His work focuses on combinatorial optimization, computational complexity, and graph theory, with applications in operations research and robust optimization.

• Research Interests: Robust optimization, graph algorithms, scheduling, facility location, transportation problems, and computational complexity of NP-hard problems.
• Key Collaborations: Frequent co-authorship with researchers like L. Wulf, M. Goerigk, G.J. Woeginger, and others.
• Grants: Involved in projects like FFG Basisprogramm (Kleinprojekt) for robust tactical transport planning and WTZ Scientific & Technological Cooperation with Slovenia.

Recent Publications analyze problems in robust optimization, graph algorithms, and NP-hardness, with a focus on transportation, scheduling, and facility location. He has submitted manuscripts on rescheduling, obnoxious facility dispersion, and complexity of multi-stage robustness.