Pages that link to "Item:Q1026227"

The following pages link to Parameterized complexity of finding regular induced subgraphs (Q1026227):

Displaying 43 items.

• Induced 2-regular subgraphs in \(k\)-chordal cubic graphs (Q266935) (← links)
• Win-win kernelization for degree sequence completion problems (Q295647) (← links)
• On graphs with induced matching number almost equal to matching number (Q324703) (← links)
• Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
• Complexity of finding maximum regular induced subgraphs with prescribed degree (Q401302) (← links)
• Parameterized complexity of finding small degree-constrained subgraphs (Q414424) (← links)
• Editing graphs to satisfy degree constraints: a parameterized approach (Q414866) (← links)
• Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
• Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
• Induced cycles in graphs (Q503635) (← links)
• Graph editing to a given degree sequence (Q507592) (← links)
• Graph editing problems with extended regularity constraints (Q526874) (← links)
• Improved induced matchings in sparse graphs (Q608287) (← links)
• The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
• On the induced matching problem (Q657915) (← links)
• Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
• The parameterized complexity of \(k\)-edge induced subgraphs (Q729817) (← links)
• Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002) (← links)
• Editing to a planar graph of given degrees (Q730508) (← links)
• Editing to Eulerian graphs (Q896016) (← links)
• Exploiting hidden structure in selecting dimensions that distinguish vectors (Q899584) (← links)
• The parameterized complexity of editing graphs for bounded degeneracy (Q986553) (← links)
• Linear kernelizations for restricted 3-Hitting Set problems (Q989471) (← links)
• A parameterized algorithmics framework for degree sequence completion problems in directed graphs (Q1739111) (← links)
• The \(k\)-regular induced subgraph problem (Q1786867) (← links)
• Parameterized algorithms and kernels for almost induced matching (Q2210504) (← links)
• Kernels for packing and covering problems (Q2272393) (← links)
• On some matching problems under the color-spanning model (Q2319899) (← links)
• A refined complexity analysis of degree anonymization in graphs (Q2347809) (← links)
• Maximum induced matchings close to maximum matchings (Q2348267) (← links)
• Editing to a graph of given degrees (Q2354405) (← links)
• Moderately exponential time algorithms for the maximum induced matching problem (Q2355320) (← links)
• Editing to a connected graph of given degrees (Q2407094) (← links)
• Fixed-parameter tractable distances to sparse graph classes (Q2408199) (← links)
• Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
• Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
• Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs (Q2942649) (← links)
• Parameterized Complexity of Eulerian Deletion Problems (Q3104771) (← links)
• Almost Induced Matching: Linear Kernels and Parameterized Algorithms (Q3181060) (← links)
• Editing to a Planar Graph of Given Degrees (Q3194713) (← links)
• Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
• Streaming deletion problems Parameterized by vertex cover (Q6057830) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)