Pages that link to "Item:Q414866"

The following pages link to Editing graphs to satisfy degree constraints: a parameterized approach (Q414866):

Displaying 30 items.

• Win-win kernelization for degree sequence completion problems (Q295647) (← links)
• Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
• Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
• Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
• Circulant graphs and GCD and LCM of subsets (Q477605) (← links)
• Graph editing to a given degree sequence (Q507592) (← links)
• Graph editing problems with extended regularity constraints (Q526874) (← links)
• Editing to a planar graph of given degrees (Q730508) (← links)
• Editing to Eulerian graphs (Q896016) (← links)
• A parameterized algorithmics framework for degree sequence completion problems in directed graphs (Q1739111) (← links)
• Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming (Q1759676) (← links)
• Parameterized algorithms and kernels for almost induced matching (Q2210504) (← links)
• An improved linear kernel for the cycle contraction problem (Q2274484) (← links)
• A refined complexity analysis of degree anonymization in graphs (Q2347809) (← links)
• Editing to a graph of given degrees (Q2354405) (← links)
• Editing to a connected graph of given degrees (Q2407094) (← links)
• The complexity of degree anonymization by graph contractions (Q2407102) (← links)
• Fixed-parameter tractable distances to sparse graph classes (Q2408199) (← links)
• Parameterized complexity of firefighting (Q2453548) (← links)
• Building large \(k\)-cores from sparse graphs (Q2678255) (← links)
• Almost Induced Matching: Linear Kernels and Parameterized Algorithms (Q3181060) (← links)
• Editing to a Planar Graph of Given Degrees (Q3194713) (← links)
• (Q5089202) (← links)
• Editing to Connected F-Degree Graph (Q5232130) (← links)
• Graph Editing to a Given Degree Sequence (Q5740185) (← links)
• The complexity of gerrymandering over graphs: paths and trees (Q5918559) (← links)
• The complexity of gerrymandering over graphs: paths and trees (Q5925552) (← links)
• Disconnected matchings (Q5972267) (← links)
• How hard is safe bribery? (Q6057829) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)