default search action
Arindam Dey 0002
Person information
- affiliation: Saroj Mohan Institute of Technology, Department of Computer Science and Engineering, Hooghly, India
Other persons with the same name
- Arindam Dey 0001
— Meta (and 5 more)
- Arindam Dey 0003
- Arindam Dey 0004 — Ericsson, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Joydeep Kundu, Sahabul Alam
Trust-Based Flying Ad Hoc Network: A Survey. IEEE Access 12: 99258-99281 (2024) - 2023
- [j12]Arindam Dey, Anita Pal:
Types of uncertain nodes in a fuzzy graph. Int. J. Adv. Intell. Paradigms 24(3/4): 332-340 (2023) - [j11]Kartick Mohanta
An application of neutrosophic logic on an inventory model with two-level partial trade credit policy for time-dependent perishable products. Soft Comput. 27(8): 4795-4822 (2023) - 2022
- [j10]Arindam Dey, Anita Pal:
Types of fuzzy graph colouring and polynomial ideal theory. Int. J. Adv. Intell. Paradigms 23(1/2): 146-154 (2022) - [j9]Tejinder Singh Lakhwani, Kartick Mohanta, Arindam Dey, Sankar Prasad Mondal, Anita Pal:
Some operations on Dombi neutrosophic graph. J. Ambient Intell. Humaniz. Comput. 13(1): 425-443 (2022) - 2020
- [j8]Kartick Mohanta, Arindam Dey, Anita Pal, Hoang Viet Long, Le Hoang Son:
A study of m-polar neutrosophic graph with applications. J. Intell. Fuzzy Syst. 38(4): 4809-4828 (2020) - [j7]Wei Xiao, Arindam Dey, Le Hoang Son:
A study on regular picture fuzzy graph with applications in communication networks. J. Intell. Fuzzy Syst. 39(3): 3633-3645 (2020) - [j6]Irfan Deli, Hoang Viet Long, Le Hoang Son, Raghvendra Kumar, Arindam Dey:
New expected impact functions and algorithms for modeling games under soft sets. J. Intell. Fuzzy Syst. 39(3): 4463-4472 (2020) - [j5]Arindam Dey
Fuzzy minimum spanning tree with interval type 2 fuzzy arc length: formulation and a new genetic algorithm. Soft Comput. 24(6): 3963-3974 (2020)
2010 – 2019
- 2019
- [j4]Arindam Dey
Computing the shortest path with words. Int. J. Adv. Intell. Paradigms 12(3/4): 355-369 (2019) - [j3]Arindam Dey
Robust and minimum spanning tree in fuzzy environment. Int. J. Comput. Sci. Math. 10(5): 513-524 (2019) - [j2]Arindam Dey
A genetic algorithm for total graph coloring. J. Intell. Fuzzy Syst. 37(6): 7831-7838 (2019) - [c3]Arindam Dey
Genetic algorithm for Robust Total coloring of a Fuzzy graph. CEC 2019: 1806-1813 - 2018
- [j1]Arindam Dey
New Concepts on Vertex and Edge Coloring of Simple Vague Graphs. Symmetry 10(9): 373 (2018) - 2017
- [c2]Said Broumi
An algorithmic approach for computing the complement of intuitionistic fuzzy graphs. ICNC-FSKD 2017: 474-480 - 2014
- [c1]Arindam Dey
The Fuzzy Robust Graph Coloring Problem. FICTA (1) 2014: 805-813
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-10-07 22:19 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: