Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDDibyayan Chakraborty
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c12]Dibyayan Chakraborty, Kshitij Gajjar:
Finding Geometric Representations of Apex Graphs is NP-Hard. WALCOM 2022: 161-174- [i9]É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) - 2021
- [j6]Dibyayan Chakraborty
, Sandip Das, Mathew C. Francis, Sagnik Sen:
On rectangle intersection graphs with stab number at most two. Discret. Appl. Math. 289: 354-365 (2021) - [c11]Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai:
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, Mathew C. Francis:
On the Stab Number of Rectangle Intersection Graphs. Theory Comput. Syst. 64(5): 681-734 (2020) - [c10]Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy:
Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes. CALDAM 2020: 102-115 - [c9]Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy:
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, Sujoy Bhore, Paz Carmi, Dibyayan Chakraborty:
Bottleneck bichromatic full Steiner trees. Inf. Process. Lett. 142: 14-19 (2019) - [j3]Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee, Uma Kant Sahoo:
Bounds on the Bend Number of Split and Cocomparability Graphs. Theory Comput. Syst. 63(6): 1336-1357 (2019) - [c8]Dibyayan Chakraborty, Sandip Das, Mathew C. Francis, Sagnik Sen:
On Rectangle Intersection Graphs with Stab Number at Most Two. CALDAM 2019: 124-137 - [c7]Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee:
Dominating Set on Overlap Graphs of Rectangles Intersecting a Line. COCOON 2019: 65-77 - [c6]Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee:
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, Partha Pratim Roy, Rajkumar Saini, Jose M. Alvarez, Umapada Pal:
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, Umapada Pal:
Baseline detection of multi-lingual unconstrained handwritten text lines. Pattern Recognit. Lett. 74: 74-81 (2016) - [c4]Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das, Sagnik Sen:
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, Sandip Das, Sagnik Sen:
On a Special Class of Boxicity 2 Graphs. CALDAM 2015: 157-168 - 2013
- [c2]Dibyayan Chakraborty, Partha Pratim Roy, Jose M. Alvarez, Umapada Pal:
OCR from Video Stream of Book Flipping. ACPR 2013: 130-134 - [c1]Dibyayan Chakraborty, Partha Pratim Roy, Jose M. Alvarez, Umapada Pal:
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2022-04-23 00:20 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 has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
