Pages that link to "Item:Q383833"

The following pages link to Fundamentals of parameterized complexity (Q383833):

Displaying 50 items.

• New width parameters for SAT and \#SAT (Q2238644) (← links)
• The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (Q2238737) (← links)
• Matchings under distance constraints. I (Q2241576) (← links)
• Parameterized approximability of maximizing the spread of influence in networks (Q2250539) (← links)
• A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
• On explaining integer vectors by few homogeneous segments (Q2256725) (← links)
• Edge deletion problems: branching facilitated by modular decomposition (Q2257301) (← links)
• Kernels for packing and covering problems (Q2272393) (← links)
• A fixed-parameter perspective on \#BIS (Q2272593) (← links)
• Optimal data reduction for graph coloring using low-degree polynomials (Q2272594) (← links)
• A note on parameterized polynomial identity testing using hitting set generators (Q2274524) (← links)
• Complexity of independency and cliquy trees (Q2283099) (← links)
• Parameterized complexity of a coupled-task scheduling problem (Q2283295) (← links)
• Mim-width. II. The feedback vertex set problem (Q2285053) (← links)
• Alternative parameterizations of \textsc{Metric Dimension} (Q2285127) (← links)
• Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition (Q2285134) (← links)
• On the computational complexity of length- and neighborhood-constrained path problems (Q2294439) (← links)
• On the parameterized tractability of the just-in-time flow-shop scheduling problem (Q2294891) (← links)
• Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results (Q2297848) (← links)
• On the parameterized complexity of graph modification to first-order logic properties (Q2300624) (← links)
• Quadratic vertex kernel for rainbow matching (Q2300725) (← links)
• Hitting minors on bounded treewidth graphs. III. Lower bounds (Q2301360) (← links)
• Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
• Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms (Q2304558) (← links)
• Subset feedback vertex set on graphs of bounded independent set size (Q2304562) (← links)
• Using decomposition-parameters for QBF: mind the prefix! (Q2304627) (← links)
• Consensus strings with small maximum distance and small distance sum (Q2309476) (← links)
• A complexity dichotomy for critical values of the \(b\)-chromatic number of graphs (Q2310757) (← links)
• Scheduling meets \(n\)-fold integer programming (Q2317129) (← links)
• Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers (Q2317862) (← links)
• A multiparametric view on answer set programming (Q2317973) (← links)
• An improved linear kernel for complementary maximal strip recovery: simpler and smaller (Q2319903) (← links)
• Backdoors to planning (Q2321271) (← links)
• Parameterized complexity of voter control in multi-peaked elections (Q2322697) (← links)
• Parameterised algorithms for deletion to classes of DAGs (Q2322699) (← links)
• Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
• The parameterized complexity of the minimum shared edges problem (Q2323342) (← links)
• How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
• Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\) (Q2326400) (← links)
• Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
• Possibilistic keys (Q2329094) (← links)
• Parameterized resiliency problems (Q2330129) (← links)
• The complexity of finding harmless individuals in social networks (Q2339843) (← links)
• Fixed-parameter complexity and approximability of norm maximization (Q2340407) (← links)
• On structural parameterizations for the 2-club problem (Q2341718) (← links)
• Backdoors to tractable answer set programming (Q2341833) (← links)
• Pure Nash equilibria in graphical games and treewidth (Q2343086) (← links)
• Finding disjoint paths in networks with star shared risk link groups (Q2344758) (← links)
• Combinatorial voter control in elections (Q2346381) (← links)
• Towards an algorithmic guide to Spiral Galaxies (Q2347000) (← links)