Pages that link to "Item:Q414424"
From MaRDI portal
The following pages link to Parameterized complexity of finding small degree-constrained subgraphs (Q414424):
Displaying 15 items.
- Increasing the minimum degree of a graph by contractions (Q385061) (← links)
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002) (← links)
- Parameterized complexity of finding connected induced subgraphs (Q897959) (← links)
- On approximating the \(d\)-girth of a graph (Q2444552) (← links)
- Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints (Q2867069) (← links)
- Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization (Q2867073) (← links)
- On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges (Q2867087) (← links)
- Increasing the Minimum Degree of a Graph by Contractions (Q2891338) (← links)
- Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs (Q2942649) (← links)
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827) (← links)
- Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable (Q5111861) (← links)
- On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances (Q5369245) (← links)
- Minimum <i>k</i>‐cores and the <i>k</i>‐core polytope (Q6087566) (← links)
