Search results
- 1.0548662 - ÚI 2022 RIV CH eng C - Conference Paper (international conference)
Acharyya, Ankush - Keikha, Vahideh - Majumdar, D. - Pandit, S.
Constrained Hitting Set Problem with Intervals.
Computing and Combinatorics: 27th International Conference, COCOON 2021 Proceedings. Cham: Springer, 2021 - (Chen, C.; Hon, W.; Hung, L.; Lee, C.), s. 604-616. Lecture Notes in Computer Science, 13025. ISBN 978-3-030-89542-6. ISSN 0302-9743.
[COCOON 2021: International Conference on Computing and Combinatorics /27./. Tainan (TW), 24.10.2021-26.10.2021]
R&D Projects: GA ČR(CZ) GJ19-06792Y
Institutional support: RVO:67985807
Keywords : Fixed Parameter Tractability * Hitting Set Problem * Approximation Algorithm
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Permanent Link: http://hdl.handle.net/11104/0324711 - 2.0548659 - ÚI 2022 RIV CH eng C - Conference Paper (international conference)
Acharyya, Ankush - Jallu, Ramesh Kumar - Keikha, Vahideh - Löffler, M. - Saumell, Maria
Minimum Color Spanning Circle in Imprecise Setup.
Computing and Combinatorics: 27th International Conference, COCOON 2021 Proceedings. Cham: Springer, 2021 - (Chen, C.; Hon, W.; Hung, L.; Lee, C.), s. 257-268. Lecture Notes in Computer Science, 13025. ISBN 978-3-030-89542-6. ISSN 0302-9743.
[COCOON 2021: International Conference on Computing and Combinatorics /27./. Tainan (TW), 24.10.2021-26.10.2021]
R&D Projects: GA ČR(CZ) GJ19-06792Y
EU Projects: European Commission(ES) 734922
Institutional support: RVO:67985807
Keywords : Color spanning circle * Imprecise points * Algorithms * Computational complexity
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Permanent Link: http://hdl.handle.net/11104/0324709 - 3.0548611 - ÚI 2022 RIV DE eng C - Conference Paper (international conference)
Acharyya, Ankush - Jallu, Ramesh Kumar - Löffler, M. - Meijer, G.G.T. - Saumell, Maria - Silveira, R.I. - Staals, F.
Terrain prickliness: Theoretical grounds for high complexity viewsheds.
11th International Conference on Geographic Information Science (GIScience 2021) - Part II. Dagstuhl: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2021 - (Janowicz, K.; Verstegen, J.), č. článku 10. Leibniz International Proceedings in Informatics (LIPIcs), 208. ISBN 978-3-95977-208-2. ISSN 1868-8969.
[GIScience 2021: International Conference on Geographic Information Science /11./. Poznan / Online (PL), 27.09.2021-30.09.2021]
R&D Projects: GA ČR(CZ) GJ19-06792Y
EU Projects: European Commission(ES) 734922
Institutional support: RVO:67985807
Keywords : Digital elevation model * Triangulated irregular network * Viewshed complexity
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Permanent Link: http://hdl.handle.net/11104/0324652File Download Size Commentary Version Access 0548611-aoa.pdf 1 4.4 MB OA CC BY 4.0 Publisher’s postprint open-access - 4.0534969 - ÚI 2021 CH eng C - Conference Paper (international conference)
Acharyya, Ankush - Nandy, S. C. - Roy, S.
Minimum Width Color Spanning Annulus.
Computing and Combinatorics. Cham: Springer, 2016 - (Dinh, T.; Thai, M.), s. 431-442. Lecture Notes in Computer Science, 9797. ISBN 978-3-319-42633-4. ISSN 0302-9743.
[COCOON 2016. International Conference /22./. Ho Chi Minh City (VN), 02.08.2016-04.08.2016]
Permanent Link: http://hdl.handle.net/11104/0313097 - 5.0534968 - ÚI 2021 CH eng C - Conference Paper (international conference)
Acharyya, Ankush - Nandy, S. C. - Pandit, S. - Roy, S.
Covering Segments with Unit Squares.
Algorithms and Data Structures. Cham, 2017 - (Ellen, F.; Kolokolova, A.; Sack, J.), s. 1-12. Lecture Notes in Computer Science, 10389. ISBN 978-3-319-62126-5. ISSN 0302-9743.
[WADS 2017: Workshop on Algorithms and Data Structures /15./. St. John’s (CA), 31.07.2017-02.08.2017]
Permanent Link: http://hdl.handle.net/11104/0313096 - 6.0534967 - ÚI 2021 CA eng C - Conference Paper (international conference)
Acharyya, Ankush - De, M. - Nandy, S. C.
Range Assignment of Base-Stations Maximizing Coverage Area without Interference.
CCCG 2017 29th Canadian Conference on Computational Geometry Proceedings. Ottawa: Carleton University, 2017 - (Smid, M.), s. 126-131
[CCCG 2017. Canadian Conference on Computational Geometry /29./. Ottawa (CA), 26.07.2017-28.07.2017]
Permanent Link: http://hdl.handle.net/11104/0313095 - 7.0534965 - ÚI 2021 CH eng C - Conference Paper (international conference)
Acharyya, Ankush - Maheshwari, A. - Nandy, S. C.
Localized query: Color spanning variations.
Algorithms and Discrete Applied Mathematics. Cham: Springer, 2019 - (Pal, S.; Vijayakumar, A.), s. 150-160. Lecture Notes in Computer Science, 11394. ISBN 978-3-030-11508-1. ISSN 0302-9743.
[CALDAM 2019. International Conference /5./. Kharagpur (IN), 14.02.2019-16.02.2019]
Permanent Link: http://hdl.handle.net/11104/0313094