Pages that link to "Item:Q5383969"

The following pages link to Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms (Q5383969):

Displayed 38 items.

• Exact algorithms for intervalizing coloured graphs (Q255264) ‎ (← links)
• A randomized algorithm for long directed cycle (Q264199) ‎ (← links)
• Deterministic parameterized algorithms for the graph motif problem (Q313814) ‎ (← links)
• Parameterized approximation algorithms for packing problems (Q313963) ‎ (← links)
• Parameterized algorithms for non-separating trees and branchings in digraphs (Q334949) ‎ (← links)
• Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs (Q527430) ‎ (← links)
• Contraction bidimensionality of geometric intersection graphs (Q832527) ‎ (← links)
• Representative families: a unified tradeoff-based approach (Q899582) ‎ (← links)
• A randomized polynomial kernel for subset feedback vertex set (Q1702849) ‎ (← links)
• Non-adaptive learning of a hidden hypergraph (Q1704557) ‎ (← links)
• Long directed \((s,t)\)-path: FPT algorithm (Q1799598) ‎ (← links)
• Algebraic methods in the congested clique (Q2010605) ‎ (← links)
• On the complexity of algorithms for detecting \(k\)-length negative cost cycles (Q2051903) ‎ (← links)
• Parameterized complexity of conflict-free matchings and paths (Q2182094) ‎ (← links)
• Faster deterministic parameterized algorithm for \(k\)-path (Q2272387) ‎ (← links)
• Partitioning a graph into small pieces with applications to path transversal (Q2316611) ‎ (← links)
• Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) ‎ (← links)
• Solving Hamiltonian cycle by an EPT algorithm for a non-sparse parameter (Q2357164) ‎ (← links)
• Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) ‎ (← links)
• Hitting forbidden subgraphs in graphs of bounded treewidth (Q2407089) ‎ (← links)
• Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) ‎ (← links)
• Parameterized algorithms for graph partitioning problems (Q2408556) ‎ (← links)
• The role of planarity in connectivity problems parameterized by treewidth (Q2514121) ‎ (← links)
• Exact learning from an honest teacher that answers membership queries (Q2636406) ‎ (← links)
• A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time (Q2946401) ‎ (← links)
• Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) ‎ (← links)
• A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q3177162) ‎ (← links)
• Deterministic Subgraph Detection in Broadcast CONGEST. (Q3300802) ‎ (← links)
• (Q3304125) ‎ (← links)
• Spotting Trees with Few Leaves (Q3448789) ‎ (← links)
• Deterministic Truncation of Linear Matroids (Q3448849) ‎ (← links)
• (Q4972036) ‎ (← links)
• (Q5092396) ‎ (← links)
• (Q5111282) ‎ (← links)
• Contraction-Bidimensionality of Geometric Intersection Graphs (Q5111864) ‎ (← links)
• Spotting Trees with Few Leaves (Q5346548) ‎ (← links)
• The \(k\)-distinct language: parameterized automata constructions (Q5964071) ‎ (← links)
• Parameterized Counting and Cayley Graph Expanders (Q6158357) ‎ (← links)