Publications

DBLP.
Google Scholar.

Manuscripts

• DC, Oscar Defrain, Florent Foucaud, Mathieu Mari, Prafullkumar Tale. Parameterized complexity of isometric path partition: treewidth and diameter. [Arxiv]


• DC, Florent Foucaud. Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations. [Arxiv]


• DC $K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two. [Arxiv]

Journal publications

• DC, L. Sunil Chandran , Dalu Jacob, and Raji R. Pillai. \chi-binding functions for squares of bipartite graphs and its subclasses. Journal of Graph Theory (accepted after minor revision). [Arxiv]


• DC, Jérémie Chalopin , Florent Foucaud, and Yann Vaxès. Isometric path complexity of graphs. Discrete Mathematics (2026). (Based on MFCS, 2023). [Arxiv]


• DC, Yann Vaxès. Additive approximation algorithm for geodesic centers in \delta-hyperbolic graphs. Theoretical computer Science, 2025. [Arxiv].


• DC, Florent Foucaud, and Anni Hakanen. Distance-Based Covering Problems for Graphs of Given Cyclomatic Number. Discrete Mathematics (2025). (based on FCT, 2023). [Hal]


• DC, Harmender Gahlawat, Bodhayan Roy. Algorithms and complexity for geodetic sets on partial grids. Theoretical Computer Science, 2024. (Based on ISAAC 2020).


• DC, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai. s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs. Discrete Applied Mathematics, 2024. (based on WG 2022).


• Édouard Bonnet, DC, and Julien Duron. Cutting Barnette graphs perfectly is hard. Theoretical Computer Science, 2024. (based on WG, 2023.) [Arxiv]


• DC, Carl Feghali , Reem Mahmoud. Kempe Equivalent List Colorings Revisited. Journal of Graph Theory, 2024. [Arxiv].


• DC, Kshitij Gajjar, Irena Rusu. Recognizing Geometric Intersection Graphs Stabbed by a Line. Theoretical Computer Science, 2024. [Arxiv].


• DC, Kshitij Gajjar. Finding Geometric Representations of Apex Graphs is NP-Hard. Theoretical Computer Science, 2023. (based on WALCOM 2022 ). [Arxiv].


• DC, Sandip Das, Srijit Mukherjee, Uma kant Sahoo, Sagnik Sen. Triangle-free projective-planar graphs with diameter two: domination and characterization. Discrete Applied Mathematics, 2023. [Arxiv].


• DC, Sandip Das, Joydeep Mukherjee. On dominating set of some subclasses of string graphs. Computational Geometry, 2022 (based on WG 2019, COCOON 2019).


• DC, Sandip Das, Mathew Francis, Sagnik Sen. On rectangle intersection graphs with stab number at most two. Discrete Applied Mathematics (2021). (based on [CALDAM 2019]).


• DC, Mathew Francis. On the Stab Number of Rectangle Intersection Graphs. Theory of Computing Systems, 2020. [Arxiv]


• A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, DC. Bottleneck bichromatic full Steiner trees. Information Processing Letters, 2019 (based on CCCG 2017).


• DC, Sandip Das, Joydeep Mukherjee, Uma kant Sahoo. Bounds on the Bend Number of Split and Cocomparability Graphs. Theory of Computing Systems, 2019. [Arxiv]


• DC, Partha Pratim Roy, Rajkumar Saini, Jose M. Alvarez, Umapada Pal. Frame selection for OCR from video stream of book flipping. Multimedia Tools Applications, 2018. (based on ACPR 2013).


• DC, Umapada Pal. Baseline detection of multi-lingual unconstrained handwritten text lines. Pattern Recognition Letters, 2016.

Conference publications

• DC, Haiko Müller, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki. Covering and Partitioning of Split, Chain and Cographs with Isometric Paths. MFCS, 2024.


• DC, Antoine Dailly, Florent Foucaud, and Ralf Klasing. Algorithms and Complexity for Path Covers of Temporal DAGs. MFCS, 2024.


• DC, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat and Subir Kumar Ghosh. Complexity and algorithms for ISOMETRIC PATH COVER on chordal graphs and beyond. ISAAC, 2022. [HAL]


• Édouard Bonnet, DC, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé. Twin-width VIII: delineation and win-wins. IPEC, 2022. [Arxiv]


• DC, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai. Algorithms and Complexity of s-Club Cluster Vertex Deletion. IWOCA 2021: 152-164. [www]


• DC, Florent Foucaud, Harmender Gahlawat, and Bodhayan Roy. Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes. CALDAM 2020: 102-115. [www]


• Sujoy Bhore, DC, Sandip Das, Sagnik Sen. On Local Structures of Cubicity 2 Graphs. COCOA 2016: 254-269


• Sujoy Bhore, DC, Sandip Das, Sagnik Sen. On a Special Class of Boxicity 2 Graphs. CALDAM 2015: 157-168


• DC, Partha Pratim Roy, Jose M. Alvarez, Umapada Pal. Duplicate open page removal from video stream of book flipping. NCVPRIPG 2013: 1-4.