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
1372014
Lossy kernelization
D Lokshtanov, F Panolan, MS Ramanujan, S Saurabh
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
592017
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
502015
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
452011
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
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-9, 2016
382016
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
312015
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
302018
Parameterized tractability of multiway cut with parity constraints
D Lokshtanov, MS Ramanujan
International Colloquium on Automata, Languages, and Programming, 750-761, 2012
302012
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 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
262020
Linear-time parameterized algorithms via skew-symmetric multicuts
MS Ramanujan, S Saurabh
ACM Transactions on Algorithms (TALG) 13 (4), 1-25, 2017
262017
Going beyond primal treewidth for (M) ILP
R Ganian, S Ordyniak, M Ramanujan
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
232017
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
222014
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
192017
Extensive-form perfect equilibrium computation in two-player games
G Farina, N Gatti
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
182017
Backdoors to q-Horn
S Gaspers, S Ordyniak, MS Ramanujan, S Saurabh, S Szeider
Algorithmica 74 (1), 540-557, 2016
182016
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
182013
Metric dimension of bounded width graphs
R Belmonte, FV Fomin, PA Golovach, MS Ramanujan
International Symposium on Mathematical Foundations of Computer Science, 115-126, 2015
172015
The system can't perform the operation now. Try again later.
Articles 1–20