Pages that link to "Item:Q1352005"

The following pages link to Fixed-parameter tractability of graph modification problems for hereditary properties (Q1352005):

Displaying 50 items.

• A fast branching algorithm for cluster vertex deletion (Q255285) (← links)
• Structural parameterizations for boxicity (Q289935) (← links)
• Win-win kernelization for degree sequence completion problems (Q295647) (← links)
• Chordal editing is fixed-parameter tractable (Q300460) (← links)
• Reducing rank of the adjacency matrix by graph modification (Q344771) (← links)
• Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
• Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
• The cluster deletion problem for cographs (Q394219) (← links)
• Graph-based data clustering with overlaps (Q456688) (← links)
• A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
• A faster algorithm for the cluster editing problem on proper interval graphs (Q495665) (← links)
• Approximate association via dissociation (Q505447) (← links)
• Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
• Unit interval editing is fixed-parameter tractable (Q515577) (← links)
• Parameterized complexity of even/odd subgraph problems (Q635735) (← links)
• Editing graphs into disjoint unions of dense clusters (Q652530) (← links)
• Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
• A linear-time algorithm for computing the intersection of all odd cycles in a graph (Q674917) (← links)
• Complexity and parameterized algorithms for cograph editing (Q690461) (← links)
• Dynamic parameterized problems (Q722546) (← links)
• The parameterized complexity of \(k\)-edge induced subgraphs (Q729817) (← links)
• Editing to a planar graph of given degrees (Q730508) (← links)
• Minimal triangulations of graphs: a survey (Q819823) (← links)
• Parameterized coloring problems on chordal graphs (Q820152) (← links)
• On the effectiveness of the incremental approach to minimal chordal edge modification (Q820555) (← links)
• On structural parameterizations of load coloring (Q831701) (← links)
• Additive approximation of generalized Turán questions (Q832525) (← links)
• Editing to Eulerian graphs (Q896016) (← links)
• Parameterized complexity of finding connected induced subgraphs (Q897959) (← links)
• Obtaining split graphs by edge contraction (Q897961) (← links)
• An FPT algorithm for the vertex cover \(P_4\) problem (Q906446) (← links)
• Fixed-parameter complexity of minimum profile problems (Q958202) (← links)
• Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
• Characterizing and computing minimal cograph completions (Q972335) (← links)
• Chordal deletion is fixed-parameter tractable (Q973007) (← links)
• Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
• Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
• Dynamically maintaining split graphs (Q1026107) (← links)
• Parameterized complexity of finding regular induced subgraphs (Q1026227) (← links)
• Deleting edges to restrict the size of an epidemic: a new application for treewidth (Q1635713) (← links)
• Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
• Two edge modification problems without polynomial kernels (Q1662097) (← links)
• On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion} (Q1679221) (← links)
• The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
• Vertex deletion problems on chordal graphs (Q1786595) (← links)
• Reconstructing gene trees from Fitch's xenology relation (Q1789081) (← links)
• A polynomial kernel for trivially perfect editing (Q1799208) (← links)
• Parameterized complexity of vertex colouring (Q1811065) (← links)
• Parameterized complexity of finding subgraphs with hereditary properties. (Q1853579) (← links)
• On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)