معرفی
Dr. Maximilian Fürst is a researcher at the Institute of Optimization and Operations Research of the University of Ulm, focusing on graph theory, discrete mathematics, and algorithmic complexity. His work primarily investigates matching problems in graphs, including uniquely restricted matchings, induced matchings, and acyclic matchings, with applications in theoretical computer science and optimization.
Research Interests:
- Graph Theory (matching theory, subcubic graphs, cycle-free graphs)
- Operations Research (approximation algorithms, linear programming)
- Computational Complexity (NP-hardness, graph invariants)
- Discrete Mathematics (combinatorics, degree sequences)
Trends in Recent Publications: His publications emphasize theoretical analysis of graph problems, particularly matching-related algorithms and bounds. Key areas include hardness proofs, approximation methods, and extremal graph theory, with collaborations across European institutions.
Teaching: He has taught courses such as Optimization and OR 2 and Graph Theory 2 at the University of Ulm since 2017.
Collaborations: Regularly works with colleagues like Dr. Julien Baste, Prof. Dieter Rautenbach, and Prof. Michael A. Henning on graph theory and optimization challenges.
