Dibyayan Chakraborty

According to our database, Dibyayan Chakraborty authored at least 30 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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., March, 2024

Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?

Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing

CoRR, 2024

2023

Algorithms and complexity for geodetic sets on partial grids.

Dibyayan Chakraborty, Harmender Gahlawat, Bodhayan Roy

Theor. Comput. Sci., November, 2023

Finding geometric representations of apex graphs is NP-hard.

Dibyayan Chakraborty, Kshitij Gajjar

Theor. Comput. Sci., September, 2023

Triangle-free projective-planar graphs with diameter two: Domination and characterization.

Dibyayan Chakraborty, Sandip Das, Srijit Mukherjee, Uma Kant Sahoo, Sagnik Sen

Discret. Appl. Math., May, 2023

χ-binding functions for squares of bipartite graphs and its subclasses.

Dibyayan Chakraborty, L. Sunil Chandran, Dalu Jacob, Raji R. Pillai

CoRR, 2023

Isometric path antichain covers: beyond hyperbolic graphs.

Dibyayan Chakraborty, Florent Foucaud

CoRR, 2023

Cutting Barnette Graphs Perfectly is Hard.

Édouard Bonnet, Dibyayan Chakraborty, Julien Duron

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Isometric Path Complexity of Graphs.

Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud, Yann Vaxès

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Distance-Based Covering Problems for Graphs of Given Cyclomatic Number.

Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022

Recognizing Geometric Intersection Graphs Stabbed by a Line.

Dibyayan Chakraborty, Kshitij Gajjar, Irena Rusu

CoRR, 2022

On dominating set of some subclasses of string graphs.

Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee

Comput. Geom., 2022

Twin-Width VIII: Delineation and Win-Wins.

Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond.

Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021

On rectangle intersection graphs with stab number at most two.

Dibyayan Chakraborty, Sandip Das, Mathew C. Francis, Sagnik Sen

Discret. Appl. Math., 2021

Algorithms and Complexity of s-Club Cluster Vertex Deletion.

Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020

On the Stab Number of Rectangle Intersection Graphs.

Dibyayan Chakraborty, Mathew C. Francis

Theory Comput. Syst., 2020

Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs.

Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes.

Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

Bounds on the Bend Number of Split and Cocomparability Graphs.

Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee, Uma Kant Sahoo

Theory Comput. Syst., 2019

Bottleneck bichromatic full Steiner trees.

A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty

Inf. Process. Lett., 2019

Approximating Minimum Dominating Set on String Graphs.

Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Dominating Set on Overlap Graphs of Rectangles Intersecting a Line.

Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018

Frame selection for OCR from video stream of book flipping.

Dibyayan Chakraborty, Partha Pratim Roy, Rajkumar Saini, José M. Álvarez, Umapada Pal

Multim. Tools Appl., 2018

On bounds on bend number of classes of split and cocomparability graphs.

Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee, Uma Kant Sahoo

CoRR, 2018

2016

Baseline detection of multi-lingual unconstrained handwritten text lines.

Dibyayan Chakraborty, Umapada Pal

Pattern Recognit. Lett., 2016

On Local Structures of Cubicity 2 Graphs.

Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

On a Special Class of Boxicity 2 Graphs.

Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen

Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2013

Duplicate open page removal from video stream of book flipping.

Dibyayan Chakraborty, Partha Pratim Roy, José M. Álvarez, Umapada Pal

Proceedings of the Fourth National Conference on Computer Vision, 2013

OCR from Video Stream of Book Flipping.

Dibyayan Chakraborty, Partha Pratim Roy, José M. Álvarez, Umapada Pal

Proceedings of the 2nd IAPR Asian Conference on Pattern Recognition, 2013