Pages that link to "Item:Q820145"

The following pages link to On miniaturized problems in parameterized complexity theory (Q820145):

Displaying 14 items.

• VC bounds on the cardinality of nearly orthogonal function classes (Q418881) (← links)
• Stable assignment with couples: parameterized complexity and local search (Q456691) (← links)
• Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699) (← links)
• On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704) (← links)
• The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT (Q456705) (← links)
• Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms (Q458454) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• On families of categorial grammars of bounded value, their learnability and related complexity questions (Q714784) (← links)
• Containment relations in split graphs (Q765349) (← links)
• Compactors for parameterized counting problems (Q826317) (← links)
• Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108) (← links)
• Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules (Q898752) (← links)
• Covering graphs with few complete bipartite subgraphs (Q1019181) (← links)
• Spined categories: generalizing tree-width beyond graphs (Q6056559) (← links)