Výsledky vyhledávání
- 1.0562741 - ÚI 2023 RIV NL eng J - Článek v odborném periodiku
Acharyya, Ankush - Jallu, Ramesh Kumar - Keikha, Vahideh - Löffler, M. - Saumell, Maria
Minimum color spanning circle of imprecise points.
Theoretical Computer Science. Roč. 930, September 2022 (2022), s. 116-127. ISSN 0304-3975. E-ISSN 1879-2294
Grant CEP: GA ČR(CZ) GJ19-06792Y
GRANT EU: European Commission(ES) 734922
Institucionální podpora: RVO:67985807
Klíčová slova: Color spanning circle * Imprecise points * Algorithms * Computational complexity * Colored points
Obor OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impakt faktor: 1.1, rok: 2022
Způsob publikování: Omezený přístup
https://dx.doi.org/10.1016/j.tcs.2022.07.016
Trvalý link: https://hdl.handle.net/11104/0335586
Vědecká data: ArXiv.org - 2.0540808 - ÚI 2022 RIV NL eng J - Článek v odborném periodiku
Acharyya, Ankush - Maheswari, A. - Nandy, S. C.
Color-spanning localized query.
Theoretical Computer Science. Roč. 861, March 2021 (2021), s. 85-101. ISSN 0304-3975. E-ISSN 1879-2294
Grant CEP: GA ČR(CZ) GJ19-06792Y
Institucionální podpora: RVO:67985807
Klíčová slova: Color-spanning object * Multilevel range searching * Localized query
Obor OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impakt faktor: 1.002, rok: 2021
Způsob publikování: Omezený přístup
http://dx.doi.org/10.1016/j.tcs.2021.02.013
Trvalý link: http://hdl.handle.net/11104/0318409 - 3.0534825 - ÚI 2021 NL eng J - Článek v odborném periodiku
Acharyya, Ankush - Nandy, S. C. - Roy, S.
Minimum width color spanning annulus.
Theoretical Computer Science. Roč. 725 (2018), s. 16-30. ISSN 0304-3975. E-ISSN 1879-2294
Klíčová slova: Location planning * Color spanning annulus * Algorithms * Complexity
Impakt faktor: 0.718, rok: 2018
Trvalý link: http://hdl.handle.net/11104/0312986 - 4.0534822 - ÚI 2021 NL eng J - Článek v odborném periodiku
Acharyya, Ankush - Nandy, S. C. - Pandit, S. - Roy, S.
Covering segments with unit squares.
Computational Geometry-Theory and Applications. Roč. 79 (2019), s. 1-13. ISSN 0925-7721. E-ISSN 1879-081X
Klíčová slova: approximation algorithms * Segment cover * Unit square * NP-hardness * Linear programming * Approximation algorithms
Impakt faktor: 0.476, rok: 2019
Trvalý link: http://hdl.handle.net/11104/0312984 - 5.0534821 - ÚI 2021 NL eng J - Článek v odborném periodiku
Acharyya, Ankush - De, M. - Nandy, S. C. - Roy, B.
Range assignment of base-stations maximizing coverage area without interference.
Theoretical Computer Science. Roč. 804 (2020), s. 81-97. ISSN 0304-3975. E-ISSN 1879-2294
Klíčová slova: time approximation schemes * packing * Quadratic programming * Discrete packing * Range assignment in wireless communication * NP-hardness * Approximation algorithm * ptas
Impakt faktor: 0.827, rok: 2020
Trvalý link: http://hdl.handle.net/11104/0312983 - 6.0534819 - ÚI 2021 NL eng J - Článek v odborném periodiku
Acharyya, Ankush - De, M. - Nandy, S. C. - Pandit, S.
Variations of largest rectangle recognition amidst a bichromatic point set.
Discrete Applied Mathematics. Roč. 286 (2020), s. 35-50. ISSN 0166-218X. E-ISSN 1872-6771
Klíčová slova: largest empty rectangle * boxes * Bichromatic point set * Obstacle-free rectangle recognition * Orthogonal range counting * In-place k-d tree * Maximum weight rectangle recognition * Space efficient algorithms
Impakt faktor: 1.139, rok: 2020
Trvalý link: http://hdl.handle.net/11104/0312981