On the complexity of minimum maximal acyclic matchings

Cites Work

Title not available (Why is that?)
Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover
On the max min vertex cover problem
A simplified NP-complete satisfiability problem
Approximability results for the maximum and minimum maximal induced matching problems
NP-completeness of some generalizations of the maximum matching problem
Optimization, approximation, and complexity classes
Induced matchings
On the complexity of minimum cardinality maximal uniquely restricted matching in graphs
The many facets of upper domination
Generalized subgraph-restricted matchings in graphs
Independent domination in graphs: A survey and recent results
On some hard and some tractable cases of the maximum acyclic matching problem
Acyclic matching in some subclasses of graphs
On the maximum uniquely restricted matching for bipartite graphs
Uniquely Restricted Matchings in Interval Graphs
A Linear Algorithm for Computing of a Minimum Weight Maximal Induced Matching in an Edge-Weighted Tree
Node-Deletion NP-Complete Problems
Edge Dominating Sets in Graphs
Perfect Elimination and Chordal Bipartite Graphs
Paths, Trees, and Flowers
On the complexity of minimum maximal uniquely restricted matching
Uniquely restricted matchings
Disconnected matchings
In)approximability of Maximum Minimal FVS
Minimum maximal acyclic matching in proper interval graphs
Weighted connected matchings
Parameterized Results on Acyclic Matchings with Implications for Related Problems
$\mathcal{P}$-matchings Parameterized by Treewidth