Maximilian Fürst

According to our database, Maximilian Fürst authored at least 16 papers between 2018 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2022

Acyclic matchings in graphs of bounded maximum degree.

Julien Baste, Maximilian Fürst, Dieter Rautenbach

Discret. Math., 2022

2021

Uniquely restricted matchings in subcubic graphs without short cycles.

Maximilian Fürst, Dieter Rautenbach

J. Graph Theory, 2021

Bounding and approximating minimum maximal matchings in regular graphs.

Julien Baste, Maximilian Fürst, Michael A. Henning, Elena Mohr, Dieter Rautenbach

Discret. Math., 2021

2020

On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs.

Maximilian Fürst, Dieter Rautenbach

Theor. Comput. Sci., 2020

A short proof for a lower bound on the zero forcing number.

Maximilian Fürst, Dieter Rautenbach

Discuss. Math. Graph Theory, 2020

Equating <i>k</i> maximum degrees in graphs without short cycles.

Maximilian Fürst, Michael Gentner, Michael A. Henning, Simon Jäger, Dieter Rautenbach

Discuss. Math. Graph Theory, 2020

Linear programming based approximation for unweighted induced matchings - Breaking the Δ barrier.

Julien Baste, Maximilian Fürst, Dieter Rautenbach

Discret. Optim., 2020

Domination versus edge domination.

Julien Baste, Maximilian Fürst, Michael A. Henning, Elena Mohr, Dieter Rautenbach

Discret. Appl. Math., 2020

Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies.

Julien Baste, Maximilian Fürst, Dieter Rautenbach

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

On the hardness of deciding the equality of the induced and the uniquely restricted matching number.

Maximilian Fürst

Inf. Process. Lett., 2019

Lower Bounds on the Uniquely Restricted Matching Number.

Maximilian Fürst, Dieter Rautenbach

Graphs Comb., 2019

Uniquely restricted matchings in subcubic graphs.

Maximilian Fürst, Michael A. Henning, Dieter Rautenbach

Discret. Appl. Math., 2019

On some hard and some tractable cases of the maximum acyclic matching problem.

Maximilian Fürst, Dieter Rautenbach

Ann. Oper. Res., 2019

2018

Locally searching for large induced matchings.

Maximilian Fürst, Marilena Leichter, Dieter Rautenbach

Theor. Comput. Sci., 2018

On some graphs with a unique perfect matching.

Steven Chaplick, Maximilian Fürst, Frédéric Maffray, Dieter Rautenbach

Inf. Process. Lett., 2018

A lower bound on the acyclic matching number of subcubic graphs.

Maximilian Fürst, Dieter Rautenbach

Discret. Math., 2018