The following pages link to M. S. Ramanujan (Q261391):
Displaying 50 items.
- Backdoors to q-Horn (Q261394) (← links)
- (Q385515) (redirect page) (← links)
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments (Q385516) (← links)
- A characterization of König-Egerváry graphs with extendable vertex covers (Q783699) (← links)
- Backdoor treewidth for SAT (Q1680239) (← links)
- Path-contractions, edge deletions and connectivity preservation (Q1713475) (← links)
- Backdoors for linear temporal logic (Q1725638) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- On the kernelization complexity of string problems (Q1749539) (← links)
- On the approximate compressibility of connected vertex cover (Q2006945) (← links)
- On structural parameterizations of the edge disjoint paths problem (Q2032342) (← links)
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS (Q2285114) (← links)
- Alternative parameterizations of \textsc{Metric Dimension} (Q2285127) (← links)
- Faster graph bipartization (Q2301359) (← links)
- On approximate preprocessing for domination and hitting subgraphs with connected deletion sets (Q2316936) (← links)
- Faster parameterized algorithms for deletion to split graphs (Q2350905) (← links)
- Faster exact algorithms for some terminal set problems (Q2361353) (← links)
- On the complexity landscape of connected \(f\)-factor problems (Q2414869) (← links)
- Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
- On the optimality of pseudo-polynomial algorithms for integer programming (Q2687057) (← links)
- A Parameterized Algorithm for Mixed-Cut (Q2802977) (← links)
- Parameterized Tractability of Multiway Cut with Parity Constraints (Q2843298) (← links)
- Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q2849356) (← links)
- Faster Exact Algorithms for Some Terminal Set Problems (Q2867080) (← links)
- Hardness of r-dominating set on Graphs of Diameter (r + 1) (Q2867088) (← links)
- Faster Parameterized Algorithms for Deletion to Split Graphs (Q2904547) (← links)
- LP can be a cure for parameterized problems (Q2904774) (← links)
- On the Kernelization Complexity of String Problems (Q2920454) (← links)
- Parameterized Approximations via d-Skew-Symmetric Multicut (Q2922631) (← links)
- Metric Dimension of Bounded Width Graphs (Q2946381) (← links)
- Backdoors to q-Horn (Q2957872) (← links)
- Partially Polynomial Kernels for Set Cover and Test Cover (Q2963898) (← links)
- Vertex Exponential Algorithms for Connected f-Factors (Q2978502) (← links)
- On the Kernelization Complexity of Colorful Motifs (Q3058688) (← links)
- Paths, Flowers and Vertex Cover (Q3092246) (← links)
- A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments (Q3104628) (← links)
- A Faster Parameterized Algorithm for Group Feedback Edge Set (Q3181064) (← links)
- Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (Q3448850) (← links)
- On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids (Q3449854) (← links)
- Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts (Q4554936) (← links)
- Linear Time Parameterized Algorithms for S <scp>ubset</scp> F <scp>eedback</scp> V <scp>ertex</scp> S <scp>et</scp> (Q4554952) (← links)
- Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting (Q4575698) (← links)
- (Q4608015) (← links)
- (Q4608076) (← links)
- (Q4608602) (← links)
- A New Perspective on FO Model Checking of Dense Graph Classes (Q4635873) (← links)
- Strong Parameterized Deletion: Bipartite Graphs (Q4636568) (← links)
- Combining Treewidth and Backdoors for CSP. (Q4636635) (← links)
- Faster Parameterized Algorithms Using Linear Programming (Q4962173) (← links)
