| 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 | 37 | 2022 |
| 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 | 19 | 2020 |
| Complexity and algorithms for isometric path cover on chordal graphs and beyond D Chakraborty, A Dailly, S Das, F Foucaud, H Gahlawat, SK Ghosh | 13 | 2022 |
| Cutting Barnette graphs perfectly is hard E Bonnet, D Chakraborty, J Duron Theoretical Computer Science, 114701, 2024 | 12 | 2024 |
| 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 | 12 | 2020 |
| Baseline detection of multi-lingual unconstrained handwritten text lines D Chakraborty, U Pal Pattern Recognition Letters 74, 74-81, 2016 | 10 | 2016 |
| Algorithms and complexity for geodetic sets on partial grids D Chakraborty, H Gahlawat, B Roy Theoretical Computer Science 979, 114217, 2023 | 8 | 2023 |
| 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 | 8 | 2021 |
| 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 | 8 | 2013 |
| On dominating set of some subclasses of string graphs D Chakraborty, S Das, J Mukherjee Computational Geometry 107, 101884, 2022 | 6 | 2022 |
| Finding geometric representations of apex graphs is NP-hard D Chakraborty, K Gajjar Theoretical Computer Science 971, 114064, 2023 | 4 | 2023 |
| On the stab number of rectangle intersection graphs D Chakraborty, MC Francis Theory of Computing Systems 64 (5), 681-734, 2020 | 4 | 2020 |
| 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 | 4 | 2019 |
| 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 | 4 | 2019 |
| 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 | 4 | 2018 |
| Isometric path complexity of graphs D Chakraborty, J Chalopin, F Foucaud, Y Vaxès arXiv preprint arXiv:2301.00278, 2022 | 3 | 2022 |
| Bottleneck bichromatic full Steiner trees AK Abu-Affash, S Bhore, P Carmi, D Chakraborty Information Processing Letters 142, 14-19, 2019 | 3 | 2019 |
| 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 | 3 | 2015 |
| Covering and partitioning of split, chain and cographs with isometric paths D Chakraborty, H Müller, S Ordyniak, F Panolan, M Rychlicki 49th International Symposium on Mathematical Foundations of Computer Science …, 2024 | 2 | 2024 |
| 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 | 2 | 2023 |
Florent FoucaudLIMOS, Université Clermont Auvergne, FranceVerified email at uca.fr