R. Subashini

Publication Activity (10 Years)

Years Active: 2009-2023
Publications (10 Years): 15

Top Topics

Graph Theoretic

Parameterized Complexity

Dense Subgraphs

Top Venues

Theor. Comput. Sci.

Publications

M. Rema, R. Subashini, Subhasree Methirumangalath, Varun Rajan
Classical and Parameterized Complexity of Line Segment Covering Problems in Arrangement. FICTA (2) (2023)
Remi Raman, Shahin John J. S, R. Subashini, Subhasree Methirumangalath
On the parameterized complexity of the Maximum Exposure Problem. Inf. Process. Lett. 180 (2023)
Geevarghese Philip, M. R. Rani, R. Subashini
On computing the Hamiltonian index of graphs. Theor. Comput. Sci. 940 (Part) (2023)
Remi Raman, Shahin John J. S, R. Subashini, Subhasree Methirumangalath
On the Parameterized Complexity of the Maximum Exposure Problem. CoRR (2022)
Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini
On Subgraph Complementation to H-free Graphs. Algorithmica 84 (10) (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)
Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep, R. Subashini
Cutting a tree with Subgraph Complementation is hard, except for some small trees. CoRR (2022)
Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini
On Subgraph Complementation to H-free Graphs. WG (2021)
Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini
On subgraph complementation to H-free graphs. CoRR (2021)
Geevarghese Philip, M. R. Rani, R. Subashini
On Computing the Hamiltonian Index of Graphs. CSR (2020)
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 (2020)
Geevarghese Philip, M. R. Rani, R. Subashini
On Computing the Hamiltonian Index of Graphs. CoRR (2019)
M. R. Rani, Mohith Jagalmohanan, R. Subashini
Classical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems. FAW (2018)
M. R. Rani, R. Subashini
Fixed-Parameter Tractability of the Simultaneous Consecutive Ones Submatrix & Editing Problems. CoRR (2017)
N. S. Narayanaswamy, R. Subashini
Obtaining Matrices with the Consecutive Ones Property by Row Deletions. Algorithmica 71 (3) (2015)
N. S. Narayanaswamy, R. Subashini
d-COS-R is FPT via Interval Deletion CoRR (2013)
N. S. Narayanaswamy, R. Subashini
FPT Algorithms for Consecutive Ones Submatrix Problems. IPEC (2013)
N. S. Narayanaswamy, R. Subashini
A new characterization of matrices with the consecutive ones property. Discret. Appl. Math. 157 (18) (2009)