Pages that link to "Item:Q1028465"
From MaRDI portal
The following pages link to The parameterized complexity of the induced matching problem (Q1028465):
Displaying 39 items.
- Kernelization of edge perfect code and its variants (Q317422) (← links)
- On graphs with induced matching number almost equal to matching number (Q324703) (← links)
- Planar graph vertex partition for linear problem kernels (Q355502) (← links)
- Improved induced matchings in sparse graphs (Q608287) (← links)
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
- Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
- On distance-3 matchings and induced matchings (Q716178) (← links)
- The parameterized complexity of \(k\)-edge induced subgraphs (Q729817) (← links)
- Parameterized complexity of finding connected induced subgraphs (Q897959) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- Approximating weighted induced matchings (Q1752475) (← links)
- Towards optimal kernel for connected vertex cover in planar graphs (Q1949125) (← links)
- On the induced matching problem in Hamiltonian bipartite graphs (Q2059914) (← links)
- Parameterized algorithms and kernels for almost induced matching (Q2210504) (← links)
- New kernels for several problems on planar graphs (Q2285156) (← links)
- On some matching problems under the color-spanning model (Q2319899) (← links)
- Maximum induced matchings close to maximum matchings (Q2348267) (← links)
- Moderately exponential time algorithms for the maximum induced matching problem (Q2355320) (← links)
- On the complexity of various parameterizations of common induced subgraph isomorphism (Q2405897) (← links)
- Exact algorithms for maximum induced matching (Q2407101) (← links)
- Maximum common induced subgraph parameterized by vertex cover (Q2445395) (← links)
- FPT and kernelization algorithms for the induced tree problem (Q2692722) (← links)
- Perfectly matched sets in graphs: parameterized and exact computation (Q2697539) (← links)
- Almost Induced Matching: Linear Kernels and Parameterized Algorithms (Q3181060) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Improved Induced Matchings in Sparse Graphs (Q3656857) (← links)
- On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model (Q4632199) (← links)
- (Q4691905) (← links)
- (Q4691914) (← links)
- Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem (Q5131709) (← links)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
- Hardness of computing width parameters based on branch decompositions over the vertex set (Q5890909) (← links)
- Hardness of computing width parameters based on branch decompositions over the vertex set (Q5899662) (← links)
- Disconnected matchings (Q5925688) (← links)
- Disconnected matchings (Q5972267) (← links)
- Parameterized complexity of perfectly matched sets (Q6038698) (← links)
- On the parameterized complexity of the acyclic matching problem (Q6038700) (← links)
