Ramanujan M. S.
TitleCited byYear
Faster parameterized algorithms using linear programming
D Lokshtanov, NS Narayanaswamy, V Raman, MS Ramanujan, ...
ACM Transactions on Algorithms (TALG) 11 (2), 15, 2014
1252014
Faster parameterized algorithms for deletion to split graphs
E Ghosh, S Kolay, M Kumar, P Misra, F Panolan, A Rai, MS Ramanujan
Algorithmica 71 (4), 989-1006, 2015
472015
LP can be a cure for parameterized problems
NS Narayanaswamy, V Raman, MS Ramanujan, S Saurabh
STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) 14, 338-349, 2012
442012
Paths, flowers and vertex cover
V Raman, MS Ramanujan, S Saurabh
European Symposium on Algorithms, 382-393, 2011
412011
Lossy kernelization
D Lokshtanov, F Panolan, MS Ramanujan, S Saurabh
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
402017
On the kernelization complexity of colorful motifs
AM Ambalath, R Balasundaram, C Rao, V Koppula, N Misra, G Philip, ...
International Symposium on Parameterized and Exact Computation, 14-25, 2010
382010
Parameterized tractability of multiway cut with parity constraints
D Lokshtanov, MS Ramanujan
International Colloquium on Automata, Languages, and Programming, 750-761, 2012
272012
Linear-time parameterized algorithms via skew-symmetric multicuts
MS Ramanujan, S Saurabh
ACM Transactions on Algorithms (TALG) 13 (4), 46, 2017
242017
Linear Time Parameterized Algorithms for S ubset F eedback V ertex S et
D Lokshtanov, MS Ramanujan, S Saurabh
ACM Transactions on Algorithms (TALG) 14 (1), 7, 2018
232018
Reconfiguration on sparse graphs
D Lokshtanov, AE Mouawad, F Panolan, MS Ramanujan, S Saurabh
Journal of Computer and System Sciences 95, 122-131, 2018
212018
FO model checking on posets of bounded width
J Gajarský, P Hlinený, D Lokshtanov, J Obdralek, S Ordyniak, ...
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 963-974, 2015
192015
Partially polynomial kernels for set cover and test cover
M Basavaraju, MC Francis, MS Ramanujan, S Saurabh
SIAM Journal on Discrete Mathematics 30 (3), 1401-1423, 2016
162016
Solving d-SAT via Backdoors to Small Treewidth
FV Fomin, D Lokshtanov, N Misra, MS Ramanujan, S Saurabh
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
162014
Hardness of r-dominating set on graphs of diameter (r+ 1)
D Lokshtanov, N Misra, G Philip, MS Ramanujan, S Saurabh
International Symposium on Parameterized and Exact Computation, 255-267, 2013
162013
Backdoors to q-Horn
S Gaspers, S Ordyniak, MS Ramanujan, S Saurabh, S Szeider
Algorithmica 74 (1), 540-557, 2016
152016
Parameterized complexity of directed Steiner tree on sparse graphs
M Jones, D Lokshtanov, MS Ramanujan, S Saurabh, O Suchý
European Symposium on Algorithms, 671-682, 2013
152013
Going beyond primal treewidth for (M) ILP
R Ganian, S Ordyniak, MS Ramanujan
Thirty-First AAAI Conference on Artificial Intelligence, 2017
142017
A new perspective on FO model checking of dense graph classes
J Gajarský, P Hliněný, J Obdržálek, D Lokshtanov, MS Ramanujan
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-9, 2016
142016
Extensive-form perfect equilibrium computation in two-player games
G Farina, N Gatti
Thirty-First AAAI Conference on Artificial Intelligence, 2017
132017
Parameterized algorithms to preserve connectivity
M Basavaraju, FV Fomin, P Golovach, P Misra, MS Ramanujan, ...
International Colloquium on Automata, Languages, and Programming, 800-811, 2014
132014
The system can't perform the operation now. Try again later.
Articles 1–20