Dr. Maximilian Fürst

Wintersemester 2019/2020

• Optimization and OR 2

Sommersemester 2019

• Graph Theory 2 (odd)

Sommersemester 2018

• Graph Theory 2

Wintersemester 2017/18

• Optimization and OR 2

 

• With J. Baste and D. Rautenbach: Acyclic matching in graphs of bounded maximum degree Preprint
• With J. Baste, M.A. Henning, E. Mohr, and D. Rautenbach: Domination versus edge domination Preprint
• With J. Baste, M.A. Henning, E. Mohr, and D. Rautenbach: Bounding and approximating minimum maximal matchings in regular graphs Preprint
• On the hardness of deciding the equality of the induced and the uniquely restricted matching number, Information Processing Letters 147 (2019) 77-81 Preprint
• With J. Baste and D. Rautenbach: Linear programming based approximation for unweighted induced matchings --- breaking the $\Delta$ barrier Preprint
• With D. Rautenbach: Uniquely restricted matchings in subcubic graphs without short cycles Preprint
• With D. Rautenbach: On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs, Theoretical Computer Science 804 (2020) 126-138 Preprint
• With M.A. Henning and D. Rautenbach: Uniquely restricted matchings in subcubic graphs, Discrete Applied Mathematics 262 (2019) 189-194 Preprint
• With D. Rautenbach: Lower bounds on the uniquely restricted matching number, Graphs and Combinatorics 35 (2019) 353-361 Preprint
• With S. Chaplick, F. Maffray, and D. Rautenbach: On some Graphs with a Unique Perfect Matching,  Information Processing Letters 139 (2018) 60-63 Preprint
• With D. Rautenbach: A lower bound on the acyclic matching number of subcubic graphs, Discrete Mathematics 341 (2018) 2353-2358 Preprint
• With D. Rautenbach: On some hard and some tractable cases of the maximum acyclic matching problem, Annals of Operations Research 279 (2019) 291–300 Preprint
• With M. Leichter and D. Rautenbach: Locally Searching for Large Induced Matchings, Theoretical Computer Science 720 (2018) 64-72 Preprint
• With D. Rautenbach: A Short Proof for a Lower Bound on the Zero Forcing Number, Discussiones Mathematicae Graph Theory 40 (2020) 355-360 Preprint
• With M. Gentner, M.A. Henning, S. Jäger, and D. Rautenbach: Equating $k$ Maximum Degrees in Graphs without Short Cycles, to appear in Discussiones Mathematicae Graph Theory Preprint

 

• Restricted Matchings, PhD thesis (2019)