The following pages link to On the induced matching problem (Q657915):
Displayed 16 items.
- Maximum matching in multi-interface networks (Q393046) (← links)
- Maximum induced matching of hexagonal graphs (Q726519) (← links)
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability (Q1680511) (← links)
- Parameterized algorithms and kernels for almost induced matching (Q2210504) (← links)
- New kernels for several problems on planar graphs (Q2285156) (← links)
- Moderately exponential time algorithms for the maximum induced matching problem (Q2355320) (← links)
- Perfectly matched sets in graphs: parameterized and exact computation (Q2697539) (← links)
- Almost Induced Matching: Linear Kernels and Parameterized Algorithms (Q3181060) (← links)
- Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
- A faster algorithm for maximum independent set on interval filament graphs (Q5084714) (← links)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
- Parameterized complexity of perfectly matched sets (Q6038698) (← links)
- Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
- Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
- Essentially tight kernels for (weakly) closed graphs (Q6103524) (← links)