default search action
Sudeep Stephen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j11]R. Nathiya, D. Meiyappan, Savari Prabhu, Sudeep Stephen:
Bandwidth of WK-recursive networks and its sparse matrix computation. J. Supercomput. 81(1): 175 (2025) - 2023
- [c4]Andrew Luxton-Reilly
, Ewan D. Tempero
Automated Assessment: Experiences From the Trenches. ACE 2023: 1-10
2010 – 2019
- 2019
- [j10]Daniela Ferrero
Zero forcing in iterated line digraphs. Discret. Appl. Math. 255: 198-208 (2019) - [j9]Daniela Ferrero
Minimum rank and zero forcing number for butterfly networks. J. Comb. Optim. 37(3): 970-988 (2019) - 2018
- [j8]Randy Davila
A lower bound on the zero forcing number. Discret. Appl. Math. 250: 363-367 (2018) - 2017
- [j7]Cyriac Grigorious, Sudeep Stephen
On the Partition Dimension of Circulant Graphs. Comput. J. 60(2): 180-184 (2017) - [c3]Cyriac Grigorious, Thomas Kalinowski
On the Power Domination Number of de Bruijn and Kautz Digraphs. IWOCA 2017: 264-272 - [i4]Cyriac Grigorious, Thomas Kalinowski, Joe Ryan, Sudeep Stephen:
The metric dimension of the circulant graph C(n, \pm\{1, 2, 3, 4\}). CoRR abs/1702.08178 (2017) - 2016
- [j6]Sandi Klavzar
Average Distance in Interconnection Networks via Reduction Theorems for Vertex-Weighted Graphs. Comput. J. 59(12): 1900-1910 (2016) - [i3]Daniela Ferrero, Cyriac Grigorious, Thomas Kalinowski, Joe Ryan, Sudeep Stephen:
Minimum rank and zero forcing number for butterfly networks. CoRR abs/1607.07522 (2016) - [i2]Randy Davila, Thomas Kalinowski, Sudeep Stephen:
Proof of a conjecture of Davila and Kenter regarding a lower bound for the forcing number in terms of girth and minimum degree. CoRR abs/1611.06557 (2016) - [i1]Cyriac Grigorious, Thomas Kalinowski, Joe Ryan, Sudeep Stephen:
On the power domination number of de Bruijn and Kautz digraphs. CoRR abs/1612.01721 (2016) - 2015
- [j5]Sudeep Stephen
Resolving-power dominating sets. Appl. Math. Comput. 256: 778-785 (2015) - [j4]Sudeep Stephen
Power domination in certain chemical structures. J. Discrete Algorithms 33: 10-18 (2015) - [j3]Paul D. Manuel
On the Strong Metric Dimension of Tetrahedral Diamond Lattice. Math. Comput. Sci. 9(2): 201-208 (2015) - 2014
- [j2]Cyriac Grigorious
On the metric dimension of circulant and Harary graphs. Appl. Math. Comput. 248: 47-54 (2014) - [j1]Cyriac Grigorious
On the partition dimension of a class of circulant graphs. Inf. Process. Lett. 114(7): 353-356 (2014) - 2012
- [c2]Bharati Rajan, Indra Rajasingh, Sudeep Stephen
Spectrum of Sierpiński triangles using MATLAB. DICTAP 2012: 400-403 - [c1]Bharati Rajan, Indra Rajasingh, Cyriac Grigorious
Energy of grid based networks using MATLAB. DICTAP 2012: 404-408
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-12-03 20:30 CET 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: