Pages that link to "Item:Q3612599"
From MaRDI portal
The following pages link to The Parameterized Complexity of the Induced Matching Problem in Planar Graphs (Q3612599):
Displaying 9 items.
- A linear kernel for a planar connected dominating set (Q534569) (← links)
- On the induced matching problem (Q657915) (← links)
- Maximum induced matching of hexagonal graphs (Q726519) (← links)
- Linear kernelizations for restricted 3-Hitting Set problems (Q989471) (← links)
- Maximum induced matching algorithms via vertex ordering characterizations (Q1986960) (← links)
- On the induced matching problem in Hamiltonian bipartite graphs (Q2059914) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- Maximum Induced Matching Algorithms via Vertex Ordering Characterizations (Q5136263) (← links)
