Search results

  1. 1.
    0534934 - ÚI 2021 CH eng C - Conference Paper (international conference)
    Jallu, R. K. - Das, G. K.
    Improved Algorithm for Maximum Independent Set on Unit Disk Graph.
    Lecture Notes in Computer Science. In: 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
     
     
  2. 2.
    0534921 - ÚI 2021 CH eng C - Conference Paper (international conference)
    Basappa, M. - Jallu, R. K. - Das, G. K. - Nandy, S. C.
    The Euclidean k-Supplier Problem in R^2.
    Lecture Notes in Computer Science. In: 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
     
     
  3. 3.
    0534918 - ÚI 2021 CH eng C - Conference Paper (international conference)
    Jallu, R. K. - 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
     
     
  4. 4.
    0534907 - ÚI 2021 CH eng C - Conference Paper (international conference)
    Dey, S. - Jallu, R. K. - 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
     
     
  5. 5.
    0534839 - ÚI 2022 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
    Keywords : Approximation algorithm * Fixed parameter tractability * k-supplier * Voronoi diagram * Local search
    Impact factor: 1.154, year: 2020
    Permanent Link: http://hdl.handle.net/11104/0312999
     
     
  6. 6.
    0534827 - ÚI 2021 eng J - Journal Article
    Jallu, R. K. - 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
     
     
  7. 7.
    0534826 - ÚI 2021 SG eng J - Journal Article
    Basappa, M. - Jallu, R. K. - 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
     
     
  8. 8.
    0534821 - ÚI 2021 NL eng J - Journal Article
    Acharyya, A. - 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
     
     
  9. 9.
    0478998 - ÚI 2018 RIV US eng J - Journal Article
    Cabello, S. - Cibulka, J. - Kynčl, J. - Saumell, Maria - Valtr, P.
    Peeling Potatoes Near-optimally in Near-linear Time.
    Siam Journal on Computing. Roč. 46, č. 5 (2017), s. 1574-1602. ISSN 0097-5397. E-ISSN 1095-7111
    R&D Projects: GA ČR GBP202/12/G061
    Grant - others: GA MŠk(CZ) LO1506; GA MŠk(CZ) EE2.3.30.0038
    Institutional support: RVO:67985807
    Keywords : geometric optimization * potato peeling * visibility graph * geometric probability * approximation algorithm
    OECD category: Pure mathematics
    Impact factor: 0.902, year: 2017
    Permanent Link: http://hdl.handle.net/11104/0275024
    FileDownloadSizeCommentaryVersionAccess
    a0478998.pdf12341.8 KBPublisher’s postprintrequire