The following pages link to (Q4393480):
Displaying 50 items.
- An FPT algorithm for the vertex cover \(P_4\) problem (Q906446) (← links)
- Searching the \(k\)-change neighborhood for TSP is W[1]-hard (Q924881) (← links)
- Hardness of optimal spaced seed design (Q931726) (← links)
- Convex recolorings of strings and trees: Definitions, hardness results and algorithms (Q931727) (← links)
- Efficient algorithms for counting parameterized list \(H\)-colorings (Q931733) (← links)
- Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs (Q935835) (← links)
- Fixed parameter algorithms for one-sided crossing minimization revisited (Q935846) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- On the complexity of the multicut problem in bounded tree-width graphs and digraphs (Q944745) (← links)
- Feedback vertex set on AT-free graphs (Q944750) (← links)
- On the fixed-parameter tractability of parameterized model-checking problems (Q963328) (← links)
- A more efficient algorithm for perfect sorting by reversals (Q963340) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- Parameterized algorithms for \(d\)-hitting set: the weighted case (Q964386) (← links)
- Parameterized graph cleaning problems (Q967382) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
- Minimum dominating set of queens: a trivial programming exercise? (Q968146) (← links)
- On the power of structural decompositions of graph-based representations of constraint problems (Q969532) (← links)
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
- Complexity of the packing coloring problem for trees (Q972338) (← links)
- Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
- The parameterized complexity of probability amplification (Q975525) (← links)
- Parameterized approximation of dominating set problems (Q975529) (← links)
- The parameterized complexity of editing graphs for bounded degeneracy (Q986553) (← links)
- A kernelization algorithm for \(d\)-hitting set (Q988567) (← links)
- Comparing trees via crossing minimization (Q988574) (← links)
- Linear kernelizations for restricted 3-Hitting Set problems (Q989471) (← links)
- Sort and Search: exact algorithms for generalized domination (Q989487) (← links)
- Exponential-time approximation of weighted set cover (Q989538) (← links)
- Constant ratio fixed-parameter approximation of the edge multicut problem (Q990949) (← links)
- Satisfiability of mixed Horn formulas (Q997066) (← links)
- A bounded search tree algorithm for parameterized face cover (Q1002098) (← links)
- A fixed parameter algorithm for optimal convex partitions (Q1002101) (← links)
- On \(k\)-connectivity problems with sharpened triangle inequality (Q1002105) (← links)
- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints (Q1002106) (← links)
- Parameterized algorithmics for linear arrangement problems (Q1003461) (← links)
- Efficiency in exponential time for domination-type problems (Q1003475) (← links)
- Some tractable instances of interval data minmax regret problems (Q1003488) (← links)
- Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
- Parameterizing above or below guaranteed values (Q1004602) (← links)
- The minimum spanning strong subdigraph problem is fixed parameter tractable (Q1005234) (← links)
- Treewidth and logical definability of graph products (Q1006041) (← links)
- The complexity of the matroid-greedoid partition problem (Q1006060) (← links)
- Computing small partial coverings (Q1007552) (← links)
- Finding occurrences of protein complexes in protein-protein interaction graphs (Q1013075) (← links)
- Red-blue covering problems and the consecutive ones property (Q1018089) (← links)
- A 3-approximation algorithm for the subtree distance between phylogenies (Q1018098) (← links)
- On parameterized complexity of the multi-MCS problem (Q1019178) (← links)
- Covering graphs with few complete bipartite subgraphs (Q1019181) (← links)
- Stacks in canonical RNA pseudoknot structures (Q1025221) (← links)
