Sukumar Mondal

Orcid: 0000-0002-5639-8439

According to our database1, Sukumar Mondal authored at least 23 papers between 2000 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Edge-vertex domination on interval graphs.
Discret. Math. Algorithms Appl., February, 2024

2023
Segmentation of breast lesion in DCE-MRI by multi-level thresholding using sine cosine algorithm with quasi opposition-based learning.
Pattern Anal. Appl., February, 2023

Breast lesion detection from MRI images using quasi-oppositional slime mould algorithm.
Multim. Tools Appl., 2023

Identification of Trajectory Anomalies on Video Surveillance Systems.
Int. J. Digit. Lit. Digit. Competence, 2023

2022
Energy of interval-valued fuzzy graphs and its application in ecological systems.
J. Appl. Math. Comput., October, 2022

Breast DCE-MRI segmentation for lesion detection using Chimp Optimization Algorithm.
Expert Syst. Appl., 2022

Computation of diameter, radius and center of permutation graphs.
Discret. Math. Algorithms Appl., 2022

2021
A study of cluster hypergraphs and its properties.
Soc. Netw. Anal. Min., 2021

Cliques and Clique Covers in Interval-Valued Fuzzy Graphs.
Int. J. Comput. Intell. Syst., 2021

Minimum r-neighborhood covering set of permutation graphs.
Discret. Math. Algorithms Appl., 2021

Breast DCE-MRI segmentation for lesion detection by multi-level thresholding using student psychological based optimization.
Biomed. Signal Process. Control., 2021

Breast DCE-MRI Segmentation for Lesion Detection by Multilevel Thresholding Using Arithmetic Optimization Algorithm.
Proceedings of the Evolution in Computational Intelligence, 2021

2019
An optimal algorithm to find minimum k-hop dominating set of interval graphs.
Discret. Math. Algorithms Appl., 2019

2018
A study on bipolar fuzzy planar graph and its application in image shrinking.
J. Intell. Fuzzy Syst., 2018

2017
Computation of inverse 1-centre location problem on the weighted interval graphs.
Int. J. Comput. Sci. Math., 2017

2014
Computation of a Tree 3-Spanner on Trapezoid Graphs.
CoRR, 2014

2010
The <i>k</i>-neighbourhood-covering problem on interval graphs.
Int. J. Comput. Math., 2010

A linear time algorithm to construct a tree 4-spanner on trapezoid graphs.
Int. J. Comput. Math., 2010

2003
An Optimal Algorithm to Solve the All-Pairs Shortest Paths Problem on Permutation Graphs.
J. Math. Model. Algorithms, 2003

Optimal Sequential and Parallel Algorithms to Compute a Steiner Tree on Permutation Graphs.
Int. J. Comput. Math., 2003

2002
An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs.
Int. J. Comput. Math., 2002

An Optimal Algorithm for Solving All-Pairs Shortest Paths on Trapezoid Graphs.
Int. J. Comput. Eng. Sci., 2002

2000
An optimal parallel algorithm for computing cut vertices and blocks on interval graphs.
Int. J. Comput. Math., 2000


  Loading...