default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDR. Subashini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]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)- [j5]Geevarghese Philip, M. R. Rani, R. Subashini:
On computing the Hamiltonian index of graphs. Theor. Comput. Sci. 940(Part): 149-179 (2023) - [c6]M. Rema, R. Subashini, Subhasree Methirumangalath, Varun Rajan:
Classical and Parameterized Complexity of Line Segment Covering Problems in Arrangement. FICTA (2) 2023: 327-338 - 2022
- [j4]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) - [c5]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 - [i6]Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep, R. Subashini:
Cutting a tree with Subgraph Complementation is hard, except for some small trees. CoRR abs/2202.13620 (2022) - [i5]Remi Raman, Shahin John J. S, R. Subashini, Subhasree Methirumangalath:
On the Parameterized Complexity of the Maximum Exposure Problem. CoRR abs/2203.11114 (2022) - 2021
- [c4]Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini:
On Subgraph Complementation to H-free Graphs. WG 2021: 118-129 - [i4]Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini:
On subgraph complementation to H-free graphs. CoRR abs/2103.02936 (2021) - 2020
- [j3]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) - [c3]Geevarghese Philip, M. R. Rani, R. Subashini:
On Computing the Hamiltonian Index of Graphs. CSR 2020: 341-353
2010 – 2019
- 2019
- [i3]Geevarghese Philip, M. R. Rani, R. Subashini:
On Computing the Hamiltonian Index of Graphs. CoRR abs/1912.01990 (2019) - 2018
- [c2]M. R. Rani, Mohith Jagalmohanan, R. Subashini:
Classical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems. FAW 2018: 154-168 - 2017
- [i2]M. R. Rani, R. Subashini:
Fixed-Parameter Tractability of the Simultaneous Consecutive Ones Submatrix & Editing Problems. CoRR abs/1707.00106 (2017) - 2015
- [j2]N. S. Narayanaswamy, R. Subashini:
Obtaining Matrices with the Consecutive Ones Property by Row Deletions. Algorithmica 71(3): 758-773 (2015) - 2013
- [c1]N. S. Narayanaswamy, R. Subashini:
FPT Algorithms for Consecutive Ones Submatrix Problems. IPEC 2013: 295-307 - [i1]N. S. Narayanaswamy, R. Subashini:
d-COS-R is FPT via Interval Deletion. CoRR abs/1303.1643 (2013)
2000 – 2009
- 2009
- [j1]N. S. Narayanaswamy, R. Subashini:
A new characterization of matrices with the consecutive ones property. Discret. Appl. Math. 157(18): 3721-3727 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
