Folgen
Aritra Banik
Aritra Banik
Assistant professor, NISER
Bestätigte E-Mail-Adresse bei niser.ac.in - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Voronoi game on graphs
S Bandyapadhyay, A Banik, S Das, H Sarkar
Theoretical Computer Science 562, 270-282, 2015
492015
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
362011
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
302013
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
232015
Tracking paths
A Banik, MJ Katz, E Packer, M Simakov
Discrete Applied Mathematics 282, 22-34, 2020
192020
Conflict-free Covering.
EM Arkin, A Banik, P Carmi, G Citovsky, MJ Katz, JSB Mitchell, M Simakov
CCCG, 2015
192015
A polynomial sized kernel for tracking paths problem
A Banik, P Choudhary, D Lokshtanov, V Raman, S Saurabh
Algorithmica 82 (1), 41-63, 2020
162020
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
152007
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
142016
Fixed-parameter tractable algorithms for tracking set problems
A Banik, P Choudhary
Conference on Algorithms and Discrete Applied Mathematics, 93-104, 2018
122018
The discrete Voronoi game in R2
A Banik, BB Bhattacharya, S Das, S Mukherjee
Computational Geometry 63, 53-62, 2017
112017
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
102014
The discrete voronoi game in a simple polygon
A Banik, S Das, A Maheshwari, M Smid
International Computing and Combinatorics Conference, 197-207, 2013
102013
Fixed-parameter tractability of (n− k) list coloring
A Banik, A Jacob, VK Paliwal, V Raman
Theory of Computing Systems 64 (7), 1307-1316, 2020
92020
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
92018
Fréchet distance between a line and avatar point set
A Banik, F Panolan, V Raman, V Sahlot
Algorithmica 80, 2616-2636, 2018
92018
Efficient data retrieval in faulty sensor networks using a mobile mule
H Yedidsion, A Banik, P Carmi, MJ Katz, M Segal
2017 15th International Symposium on Modeling and Optimization in Mobile, Ad …, 2017
92017
One-round discrete Voronoi game in R2 in presence of existing facilities
A Banik, BB Bhattacharya, S Das, S Mukherjee
Canadian conference in computational geometry (CCCG), 2013
82013
On fair covering and hitting problems
S Bandyapadhyay, A Banik, S Bhore
Graph-Theoretic Concepts in Computer Science: 47th International Workshop …, 2021
72021
Fixed-parameter tractable algorithms for tracking shortest paths
A Banik, P Choudhary, V Raman, S Saurabh
Theoretical Computer Science 846, 1-13, 2020
72020
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20