Pages that link to "Item:Q1853579"

The following pages link to Parameterized complexity of finding subgraphs with hereditary properties. (Q1853579):

Displaying 50 items.

• Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
• Local search: is brute-force avoidable? (Q439931) (← links)
• On the parameterized complexity of reconfiguration problems (Q527426) (← links)
• Parameterized complexity of even/odd subgraph problems (Q635735) (← links)
• Hardness of subgraph and supergraph problems in \(c\)-tournaments (Q638528) (← links)
• Dynamic parameterized problems (Q722546) (← links)
• Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
• The parameterized complexity of \(k\)-edge induced subgraphs (Q729817) (← links)
• Editing to a planar graph of given degrees (Q730508) (← links)
• Parameterized algorithms for feedback set problems and their duals in tournaments (Q820159) (← links)
• Additive approximation of generalized Turán questions (Q832525) (← links)
• A parameterized perspective on packing paths of length two (Q849135) (← links)
• The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
• Parameterized complexity of finding connected induced subgraphs (Q897959) (← links)
• Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles (Q958211) (← links)
• Parameterizing above or below guaranteed values (Q1004602) (← links)
• Parameterized complexity of finding regular induced subgraphs (Q1026227) (← links)
• Almost 2-SAT is fixed-parameter tractable (Q1034100) (← links)
• Multivariate algorithmics for finding cohesive subnetworks (Q1736776) (← links)
• Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
• Computing the similarity of two sequences with nested arc annotations (Q1884953) (← links)
• Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity (Q2134740) (← links)
• Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes (Q2140500) (← links)
• List-coloring -- parameterizing from triviality (Q2173305) (← links)
• Parameterized aspects of strong subgraph closure (Q2182097) (← links)
• The parameterised complexity of counting connected subgraphs and graph motifs (Q2256721) (← links)
• Kernels for packing and covering problems (Q2272393) (← links)
• Faster graph bipartization (Q2301359) (← links)
• Tractability of König edge deletion problems (Q2333799) (← links)
• Editing to a graph of given degrees (Q2354405) (← links)
• Parameterized complexity of the induced subgraph problem in directed graphs (Q2380001) (← links)
• Editing to a connected graph of given degrees (Q2407094) (← links)
• Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
• The parameterized complexity of maximality and minimality problems (Q2470035) (← links)
• Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs (Q2828227) (← links)
• The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
• Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows (Q2908533) (← links)
• A Basic Parameterized Complexity Primer (Q2908536) (← links)
• What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
• Dual parameterization and parameterized approximability of subset graph problems (Q2969972) (← links)
• Parameterized Complexity of Eulerian Deletion Problems (Q3104771) (← links)
• Editing to a Planar Graph of Given Degrees (Q3194713) (← links)
• Wheel-Free Deletion Is W[2]-Hard (Q3503585) (← links)
• The Parameterized Complexity of Finding Point Sets with Hereditary Properties (Q5009473) (← links)
• Counting Small Induced Subgraphs Satisfying Monotone Properties (Q5071087) (← links)
• (Q5116487) (← links)
• Assessing the Computational Complexity of Multi-layer Subgraph Detection (Q5283362) (← links)
• (Q5743382) (← links)
• A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (Q5895104) (← links)
• On the parameterized complexity of the acyclic matching problem (Q6038700) (← links)