The following pages link to (Q5710169):
Displaying 50 items.
- Parameterizations of test cover with bounded test sizes (Q261370) (← links)
- Parameterized algorithms for finding square roots (Q262249) (← links)
- Complexity and monotonicity results for domination games (Q266262) (← links)
- On the ordered list subgraph embedding problems (Q270006) (← links)
- An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification (Q284360) (← links)
- Ranking chain sum orders (Q290525) (← links)
- \((1, j)\)-set problem in graphs (Q294556) (← links)
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- A fast algorithm for permutation pattern matching based on alternating runs (Q300457) (← links)
- Parameterized tractability of the maximum-duo preservation string mapping problem (Q306271) (← links)
- Finding shortest paths between graph colourings (Q309791) (← links)
- Graph isomorphism parameterized by elimination distance to bounded degree (Q309797) (← 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 graphs with induced matching number almost equal to matching number (Q324703) (← 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)
- Parameterized complexity of the \(k\)-arc Chinese postman problem (Q340562) (← links)
- Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
- Parameterized algorithms for the module motif problem (Q342716) (← links)
- Refined algorithms for hitting many intervals (Q344570) (← links)
- Parameterized complexity of \(k\)-anonymity: hardness and tractability (Q358665) (← links)
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- Increasing the minimum degree of a graph by contractions (Q385061) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Parameterized complexity of Min-power multicast problems in wireless ad hoc networks (Q388087) (← links)
- Finding approximate and constrained motifs in graphs (Q390871) (← 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)
- Parameterized complexity of max-lifetime target coverage in wireless sensor networks (Q391780) (← links)
- Maximum balanced subgraph problem parameterized above lower bound (Q391973) (← links)
- Parameterized complexity of \(k\)-Chinese postman problem (Q391983) (← links)
- Parameterized maximum path coloring (Q392021) (← links)
- Parameterized complexity of MaxSat above average (Q392026) (← links)
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- The \(l\)-diversity problem: tractability and approximability (Q392037) (← links)
- Polynomial kernels for proper interval completion and related problems (Q393083) (← 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)
- Solving min ones 2-SAT as fast as vertex cover (Q393120) (← links)
- Matching and weighted \(P_2\)-packing: algorithms and kernels (Q393902) (← links)
- Revisiting the complexity of and/or graph solution (Q394337) (← links)
- Parameterized complexity of connected even/odd subgraph problems (Q395000) (← links)
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- The constrained shortest common supersequence problem (Q396654) (← links)
