Follow
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
1682014
Lossy kernelization
D Lokshtanov, F Panolan, MS Ramanujan, S Saurabh
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
792017
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
592015
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
512020
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
482012
Paths, flowers and vertex cover
V Raman, MS Ramanujan, S Saurabh
European Symposium on Algorithms, 382-393, 2011
472011
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
462015
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
442020
On the kernelization complexity of colorful motifs
AM Ambalath, R Balasundaram, H Rao, V Koppula, N Misra, G Philip, ...
International Symposium on Parameterized and Exact Computation, 14-25, 2010
442010
Reconfiguration on sparse graphs
D Lokshtanov, AE Mouawad, F Panolan, MS Ramanujan, S Saurabh
Journal of Computer and System Sciences 95, 122-131, 2018
432018
Parameterized tractability of multiway cut with parity constraints
D Lokshtanov, MS Ramanujan
International Colloquium on Automata, Languages, and Programming, 750-761, 2012
412012
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
352018
Going beyond primal treewidth for (M) ILP
R Ganian, S Ordyniak, M Ramanujan
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
322017
Linear-time parameterized algorithms via skew-symmetric multicuts
MS Ramanujan, S Saurabh
ACM Transactions on Algorithms (TALG) 13 (4), 1-25, 2017
302017
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
302014
Parameterized Algorithms for Even Cycle Transversal
P Misra, V Raman, MS Ramanujan, S Saurabh
International Workshop on Graph-Theoretic Concepts in Computer Science, 172-183, 2012
282012
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
272017
Combining treewidth and backdoors for CSP
R Ganian, MS Ramanujan, S Szeider
arXiv preprint arXiv:1610.03298, 2016
272016
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
262017
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
232013
The system can't perform the operation now. Try again later.
Articles 1–20