R. Subashini

Orcid: 0000-0002-9724-3484

According to our database1, R. Subashini authored at least 12 papers between 2009 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On computing the Hamiltonian index of graphs.
Theor. Comput. Sci., 2023

On the parameterized complexity of the Maximum Exposure Problem.
Inf. Process. Lett., 2023

Classical and Parameterized Complexity of Line Segment Covering Problems in Arrangement.
Proceedings of the Intelligent Data Engineering and Analytics, 2023

2022
On Subgraph Complementation to H-free Graphs.
Algorithmica, 2022

Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2020
Simultaneous consecutive ones submatrix and editing problems: Classical complexity and fixed-parameter tractable results.
Theor. Comput. Sci., 2020

2018
Classical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems.
Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

2017
Fixed-Parameter Tractability of the Simultaneous Consecutive Ones Submatrix & Editing Problems.
CoRR, 2017

2015
Obtaining Matrices with the Consecutive Ones Property by Row Deletions.
Algorithmica, 2015

2013
d-COS-R is FPT via Interval Deletion
CoRR, 2013

FPT Algorithms for Consecutive Ones Submatrix Problems.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

2009
A new characterization of matrices with the consecutive ones property.
Discret. Appl. Math., 2009


  Loading...