default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDC. S. Rahul 0001
Person information
- affiliation: Indian Institute of Technology Goa, Department of Computer Science, Ponda
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j5]Robert Ganian, Sebastian Ordyniak, C. S. Rahul
:
Group Activity Selection with Few Agent Types. Algorithmica 85(5): 1111-1155 (2023)- [j4]Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul:
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials. Algorithmica 85(9): 2554-2579 (2023) - 2022
- [j3]Hanan Hussain, P. S. Tamizharasan, C. S. Rahul:
Design possibilities and challenges of DNN models: a review on the perspective of end devices. Artif. Intell. Rev. 55(7): 5109-5167 (2022) - [c5]Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul:
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials. ICALP 2022: 83:1-83:20 - 2020
- [i6]Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul:
Graph Homomorphism Polynomials: Algorithms and Complexity. CoRR abs/2011.04778 (2020)
2010 – 2019
- 2019
- [j2]Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan:
On the Complexity Landscape of Connected f-Factor Problems. Algorithmica 81(6): 2606-2632 (2019) - [c4]Robert Ganian, Sebastian Ordyniak, C. S. Rahul:
Group Activity Selection with Few Agent Types. ESA 2019: 48:1-48:16 - 2018
- [j1]Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul, Marten Waanders:
Approximation Algorithms for Connected Graph Factors of Minimum Weight. Theory Comput. Syst. 62(2): 441-464 (2018) - [i5]Robert Ganian, Sebastian Ordyniak, C. S. Rahul:
Group Activity Selection with Few Agent Types. CoRR abs/1808.06954 (2018) - [i4]Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan:
On the Complexity Landscape of Connected f -Factor Problems. CoRR abs/1812.02037 (2018) - 2016
- [c3]Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan:
On the Complexity Landscape of Connected f-Factor Problems. MFCS 2016: 41:1-41:14 - [i3]N. S. Narayanaswamy, C. S. Rahul:
A Characterization for the Existence of Connected $f$-Factors of $\textit{ Large}$ Minimum Degree. CoRR abs/1601.06291 (2016) - 2015
- [c2]N. S. Narayanaswamy, C. S. Rahul:
Approximation and Exact Algorithms for Special Cases of Connected f-Factors. CSR 2015: 350-363 - [i2]N. S. Narayanaswamy, C. S. Rahul:
A Classification of Connected f -factor Problems inside NP. CoRR abs/1507.07856 (2015) - 2013
- [c1]Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul:
Approximability of Connected Factors. WAOA 2013: 120-131 - [i1]Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul:
Approximability of Connected Factors. CoRR abs/1310.2387 (2013)
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-07 21:17 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:
