CHAKRABORTY - Dipayan
Toutes les publications (25)
| Date/Type | Titre/URL/journal | Domaines | Notes SJR/Core | Cit. GScholar |
|---|---|---|---|---|
| 2026
ART |
Dipayan Chakraborty, Florent Foucaud, Michael Henning, Tuomo Lehtilä
Identifying codes in graphs of given maximum degree: Characterizing trees Discrete Mathematics - 2026 |
Maths | ||
| 2025
COMM |
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
Structural Parameterization of Locating-Dominating Set and Test Cover Proceedings of the 14th International Conference on Algorithms and Complexity (CIAC 2025) - 2025 |
Informatique/Algorithme et structure de données | ||
| 2025
UNDEFINED |
Dipayan Chakraborty, Florent Foucaud, Michael Antony Henning, Tero Laihonen
A note on partitioning the vertex set of a graph into a dominating set and a locating dominating set |
Maths | ||
| 2025
ART |
Dipayan Chakraborty, Soumen Nandi, Sagnik Sen, D.K. Supraja
A linear algorithm for radio k-coloring of powers of paths having small diameters Journal of Computer and System Sciences - 2025 |
Maths | ||
| 2024
UNDEFINED |
Dipayan Chakraborty, Annegret K. Wagler
On lower bounds for cardinalities of several separating-dominating codes in graphs |
Maths | ||
| 2024
THESE |
Dipayan Chakraborty
Structural and algorithmic aspects of identification problems in graphs |
Maths | ||
| 2024
COMM |
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover Proceedings of the 35th International Symposium on Algorithms and Computation (ISAAC 2024) - 2024 |
Informatique/Algorithme et structure de données | ||
| 2024
ART |
Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael Henning, Annegret Wagler
Progress towards the two-thirds conjecture on locating-total dominating sets Discrete Mathematics - 2024 |
Maths | ||
| 2024
UNDEFINED |
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
Structural Parameterization of Locating-Dominating Set and Test Cover |
Informatique/Algorithme et structure de données | ||
| 2024
UNDEFINED |
Dipayan Chakraborty, Florent Foucaud, Michael Henning, Tuomo Lehtilä
Identifying codes in triangle-free graphs of bounded maximum degree |
Maths | ||
| 2024
ART |
Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret K Wagler
On three domination-based identification problems in block graphs Fundamenta Informaticae - 2024 |
Maths | ||
| 2024
UNDEFINED |
Dipayan Chakraborty, Annegret K. Wagler
On full-separating sets in graphs |
Maths | ||
| 2024
UNDEFINED |
Dipayan Chakraborty, Florent Foucaud, Michael Henning
Identifying open codes in trees and 4-cycle-free graphs of given maximum degree |
Maths | ||
| 2024
UNDEFINED |
Dipayan Chakraborty, Anni Hakanen, Tuomo Lehtilä
The n/2-bound for locating-dominating sets in subcubic graphs |
Maths | ||
| 2024
COMM |
Dipayan Chakraborty, Annegret Wagler
Open-Separating Dominating Codes in Graphs International Symposium on Combinatorial Optimization - 2024 |
Maths | ||
| 2024
UNDEFINED |
Dipayan Chakraborty, Annegret K. Wagler
Open-separating dominating codes in graphs |
Maths | ||
| 2024
COMM |
Silvia Bianchi, Dipayan Chakraborty, Yanina Lucarini, Annegret Wagler
Location-Domination Type Problems Under the Mycielski Construction International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), 2024 - 2024 |
Maths | ||
| 2024
UNDEFINED |
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover |
Informatique/Algorithme et structure de données | ||
| 2024
ART |
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D.K. Supraja
On locating and neighbor-locating colorings of sparse graphs Discrete Applied Mathematics - 2024 |
Maths | ||
| 2023
UNDEFINED |
Silvia M. Bianchi, Dipayan Chakraborty, Yanina Lucarini, Annegret K. Wagler
Location-Domination Type Problems Under the Mycielski Construction |
Maths | ||
| 2023
PROCEEDINGS |
Dipayan Chakraborty, R. Sandeep
Contracting Edges to Destroy a Pattern: A Complexity Study |
Maths | ||
| 2023
COMM |
Dipayan Chakraborty, Florent Foucaud, Tuomo Lehtilä
Identifying codes in bipartite graphs of given maximum degree 12th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023) - 2023 |
Maths | ||
| 2023
COMM |
Dipayan Chakraborty, Soumen Nandi, Sagnik Sen, D. Supraja
A Linear Algorithm for Radio k-Coloring Powers of Paths Having Small Diameter 34th International Workshop on Combinatorial Algorithms - 2023 |
Maths | ||
| 2023
COMM |
Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret Wagler
On Three Domination-Based Identification Problems in Block Graphs 9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2023) - 2023 |
Maths | ||
| 2023
COMM |
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D K Supraja
New Bounds and Constructions for Neighbor-Locating Colorings of Graphs 9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2023) - 2023 |
Maths |