default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 24 matches
- 2025
- Dipayan Chakraborty, Soumen Nandi, Sagnik Sen, D. K. Supraja:
A linear algorithm for radio k-coloring of powers of paths having small diameters. J. Comput. Syst. Sci. 147: 103577 (2025) - 2024
- Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja:
On locating and neighbor-locating colorings of sparse graphs. Discret. Appl. Math. 358: 366-381 (2024) - Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael A. Henning, Annegret Katrin Wagler:
Progress towards the two-thirds conjecture on locating-total dominating sets. Discret. Math. 347(12): 114176 (2024) - Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret Wagler:
On Three Domination-based Identification Problems in Block Graphs. Fundam. Informaticae 191(3-4): 197-229 (2024) - Silvia M. Bianchi, Dipayan Chakraborty, Yanina Lucarini, Annegret Katrin Wagler:
Location-Domination Type Problems Under the Mycielski Construction. CALDAM 2024: 255-269 - Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale:
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover. ISAAC 2024: 19:1-19:18 - Dipayan Chakraborty, Annegret Katrin Wagler:
Open-Separating Dominating Codes in Graphs. ISCO 2024: 137-151 - Dipayan Chakraborty, Annegret Katrin Wagler:
Open-separating dominating codes in graphs. CoRR abs/2402.03015 (2024) - Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale:
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover. CoRR abs/2402.08346 (2024) - Dipayan Chakraborty, Annegret Katrin Wagler:
On full-separating sets in graphs. CoRR abs/2407.10595 (2024) - 2023
- Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen:
On clique numbers of colored mixed graphs. Discret. Appl. Math. 324: 29-40 (2023) - Samik Chakraborty, Dipayan Chatterjee, Subrata Golui, Madhuchhanda Mitra, Saurabh Pal:
Effect of facial expression in face biometry for a multimodal approach. Int. J. Biom. 15(1): 101-119 (2023) - Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja:
New Bounds and Constructions for Neighbor-Locating Colorings of Graphs. CALDAM 2023: 121-133 - Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret Katrin Wagler:
On Three Domination-Based Identification Problems in Block Graphs. CALDAM 2023: 271-283 - Dipayan Chakraborty, R. B. Sandeep:
Contracting Edges to Destroy a Pattern: A Complexity Study. FCT 2023: 118-131 - Dipayan Chakraborty, Soumen Nandi, Sagnik Sen, D. K. Supraja:
A Linear Algorithm for Radio k-Coloring Powers of Paths Having Small Diameter. IWOCA 2023: 148-159 - Dipayan Chakraborty, Florent Foucaud, Tuomo Lehtilä:
Identifying codes in bipartite graphs of given maximum degree. LAGOS 2023: 157-165 - Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja:
New bounds and constructions for neighbor-locating colorings of graphs. CoRR abs/2301.13557 (2023) - Dipayan Chakraborty, R. B. Sandeep:
Contracting edges to destroy a pattern: A complexity study. CoRR abs/2302.13605 (2023) - 2022
- Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael A. Henning, Annegret Wagler:
Progress towards the two-thirds conjecture on locating-total dominating sets. CoRR abs/2211.14178 (2022) - 2021
- Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen:
On clique numbers of colored mixed graphs. CoRR abs/2104.07416 (2021) - 2020
- Dipayan Dewan, Lidia Ghosh, Biswadeep Chakraborty, Abir Chowdhury, Amit Konar, Atulya K. Nagar:
Cognitive Analysis of Mental States of People According to Ethical Decisions Using Deep Learning Approach. IJCNN 2020: 1-8 - 2019
- Abir Chowdhury, Biswadeep Chakraborty, Lidia Ghosh, Dipayan Dewan, Amit Konar:
A Dynamical Phase Synchronization Based Approach to Study the Effects of Long-Term Alcoholism on Functional Connectivity Dynamics. PReMI (2) 2019: 218-226 - 2016
- Chiradeep Mukherjee, Sayak Pramanik, Dipayan Singha Roy, Souvik Mondal, Aritro Sinha, Arnab Guha Roy, Subham Bid, Shirsha Chakraborty:
Layered T methodology in QCA: NAND/NOR based circuit designing approach. UEMCON 2016: 1-6
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-12-09 08:22 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint