Ramanujan M. S.
Cited by
Cited by
Faster parameterized algorithms using linear programming
D Lokshtanov, NS Narayanaswamy, V Raman, MS Ramanujan, ...
ACM Transactions on Algorithms (TALG) 11 (2), 1-31, 2014
Lossy kernelization
D Lokshtanov, F Panolan, MS Ramanujan, S Saurabh
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
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
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
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
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
Paths, flowers and vertex cover
V Raman, MS Ramanujan, S Saurabh
Algorithms–ESA 2011: 19th Annual European Symposium, Saarbrücken, Germany …, 2011
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
LP can be a cure for parameterized problems
NS Narayanaswamy, V Raman, MS Ramanujan, S Saurabh
29th International Symposium on Theoretical Aspects of Computer Science …, 2012
Reconfiguration on sparse graphs
D Lokshtanov, AE Mouawad, F Panolan, MS Ramanujan, S Saurabh
Journal of Computer and System Sciences 95, 122-131, 2018
Parameterized tractability of multiway cut with parity constraints
D Lokshtanov, MS Ramanujan
Automata, Languages, and Programming: 39th International Colloquium, ICALP …, 2012
On the kernelization complexity of colorful motifs
AM Ambalath, R Balasundaram, C Rao H, V Koppula, N Misra, G Philip, ...
Parameterized and Exact Computation: 5th International Symposium, IPEC 2010 …, 2010
Metric dimension of bounded tree-length graphs
R Belmonte, FV Fomin, PA Golovach, MS Ramanujan
SIAM Journal on Discrete Mathematics 31 (2), 1217-1243, 2017
Parameterized algorithms to preserve connectivity
M Basavaraju, FV Fomin, P Golovach, P Misra, MS Ramanujan, ...
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
Going beyond primal treewidth for (M) ILP
R Ganian, S Ordyniak, M Ramanujan
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
Combining treewidth and backdoors for CSP
R Ganian, MS Ramanujan, S Szeider
arXiv preprint arXiv:1610.03298, 2016
Parameterized Algorithms for Even Cycle Transversal
P Misra, V Raman, MS Ramanujan, S Saurabh
Graph-Theoretic Concepts in Computer Science: 38th International Workshop …, 2012
Linear-time parameterized algorithms via skew-symmetric multicuts
MS Ramanujan, S Saurabh
ACM Transactions on Algorithms (TALG) 13 (4), 1-25, 2017
Discovering archipelagos of tractability for constraint satisfaction and counting
R Ganian, MS Ramanujan, S Szeider
ACM Transactions on Algorithms (TALG) 13 (2), 1-32, 2017
Parameterized complexity of directed steiner tree on sparse graphs
M Jones, D Lokshtanov, MS Ramanujan, S Saurabh, O Suchı
Algorithms–ESA 2013: 21st Annual European Symposium, Sophia Antipolis …, 2013
The system can't perform the operation now. Try again later.
Articles 1–20