Obserwuj
Dibyayan Chakraborty
Tytuł
Cytowane przez
Cytowane przez
Rok
Twin-width VIII: delineation and win-wins
É Bonnet, D Chakraborty, EJ Kim, N Köhler, R Lopes, S Thomassé
arXiv preprint arXiv:2204.00722, 2022
232022
Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs
D Chakraborty, S Das, F Foucaud, H Gahlawat, D Lajou, B Roy
31st International Symposium on Algorithms and Computation (ISAAC 2020) 181 …, 2020
152020
Hardness and approximation for the geodetic set problem in some graph classes
D Chakraborty, F Foucaud, H Gahlawat, SK Ghosh, B Roy
Conference on Algorithms and Discrete Applied Mathematics, 102-115, 2020
102020
Baseline detection of multi-lingual unconstrained handwritten text lines
D Chakraborty, U Pal
Pattern Recognition Letters 74, 74-81, 2016
102016
Complexity and algorithms for Isometric Path Cover on chordal graphs and beyond
D Chakraborty, A Dailly, S Das, F Foucaud, H Gahlawat, SK Ghosh
82022
Algorithms and Complexity of s-Club Cluster Vertex Deletion
D Chakraborty, LS Chandran, S Padinhatteeri, RR Pillai
International Workshop on Combinatorial Algorithms, 152-164, 2021
82021
OCR from video stream of book flipping
D Chakraborty, PP Roy, JM Alvarez, U Pal
2013 2nd IAPR Asian Conference on Pattern Recognition, 130-134, 2013
72013
Cutting Barnette graphs perfectly is hard
E Bonnet, D Chakraborty, J Duron
International Workshop on Graph-Theoretic Concepts in Computer Science, 116-129, 2023
52023
Finding geometric representations of apex graphs is NP-hard
D Chakraborty, K Gajjar
Theoretical Computer Science 971, 114064, 2023
42023
Bounds on the bend number of split and cocomparability graphs
D Chakraborty, S Das, J Mukherjee, UK Sahoo
Theory of Computing Systems 63, 1336-1357, 2019
42019
Approximating minimum dominating set on string graphs
D Chakraborty, S Das, J Mukherjee
International Workshop on Graph-Theoretic Concepts in Computer Science, 232-243, 2019
42019
Frame selection for OCR from video stream of book flipping
D Chakraborty, PP Roy, R Saini, JM Alvarez, U Pal
Multimedia Tools and Applications 77, 985-1008, 2018
42018
Algorithms and complexity for geodetic sets on partial grids
D Chakraborty, H Gahlawat, B Roy
Theoretical Computer Science 979, 114217, 2023
32023
Bottleneck bichromatic full steiner trees
AK Abu-Affash, S Bhore, P Carmi, D Chakraborty
Information Processing Letters 142, 14-19, 2019
32019
On a special class of boxicity 2 graphs
SK Bhore, D Chakraborty, S Das, S Sen
Algorithms and Discrete Applied Mathematics: First International Conference …, 2015
32015
On dominating set of some subclasses of string graphs
D Chakraborty, S Das, J Mukherjee
Computational Geometry 107, 101884, 2022
22022
On the stab number of rectangle intersection graphs
D Chakraborty, MC Francis
Theory of Computing Systems 64 (5), 681-734, 2020
22020
Dominating set on overlap graphs of rectangles intersecting a line
D Chakraborty, S Das, J Mukherjee
International Computing and Combinatorics Conference, 65-77, 2019
22019
Distance-Based Covering Problems for Graphs of Given Cyclomatic Number
D Chakraborty, F Foucaud, A Hakanen
International Symposium on Fundamentals of Computation Theory, 132-146, 2023
12023
On rectangle intersection graphs with stab number at most two
D Chakraborty, S Das, MC Francis, S Sen
Discrete Applied Mathematics 289 (31), 354-365, 2021
12021
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20