default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUma Kant Sahoo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j8]Dibyayan Chakraborty
, Sandip Das, Srijit Mukherjee, Uma Kant Sahoo, Sagnik Sen:
Triangle-free projective-planar graphs with diameter two: Domination and characterization. Discret. Appl. Math. 331: 11-24 (2023)- 2021
- [j7]Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen:
Cops and Robber on some families of oriented graphs. Theor. Comput. Sci. 888: 31-40 (2021) - 2020
- [j6]Siddani Bhaskara Rao, Uma Kant Sahoo, V. Parameswaran:
Cycle stochastic graphs: Structural and forbidden graph characterizations. AKCE Int. J. Graphs Comb. 17(3): 1076-1080 (2020) - 2019
- [j5]Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee, Uma Kant Sahoo:
Bounds on the Bend Number of Split and Cocomparability Graphs. Theory Comput. Syst. 63(6): 1336-1357 (2019) - 2015
- [j4]Siddani Bhaskara Rao, Uma Kant Sahoo:
Embeddings in Eulerian graceful graphs. Australas. J Comb. 62: 128-139 (2015) - 2013
- [j3]Satya Ranjan Dash, Satchidananda Dehuri, Uma Kant Sahoo:
Interactions and Applications of Fuzzy, Rough, and Soft Set in Data Mining. Int. J. Fuzzy Syst. Appl. 3(3): 37-50 (2013) - [j2]Satya Ranjan Dash, Satchidananda Dehuri, Uma Kant Sahoo:
Scaled Fuzzy Graph for Cluster Analysis in DNA Sequence of Olfactory Receptors. Int. J. Heal. Inf. Syst. Informatics 8(1): 57-70 (2013) - 2012
- [j1]Satya Ranjan Dash, Satchidananda Dehuri, Uma Kant Sahoo:
Usage of Fuzzy, Rough, and Soft Set Approach in Association Rule Mining. Int. J. Artif. Life Res. 3(3): 64-77 (2012)
Conference and Workshop Papers
- 2023
- [c5]Sandip Das, Harmender Gahlawat, Ashwin Ramgopal, Uma Kant Sahoo, Sagnik Sen:
Cops and Robber on Oriented Graphs with Respect to Push Operation. CALDAM 2023: 309-320 - 2021
- [c4]Sandip Das, Siddani Bhaskara Rao, Uma Kant Sahoo:
On Degree Sequences and Eccentricities in Pseudoline Arrangement Graphs. CALDAM 2021: 259-271 - 2019
- [c3]Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen:
Cops and Robber on Some Families of Oriented Graphs. IWOCA 2019: 188-200 - 2018
- [c2]Sandip Das, Subhadeep Ranjan Dev, Arpan Sadhukhan, Uma Kant Sahoo, Sagnik Sen:
Burning Spiders. CALDAM 2018: 155-163 - 2012
- [c1]Satya Ranjan Dash, Satchidananda Dehuri, Uma Kant Sahoo, Gi-Nam Wang:
On Clustering of DNA Sequence of Olfactory Receptors Using Scaled Fuzzy Graph Model. SocProS 2012: 875-884
Informal and Other Publications
- 2022
- [i2]Dibyayan Chakraborty, Sandip Das, Srijit Mukherjee, Uma Kant Sahoo, Sagnik Sen:
Triangle-free projective-planar graphs with diameter two: domination and characterization. CoRR abs/2212.04253 (2022) - 2018
- [i1]Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee, Uma Kant Sahoo:
On bounds on bend number of classes of split and cocomparability graphs. CoRR abs/1804.06584 (2018)
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-05-08 21:46 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:
