Dibyayan Chakraborty

59 papers B 11C 2Misc 1Journal 39Unranked 6

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