Clear Cache
Subashini R.
Subashini R.
Associate Professor
Office Address:
CSE-101A, National Institute of Technology Calicut, Kerala 673601.
Ph.D.: Department of Computer Science and Engineering, Indian Institute of Technology, Madras (2009-2014)
M.Tech.: Department of Computer Science and Engineering, Indian Institute of Technology, Madras (2004-2006)
B.E.: Department of Computer Science and Engineering, Government College of Engineering (Formerly IRTT), Erode (1994-1998)
Educational Qualifications
-
Ph.D.: Department of Computer Science and Engineering, Indian Institute of Technology, Madras (2009-2014)
-
M.Tech.: Department of Computer Science and Engineering, Indian Institute of Technology, Madras (2004-2006)
-
B.E.: Department of Computer Science and Engineering, Government College of Engineering (Formerly IRTT), Erode (1994-1998)
Journals
2024
D Antony, S Pal, RB Sandeep, R Subashini, Cutting a tree with subgraph complementation is hard, except for some small trees, Journal of Graph Theory 107 (1), 126-168
R Raman, S john JS, R Subashini, S Methirumangalath, Fixed Parameter Tractable Algorithms for Watchman Route Related Problems on Line Segment Arrangements, International Journal of Computer Mathematics: Computer Systems Theory, 1
2023
G Philip, R Subashini, On computing the Hamiltonian index of graphs, Theoretical Computer Science 940, 149-179
M Rema, R Subashini, S Methirumangalath, V Rajan, Classical and Parameterized Complexity of Line Segment Covering Problems in Arrangement, International Conference on Frontiers of Intelligent Computing: Theory and …
R Raman, SJ JS, R Subashini, S Methirumangalath, On the parameterized complexity of the Maximum Exposure Problem, Information Processing Letters 180, 106338
2022
D Antony, J Garchar, S Pal, RB Sandeep, S Sen, R Subashini, On Subgraph Complementation to H-free Graphs, Algorithmica 84 (10), 2842-2870
2020
R Subashini, M Jagalmohanan, Simultaneous consecutive ones submatrix and editing problems: Classical complexity and fixed-parameter tractable results, Theoretical Computer Science 812, 13-38
2019
R Raman, R Subashini, S Methirumangalath, Fixed-Parameter Tractable Algorithms for Corridor Guarding Problems, arXiv preprint arXiv:1902.03820
2018
MR Rani, M Jagalmohanan, R Subashini, Check for updates Classical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems, Frontiers in Algorithmics: 12th International Workshop, FAW 2018, Guangzhou …
MR Rani, M Jagalmohanan, R Subashini, Classical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems, International Workshop on Frontiers in Algorithmics, 154-168
2017
MR Rani, R Subashini, Fixed-Parameter Tractability of the Simultaneous Consecutive Ones Submatrix & Editing Problems., arXiv preprint arXiv:1707.00106
2015
NS Narayanaswamy, R Subashini, Obtaining matrices with the consecutive ones property by row deletion, Algorithmica 71, 758-773
2013
NS Narayanaswamy, R Subashini, FPT algorithms for consecutive ones submatrix problems,Parameterized and Exact Computation: 8th International Symposium, IPEC 2013 …
NS Narayanaswamy, R Subashini, d-COS-R is FPT via Interval Deletion, arXiv preprint arXiv:1303.1643
2009
NS Narayanaswamy, R Subashini, A new characterization of matrices with the consecutive ones propertyDiscrete applied mathematics 157 (18), 3721-3727
Classes
CS4027-Topics in Algorithms
Semester: Winter
Offered: 2018
CS6137 Parameterized Algorithms and Complexity
Semester: Winter
Offered: 2018
CS3001-Theory of Computation
Semester: Monsoon
Offered: 2016
CS2092-Programming Lab
Semester: Monsoon
Offered: 2016
Presentations
Google Scholar
Data Structures, Design and Analysis of Algorithms