Search results
- 1.0567939 - ÚI 2023 RIV CH eng C - Conference Paper (international conference)
Keikha, Vahideh
Large k-Gons in a 1.5D Terrain.
Computing and Combinatorics: 28th International Conference, COCOON 2022 Proceedings. Cham: Springer, 2022 - (Zhang, Y.; Miao, D.; Möhring, R.), s. 49-60. Lecture Notes in Computer Science, 13595. ISBN 978-3-031-22104-0. ISSN 0302-9743. E-ISSN 1611-3349.
[COCOON 2022: International Computing and Combinatorics Conference /28./. Shenzhen (CN), 22.10.2022-24.10.2022]
R&D Projects: GA ČR(CZ) GJ19-06792Y
Institutional support: RVO:67985807
Keywords : 1.5D terrain * Optimal area * Optimal perimeter * Approximation algorithm
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Permanent Link: https://hdl.handle.net/11104/0339206 - 2.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 - 3.0534934 - ÚI 2021 CH eng C - Conference Paper (international conference)
Jallu, Ramesh Kumar - Das, G. K.
Improved Algorithm for Maximum Independent Set on Unit Disk Graph.
Algorithmsand Discrete AppliedMathematics. Cham: Springer, 2016 - (Govindarajan, S.; Maheshwari, A.), s. 212-223. Lecture Notes in Computer Science, 9602. ISBN 978-3-319-29220-5. ISSN 0302-9743.
[CADALM 2016. International Conference /2./. Thiruvananthapuram (IN), 18.02.2016-20.02.2016]
Keywords : time approximation schemes * packing * Maximum independent set * Unit disk graph * Approximation algorithm
Permanent Link: http://hdl.handle.net/11104/0313065 - 4.0534921 - ÚI 2021 CH eng C - Conference Paper (international conference)
Basappa, M. - Jallu, Ramesh Kumar - Das, G. K. - Nandy, S. C.
The Euclidean k-Supplier Problem in R^2.
Algorithms for Sensor Systems. Cham: Springer, 2017 - (Chrobak, M.; Anta, A.; Gąsieniec, A.; Klasing, R.), s. 129-140. Lecture Notes in Computer Science, 10050. ISBN 978-3-319-53057-4. ISSN 0302-9743.
[ALGOSENSORS 2016. International Symposium on Algorithms and Experiments for Wireless Sensor Networks /12./. Aarhus (DK), 25.08.2016-26.08.2016]
Keywords : base-station placement * convex polygon * approximation algorithms * boundary * k-supplier problem * FPT algorithm * Approximation algorithm
Permanent Link: http://hdl.handle.net/11104/0313056 - 5.0534918 - ÚI 2021 CH eng C - Conference Paper (international conference)
Jallu, Ramesh Kumar - Das, G. K.
Liar's Domination in 2D.
Algorithms and Discrete Applied Mathematics. Cham: Springer, 2017 - (Narayanaswamy, N.; Gaur, D.), s. 219-229. Lecture Notes in Computer Science, 10156. ISBN 978-3-319-53006-2. ISSN 0302-9743.
[CALDAM 2017. International Conference /3./. Sancoale, Goa (IN), 16.02.2017-18.02.2017]
Keywords : graphs * approximation * algorithms * Unit disk graph * Approximation algorithm * Dominating set * Liar's dominating set
Permanent Link: http://hdl.handle.net/11104/0313055 - 6.0534907 - ÚI 2021 CH eng C - Conference Paper (international conference)
Dey, S. - Jallu, Ramesh Kumar - Nandy, S. C.
Minimum Spanning Tree of Line Segments.
Computing and Combinatorics. Cham, 2018 - (Wang, L.; Zhu, D.), s. 529-541. Lecture Notes in Computer Science, 10976. ISBN 78-3-319-94775-4. ISSN 0302-9743.
[COCOON 2018. International Conference /24./. Qing Dao (CN), 02.07.2018-04.07.2018]
Keywords : graphs * set * mst * Minimum spanning tree * k-MST * Approximation algorithm * NP-complete
Permanent Link: http://hdl.handle.net/11104/0313050 - 7.0534839 - ÚI 2022 RIV NL eng J - Journal Article
Basappa, M. - Jallu, Ramesh Kumar - Das, G. K. - Nandy, S. C.
The Euclidean k-Supplier problem in R^2.
Operations Research Letters. Roč. 49, č. 1 (2021), s. 48-54. ISSN 0167-6377. E-ISSN 1872-7468
Institutional support: RVO:67985807
Keywords : Approximation algorithm * Fixed parameter tractability * k-supplier * Voronoi diagram * Local search
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impact factor: 1.151, year: 2021
Method of publishing: Limited access
http://dx.doi.org/10.1016/j.orl.2020.10.008
Permanent Link: http://hdl.handle.net/11104/0312999 - 8.0534827 - ÚI 2021 eng J - Journal Article
Jallu, Ramesh Kumar - Prasad, P. R. - Das, G. K.
Distributed construction of connected dominating set in unit disk graphs.
Journal of Parallel and Distributed Computing. Roč. 104 (2017), s. 159-166. ISSN 0743-7315. E-ISSN 1096-0848
Keywords : wireless * algorithm * Unit disk graph * Approximation algorithm * Connected dominating set
Impact factor: 1.815, year: 2017
Permanent Link: http://hdl.handle.net/11104/0312992 - 9.0534826 - ÚI 2021 SG eng J - Journal Article
Basappa, M. - Jallu, Ramesh Kumar - Das, G. K.
Constrained k-Center Problem on a Convex Polygon.
International Journal of Foundations of Computer Science. Roč. 31, č. 2 (2020), s. 275-291. ISSN 0129-0541. E-ISSN 1793-6373
Keywords : base-station placement * efficient algorithms * boundary * Approximation algorithm * convex polygon cover * geometric disk cover
Impact factor: 0.416, year: 2020
Permanent Link: http://hdl.handle.net/11104/0312990 - 10.0534821 - ÚI 2021 NL eng J - Journal Article
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
Keywords : time approximation schemes * packing * Quadratic programming * Discrete packing * Range assignment in wireless communication * NP-hardness * Approximation algorithm * ptas
Impact factor: 0.827, year: 2020
Permanent Link: http://hdl.handle.net/11104/0312983