The following pages link to Saket Saurabh (Q261392):
Displaying 50 items.
- Backdoors to q-Horn (Q261394) (← links)
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- Parameterized algorithms for non-separating trees and branchings in digraphs (Q334949) (← links)
- On the parameterized complexity of b-\textsc{chromatic number} (Q340565) (← links)
- Reducing rank of the adjacency matrix by graph modification (Q344771) (← links)
- Irrelevant vertices for the planar disjoint paths problem (Q345131) (← links)
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments (Q385516) (← links)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
- Parameterized complexity of finding small degree-constrained subgraphs (Q414424) (← links)
- Faster algorithms for finding and counting subgraphs (Q439930) (← links)
- Local search: is brute-force avoidable? (Q439931) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- On the directed full degree spanning tree problem (Q456701) (← links)
- Lower bounds on kernelization (Q456702) (← links)
- The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
- Parameterized complexity of strip packing and minimum volume packing (Q501656) (← links)
- A linear kernel for a planar connected dominating set (Q534569) (← links)
- An exact algorithm for minimum distortion embedding (Q551173) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Bandwidth on AT-free graphs (Q650939) (← links)
- The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
- Kernels for feedback arc set in tournaments (Q657916) (← links)
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- Group activity selection on graphs: parameterized analysis (Q681851) (← links)
- On parameterized independent feedback vertex set (Q690464) (← links)
- FPT algorithms for connected feedback vertex set (Q695322) (← links)
- Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- Parameterized algorithm for eternal vertex cover (Q765521) (← links)
- A characterization of König-Egerváry graphs with extendable vertex covers (Q783699) (← links)
- Parameterized algorithms for feedback set problems and their duals in tournaments (Q820159) (← links)
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles (Q958211) (← links)
- On two techniques of combining branching and treewidth (Q1022343) (← links)
- \textsc{Max-Cut Above Spanning Tree} is fixed-parameter tractable (Q1625174) (← links)
- Finding even subgraphs even faster (Q1671994) (← links)
- Kernels for deletion to classes of acyclic digraphs (Q1678165) (← links)
- Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover} (Q1679222) (← links)
- Parameterized complexity of superstring problems (Q1679230) (← links)
- Bivariate complexity analysis of \textsc{Almost Forest Deletion} (Q1686068) (← links)
- Parameterized algorithms for stable matching with ties and incomplete lists (Q1708024) (← links)
- Parameterized algorithms and kernels for rainbow matching (Q1739114) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- On the kernelization complexity of string problems (Q1749539) (← links)
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
- Hitting and covering partially (Q1791047) (← links)
