Pages that link to "Item:Q2867067"

The following pages link to Parameterized and Exact Computation (Q2867067):

Displaying 50 items.

• On the ordered list subgraph embedding problems (Q270006) (← links)
• A parameterized study of maximum generalized pattern matching problems (Q300450) (← links)
• AND-compression of NP-complete problems: streamlined proof and minor observations (Q309801) (← links)
• On the parameterized complexity of reconfiguration problems (Q527426) (← links)
• Parameterizing by the number of numbers (Q692894) (← links)
• Parameterized complexity results for general factors in bipartite graphs with an application to constraint programming (Q1759676) (← links)
• A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (Q1759685) (← links)
• Small vertex cover makes Petri net coverability and boundedness easier (Q1949744) (← links)
• On subexponential and FPT-time inapproximability (Q2343081) (← links)
• On sparsification for computing treewidth (Q2343087) (← links)
• Editing to a graph of given degrees (Q2354405) (← links)
• Contracting graphs to paths and trees (Q2441588) (← links)
• A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
• The role of planarity in connectivity problems parameterized by treewidth (Q2514121) (← links)
• The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups (Q2867068) (← links)
• Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints (Q2867069) (← links)
• Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem (Q2867070) (← links)
• The Fine Details of Fast Dynamic Programming over Tree Decompositions (Q2867071) (← links)
• Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization (Q2867073) (← links)
• Chain Minors Are FPT (Q2867074) (← links)
• Incompressibility of H-Free Edge Modification (Q2867075) (← links)
• Contracting Few Edges to Remove Forbidden Induced Subgraphs (Q2867076) (← links)
• Fixed-Parameter and Approximation Algorithms: A New Look (Q2867077) (← links)
• Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs (Q2867078) (← links)
• Computing Tree-Depth Faster Than 2 n (Q2867079) (← links)
• Faster Exact Algorithms for Some Terminal Set Problems (Q2867080) (← links)
• Parameterized Algorithms for Modular-Width (Q2867081) (← links)
• A Completeness Theory for Polynomial (Turing) Kernelization (Q2867084) (← links)
• The Jump Number Problem: Exact and Parameterized (Q2867086) (← links)
• On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges (Q2867087) (← links)
• Hardness of r-dominating set on Graphs of Diameter (r + 1) (Q2867088) (← links)
• Amalgam Width of Matroids (Q2867089) (← links)
• FPT Algorithms for Consecutive Ones Submatrix Problems (Q2867091) (← links)
• Upper Bounds on Boolean-Width with Applications to Exact Algorithms (Q2867092) (← links)
• Speeding Up Dynamic Programming with Representative Sets (Q2867093) (← links)
• Completeness Results for Parameterized Space Classes (Q2867094) (← links)
• Treewidth and Pure Nash Equilibria (Q2867095) (← links)
• Algorithms for k-Internal Out-Branching (Q2867096) (← links)
• On Multiway Cut Parameterized above Lower Bounds (Q2891333) (← links)
• Parameterized Complexity of Firefighting Revisited (Q2891334) (← links)
• Parameterized Complexity in Multiple-Interval Graphs: Domination (Q2891335) (← links)
• A Faster Algorithm for Dominating Set Analyzed by the Potential Method (Q2891336) (← links)
• Increasing the Minimum Degree of a Graph by Contractions (Q2891338) (← links)
• Planar Disjoint-Paths Completion (Q2891339) (← links)
• Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing (Q2891340) (← links)
• New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree (Q2891341) (← links)
• Improved Parameterized Algorithms for above Average Constraint Satisfaction (Q2891342) (← links)
• On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
• Kernel Bounds for Path and Cycle Problems (Q2891344) (← links)
• On the Hardness of Losing Width (Q2891345) (← links)