Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Supantha Pandit"'
Publikováno v:
Discrete Applied Mathematics. 336:83-98
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::36c7574523bad2fe5cef437e49957934
https://doi.org/10.1016/j.dam.2023.03.026
https://doi.org/10.1016/j.dam.2023.03.026
Autor:
Supantha Pandit
Publikováno v:
Discrete Applied Mathematics. 319:92-110
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc2fe400cd35702715dc47e603055744
https://doi.org/10.1016/j.dam.2021.11.017
https://doi.org/10.1016/j.dam.2021.11.017
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
Autor:
Joseph S.B. Mitchell, Supantha Pandit
Publikováno v:
Theoretical Computer Science. 876:1-11
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e72d1103295a5851b9252184808f502a
https://doi.org/10.1016/j.tcs.2021.05.002
https://doi.org/10.1016/j.tcs.2021.05.002
Autor:
Supantha Pandit
Publikováno v:
Journal of Combinatorial Optimization. 41:414-432
The Minimum Dominating Set (MDS) problem is one of the well-studied problems in computer science. It is well-known that this problem is $$\mathsf {NP}$$ -hard for simple geometric objects; unit disks, axis-parallel unit squares, and axis-parallel rec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ca902daff89122b0471652a5617c6ec
https://doi.org/10.1007/s10878-020-00685-y
https://doi.org/10.1007/s10878-020-00685-y
Publikováno v:
Discrete Applied Mathematics. 286:35-50
Classical separability problem involving multi-color point sets is an important area of study in computational geometry. In this paper, we study different separability problems for bichromatic point set P = P r ∪ P b in R 2 and R 3 , where P r and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16f6c4f2393bd492eb9c152d53b6b221
https://doi.org/10.1016/j.dam.2019.05.012
https://doi.org/10.1016/j.dam.2019.05.012
Publikováno v:
Journal of Combinatorial Optimization. 39:1017-1037
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1855a5a03e37b5c13d162440e8e1fd1c
https://doi.org/10.1007/s10878-020-00536-w
https://doi.org/10.1007/s10878-020-00536-w
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031203497
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3faf757ffb86cf5789b11c88cf362af4
https://doi.org/10.1007/978-3-031-20350-3_28
https://doi.org/10.1007/978-3-031-20350-3_28
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031210167
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed0764821185b8d2440f2fe71c36936b
https://doi.org/10.1007/978-3-031-21017-4_17
https://doi.org/10.1007/978-3-031-21017-4_17