Dibyayan Chakraborty

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 47

Top Topics

Introduce A General Framework

Unconstrained Handwritten

Top Venues

Theor. Comput. Sci.

Publications

Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing
Algorithms and Complexity for Path Covers of Temporal DAGs. MFCS (2024)
Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai
s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs. Discret. Appl. Math. 345 (2024)
Dibyayan Chakraborty, Yann Vaxès
Additive approximation algorithm for geodesic centers in δ-hyperbolic graphs. CoRR (2024)
Dibyayan Chakraborty, Haiko Müller, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki
Covering and Partitioning of Split, Chain and Cographs with Isometric Paths. MFCS (2024)
Dibyayan Chakraborty, Kshitij Gajjar, Irena Rusu
Recognizing geometric intersection graphs stabbed by a line. Theor. Comput. Sci. 995 (2024)
Édouard Bonnet, Dibyayan Chakraborty, Julien Duron
Cutting Barnette graphs perfectly is hard. Theor. Comput. Sci. 1010 (2024)
Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing
Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic? CoRR (2024)
Dibyayan Chakraborty, Sandip Das, Srijit Mukherjee, Uma Kant Sahoo, Sagnik Sen
Triangle-free projective-planar graphs with diameter two: Domination and characterization. Discret. Appl. Math. 331 (2023)
Dibyayan Chakraborty, L. Sunil Chandran, Dalu Jacob, Raji R. Pillai
χ-binding functions for squares of bipartite graphs and its subclasses. CoRR (2023)
Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen
Distance-Based Covering Problems for Graphs of Given Cyclomatic Number. FCT (2023)
Édouard Bonnet, Dibyayan Chakraborty, Julien Duron
Cutting Barnette Graphs Perfectly is Hard. WG (2023)
Édouard Bonnet, Dibyayan Chakraborty, Julien Duron
Cutting Barnette graphs perfectly is hard. CoRR (2023)
Dibyayan Chakraborty, Florent Foucaud
Isometric path antichain covers: beyond hyperbolic graphs. CoRR (2023)
Dibyayan Chakraborty, Harmender Gahlawat, Bodhayan Roy
Algorithms and complexity for geodetic sets on partial grids. Theor. Comput. Sci. 979 (2023)
Dibyayan Chakraborty, Kshitij Gajjar
Finding geometric representations of apex graphs is NP-hard. Theor. Comput. Sci. 971 (2023)
Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud, Yann Vaxès
Isometric Path Complexity of Graphs. MFCS (2023)
Dibyayan Chakraborty, Kshitij Gajjar, Irena Rusu
Recognizing Geometric Intersection Graphs Stabbed by a Line. CoRR (2022)
Dibyayan Chakraborty, Sandip Das, Srijit Mukherjee, Uma Kant Sahoo, Sagnik Sen
Triangle-free projective-planar graphs with diameter two: domination and characterization. CoRR (2022)
Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé
Twin-Width VIII: Delineation and Win-Wins. IPEC (2022)
Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai
s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs. CoRR (2022)
Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai
s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs. WG (2022)
Dibyayan Chakraborty, Kshitij Gajjar
Finding Geometric Representations of Apex Graphs is NP-Hard. WALCOM (2022)
Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé
Twin-width VIII: delineation and win-wins. CoRR (2022)
Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee
On dominating set of some subclasses of string graphs. Comput. Geom. 107 (2022)
Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh
Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. ISAAC (2022)
Dibyayan Chakraborty, Kshitij Gajjar
Finding Geometric Representations of Apex Graphs is NP-Hard. CoRR (2021)
Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai
Algorithms and Complexity of s-Club Cluster Vertex Deletion. IWOCA (2021)
Dibyayan Chakraborty, Sandip Das, Mathew C. Francis, Sagnik Sen
On rectangle intersection graphs with stab number at most two. Discret. Appl. Math. 289 (2021)
Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy
Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs. ISAAC (2020)
Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy
Algorithms and complexity for geodetic sets on planar and chordal graphs. CoRR (2020)
Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy
Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes. CALDAM (2020)
Dibyayan Chakraborty, Mathew C. Francis
On the Stab Number of Rectangle Intersection Graphs. Theory Comput. Syst. 64 (5) (2020)
Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy
Hardness and approximation for the geodetic set problem in some graph classes. CoRR (2019)
Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee
Dominating Set on Overlap Graphs of Rectangles Intersecting a Line. COCOON (2019)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty
Bottleneck bichromatic full Steiner trees. Inf. Process. Lett. 142 (2019)
Dibyayan Chakraborty, Sandip Das, Mathew C. Francis, Sagnik Sen
On Rectangle Intersection Graphs with Stab Number at Most Two. CALDAM (2019)
Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee, Uma Kant Sahoo
Bounds on the Bend Number of Split and Cocomparability Graphs. Theory Comput. Syst. 63 (6) (2019)
Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee
Approximating Minimum Dominating Set on String Graphs. WG (2019)
Dibyayan Chakraborty, Partha Pratim Roy, Rajkumar Saini, Jose M. Alvarez, Umapada Pal
Frame selection for OCR from video stream of book flipping. Multim. Tools Appl. 77 (1) (2018)
Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee, Uma Kant Sahoo
On bounds on bend number of classes of split and cocomparability graphs. CoRR (2018)
Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee
Approximating Minimum Dominating Set on String Graphs. CoRR (2018)
Dibyayan Chakraborty, Mathew C. Francis
On the stab number of rectangle intersection graphs. CoRR (2018)
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty
Bottleneck Bichromatic Full Steiner Trees. CCCG (2017)
Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen
On Local Structures of Cubicity 2 Graphs. COCOA (2016)
Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen
On a special class of boxicity 2 graphs. CoRR (2016)
Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen
On local structures of cubicity 2 graphs. CoRR (2016)
Dibyayan Chakraborty, Umapada Pal
Baseline detection of multi-lingual unconstrained handwritten text lines. Pattern Recognit. Lett. 74 (2016)
Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen
On a Special Class of Boxicity 2 Graphs. CALDAM (2015)
Dibyayan Chakraborty, Partha Pratim Roy, Jose M. Alvarez, Umapada Pal
OCR from Video Stream of Book Flipping. ACPR (2013)
Dibyayan Chakraborty, Partha Pratim Roy, Jose M. Alvarez, Umapada Pal
Duplicate open page removal from video stream of book flipping. NCVPRIPG (2013)