The following pages link to Parametrized complexity theory. (Q2488567):
Displaying 50 items.
- Parameterizations of test cover with bounded test sizes (Q261370) (← links)
- Backdoors to q-Horn (Q261394) (← links)
- Parameterized algorithms for finding square roots (Q262249) (← links)
- Complexity and monotonicity results for domination games (Q266262) (← links)
- Structural tractability of counting of solutions to conjunctive queries (Q269342) (← links)
- Structural decompositions for problems with global constraints (Q272005) (← links)
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- Hull number: \(P_5\)-free graphs and reduction rules (Q299077) (← links)
- A parameterized study of maximum generalized pattern matching problems (Q300450) (← links)
- A fast algorithm for permutation pattern matching based on alternating runs (Q300457) (← links)
- Graph isomorphism parameterized by elimination distance to bounded degree (Q309797) (← links)
- Tractability-preserving transformations of global cost functions (Q309935) (← links)
- The label cut problem with respect to path length and label frequency (Q313969) (← links)
- Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control (Q314421) (← links)
- On the hardness of bribery variants in voting with CP-nets (Q314427) (← links)
- Rural postman parameterized by the number of components of required edges (Q314816) (← links)
- On the parameterised complexity of string morphism problems (Q315525) (← links)
- Algorithms for the workflow satisfiability problem engineered for counting constraints (Q328681) (← links)
- \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments (Q329039) (← links)
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- Parameterized complexity of the \(k\)-arc Chinese postman problem (Q340562) (← links)
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
- A generalization of Spira's theorem and circuits with small segregators or separators (Q342721) (← links)
- Courcelle's theorem for triangulations (Q346450) (← links)
- Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing (Q346522) (← links)
- Fixed-parameter tractability and lower bounds for stabbing problems (Q359746) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Relativization makes contradictions harder for resolution (Q386151) (← links)
- Shuffled languages -- representation and recognition (Q388107) (← links)
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- Approximation algorithms for orienting mixed graphs (Q390889) (← links)
- Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
- Two-layer planarization parameterized by feedback edge set (Q391093) (← links)
- The complexity of the stamp folding problem (Q391214) (← links)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- Maximum balanced subgraph problem parameterized above lower bound (Q391973) (← links)
- Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game (Q391980) (← links)
- Parameterized complexity of \(k\)-Chinese postman problem (Q391983) (← links)
- Parameterized maximum path coloring (Q392021) (← links)
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems (Q392025) (← links)
- Parameterized complexity of MaxSat above average (Q392026) (← links)
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
- A new bound for 3-satisfiable MaxSat and its algorithmic application (Q393085) (← links)
- Revisiting the complexity of and/or graph solution (Q394337) (← links)
