Maximilian Fürst

17 papers Misc 1Journal 16
YearRankTypeTitle / Venue / Authors
2022 J jnl
Acyclic matchings in graphs of bounded maximum degree.
Discret. Math.
Julien Baste, Maximilian Fürst, Dieter Rautenbach
2021 J jnl
Bounding and approximating minimum maximal matchings in regular graphs.
Discret. Math.
Julien Baste, Maximilian Fürst, Michael A. Henning, Elena Mohr, Dieter Rautenbach
2021 J jnl
Uniquely restricted matchings in subcubic graphs without short cycles.
J. Graph Theory
Maximilian Fürst, Dieter Rautenbach
2020 J jnl
A short proof for a lower bound on the zero forcing number.
Discuss. Math. Graph Theory
Maximilian Fürst, Dieter Rautenbach
2020 Misc conf
Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies.
COCOON
Julien Baste, Maximilian Fürst, Dieter Rautenbach
2020 J jnl
Domination versus edge domination.
Discret. Appl. Math.
Julien Baste, Maximilian Fürst, Michael A. Henning, Elena Mohr, Dieter Rautenbach
2020 J jnl
Equating
Discuss. Math. Graph Theory
Maximilian Fürst, Michael Gentner, Michael A. Henning, Simon Jäger, Dieter Rautenbach
2020 J jnl
Linear programming based approximation for unweighted induced matchings - Breaking the Δ barrier.
Discret. Optim.
Julien Baste, Maximilian Fürst, Dieter Rautenbach
2020 J jnl
On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs.
Theor. Comput. Sci.
Maximilian Fürst, Dieter Rautenbach
2019 J jnl
Lower Bounds on the Uniquely Restricted Matching Number.
Graphs Comb.
Maximilian Fürst, Dieter Rautenbach
2019 J jnl
On some hard and some tractable cases of the maximum acyclic matching problem.
Ann. Oper. Res.
Maximilian Fürst, Dieter Rautenbach
2019 J jnl
On the hardness of deciding the equality of the induced and the uniquely restricted matching number.
Inf. Process. Lett.
Maximilian Fürst
2019 J jnl
Uniquely restricted matchings in subcubic graphs.
Discret. Appl. Math.
Maximilian Fürst, Michael A. Henning, Dieter Rautenbach
2018 J jnl
A lower bound on the acyclic matching number of subcubic graphs.
Discret. Math.
Maximilian Fürst, Dieter Rautenbach
2018 J jnl
Locally searching for large induced matchings.
Theor. Comput. Sci.
Maximilian Fürst, Marilena Leichter, Dieter Rautenbach
2018 J jnl
On some graphs with a unique perfect matching.
Inf. Process. Lett.
Steven Chaplick, Maximilian Fürst, Frédéric Maffray, Dieter Rautenbach
2017 J jnl
On some Graphs with a Unique Perfect Matching.
CoRR
Steven Chaplick, Maximilian Fürst, Frédéric Maffray, Dieter Rautenbach