scientific article; zbMATH DE number 6783431
From MaRDI portal
Publication:5365079
Recommendations
- Slightly superexponential parameterized problems
- Parameterized Approximation Problems
- Superlinear problems
- Superlinear discrete problems
- Subexponential Parameterized Algorithms
- Subexponential parameterized algorithms
- scientific article; zbMATH DE number 4107251
- scientific article; zbMATH DE number 5773461
Cited in
(35)- Hitting minors on bounded treewidth graphs. III. Lower bounds
- The graph motif problem parameterized by the structure of the input graph
- A tight lower bound for vertex planarization on graphs of bounded treewidth
- Hitting forbidden subgraphs in graphs of bounded treewidth
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- Tight complexity bounds for FPT subgraph problems parameterized by clique-width
- Parameterized complexity and subexponential-time computability
- Graph minors and parameterized algorithm design
- What's next? Future directions in parameterized complexity
- Parameterized and subexponential-time complexity of satisfiability problems and applications
- Tight bounds for linkages in planar graphs
- scientific article; zbMATH DE number 7228418 (Why is no real title available?)
- A double exponential lower bound for the distinct vectors problem
- Lower bounds for the graph homomorphism problem
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
- On approximating string selection problems with outliers
- On exact algorithms for the permutation CSP
- Confronting intractability via parameters
- Smaller Explicit Superconcentrators
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection
- On the Complexity of Bounded Context Switching.
- Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth
- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms
- Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces
- Finding Hamiltonian cycle in graphs of bounded tree-width: experimental evaluation
- Dynamic programming for graphs on surfaces
- Slightly superexponential parameterized problems
- Fine-grained complexity of safety verification
- scientific article; zbMATH DE number 7758338 (Why is no real title available?)
- Close relatives of feedback vertex set without single-exponential algorithms parameterized by treewidth
- Faster parameterized algorithms for minor containment
- Parameterized complexity of coupon coloring of graphs
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem
- Parameterized and subexponential-time complexity of satisfiability problems and applications
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365079)
