default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDipayan Chakraborty
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j5]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
- [j4]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) - [j3]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) - [j2]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) - [c8]Silvia M. Bianchi, Dipayan Chakraborty, Yanina Lucarini, Annegret Katrin Wagler:
Location-Domination Type Problems Under the Mycielski Construction. CALDAM 2024: 255-269 - [c7]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 - [c6]Dipayan Chakraborty, Annegret Katrin Wagler:
Open-Separating Dominating Codes in Graphs. ISCO 2024: 137-151 - [i8]Dipayan Chakraborty, Annegret Katrin Wagler:
Open-separating dominating codes in graphs. CoRR abs/2402.03015 (2024) - [i7]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) - [i6]Dipayan Chakraborty, Annegret Katrin Wagler:
On full-separating sets in graphs. CoRR abs/2407.10595 (2024) - [i5]Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale:
Structural Parameterization of Locating-Dominating Set and Test Cover. CoRR abs/2411.17948 (2024) - 2023
- [j1]Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen:
On clique numbers of colored mixed graphs. Discret. Appl. Math. 324: 29-40 (2023) - [c5]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 - [c4]Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret Katrin Wagler:
On Three Domination-Based Identification Problems in Block Graphs. CALDAM 2023: 271-283 - [c3]Dipayan Chakraborty, R. B. Sandeep:
Contracting Edges to Destroy a Pattern: A Complexity Study. FCT 2023: 118-131 - [c2]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 - [c1]Dipayan Chakraborty, Florent Foucaud, Tuomo Lehtilä:
Identifying codes in bipartite graphs of given maximum degree. LAGOS 2023: 157-165 - [i4]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) - [i3]Dipayan Chakraborty, R. B. Sandeep:
Contracting edges to destroy a pattern: A complexity study. CoRR abs/2302.13605 (2023) - 2022
- [i2]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
- [i1]Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen:
On clique numbers of colored mixed graphs. CoRR abs/2104.07416 (2021)
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 13:12 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:
