Pages that link to "Item:Q673779"
From MaRDI portal
The following pages link to Fixed-parameter tractability and completeness II: On completeness for W[1] (Q673779):
Displaying 24 items.
- A characterization of trees having a minimum vertex cover which is also a minimum total dominating set (Q5377033) (← links)
- Bounded Tree-Width and CSP-Related Problems (Q5387797) (← links)
- The Parameterized Complexity of Graph Cyclability (Q5891809) (← links)
- Ruling out FPT algorithms for weighted coloring on forests (Q5916046) (← links)
- Balanced stable marriage: how close is close enough? (Q5918373) (← links)
- Subgraph isomorphism on graph classes that exclude a substructure (Q5919029) (← links)
- Parameterized algorithms for the happy set problem (Q5919103) (← links)
- (Q6068238) (← links)
- Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
- Improving the non‐compensatory trace‐clustering decision process (Q6079902) (← links)
- Controlling entity integrity with key sets (Q6098153) (← links)
- Exact and heuristic methods for a workload allocation problem with chain precedence constraints (Q6112777) (← links)
- Exact algorithms for restricted subset feedback vertex set in chordal and split graphs (Q6140360) (← links)
- Parameterized Counting and Cayley Graph Expanders (Q6158357) (← links)
- Stable matching with multilayer approval preferences: approvals can be harder than strict preferences (Q6188265) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6499010) (← links)
- On the parameterized intractability of determinant maximization (Q6547207) (← links)
- Open packing in \(H\)-free graphs and subclasses of split graphs (Q6547836) (← links)
- The multicolored graph realization problem (Q6558680) (← links)
- On computing large temporal (unilateral) connected components (Q6564621) (← links)
- Counting vanishing matrix-vector products (Q6575406) (← links)
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)
- Parameterized problems complete for nondeterministic FPT time and logarithmic space (Q6614886) (← links)
- Counting vanishing matrix-vector products (Q6639735) (← links)