Chakraborty, Dipayan

1. Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
   2024/02/13 by Chakraborty, Dipayan, Foucaud, Florent, Majumdar, Diptapriyo +1 · 3 citations
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
2. The n/2-bound for locating-dominating sets in subcubic graphs
   2024/06/27 by Chakraborty, Dipayan, Hakanen, Anni, Lehtilä, Tuomo · 1 citation
   #Combinatorics (math.CO) #FOS: Mathematics