| Voronoi game on graphs S Bandyapadhyay, A Banik, S Das, H Sarkar Theoretical Computer Science 562, 270-282, 2015 | 52 | 2015 |
| A domain specific ontology based semantic web search engine D Mukhopadhyay, A Banik, S Mukherjee, J Bhattacharya, YC Kim arXiv preprint arXiv:1102.0695, 2011 | 37 | 2011 |
| Optimal strategies for the one-round discrete Voronoi game on a line A Banik, BB Bhattacharya, S Das Journal of Combinatorial Optimization 26 (4), 655-669, 2013 | 27 | 2013 |
| Tracking paths A Banik, MJ Katz, E Packer, M Simakov Discrete Applied Mathematics 282, 22-34, 2020 | 24 | 2020 |
| Choice is hard EM Arkin, A Banik, P Carmi, G Citovsky, MJ Katz, JSB Mitchell, M Simakov International Symposium on Algorithms and Computation, 318-328, 2015 | 24 | 2015 |
| Conflict-free Covering. EM Arkin, A Banik, P Carmi, G Citovsky, MJ Katz, JSB Mitchell, M Simakov CCCG, 2015 | 21 | 2015 |
| A polynomial sized kernel for tracking paths problem A Banik, P Choudhary, D Lokshtanov, V Raman, S Saurabh Algorithmica 82 (1), 41-63, 2020 | 19 | 2020 |
| Selecting and covering colored points EM Arkin, A Banik, P Carmi, G Citovsky, MJ Katz, JSB Mitchell, M Simakov Discrete Applied Mathematics 250, 75-86, 2018 | 19 | 2018 |
| A technique for automatic construction of ontology from existing database to facilitate semantic web D Mukhopadhyay, A Banik, S Mukherjee 10th International Conference on Information Technology (ICIT 2007), 246-251, 2007 | 15 | 2007 |
| Fixed-parameter tractable algorithms for tracking set problems A Banik, P Choudhary Conference on Algorithms and Discrete Applied Mathematics, 93-104, 2018 | 14 | 2018 |
| Discrete Voronoi games and ϵ-nets, in two and three dimensions A Banik, JL De Carufel, A Maheshwari, M Smid Computational Geometry 55, 41-58, 2016 | 13 | 2016 |
| Minimum enclosing circle of a set of fixed points and a mobile point A Banik, BB Bhattacharya, S Das Computational Geometry 47 (9), 891-898, 2014 | 12 | 2014 |
| Parameterized complexity of geometric covering problems having conflicts A Banik, F Panolan, V Raman, V Sahlot, S Saurabh Algorithmica 82 (1), 1-19, 2020 | 11 | 2020 |
| The discrete Voronoi game in R2 A Banik, BB Bhattacharya, S Das, S Mukherjee Computational Geometry 63, 53-62, 2017 | 11 | 2017 |
| On colorful vertex and edge cover problems S Bandyapadhyay, A Banik, S Bhore Algorithmica 85 (12), 3816-3827, 2023 | 10 | 2023 |
| On fair covering and hitting problems S Bandyapadhyay, A Banik, S Bhore International Workshop on Graph-Theoretic Concepts in Computer Science, 39-51, 2021 | 9 | 2021 |
| Fixed-parameter tractable algorithms for tracking shortest paths A Banik, P Choudhary, V Raman, S Saurabh Theoretical Computer Science 846, 1-13, 2020 | 9 | 2020 |
| Fréchet distance between a line and avatar point set A Banik, F Panolan, V Raman, V Sahlot Algorithmica 80 (9), 2616-2636, 2018 | 9 | 2018 |
| The -Center Problem in Tree Networks Revisited A Banik, B Bhattacharya, S Das, T Kameda, Z Song arXiv preprint arXiv:1604.07535, 2016 | 9 | 2016 |
| The discrete voronoi game in a simple polygon A Banik, S Das, A Maheshwari, M Smid International Computing and Combinatorics Conference, 197-207, 2013 | 9 | 2013 |
