Maximilian Fürst

According to our database1, Maximilian Fürst authored at least 15 papers between 2018 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Uniquely restricted matchings in subcubic graphs without short cycles.
J. Graph Theory, 2021

Bounding and approximating minimum maximal matchings in regular graphs.
Discret. Math., 2021

2020
On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs.
Theor. Comput. Sci., 2020

A short proof for a lower bound on the zero forcing number.
Discuss. Math. Graph Theory, 2020

Equating <i>k</i> maximum degrees in graphs without short cycles.
Discuss. Math. Graph Theory, 2020

Linear programming based approximation for unweighted induced matchings - Breaking the Δ barrier.
Discret. Optim., 2020

Domination versus edge domination.
Discret. Appl. Math., 2020

Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies.
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.
Inf. Process. Lett., 2019

Lower Bounds on the Uniquely Restricted Matching Number.
Graphs Comb., 2019

Uniquely restricted matchings in subcubic graphs.
Discret. Appl. Math., 2019

On some hard and some tractable cases of the maximum acyclic matching problem.
Ann. Oper. Res., 2019

2018
Locally searching for large induced matchings.
Theor. Comput. Sci., 2018

On some graphs with a unique perfect matching.
Inf. Process. Lett., 2018

A lower bound on the acyclic matching number of subcubic graphs.
Discret. Math., 2018


  Loading...