A Technique for Automatic Construction of Ontology from Existing Database to Facilitate Semantic Web. - Debajyoti Mukhopadhyay; Aritra Banik; Sreemoyee Mukherjee (ICIT, 2007)

A Domain Specific Ontology Based Semantic Web Search Engine - Debajyoti Mukhopadhyay; Aritra Banik; Sreemoyee Mukherjee; Jhilik Bhattacharya; Young-Chon Kim (CoRR, 2011)

Two-Round Discrete Voronoi Game along a Line. - Aritra Banik; Bhaswar B. Bhattacharya; Sandip Das 001; Sreeja Das (FAW-AAIM, 2013)

One-Round Discrete Voronoi Game in ℝ2 in Presence of Existing Facilities. - Aritra Banik; Bhaswar B. Bhattacharya; Sandip Das 001; Satyaki Mukherjee (CCCG, 2013)

Optimal strategies for the one-round discrete Voronoi game on a line. - Aritra Banik; Bhaswar B. Bhattacharya; Sandip Das 001 (J. Comb. Optim., 2013)

Voronoi Games and Epsilon Nets. - Aritra Banik; Jean-Lou De Carufel; Anil Maheshwari; Michiel H. M. Smid (CCCG, 2014)

Minimum enclosing circle of a set of fixed points and a mobile point. - Aritra Banik; Bhaswar B. Bhattacharya; Sandip Das 001 (Comput. Geom., 2014)

Conflict-free Covering. - Esther M. Arkin; Aritra Banik; Paz Carmi; Gui Citovsky; Matthew J. Katz; Joseph S. B. Mitchell; Marina Simakov (CCCG, 2015)

Bottleneck Segment Matching. - Aritra Banik; Matthew J. Katz; Marina Simakov (CCCG, 2015)

Choice Is Hard. - Esther M. Arkin; Aritra Banik; Paz Carmi; Gui Citovsky; Matthew J. Katz; Joseph S. B. Mitchell; Marina Simakov (ISAAC, 2015)

Voronoi game on graphs. - Sayan Bandyapadhyay; Aritra Banik; Sandip Das 001; Hirak Sarkar (Theor. Comput. Sci., 2015)

The p-Center Problem in Tree Networks Revisited. - Aritra Banik; Binay K. Bhattacharya; Sandip Das 001; Tsunehiko Kameda; Zhao Song 002 (SWAT, 2016)

Discrete Voronoi games and ϵ-nets, in two and three dimensions. - Aritra Banik; Jean-Lou De Carufel; Anil Maheshwari; Michiel H. M. Smid (Comput. Geom., 2016)

Polynomial Time Algorithms for Bichromatic Problems. - Sayan Bandyapadhyay; Aritra Banik (CALDAM, 2017)

Network Optimization on Partitioned Pairs of Points. - Esther M. Arkin; Aritra Banik; Paz Carmi; Gui Citovsky; Su Jia; Matthew J. Katz; Tyler Mayer; Joseph S. B. Mitchell (ISAAC, 2017)

Efficient data retrieval in faulty sensor networks using a mobile mule. - Harel Yedidsion; Aritra Banik; Paz Carmi; Matthew J. Katz; Michael Segal 001 (WiOpt, 2017)

The discrete Voronoi game in R2. - Aritra Banik; Bhaswar B. Bhattacharya; Sandip Das 001; Satyaki Mukherjee (Comput. Geom., 2017)

Fixed-Parameter Tractable Algorithms for Tracking Set Problems. - Aritra Banik; Pratibha Choudhary (CALDAM, 2018)

Some (in)tractable Parameterizations of Coloring and List-Coloring. - Pranav Arora; Aritra Banik; Vijay Kumar Paliwal; Venkatesh Raman 001 (FAW, 2018)

Fréchet Distance Between a Line and Avatar Point Set. - Aritra Banik; Fahad Panolan; Venkatesh Raman 001; Vibha Sahlot (Algorithmica, 2018)

Selecting and covering colored points. - Esther M. Arkin; Aritra Banik; Paz Carmi; Gui Citovsky; Matthew J. Katz; Joseph S. B. Mitchell; Marina Simakov (Discret. Appl. Math., 2018)

The 1-dimensional discrete Voronoi game. - Aritra Banik; Bhaswar B. Bhattacharya; Sandip Das 001; Sreeja Das (Oper. Res. Lett., 2019)

The discrete Voronoi game in a simple polygon. - Aritra Banik; Sandip Das 001; Anil Maheshwari; Michiel H. M. Smid (Theor. Comput. Sci., 2019)

Geometric Planar Networks on Bichromatic Points. - Sayan Bandyapadhyay; Aritra Banik; Sujoy Bhore; Martin Nöllenburg (CALDAM, 2020)

Optimal Strategies in Single Round Voronoi Game on Convex Polygons with Constraints. - Aritra Banik; Arun Kumar Das 001; Sandip Das 001; Anil Maheshwari; Swami Sarvottamananda (COCOA, 2020)

A Polynomial Sized Kernel for Tracking Paths Problem. - Aritra Banik; Pratibha Choudhary; Daniel Lokshtanov; Venkatesh Raman 001; Saket Saurabh 001 (Algorithmica, 2020)

Parameterized Complexity of Geometric Covering Problems Having Conflicts. - Aritra Banik; Fahad Panolan; Venkatesh Raman 001; Vibha Sahlot; Saket Saurabh 001 (Algorithmica, 2020)

Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule. - Harel Yedidsion; Stav Ashur; Aritra Banik; Paz Carmi; Matthew J. Katz; Michael Segal 001 (Algorithmica, 2020)

Approximation algorithms for geometric conflict free covering problems. - Aritra Banik; Vibha Sahlot; Saket Saurabh 001 (Comput. Geom., 2020)

Tracking Paths. - Aritra Banik; Matthew J. Katz; Eli Packer; Marina Simakov (Discret. Appl. Math., 2020)

Fixed-Parameter Tractability of (n - k) List Coloring. - Aritra Banik; Ashwin Jacob; Vijay Kumar Paliwal; Venkatesh Raman 001 (Theory Comput. Syst., 2020)

List-coloring - Parameterizing from triviality. - Pranav Arora; Aritra Banik; Vijay Kumar Paliwal; Venkatesh Raman 001 (Theor. Comput. Sci., 2020)

Fixed-parameter tractable algorithms for Tracking Shortest Paths. - Aritra Banik; Pratibha Choudhary; Venkatesh Raman 001; Saket Saurabh 001 (Theor. Comput. Sci., 2020)

On Geometric Priority Set Cover Problems. - Aritra Banik; Rajiv Raman 001; Saurabh Ray (ISAAC, 2021)

On Fair Covering and Hitting Problems. - Sayan Bandyapadhyay; Aritra Banik; Sujoy Bhore (WG, 2021)

Geometric planar networks on bichromatic collinear points. - Sayan Bandyapadhyay; Aritra Banik; Sujoy Bhore; Martin Nöllenburg (Theor. Comput. Sci., 2021)

Voronoi game on polygons. - Aritra Banik; Arun Kumar Das 001; Sandip Das 001; Anil Maheshwari; Swami Sarvattomananda (Theor. Comput. Sci., 2021)

Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets. - Ankit Abhinav; Susobhan Bandopadhyay; Aritra Banik; Yasuaki Kobayashi; Shunsuke Nagano; Yota Otachi; Saket Saurabh 001 (MFCS, 2022)

Parameterized Complexity of Graph Partitioning into Connected Clusters. - Ankit Abhinav; Susobhan Bandopadhyay; Aritra Banik; Saket Saurabh 001 (CoRR, 2022)

Dominator Coloring Parameterized by Cluster Vertex Deletion Number. - Aritra Banik; Prahlad Narasimhan Kasthurirangan; Venkatesh Raman 001 (CoRR, 2022)

Geometric systems of unbiased representatives. - Aritra Banik; Bhaswar B. Bhattacharya; Sujoy Bhore; Leonardo Martínez-Sandoval (Inf. Process. Lett., 2022)

Parameterized algorithms for finding highly connected solution. - Ankit Abhinav; Susobhan Bandopadhyay; Aritra Banik; Saket Saurabh 001 (Theor. Comput. Sci., 2023)

Structural parameterizations of budgeted graph coloring. - Susobhan Bandopadhyay; Suman Banerjee 002; Aritra Banik; Venkatesh Raman 001 (Theor. Comput. Sci., 2023)

On the geometric priority set cover problem. - Aritra Banik; Rajiv Raman 001; Saurabh Ray (Comput. Geom., 2023)

On Colorful Vertex and Edge Cover Problems. - Sayan Bandyapadhyay; Aritra Banik; Sujoy Bhore (Algorithmica, 2023)

Cuts in Graphs with Matroid Constraints. - Aritra Banik; Fedor V. Fomin; Petr A. Golovach; Tanmay Inamdar 002; Satyabrata Jana; Saket Saurabh 001 (ESA, 2024)

Minimum Consistent Subset in Trees and Interval Graphs. - Aritra Banik; Sayani Das; Anil Maheshwari; Bubai Manna; Subhas C. Nandy; Krishna Priya K. M.; Bodhayan Roy; Sasanka Roy; Abhishek Sahu (FSTTCS, 2024)

Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints. - Susobhan Bandopadhyay; Aritra Banik; Diptapriyo Majumdar; Abhishek Sahu (MFCS, 2024)

Conflict and Fairness in Resource Allocation. - Susobhan Bandopadhyay; Aritra Banik; Sushmita Gupta; Pallavi Jain 001; Abhishek Sahu; Saket Saurabh 001; Prafullkumar Tale (CoRR, 2024)

Multivariate Exploration of Metric Dilation. - Aritra Banik; Fedor V. Fomin; Petr A. Golovach; Tanmay Inamdar 002; Satyabrata Jana; Saket Saurabh 001 (STACS, 2025)

Dominator coloring and CD coloring in almost cluster graphs. - Aritra Banik; Prahlad Narasimhan Kasthurirangan; Venkatesh Raman 001 (J. Comput. Syst. Sci., 2025)