default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSukumar Mondal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Amita Samanta Adhya, Sukumar Mondal, Sambhu Charan Barman
:
Edge-vertex domination on interval graphs. Discret. Math. Algorithms Appl. 16(2): 2350015:1-2350015:12 (2024)- [j21]Subhrananda Goswami, Sukumar Mondal, Subhankar Johardar, Chandan Bikash Das:
HS-WOA-MANET: a hybrid meta-heuristic approach-based multi-objective constraints for energy efficient routing protocol in mobile ad hoc networks. J. Reliab. Intell. Environ. 10(2): 151-176 (2024) - 2023
- [j20]Suman Mondal, Arindam Roy, Sukumar Mondal:
Identification of Trajectory Anomalies on Video Surveillance Systems. Int. J. Digit. Lit. Digit. Competence 14(1): 1-18 (2023) - [j19]Dipak Kumar Patra, Tapas Si, Sukumar Mondal, Prakash Mukherjee:
Breast lesion detection from MRI images using quasi-oppositional slime mould algorithm. Multim. Tools Appl. 82(20): 30599-30641 (2023) - [j18]Tapas Si, Dipak Kumar Patra, Sukumar Mondal, Prakash Mukherjee:
Segmentation of breast lesion in DCE-MRI by multi-level thresholding using sine cosine algorithm with quasi opposition-based learning. Pattern Anal. Appl. 26(1): 201-216 (2023) - 2022
- [j17]Shaoli Nandi, Sukumar Mondal, Sambhu Charan Barman:
Computation of diameter, radius and center of permutation graphs. Discret. Math. Algorithms Appl. 14(8): 2250039:1-2250039:23 (2022) - [j16]Tapas Si, Dipak Kumar Patra, Sukumar Mondal, Prakash Mukherjee:
Breast DCE-MRI segmentation for lesion detection using Chimp Optimization Algorithm. Expert Syst. Appl. 204: 117481 (2022) - [j15]Napur Patra, Sanjib Mondal, Madhumangal Pal, Sukumar Mondal:
Energy of interval-valued fuzzy graphs and its application in ecological systems. J. Appl. Math. Comput. 68(5): 3327-3345 (2022) - 2021
- [j14]Dipak Kumar Patra, Tapas Si, Sukumar Mondal, Prakash Mukherjee:
Breast DCE-MRI segmentation for lesion detection by multi-level thresholding using student psychological based optimization. Biomed. Signal Process. Control. 69: 102925 (2021) - [j13]Amita Samanta Adhya, Sukumar Mondal, Sambhu Charan Barman:
Minimum r-neighborhood covering set of permutation graphs. Discret. Math. Algorithms Appl. 13(6): 2150081:1-2150081:14 (2021) - [j12]Napur Patra, Tarasankar Pramanik, Madhumangal Pal, Sukumar Mondal:
Cliques and Clique Covers in Interval-Valued Fuzzy Graphs. Int. J. Comput. Intell. Syst. 14(1): 1773-1783 (2021) - [j11]Ananta Maity, Kousik Das, Sovan Samanta, Sukumar Mondal, Vivek Kumar Dubey:
A study of cluster hypergraphs and its properties. Soc. Netw. Anal. Min. 11(1): 20 (2021) - [c1]Dipak Kumar Patra, Tapas Si, Sukumar Mondal, Prakash Mukherjee:
Breast DCE-MRI Segmentation for Lesion Detection by Multilevel Thresholding Using Arithmetic Optimization Algorithm. FICTA (2) 2021: 327-340
2010 – 2019
- 2019
- [j10]Sambhu Charan Barman, Madhumangal Pal, Sukumar Mondal:
An optimal algorithm to find minimum k-hop dominating set of interval graphs. Discret. Math. Algorithms Appl. 11(2): 1950016:1-1950016:18 (2019) - 2018
- [j9]Tarasankar Pramanik, Madhumangal Pal, Sukumar Mondal, Sovan Samanta:
A study on bipolar fuzzy planar graph and its application in image shrinking. J. Intell. Fuzzy Syst. 34(3): 1863-1874 (2018) - 2017
- [j8]Biswanath Jana, Sukumar Mondal, Madhumangal Pal:
Computation of inverse 1-centre location problem on the weighted interval graphs. Int. J. Comput. Sci. Math. 8(6): 533-541 (2017) - 2014
- [i1]Sambhu Charan Barman, Sukumar Mondal, Madhumangal Pal:
Computation of a Tree 3-Spanner on Trapezoid Graphs. CoRR abs/1407.8132 (2014) - 2010
- [j7]Sambhu Charan Barman, Sukumar Mondal, Madhumangal Pal:
A linear time algorithm to construct a tree 4-spanner on trapezoid graphs. Int. J. Comput. Math. 87(4): 743-755 (2010) - [j6]Sambhu Charan Barman, Madhumangal Pal, Sukumar Mondal:
The k-neighbourhood-covering problem on interval graphs. Int. J. Comput. Math. 87(9): 1918-1935 (2010)
2000 – 2009
- 2003
- [j5]Sukumar Mondal, Madhumangal Pal, Tapan Kumar Pal:
Optimal Sequential and Parallel Algorithms to Compute a Steiner Tree on Permutation Graphs. Int. J. Comput. Math. 80(8): 937-943 (2003) - [j4]Sukumar Mondal, Madhumangal Pal, Tapan Kumar Pal:
An Optimal Algorithm to Solve the All-Pairs Shortest Paths Problem on Permutation Graphs. J. Math. Model. Algorithms 2(1): 57-65 (2003) - 2002
- [j3]Sukumar Mondal, Madhumangal Pal, Tapan Kumar Pal:
An Optimal Algorithm for Solving All-Pairs Shortest Paths on Trapezoid Graphs. Int. J. Comput. Eng. Sci. 3(2): 103-116 (2002) - [j2]Sukumar Mondal, Madhumangal Pal, Tapan Kumar Pal:
An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs. Int. J. Comput. Math. 79(2): 189-204 (2002) - 2000
- [j1]Madhumangal Pal, Sukumar Mondal, Debashis Bera, Tapan Kumar Pal:
An optimal parallel algorithm for computing cut vertices and blocks on interval graphs. Int. J. Comput. Math. 75(1): 59-70 (2000)
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 00:27 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:
