default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSangram K. Jena 0001
Person information
- affiliation: Miami University, Department of Computer Science and Software Engineering, Oxford, OH, USA
- affiliation: West Virginia University, Lane Department of Computer Science & Electrical Engineering, Morgantown, WV, USA
- affiliation: Indian Institute of Technology Guwahati (IITG), Guwahati, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Sangram K. Jena, K. Subramani
, Alvaro Velasquez:
Designing dataless neural networks for kidney exchange variants. Neural Comput. Appl. 36(35): 22265-22275 (2024)- [c10]Sangram K. Jena, Piotr Wojciechowski:
Representation of Dominating Set Variants Using Dataless Neural Networks. AAIM (2) 2024: 15-26 - [c9]Sangram Kishor Jena, K. Subramani, Alvaro Velasquez:
A Differential Approach for Several NP-hard Optimization Problems. ISAIM 2024: 68-80 - 2023
- [c8]Sangram Kishor Jena, K. Subramani, Alvaro Velasquez:
Differentiable Discrete Optimization Using Dataless Neural Networks. COCOA (2) 2023: 3-15 - 2022
- [j4]Sangram Kishor Jena, Gautam K. Das:
Vertex-edge domination in unit disk graphs. Discret. Appl. Math. 319: 351-361 (2022) - [j3]Sangram Kishor Jena, Ramesh K. Jallu, Gautam K. Das:
On d-distance m-tuple (ℓ, r)-domination in graphs. Inf. Process. Lett. 174: 106178 (2022) - [c7]Sangram Kishor Jena, K. Subramani:
Analyzing the 3-path Vertex Cover Problem in Planar Bipartite Graphs. TAMC 2022: 103-115 - 2021
- [c6]Sangram Kishor Jena, Gautam K. Das:
Total Domination in Geometric Unit Disk Graphs. CCCG 2021: 219-227 - 2020
- [j2]Pawan K. Mishra, Sangram Kishor Jena, Gautam K. Das, S. V. Rao:
Capacitated discrete unit disk cover. Discret. Appl. Math. 285: 242-251 (2020) - [j1]Ramesh K. Jallu, Sangram Kishor Jena, Gautam K. Das:
Liar's domination in unit disk graphs. Theor. Comput. Sci. 845: 38-49 (2020) - [c5]Sangram Kishor Jena, Gautam K. Das:
Vertex-Edge Domination in Unit Disk Graphs. CALDAM 2020: 67-78 - [i4]Ramesh K. Jallu, Sangram Kishor Jena, Gautam K. Das:
Liar's Domination in Unit Disk Graphs. CoRR abs/2005.13913 (2020) - [i3]Sangram Kishor Jena, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy:
The Generalized Independent and Dominating Set Problems on Unit Disk Graphs. CoRR abs/2006.15381 (2020) - [i2]Sangram Kishor Jena, Gautam K. Das:
Total Domination in Unit Disk Graphs. CoRR abs/2007.11997 (2020)
2010 – 2019
- 2019
- [c4]Pawan K. Mishra, Sangram Kishor Jena, Gautam K. Das, S. V. Rao:
Capacitated Discrete Unit Disk Cover. WALCOM 2019: 407-418 - [i1]Sangram Kishor Jena, Ramesh K. Jallu, Gautam K. Das:
Generalized Liar's Dominating Set in Graphs. CoRR abs/1907.11416 (2019) - 2018
- [c3]Ramesh K. Jallu, Sangram Kishor Jena, Gautam K. Das:
Liar's Dominating Set in Unit Disk Graphs. COCOON 2018: 516-528 - [c2]Sangram Kishor Jena, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy:
The Maximum Distance-d Independent Set Problem on Unit Disk Graphs. FAW 2018: 68-80 - 2015
- [c1]Bijaya K. Bhatta, Sangram Kishor Jena:
Global t-Sweep Coverage Problem with Minimum Interference. ICIT 2015: 20-25
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 2025-01-09 19:33 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:
