Zobrazeno 1 - 10
of 121
pro vyhledávání: '"Sasanka Roy"'
Publikováno v:
Discrete Applied Mathematics. 319:71-80
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d945d2cbe3b4e3edfd41c001a541b370
https://doi.org/10.1016/j.dam.2021.04.013
https://doi.org/10.1016/j.dam.2021.04.013
Autor:
Sasanka Roy, Supantha Pandit, Satyabrata Jana, Sujoy Bhore, Sourav Chakraborty, Joseph S. B. Mitchell
Publikováno v:
Discrete Applied Mathematics. 319:111-120
The problem of computing induced subgraphs that satisfy some specified restrictions arises in various applications of graph algorithms and has been well studied. In this paper, we consider the following Balanced Connected Subgraph (shortly, BCS) prob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::622e6ad3bb4f09d5da2b16db5ab139e0
https://doi.org/10.1016/j.dam.2020.12.030
https://doi.org/10.1016/j.dam.2020.12.030
Publikováno v:
Theoretical Computer Science. 929:69-80
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd5fc8b94a86f8ead19c47e6e8ea4e7a
https://doi.org/10.1016/j.tcs.2022.06.030
https://doi.org/10.1016/j.tcs.2022.06.030
Publikováno v:
Theoretical Computer Science. 847:68-75
We study the descending facility location (DFL) problem on the surface of a triangulated terrain. A path from a point s to a point t on the surface of a terrain is descending if the heights of the subsequent points along the path from s to t are in a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb8de9193a015cb6311636869cfdaa55
https://doi.org/10.1016/j.tcs.2020.09.037
https://doi.org/10.1016/j.tcs.2020.09.037
Publikováno v:
Discrete Applied Mathematics. 283:456-472
In this paper, we study some fundamental facility location problems from the space-efficient perspective. We show that 1-center problem in Euclidean space and in tree networks can be efficiently solved in constant-workspace model. We use a virtual pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::31b3c01517e54b3acafaa8bf75f7e0c2
https://doi.org/10.1016/j.dam.2020.01.040
https://doi.org/10.1016/j.dam.2020.01.040
Publikováno v:
International Journal of Foundations of Computer Science. 31:421-443
Given a convex polygon with [Formula: see text] vertices, we study the problem of identifying a triangle with its smallest side as large as possible among all the triangles that can be drawn inside the polygon. We show that at least one of the vertic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b98e398bd5d55eda750c697ac6dc80c7
https://doi.org/10.1142/s0129054120500173
https://doi.org/10.1142/s0129054120500173
Autor:
Sasanka Roy, Binayak Dutta
Publikováno v:
International Journal of Computational Geometry & Applications. 30:79-95
We study the shortest [Formula: see text]-violation path problem in a simple polygon. Let [Formula: see text] be a simple polygon in [Formula: see text] with [Formula: see text] vertices and let [Formula: see text] be a pair of points in [Formula: se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b63ce2861112667d410bac09ace28523
https://doi.org/10.1142/s0218195920500041
https://doi.org/10.1142/s0218195920500041
Publikováno v:
Journal of Graph Algorithms and Applications. 24:523-546
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e32514d1e1c3c21dcdf37b745fbf6348
https://doi.org/10.7155/jgaa.00544
https://doi.org/10.7155/jgaa.00544
Publikováno v:
Journal of Parallel and Distributed Computing. 132:36-47
Finding a maximal independent set ( MIS ) in a graph is one of the fundamental problems in distributed computing. Researchers in this community are trying to close the time complexity gap of computing a MIS in a graph, way back from Luby’s [STOC’
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::793d8f52083092d9730436cc361a16db
https://doi.org/10.1016/j.jpdc.2019.05.012
https://doi.org/10.1016/j.jpdc.2019.05.012
Publikováno v:
Computational Geometry. 81:1-11
Let P be a set of n points in the plane in general position, and consider the problem of finding an axis-parallel rectangle with a given perimeter, or area, or diagonal, that encloses the maximum number of points of P. We present an exact algorithm t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::752ef3445bcbef54d6e74bd3ef13fc3e
https://doi.org/10.1016/j.comgeo.2019.01.007
https://doi.org/10.1016/j.comgeo.2019.01.007