Subashini R

Associate Professor

Department of Computer Science and Engineering
National Institute of Technology, Calicut
Kozhikode, Kerala, India - 673601. India
Email: subaXnitcYacYin [@/X,./Y].

Research Interests:

• Graph theory & Algorithms
• Parameterized Algorithms

Academic Background:

• 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.Tech. Department of Computer Science and Engineering, Institute of Road and Transport Technology, Erode (1994-1998).

Publications:

• Raman Remi, Shahin John J S, R. Subashini, and Subhasree Methirumangalath. “Fixed Parameter Tractable Algorithms for Watchman Route Related Problems on Line Segment Arrangements,” International Journal of Computer Mathematics: Computer Systems Theory, May 1–8, 2024.


• Remi Raman, Shahin John J. S, R. Subashini, Subhasree Methirumangalath: On the parameterized complexity of the Maximum Exposure Problem. Inf. Process. Lett. 180: 106338 (2023)


• Geevarghese Philip, M. R. Rani, R. Subashini: On computing the Hamiltonian index of graphs. Theor. Comput. Sci. 940(Part): 149-179 (2023)


• M. Rema, R. Subashini, Subhasree Methirumangalath, Varun Rajan: Classical and Parameterized Complexity of Line Segment Covering Problems in Arrangement. FICTA (2) 2023: 327-338


• Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini: On Subgraph Complementation to H-free Graphs. Algorithmica 84(10): 2842-2870 (2022)


• Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep, R. Subashini: Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees. LATIN 2022: 3-19


• Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini: On Subgraph Complementation to H-free Graphs. WG 2021: 118-129.


• M. R. Rani, R. Subashini, Mohith Jagalmohanan: Simultaneous consecutive ones submatrix and editing problems: Classical complexity and fixed-parameter tractable results. Theor. Comput. Sci. 812: 13-38 (2020)


• Geevarghese Philip, M. R. Rani, R. Subashini:On Computing the Hamiltonian Index of Graphs. CSR 2020: 341-353.


• Rani, MR, Jagalmohanan M, Subashini R. 2018. Complexity Status and Fixed-Parameter Tractability of the Simultaneous Consecutive Ones Submatrix & Editing Problems, May 8-10, 2018. International Frontiers of Algorithmics Workshop (FAW 2018). , Guangzhou University, China.


• Narayanaswamy, NS, Subashini R. 2015. Obtaining Matrices with the Consecutive Ones Property by Row Deletions. Algorithmica, 2015. 71(3):758-773.


• Narayanaswamy, NS, Subashini R. 2013. FPT Algorithms for Consecutive Ones Submatrix Problems, 6 Septemebr. International Symposium on Parameterized and Exact Computation (IPEC), 2013. , Sophia Antipolis, France.


• Narayanaswamy, NS, Subashini R. 2009. A new characterization of matrices with the Consecutive Ones Property. Discrete Applied Mathematics (DAM), 2009. 157(18):3721-3727.

Ph.D. Scholars:

• Rani M R (2016 - 2021)


• Dhanyamol Antony (2017 -2023)


• Remi R (co-guide Subhasree M) (2017 - 2024)


• Rema M (co-guide Subhasree M) (2018 - )


• Kanimozhi C (co-guide Venkatarami Reddy Chintapalli ) (2023 - )

My Research Group: