Pages that link to "Item:Q820145"
From MaRDI portal
The following pages link to On miniaturized problems in parameterized complexity theory (Q820145):
Displaying 28 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)
- Practical complexities of probabilistic algorithms for solving Boolean polynomial systems (Q2065761) (← links)
- Fine-grained parameterized complexity analysis of graph coloring problems (Q2112649) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Color spanning objects: algorithms and hardness results (Q2181240) (← links)
- Pursuing a fast robber on a graph (Q2268876) (← links)
- Complexity of independency and cliquy trees (Q2283099) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- Domination and convexity problems in the target set selection model (Q2689641) (← links)
- Parameterized Complexity and Subexponential-Time Computability (Q2908538) (← links)
- Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications (Q2942439) (← links)
- Fixed-parameter decidability: Extending parameterized complexity analysis (Q2958220) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
- Parameterized algorithms for module map problems (Q5918889) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5925712) (← links)
- Spined categories: generalizing tree-width beyond graphs (Q6056559) (← links)
