Maximilian Fürst

Publication Activity (10 Years)

Years Active: 2017-2022
Publications (10 Years): 17

Top Topics

Top Venues

Inf. Process. Lett.

Discret. Appl. Math.

Discuss. Math. Graph Theory

Publications

Julien Baste, Maximilian Fürst, Dieter Rautenbach
Acyclic matchings in graphs of bounded maximum degree. Discret. Math. 345 (7) (2022)
Julien Baste, Maximilian Fürst, Michael A. Henning, Elena Mohr, Dieter Rautenbach
Bounding and approximating minimum maximal matchings in regular graphs. Discret. Math. 344 (3) (2021)
Maximilian Fürst, Dieter Rautenbach
Uniquely restricted matchings in subcubic graphs without short cycles. J. Graph Theory 96 (4) (2021)
Maximilian Fürst, Dieter Rautenbach
On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs. Theor. Comput. Sci. 804 (2020)
Julien Baste, Maximilian Fürst, Dieter Rautenbach
Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies. COCOON (2020)
Maximilian Fürst, Dieter Rautenbach
A short proof for a lower bound on the zero forcing number. Discuss. Math. Graph Theory 40 (1) (2020)
Julien Baste, Maximilian Fürst, Dieter Rautenbach
Linear programming based approximation for unweighted induced matchings - Breaking the Δ barrier. Discret. Optim. 38 (2020)
Maximilian Fürst, Michael Gentner, Michael A. Henning, Simon Jäger, Dieter Rautenbach
maximum degrees in graphs without short cycles. Discuss. Math. Graph Theory 40 (3) (2020)
Julien Baste, Maximilian Fürst, Michael A. Henning, Elena Mohr, Dieter Rautenbach
Domination versus edge domination. Discret. Appl. Math. 285 (2020)
Maximilian Fürst
On the hardness of deciding the equality of the induced and the uniquely restricted matching number. Inf. Process. Lett. 147 (2019)
Maximilian Fürst, Dieter Rautenbach
On some hard and some tractable cases of the maximum acyclic matching problem. Ann. Oper. Res. 279 (1-2) (2019)
Maximilian Fürst, Michael A. Henning, Dieter Rautenbach
Uniquely restricted matchings in subcubic graphs. Discret. Appl. Math. 262 (2019)
Maximilian Fürst, Dieter Rautenbach
Lower Bounds on the Uniquely Restricted Matching Number. Graphs Comb. 35 (1) (2019)
Steven Chaplick, Maximilian Fürst, Frédéric Maffray, Dieter Rautenbach
On some graphs with a unique perfect matching. Inf. Process. Lett. 139 (2018)
Maximilian Fürst, Marilena Leichter, Dieter Rautenbach
Locally searching for large induced matchings. Theor. Comput. Sci. 720 (2018)
Maximilian Fürst, Dieter Rautenbach
A lower bound on the acyclic matching number of subcubic graphs. Discret. Math. 341 (8) (2018)
Steven Chaplick, Maximilian Fürst, Frédéric Maffray, Dieter Rautenbach
On some Graphs with a Unique Perfect Matching. CoRR (2017)