- About Me
- Research
- Publications
- Teaching
- Resources

Primarily I'm a computational geometer with interest in other related algorithimic problems. I am interested in designing efficient algorithms (or prove it does not exist) for problems in various domains.

- Since May 2018 : Assistant Professor ~ National Institute of Science Education and Research(NISER), India
- March 2016 - May 2018 : Assistant Professor ~ Indian Institute of Technology Jodhpur, India
- August 2014 - February 2016: Postdoctoral Associate ~ Ben-Gurion University of the Negev, Israel
- January 2014 - July 2014: Visiting Scientist ~ Indian Statistical Institute

- Ph.D.(Computer Science), Indian Statistical Institute Kolkata, 2014.
- M. Tech.(Computer Science), Indian Statistical Institute, Kolkata, 2009.
- B. Tech.(Computer Science), West Bengal University of Technology, 2007.

(School of Mathematical Sciences Building)

National Institute of Science Education and Research(NISER)

P.O. Jatni, Khurda 752050, Odisha, India

E-mail:

Recent Trends in Algorithms

February 7-10, 2019

What you seek is seeking you- Rumi

Research Interests:

- Computational geometry: Paradigms & techniques, approximation algorithms, geometric optimization, kinetic geometry, data structures, arrangements, proximity problems triangulation, motion planning
- Combinatorial Geometry: Epsilon-nets, Erdos-Szekeres Problems, Ramsey Theory, VC dimension.
- Approximation Algorithms: Geometric Approximation Algorithms, Hardness of approximation.
- Sensor networks: Processing sensor data, communication and energy efficient algorithms, sensor network design, sensor networks for ecological modeling.
- Parameterized Complexity: Parameterized Complexity of geometric problems

- E. M. Arkin, A. Banik, P. Carmi, G. Citovsky, M. J. Katz, J. S. B. Mitchell, M. Simakov, Selecting and Covering Colored Points, Discrete Applied Mathematics, Accepted.
- A. Banik, F. Panolan, V. Raman and V. Sahlot, Fréchet Distance Between a Line and Avatar Point Set, Algorithmica, Accepted.
- A. Banik, B. B. Bhattacharya, S. Das, and S. Mukherjee, The Discrete Voronoi Game in R 2 , Computational Geometry: Theory and Applications, 63: 53-62 2017.
- A. Banik, J. D. Carufel, A. Maheshwari, M. H. M. Smid, Discrete Voronoi games and epsilon-nets, in two and three dimensions, Computational Geometry: Theory and Applications,55: 41-58 2016.
- S. Bandyapadhyay, A. Banik, S. Das, H. Sarkar, Voronoi game on graphs, Theoretical Computer Science, 562: 270-282, 2015.
- A. Banik, B. B. Bhattacharya, S. Das, Minimum enclosing circle of a set of fixed points and a mobile point, Comput. Geom., 47(9):891898, 2014.
- A. Banik, B. B. Bhattacharya, S. Das, Optimal Strategies for the One-Round Discrete Voronoi Game on a Line, Journal of Combinatorial Optimization 1{15, 2012. ISSN 1382- 6905. doi: 10.1007/s10878-011-9447-6.

- A. Banik, P. Choudhary, Fixed-parameter Tractable Algorithms for Tracking Set Prob- lems, CALDAM 2018, LNCS, 10743, 93-104.
- E. Arkin, A. Banik, P. Carmi, G. Citovsky, S. Jia, M. Katz, T. Mayer and J. Mitchell. Network Optimization on Partitioned Pairs of Points, ISAAC 2017, LNCS, 10389, 61-72.
- A. Banik, F. Panolan, V. Raman, V. Sahlot and S. Saurabh. Parameterized Complexity of Geometric Covering Problems Having Conflicts, WADS 2017, LNCS, 92, 6:1-6:12.
- A. Banik, M. J. Katz, E. Packer, M. Simakov. Tracking Paths, CIAC 2017, LNCS, 10236, 67-79.
- S. Bandyapadhyay and A. Banik. Polynomial Time Algorithms for Bichromatic Prob- lems, Algorithms and Discrete Applied Mathematics - Third International Conference, CALDAM 2017, LNCS, 10156, 12-23.
- A. Banik, F. Panolan, V. Raman and V. Sahlot, Frechet Distance Between a Line and Avatar Point Set, 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,65,1-32.
- A. Banik, B. Bhattacharya, S. Das, T. Kameda and Z. Song, The p-Center Problem in Tree Networks Revisited, SWAT 2016, to appear.
- E. Arkin, A. Banik, P. Carmi, G. Citovsky, M. Katz, J. Mitchell and M. Simakov, Choice is Hard, Algorithms and Computation - 26rd International Symposium, ISAAC 2015, LNCS 9472,318\96328.
- E. Arkin, A. Banik, P. Carmi, G. Citovsky, M. Katz, J. Mitchell and M. Simakov, Conflict-free Covering, 27th Canadian Conference on Computational Geometry, CCCG 2015, Queen's University, Ontario, Canada.

- Computational Geometry, 2016
- Algorithm Design and Analysis, 2016, IIT Jodhpur
- Selected Topics in Algorithms, 2016, IIT Jodhpur
- Discrete Mathematics, 2017, IIT Jodhpur
- Data Structure, 2017, IIT Jodhpur
- Operating System, 2017, IIT Jodhpur
- Discrete Mathematics, 2018, IIT Jodhpur
- Computational Geometry, 2018, IIT Jodhpur