Ramanujan M. S.
Title
Cited by
Cited by
Year
Faster parameterized algorithms using linear programming
D Lokshtanov, NS Narayanaswamy, V Raman, MS Ramanujan, ...
ACM Transactions on Algorithms (TALG) 11 (2), 1-31, 2014
1302014
Lossy kernelization
D Lokshtanov, F Panolan, MS Ramanujan, S Saurabh
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
542017
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
472012
Paths, flowers and vertex cover
V Raman, MS Ramanujan, S Saurabh
European Symposium on Algorithms, 382-393, 2011
442011
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
392010
A new perspective on FO model checking of dense graph classes
J Gajarský, P Hliněný, J Obdržálek, D Lokshtanov, MS Ramanujan
ACM Transactions on Computational Logic (TOCL) 21 (4), 1-23, 2020
302020
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
292015
Reconfiguration on sparse graphs
D Lokshtanov, AE Mouawad, F Panolan, MS Ramanujan, S Saurabh
Journal of Computer and System Sciences 95, 122-131, 2018
282018
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 for Subset Feedback Vertex Set
D Lokshtanov, MS Ramanujan, S Saurabh
ACM Transactions on Algorithms (TALG) 14 (1), 1-37, 2018
262018
Linear-time parameterized algorithms via skew-symmetric multicuts
MS Ramanujan, S Saurabh
ACM Transactions on Algorithms (TALG) 13 (4), 1-25, 2017
252017
Parameterized complexity and approximability of directed odd cycle transversal
D Lokshtanov, MS Ramanujan, S Saurab, M Zehavi
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
222020
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
202014
Going beyond primal treewidth for (M) ILP
R Ganian, S Ordyniak, MS Ramanujan
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence …, 2017
192017
Extensive-form perfect equilibrium computation in two-player games
G Farina, N Gatti
arXiv preprint arXiv:1611.05011, 2016
182016
Backdoors to q-Horn
S Gaspers, S Ordyniak, MS Ramanujan, S Saurabh, S Szeider
Algorithmica 74 (1), 540-557, 2016
172016
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
172013
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
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
162013
The system can't perform the operation now. Try again later.
Articles 1–20