Pages that link to "Item:Q1140988"

The following pages link to The node-deletion problem for hereditary properties is NP-complete (Q1140988):

Displaying 50 items.

• Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover (Q266943) (← links)
• Augmenting approach for some maximum set problems (Q284765) (← links)
• Chordal editing is fixed-parameter tractable (Q300460) (← links)
• Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
• Reducing rank of the adjacency matrix by graph modification (Q344771) (← links)
• Graph editing to a fixed target (Q344855) (← links)
• Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
• Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
• Minimum \(d\)-blockers and \(d\)-transversals in graphs (Q411244) (← links)
• Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions (Q414467) (← links)
• The \textsc{max quasi-independent set} problem (Q434194) (← links)
• Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
• PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
• Approximate association via dissociation (Q505447) (← links)
• The topological defense in SIS epidemic models (Q508188) (← links)
• Unit interval editing is fixed-parameter tractable (Q515577) (← links)
• Efficient stabilization of cooperative matching games (Q526875) (← links)
• On the parameterized complexity of reconfiguration problems (Q527426) (← links)
• A structural characterization for certifying Robinsonian matrices (Q529005) (← links)
• Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
• Matching interdiction (Q602686) (← links)
• Parameterized complexity of even/odd subgraph problems (Q635735) (← links)
• The maximum \(k\)-colorable subgraph problem and orbitopes (Q666000) (← links)
• Minimal obstructions for partial representations of interval graphs (Q668026) (← links)
• Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
• Dynamic parameterized problems (Q722546) (← links)
• Approximability of clique transversal in perfect graphs (Q724231) (← links)
• Editing to a planar graph of given degrees (Q730508) (← links)
• A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
• Edge-contraction problems (Q794164) (← links)
• Isolation concepts for efficiently enumerating dense subgraphs (Q837155) (← links)
• Editing to Eulerian graphs (Q896016) (← links)
• Parameterized complexity of finding connected induced subgraphs (Q897959) (← links)
• An FPT algorithm for the vertex cover \(P_4\) problem (Q906446) (← links)
• Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties (Q955347) (← links)
• Chordal deletion is fixed-parameter tractable (Q973007) (← links)
• Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
• Parameterized complexity of finding regular induced subgraphs (Q1026227) (← links)
• A new approach for approximating node deletion problems (Q1029021) (← links)
• Blockers and transversals (Q1043948) (← links)
• The complexity of counting homeomorphs (Q1058852) (← links)
• Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
• Scheduling jobs with fixed start and end times (Q1098765) (← links)
• A probabilistic estimator for the vertex deletion problem (Q1130419) (← links)
• \(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems (Q1177173) (← links)
• A unified approximation algorithm for node-deletion problems (Q1270821) (← links)
• Deterministic generalized automata (Q1285583) (← links)
• Variable and term removal from Boolean formulae (Q1363769) (← links)
• Finding optimal subgraphs by local search (Q1392027) (← links)
• Local approximations for maximum partial subgraph problem. (Q1426723) (← links)