Classical and parameterized complexity of covering problems in line segment arrangements.

R. Subashini https://orcid.org/0000-0002-9724-3484

M. Rema R. Subashini Subhasree Methirumangalath Varun Rajan Classical and parameterized complexity of covering problems in line segment arrangements. 166-179 2025 10 Int. J. Comput. Math. Comput. Syst. Theory 3 https://doi.org/10.1080/23799927.2025.2528169 db/journals/ijcmcst/ijcmcst10.html#RemaSMR25 streams/journals/ijcmcst

Remi Raman Shahin John J. S R. Subashini Subhasree Methirumangalath Fixed parameter tractable algorithms for watchman route related problems on line segment arrangements. 131-138 2024 9 Int. J. Comput. Math. Comput. Syst. Theory 3 https://doi.org/10.1080/23799927.2024.2357323 db/journals/ijcmcst/ijcmcst9.html#RamanSSM24 streams/journals/ijcmcst

Dhanyamol Antony Sagartanu Pal R. B. Sandeep R. Subashini Cutting a tree with subgraph complementation is hard, except for some small trees. 126-168 2024 107 J. Graph Theory 1 https://doi.org/10.1002/jgt.23112 db/journals/jgt/jgt107.html#AntonyPSS24 streams/journals/jgt

Remi Raman Shahin John J. S R. Subashini Subhasree Methirumangalath On the parameterized complexity of the Maximum Exposure Problem. 106338 2023 180 Inf. Process. Lett. https://doi.org/10.1016/j.ipl.2022.106338 db/journals/ipl/ipl180.html#RamanSSM23

Geevarghese Philip M. R. Rani R. Subashini On computing the Hamiltonian index of graphs. 149-179 2023 940 Theor. Comput. Sci. Part https://doi.org/10.1016/j.tcs.2022.10.047 db/journals/tcs/tcs940.html#PhilipRS23

M. Rema R. Subashini Subhasree Methirumangalath Varun Rajan Classical and Parameterized Complexity of Line Segment Covering Problems in Arrangement. 327-338 2023 FICTA (2) https://doi.org/10.1007/978-981-99-6706-3_29 conf/ficta/2023-2 db/conf/ficta/ficta2023-2.html#RemaSMR23

Dhanyamol Antony Jay Garchar Sagartanu Pal R. B. Sandeep Sagnik Sen 0001 R. Subashini On Subgraph Complementation to H-free Graphs. 2842-2870 2022 84 Algorithmica 10 https://doi.org/10.1007/s00453-022-00991-3 db/journals/algorithmica/algorithmica84.html#AntonyGPSSS22

Dhanyamol Antony Sagartanu Pal R. B. Sandeep R. Subashini Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees. 3-19 2022 LATIN https://doi.org/10.1007/978-3-031-20624-5_1 conf/latin/2022 db/conf/latin/latin2022.html#AntonyPSS22

Dhanyamol Antony Sagartanu Pal R. B. Sandeep R. Subashini Cutting a tree with Subgraph Complementation is hard, except for some small trees. 2022 abs/2202.13620 CoRR https://arxiv.org/abs/2202.13620 db/journals/corr/corr2202.html#abs-2202-13620

Remi Raman Shahin John J. S R. Subashini Subhasree Methirumangalath On the Parameterized Complexity of the Maximum Exposure Problem. 2022 abs/2203.11114 CoRR https://doi.org/10.48550/arXiv.2203.11114 db/journals/corr/corr2203.html#abs-2203-11114

Dhanyamol Antony Jay Garchar Sagartanu Pal R. B. Sandeep Sagnik Sen 0001 R. Subashini On Subgraph Complementation to H-free Graphs. 118-129 2021 WG https://doi.org/10.1007/978-3-030-86838-3_9 conf/wg/2021 db/conf/wg/wg2021.html#AntonyGPSSS21

Dhanyamol Antony Jay Garchar Sagartanu Pal R. B. Sandeep Sagnik Sen 0001 R. Subashini On subgraph complementation to H-free graphs. 2021 abs/2103.02936 CoRR https://arxiv.org/abs/2103.02936 db/journals/corr/corr2103.html#abs-2103-02936

M. R. Rani R. Subashini Mohith Jagalmohanan Simultaneous consecutive ones submatrix and editing problems: Classical complexity and fixed-parameter tractable results. 13-38 2020 812 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2019.05.043 https://www.wikidata.org/entity/Q127553174 db/journals/tcs/tcs812.html#RaniSJ20

Geevarghese Philip M. R. Rani R. Subashini On Computing the Hamiltonian Index of Graphs. 341-353 2020 CSR https://doi.org/10.1007/978-3-030-50026-9_25 conf/csr/2020 db/conf/csr/csr2020.html#PhilipRS20

Geevarghese Philip M. R. Rani R. Subashini On Computing the Hamiltonian Index of Graphs. 2019 abs/1912.01990 CoRR http://arxiv.org/abs/1912.01990 db/journals/corr/corr1912.html#abs-1912-01990

M. R. Rani Mohith Jagalmohanan R. Subashini Classical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems. 154-168 2018 FAW https://doi.org/10.1007/978-3-319-78455-7_12 conf/faw/2018 db/conf/faw/faw2018.html#RaniJS18

M. R. Rani R. Subashini Fixed-Parameter Tractability of the Simultaneous Consecutive Ones Submatrix & Editing Problems. 2017 abs/1707.00106 CoRR http://arxiv.org/abs/1707.00106 db/journals/corr/corr1707.html#RaniS17

N. S. Narayanaswamy R. Subashini Obtaining Matrices with the Consecutive Ones Property by Row Deletions. 758-773 2015 71 Algorithmica 3 https://doi.org/10.1007/s00453-014-9925-1 db/journals/algorithmica/algorithmica71.html#NarayanaswamyS15

N. S. Narayanaswamy R. Subashini FPT Algorithms for Consecutive Ones Submatrix Problems. 295-307 2013 IPEC https://doi.org/10.1007/978-3-319-03898-8_25 conf/iwpec/2013 db/conf/iwpec/ipec2013.html#NarayanaswamyS13

N. S. Narayanaswamy R. Subashini d-COS-R is FPT via Interval Deletion http://arxiv.org/abs/1303.1643 2013 CoRR abs/1303.1643 db/journals/corr/corr1303.html#abs-1303-1643

N. S. Narayanaswamy R. Subashini A new characterization of matrices with the consecutive ones property. 3721-3727 2009 157 Discret. Appl. Math. 18 https://doi.org/10.1016/j.dam.2009.08.001 db/journals/dam/dam157.html#NarayanaswamyS09

Dhanyamol Antony Jay Garchar Mohith Jagalmohanan Subhasree Methirumangalath N. S. Narayanaswamy Sagartanu Pal Geevarghese Philip Varun Rajan Remi Raman M. R. Rani M. Rema Shahin John J. S R. B. Sandeep Sagnik Sen 0001