Pages that link to "Item:Q1604206"

The following pages link to Which problems have strongly exponential complexity? (Q1604206):

Displaying 19 items.

• Subexponential parameterized algorithms (Q458457) (← links)
• Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662) (← links)
• Linear kernels and linear-time algorithms for finding large cuts (Q722541) (← links)
• Complexity of token swapping and its variants (Q722547) (← links)
• Approximating vector scheduling: almost matching upper and lower bounds (Q727975) (← links)
• Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
• On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results (Q1693144) (← links)
• Sitting closer to friends than enemies, revisited (Q2345988) (← links)
• Characterization and complexity results on jumping finite automata (Q2357104) (← links)
• Polynomial kernelization for removing induced claws and diamonds (Q2398208) (← links)
• Exact algorithms for the Hamiltonian cycle problem in planar graphs (Q2494820) (← links)
• Tight lower bounds for certain parameterized NP-hard problems (Q2568440) (← links)
• Ranking and Drawing in Subexponential Time (Q3000521) (← links)
• A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q3177162) (← links)
• Subexponential Time Algorithms for Finding Small Tree and Path Decompositions (Q3452781) (← links)
• Fine-grained Lower Bounds on Cops and Robbers (Q5009566) (← links)
• Improved Lower Bounds for Graph Embedding Problems (Q5283358) (← links)
• Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928) (← links)
• A Subexponential Parameterized Algorithm for Proper Interval Completion (Q5899484) (← links)