Aritra Banik

 

I am a postdoctoral associate at Ben-Gurion University of the Negev, working with Prof. Matya Katz since August 2014. I have completed my PhD in January, 2014 from Indian Statistical Institute, Kolkata. Before joinisng Ben-Gurion University of the Negev I was a postdoctoral fellow at Indian Statistical Institute, Kolkata. My current research interest is broadly on the following sub-disciplines

  • Computational Geometry: Facility Location, Geometric Optimization, Motion Planning, Voronoi Diagrams.
  • Combinatorial Geometry: Epsilon-nets, Erdos-Szekeres Problems, Ramsey Theory, VC dimension.
    Journal Publications
  1. S. Bandyapadhyay, A. Banik, S. Das, H. Sarkar, Voronoi game on graphs, Theoretical Computer Science, 562: 270-282, 2015.
  2. 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.
  3. 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.
    Conference Publications
  1. A. Banik, J. Carufel, A. Maheshwari, M. Smid, Voronoi Games and Epsilon Nets, 26th Canadian Conference on Computational Geometry, CCCG, Halifax, Nova Scotia, Canada, 2014.
  2. A. Banik, B. B. Bhattacharya, S. Das, S. Mukherjee, One-Round Discrete Voronoi Game in R2 in Presence of Existing Facilities, 25th Canadian Conference on Computational Geometry, CCCG. Carleton University, Ottawa, Canada, 2013.
  3. A. Banik, B. B. Bhattacharya, S. Das, S. Das, Two-round discrete Voronoi Game along a line, Seventh International Frontiers of Algorithmics Workshop, FAW 2013, LNCS 7924, 210{220.
  4. A. Banik, S. Das, A. Maheshwari, M. Smid, The Discrete Voronoi Game in a Simple Polygon, Proc. 19th Annual International Computing and Combinatorics Conference, COCOON 2013, LNCS 7936, 197{207. Invited to special issue of Algorithmica.
  5. S. Bandyapadhyay, A. Banik, S. Das, H. Sarkar, Voronoi Game on Graphs, Proc. Work- shop on Algorithm and Computation, WALCOM 2013, LNCS 7748, 77{88. Invited to special issue of Theoretical Computer Science.
  6. A. Banik, B. B. Bhattacharya, S. Das, Optimal Strategies for the One-Round Discrete Voronoi Game on a Line, Proc. 17th Annual International Computing and Combinatorics Conference, COCOON 2011, LNCS 6842, 213{224. Invited and accepted to special issue of Journal of Combinatorial Optimization.
  7. A. Banik, B. B. Bhattacharya, S. Das, The Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point, Proc. Workshop on Algorithm and Computation, WALCOM 2011, LNCS 6522, 98{109.
  8. P. K. Bhowmick, A. Mukherjee, A. Banik, P. Mitra, A. Basu, A Comparative Study of Emotional and Non-Emotional Lexicons in the Wordnet: A Complex Network Approach, 6th International Conference on Natural Language Processing, ICON 2008, Macmillan Publishers, India.
  9. D. Mukhopadhyay, A. Banik, S. Mukherjee, A Technique for Automatic Construction of Ontology from Existing Database to Facilitate Semantic Web, Proc. 10th International Conference on Information Technology, ICIT 2007, IEEE CS Press, 246{251.

Aritra Banik
Room No: 214 Alon building(37)
Department of Computer Science
Ben-Gurion University of the Negev
Beer-Sheva 84105, Israel

E-mail: aritrabanik@gmail.com