Pages that link to "Item:Q5745079"
From MaRDI portal
The following pages link to Slightly Superexponential Parameterized Problems (Q5745079):
Displaying 23 items.
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms (Q2272595) (← links)
- General lower bounds and improved algorithms for infinite-domain CSPs (Q2700386) (← links)
- Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces (Q3119488) (← links)
- Finding Hamiltonian Cycle in Graphs of Bounded Treewidth (Q4984872) (← links)
- (Q5009486) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
- A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs (Q5071089) (← links)
- Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. (Q5092404) (← links)
- Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
- On the complexity of finding large odd induced subgraphs and odd colorings (Q5918338) (← links)
- Parameterized complexity of conflict-free set cover (Q5918356) (← links)
- Streaming deletion problems Parameterized by vertex cover (Q6057830) (← links)
- (Q6068237) (← links)
- On the Parameterized Complexity of Maximum Degree Contraction Problem. (Q6089673) (← links)
- Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm (Q6115414) (← links)
- Solving infinite-domain CSPs using the patchwork property (Q6157211) (← links)
- Offensive alliances in graphs (Q6201327) (← links)
- Induced tree covering and the generalized Yutsis property (Q6547951) (← links)
- \(b\)-coloring parameterized by clique-width (Q6614620) (← links)
- Constant depth formula and partial function versions of MCSP are hard (Q6654556) (← links)
