OCR from Video Stream of Book Flipping. - Dibyayan Chakraborty; Partha Pratim Roy 001; José M. Álvarez 004; Umapada Pal 001 (ACPR, 2013)

Duplicate open page removal from video stream of book flipping. - Dibyayan Chakraborty; Partha Pratim Roy 001; José M. Álvarez 004; Umapada Pal 001 (NCVPRIPG, 2013)

On a Special Class of Boxicity 2 Graphs. - Sujoy Kumar Bhore; Dibyayan Chakraborty; Sandip Das 001; Sagnik Sen 001 (CALDAM, 2015)

On Local Structures of Cubicity 2 Graphs. - Sujoy Kumar Bhore; Dibyayan Chakraborty; Sandip Das 001; Sagnik Sen 001 (COCOA, 2016)

Baseline detection of multi-lingual unconstrained handwritten text lines. - Dibyayan Chakraborty; Umapada Pal 001 (Pattern Recognit. Lett., 2016)

On bounds on bend number of classes of split and cocomparability graphs. - Dibyayan Chakraborty; Sandip Das 001; Joydeep Mukherjee; Uma Kant Sahoo (CoRR, 2018)

Frame selection for OCR from video stream of book flipping. - Dibyayan Chakraborty; Partha Pratim Roy 001; Rajkumar Saini; José M. Álvarez 004; Umapada Pal 001 (Multim. Tools Appl., 2018)

Dominating Set on Overlap Graphs of Rectangles Intersecting a Line. - Dibyayan Chakraborty; Sandip Das 001; Joydeep Mukherjee (COCOON, 2019)

Approximating Minimum Dominating Set on String Graphs. - Dibyayan Chakraborty; Sandip Das 001; Joydeep Mukherjee (WG, 2019)

Bottleneck bichromatic full Steiner trees. - A. Karim Abu-Affash; Sujoy Bhore; Paz Carmi; Dibyayan Chakraborty (Inf. Process. Lett., 2019)

Bounds on the Bend Number of Split and Cocomparability Graphs. - Dibyayan Chakraborty; Sandip Das 001; Joydeep Mukherjee; Uma Kant Sahoo (Theory Comput. Syst., 2019)

Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes. - Dibyayan Chakraborty; Florent Foucaud; Harmender Gahlawat; Subir Kumar Ghosh; Bodhayan Roy (CALDAM, 2020)

Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs. - Dibyayan Chakraborty; Sandip Das 001; Florent Foucaud; Harmender Gahlawat; Dimitri Lajou; Bodhayan Roy (ISAAC, 2020)

On the Stab Number of Rectangle Intersection Graphs. - Dibyayan Chakraborty; Mathew C. Francis (Theory Comput. Syst., 2020)

Algorithms and Complexity of s-Club Cluster Vertex Deletion. - Dibyayan Chakraborty; L. Sunil Chandran; Sajith Padinhatteeri; Raji R. Pillai (IWOCA, 2021)

On rectangle intersection graphs with stab number at most two. - Dibyayan Chakraborty; Sandip Das 001; Mathew C. Francis; Sagnik Sen 001 (Discret. Appl. Math., 2021)

Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. - Dibyayan Chakraborty; Antoine Dailly; Sandip Das 001; Florent Foucaud; Harmender Gahlawat; Subir Kumar Ghosh (ISAAC, 2022)

Twin-Width VIII: Delineation and Win-Wins. - Édouard Bonnet; Dibyayan Chakraborty; Eun Jung Kim 002; Noleen Köhler; Raul Lopes 001; Stéphan Thomassé (IPEC, 2022)

On dominating set of some subclasses of string graphs. - Dibyayan Chakraborty; Sandip Das 001; Joydeep Mukherjee (Comput. Geom., 2022)

Distance-Based Covering Problems for Graphs of Given Cyclomatic Number. - Dibyayan Chakraborty; Florent Foucaud; Anni Hakanen (FCT, 2023)

Isometric Path Complexity of Graphs. - Dibyayan Chakraborty; Jérémie Chalopin; Florent Foucaud; Yann Vaxès (MFCS, 2023)

Isometric path antichain covers: beyond hyperbolic graphs. - Dibyayan Chakraborty; Florent Foucaud (CoRR, 2023)

χ-binding functions for squares of bipartite graphs and its subclasses. - Dibyayan Chakraborty; L. Sunil Chandran; Dalu Jacob; Raji R. Pillai (CoRR, 2023)

Triangle-free projective-planar graphs with diameter two: Domination and characterization. - Dibyayan Chakraborty; Sandip Das 001; Srijit Mukherjee; Uma Kant Sahoo; Sagnik Sen 001 (Discret. Appl. Math., 2023)

Finding geometric representations of apex graphs is NP-hard. - Dibyayan Chakraborty; Kshitij Gajjar (Theor. Comput. Sci., 2023)

Algorithms and complexity for geodetic sets on partial grids. - Dibyayan Chakraborty; Harmender Gahlawat; Bodhayan Roy (Theor. Comput. Sci., 2023)

Algorithms and Complexity for Path Covers of Temporal DAGs. - Dibyayan Chakraborty; Antoine Dailly; Florent Foucaud; Ralf Klasing (MFCS, 2024)

Covering and Partitioning of Split, Chain and Cographs with Isometric Paths. - Dibyayan Chakraborty; Haiko Müller; Sebastian Ordyniak; Fahad Panolan; Mateusz Rychlicki (MFCS, 2024)

Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic? - Dibyayan Chakraborty; Antoine Dailly; Florent Foucaud; Ralf Klasing (CoRR, 2024)

Kempe equivalent list colorings revisited. - Dibyayan Chakraborty; Carl Feghali; Reem Mahmoud (J. Graph Theory, 2024)

Cutting Barnette graphs perfectly is hard. - Édouard Bonnet; Dibyayan Chakraborty; Julien Duron (Theor. Comput. Sci., 2024)

Recognizing geometric intersection graphs stabbed by a line. - Dibyayan Chakraborty; Kshitij Gajjar; Irena Rusu (Theor. Comput. Sci., 2024)

s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs. - Dibyayan Chakraborty; L. Sunil Chandran; Sajith Padinhatteeri; Raji R. Pillai (Discret. Appl. Math., 2024)

Distance-based (and path-based) covering problems for graphs of given cyclomatic number. - Dibyayan Chakraborty; Florent Foucaud; Anni Hakanen (Discret. Math., 2025)

Additive approximation algorithm for geodesic centers in δ-hyperbolic graphs. - Dibyayan Chakraborty; Yann Vaxès (Theor. Comput. Sci., 2025)

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations. - Dibyayan Chakraborty; Florent Foucaud (CoRR, 2025)

K2,3-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two. - Dibyayan Chakraborty (CoRR, 2025)