Pages that link to "Item:Q608287"
From MaRDI portal
The following pages link to Improved induced matchings in sparse graphs (Q608287):
Displaying 8 items.
- Induced matchings in subcubic graphs without short cycles (Q393187) (← links)
- Towards optimal kernel for connected vertex cover in planar graphs (Q1949125) (← 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)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
- Parameterized complexity of perfectly matched sets (Q6038698) (← links)
- Essentially tight kernels for (weakly) closed graphs (Q6103524) (← links)
