The following pages link to On the Induced Matching Problem (Q4910736):
Displaying 16 items.
- Improved induced matchings in sparse graphs (Q608287) (← links)
- On the induced matching problem (Q657915) (← links)
- Improved kernels for several problems on planar graphs (Q777291) (← links)
- Linear kernelizations for restricted 3-Hitting Set problems (Q989471) (← links)
- The parameterized complexity of the induced matching problem (Q1028465) (← links)
- On the approximability of the maximum induced matching problem (Q1775017) (← links)
- On the induced matching problem in Hamiltonian bipartite graphs (Q2059914) (← links)
- New kernels for several problems on planar graphs (Q2285156) (← links)
- Exact algorithms for maximum induced matching (Q2407101) (← links)
- Safe Approximation and Its Relation to Kernelization (Q2891346) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- Improved Induced Matchings in Sparse Graphs (Q3656857) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem (Q5131709) (← links)
- On the Problem of Multiple Matching (Q5841844) (← links)
- A simple matching domain with indifferences and a master list (Q6156344) (← links)