The following pages link to (Q5365079):
Displaying 38 items.
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- On approximating string selection problems with outliers (Q391209) (← links)
- On exact algorithms for the permutation CSP (Q392031) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- On the computational complexity of vertex integrity and component order connectivity (Q727981) (← links)
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
- Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108) (← links)
- Hitting minors on bounded treewidth graphs. III. Lower bounds (Q2301360) (← links)
- The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
- A tight lower bound for vertex planarization on graphs of bounded treewidth (Q2403808) (← links)
- On the complexity of various parameterizations of common induced subgraph isomorphism (Q2405897) (← links)
- Hitting forbidden subgraphs in graphs of bounded treewidth (Q2407089) (← links)
- The role of planarity in connectivity problems parameterized by treewidth (Q2514121) (← links)
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
- Parameterized Complexity and Subexponential-Time Computability (Q2908538) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications (Q2942439) (← links)
- Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations (Q2947879) (← links)
- Tight Bounds for Linkages in Planar Graphs (Q3012796) (← links)
- (Q3304125) (← links)
- Lower Bounds for the Graph Homomorphism Problem (Q3448809) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- Smaller Explicit Superconcentrators (Q4665445) (← links)
- On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection (Q5041250) (← links)
- On the Complexity of Bounded Context Switching. (Q5111714) (← links)
- (Q5111863) (← links)
- (Q5111866) (← links)
- Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces (Q5115789) (← links)
- Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation (Q5140740) (← links)
- Dynamic programming for graphs on surfaces (Q5501962) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
- Fine-grained complexity of safety verification (Q5919003) (← links)
- (Q6062162) (← links)
- (Q6068237) (← links)
