default search action
Dibyayan Chakraborty
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Dibyayan Chakraborty
, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai:
s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs. Discret. Appl. Math. 345: 170-189 (2024) - [j12]Dibyayan Chakraborty, Kshitij Gajjar, Irena Rusu:
Recognizing geometric intersection graphs stabbed by a line. Theor. Comput. Sci. 995: 114488 (2024) - [j11]Édouard Bonnet, Dibyayan Chakraborty
Cutting Barnette graphs perfectly is hard. Theor. Comput. Sci. 1010: 114701 (2024) - [c20]Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing:
Algorithms and Complexity for Path Covers of Temporal DAGs. MFCS 2024: 38:1-38:17 - [c19]Dibyayan Chakraborty, Haiko Müller, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki:
Covering and Partitioning of Split, Chain and Cographs with Isometric Paths. MFCS 2024: 39:1-39:14 - [i17]Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing:
Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic? CoRR abs/2403.04589 (2024) - [i16]Dibyayan Chakraborty, Yann Vaxès:
Additive approximation algorithm for geodesic centers in δ-hyperbolic graphs. CoRR abs/2404.03812 (2024) - 2023
- [j10]Dibyayan Chakraborty
Triangle-free projective-planar graphs with diameter two: Domination and characterization. Discret. Appl. Math. 331: 11-24 (2023) - [j9]Dibyayan Chakraborty
Finding geometric representations of apex graphs is NP-hard. Theor. Comput. Sci. 971: 114064 (2023) - [j8]Dibyayan Chakraborty
Algorithms and complexity for geodetic sets on partial grids. Theor. Comput. Sci. 979: 114217 (2023) - [c18]Dibyayan Chakraborty
Distance-Based Covering Problems for Graphs of Given Cyclomatic Number. FCT 2023: 132-146 - [c17]Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud, Yann Vaxès:
Isometric Path Complexity of Graphs. MFCS 2023: 32:1-32:14 - [c16]Édouard Bonnet
Cutting Barnette Graphs Perfectly is Hard. WG 2023: 116-129 - [i15]Dibyayan Chakraborty, Florent Foucaud:
Isometric path antichain covers: beyond hyperbolic graphs. CoRR abs/2301.00278 (2023) - [i14]Édouard Bonnet, Dibyayan Chakraborty, Julien Duron:
Cutting Barnette graphs perfectly is hard. CoRR abs/2302.11667 (2023) - [i13]Dibyayan Chakraborty, L. Sunil Chandran, Dalu Jacob, Raji R. Pillai:
χ-binding functions for squares of bipartite graphs and its subclasses. CoRR abs/2312.08759 (2023) - 2022
- [j7]Dibyayan Chakraborty
On dominating set of some subclasses of string graphs. Comput. Geom. 107: 101884 (2022) - [c15]Dibyayan Chakraborty
Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. ISAAC 2022: 12:1-12:17 - [c14]Édouard Bonnet, Dibyayan Chakraborty
Twin-Width VIII: Delineation and Win-Wins. IPEC 2022: 9:1-9:18 - [c13]Dibyayan Chakraborty, Kshitij Gajjar
Finding Geometric Representations of Apex Graphs is NP-Hard. WALCOM 2022: 161-174 - [c12]Dibyayan Chakraborty
s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs. WG 2022: 129-143 - [i12]Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé:
Twin-width VIII: delineation and win-wins. CoRR abs/2204.00722 (2022) - [i11]Dibyayan Chakraborty, Kshitij Gajjar, Irena Rusu:
Recognizing Geometric Intersection Graphs Stabbed by a Line. CoRR abs/2209.01851 (2022) - [i10]Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai:
s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs. CoRR abs/2210.07699 (2022) - [i9]Dibyayan Chakraborty, Sandip Das, Srijit Mukherjee, Uma Kant Sahoo, Sagnik Sen:
Triangle-free projective-planar graphs with diameter two: domination and characterization. CoRR abs/2212.04253 (2022) - 2021
- [j6]Dibyayan Chakraborty
On rectangle intersection graphs with stab number at most two. Discret. Appl. Math. 289: 354-365 (2021) - [c11]Dibyayan Chakraborty
Algorithms and Complexity of s-Club Cluster Vertex Deletion. IWOCA 2021: 152-164 - [i8]Dibyayan Chakraborty, Kshitij Gajjar
Finding Geometric Representations of Apex Graphs is NP-Hard. CoRR abs/2104.09976 (2021) - 2020
- [j5]Dibyayan Chakraborty
On the Stab Number of Rectangle Intersection Graphs. Theory Comput. Syst. 64(5): 681-734 (2020) - [c10]Dibyayan Chakraborty
Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes. CALDAM 2020: 102-115 - [c9]Dibyayan Chakraborty
Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs. ISAAC 2020: 7:1-7:15 - [i7]Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy:
Algorithms and complexity for geodetic sets on planar and chordal graphs. CoRR abs/2006.16511 (2020)
2010 – 2019
- 2019
- [j4]A. Karim Abu-Affash
Bottleneck bichromatic full Steiner trees. Inf. Process. Lett. 142: 14-19 (2019) - [j3]Dibyayan Chakraborty
Bounds on the Bend Number of Split and Cocomparability Graphs. Theory Comput. Syst. 63(6): 1336-1357 (2019) - [c8]Dibyayan Chakraborty
On Rectangle Intersection Graphs with Stab Number at Most Two. CALDAM 2019: 124-137 - [c7]Dibyayan Chakraborty
Dominating Set on Overlap Graphs of Rectangles Intersecting a Line. COCOON 2019: 65-77 - [c6]Dibyayan Chakraborty
Approximating Minimum Dominating Set on String Graphs. WG 2019: 232-243 - [i6]Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy:
Hardness and approximation for the geodetic set problem in some graph classes. CoRR abs/1909.08795 (2019) - 2018
- [j2]Dibyayan Chakraborty
Frame selection for OCR from video stream of book flipping. Multim. Tools Appl. 77(1): 985-1008 (2018) - [i5]Dibyayan Chakraborty, Mathew C. Francis:
On the stab number of rectangle intersection graphs. CoRR abs/1804.06571 (2018) - [i4]Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee, Uma Kant Sahoo:
On bounds on bend number of classes of split and cocomparability graphs. CoRR abs/1804.06584 (2018) - [i3]Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee:
Approximating Minimum Dominating Set on String Graphs. CoRR abs/1809.09990 (2018) - 2017
- [c5]A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty:
Bottleneck Bichromatic Full Steiner Trees. CCCG 2017: 13-18 - 2016
- [j1]Dibyayan Chakraborty
Baseline detection of multi-lingual unconstrained handwritten text lines. Pattern Recognit. Lett. 74: 74-81 (2016) - [c4]Sujoy Kumar Bhore, Dibyayan Chakraborty
On Local Structures of Cubicity 2 Graphs. COCOA 2016: 254-269 - [i2]Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen:
On a special class of boxicity 2 graphs. CoRR abs/1603.09561 (2016) - [i1]Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen:
On local structures of cubicity 2 graphs. CoRR abs/1603.09570 (2016) - 2015
- [c3]Sujoy Kumar Bhore, Dibyayan Chakraborty
On a Special Class of Boxicity 2 Graphs. CALDAM 2015: 157-168 - 2013
- [c2]Dibyayan Chakraborty
OCR from Video Stream of Book Flipping. ACPR 2013: 130-134 - [c1]Dibyayan Chakraborty
Duplicate open page removal from video stream of book flipping. NCVPRIPG 2013: 1-4
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-27 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: