MR
M. S. Ramanujan
cs.DScs.DMcs.CCcs.LOmath.COParameterized complexityBackdoor setscs.AIcs.CGcs.CR
On Valency
published · living versionsPreprints & journals
40 papers in the corpus · 2012–2026Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality
0 citations
A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots
0 citations
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion.
2 citations
Packing Short Cycles
0 citations
Routing on Sparse Graphs with Non-metric Costs for the Prize-collecting Travelling Salesperson Problem
0 citations
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy
0 citations
Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
0 citations
FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less
2 citations
Meta-theorems for Parameterized Streaming Algorithms
1 citation
On the Complexity of Majority Illusion in Social Networks
2 citations
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent
7 citations
On the Parameterized Complexity of Deletion to -free Strong Components
1 citation
On the Constrained Least-cost Tour Problem
0 citations
On the Approximate Compressibility of Connected Vertex Cover
9 citations
On the Complexity Landscape of Connected f -Factor Problems
0 citations
Backdoors for Linear Temporal Logic.
6 citations
A New Perspective on FO Model Checking of Dense Graph Classes
19 citations
Alternative parameterizations of Metric Dimension
10 citations
On Structural Parameterizations of the Edge Disjoint Paths Problem
10 citations
Saving Critical Nodes with Firefighters is FPT
1 citation
Path-contractions, edge deletions and connectivity preservation
7 citations
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
44 citations
The Half-integral Erdös-Pósa Property for Non-null Cycles
1 citation
On finding highly connected spanning subgraphs
2 citations
Backdoors to Tractable Valued CSP
1 citation
Combining Treewidth and Backdoors for CSP
20 citations
A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set
9 citations
On the Optimality of Pseudo-polynomial Algorithms for Integer Programming
6 citations
A Linear Time Parameterized Algorithm for Node Unique Label Cover
6 citations
Lossy Kernelization
2 citations
Strong Backdoors for Linear Temporal Logic
0 citations
Metric Dimension of Bounded Tree-length Graphs
29 citations
A Parameterized Algorithm for Mixed Cut
4 citations
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
17 citations
FO Model Checking on Posets of Bounded Width
28 citations
Reconfiguration on sparse graphs
0 citations
Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts
11 citations
Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints
16 citations
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
17 citations
Faster Parameterized Algorithms using Linear Programming
195 citations
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in beta. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.