Aritra Banik

According to our database, Aritra Banik authored at least 51 papers between 2007 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Multivariate Exploration of Metric Dilation.

Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

2024

Conflict and Fairness in Resource Allocation.

Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta, Pallavi Jain, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale

CoRR, 2024

Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints.

Susobhan Bandopadhyay, Aritra Banik, Diptapriyo Majumdar, Abhishek Sahu

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 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

Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

Cuts in Graphs with Matroid Constraints.

Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

On Colorful Vertex and Edge Cover Problems.

Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore

Algorithmica, December, 2023

On the geometric priority set cover problem.

Aritra Banik, Rajiv Raman, Saurabh Ray

Comput. Geom., June, 2023

Dominator Coloring and CD Coloring in Almost Cluster Graphs.

Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

2022

Dominator Coloring Parameterized by Cluster Vertex Deletion Number.

Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman

CoRR, 2022

Parameterized Complexity of Graph Partitioning into Connected Clusters.

Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh

CoRR, 2022

Structural Parameterizations of Budgeted Graph Coloring.

Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman

Proceedings of the WALCOM: Algorithms and Computation, 2022

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

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Parameterized Algorithms for Finding Highly Connected Solution.

Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh

Proceedings of the Computer Science - Theory and Applications, 2022

2021

Voronoi game on polygons.

Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda

Theor. Comput. Sci., 2021

Geometric planar networks on bichromatic collinear points.

Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg

Theor. Comput. Sci., 2021

On Fair Covering and Hitting Problems.

Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

On Geometric Priority Set Cover Problems.

Aritra Banik, Rajiv Raman, Saurabh Ray

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020

Fixed-parameter tractable algorithms for Tracking Shortest Paths.

Aritra Banik, Pratibha Choudhary, Venkatesh Raman, Saket Saurabh

Theor. Comput. Sci., 2020

List-coloring - Parameterizing from triviality.

Pranav Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman

Theor. Comput. Sci., 2020

Approximation algorithms for geometric conflict free covering problems.

Aritra Banik, Vibha Sahlot, Saket Saurabh

Comput. Geom., 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

Algorithmica, 2020

Optimal Strategies in Single Round Voronoi Game on Convex Polygons with Constraints.

Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvottamananda

Proceedings of the Combinatorial Optimization and Applications, 2020

Geometric Planar Networks on Bichromatic Points.

Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

The 1-dimensional discrete Voronoi game.

Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Sreeja Das

Oper. Res. Lett., 2019

Fixed-Parameter Tractability of (n-k) List Coloring.

Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Geometric Systems of Unbiased Representatives.

Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore, Leonardo Martínez-Sandoval

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

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

A Polynomial Sized Kernel for Tracking Paths Problem.

Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Some (in)tractable Parameterizations of Coloring and List-Coloring.

Pranav Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

Fixed-Parameter Tractable Algorithms for Tracking Set Problems.

Aritra Banik, Pratibha Choudhary

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017

The discrete Voronoi game in R².

Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Satyaki Mukherjee

Comput. Geom., 2017

Efficient data retrieval in faulty sensor networks using a mobile mule.

Harel Yedidsion, Aritra Banik, Paz Carmi, Matthew J. Katz, Michael Segal

Proceedings of the 15th International Symposium on Modeling and Optimization in Mobile, 2017

Parameterized Complexity of Geometric Covering Problems Having Conflicts.

Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 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

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Tracking Paths.

Aritra Banik, Matthew J. Katz, Eli Packer, Marina Simakov

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Polynomial Time Algorithms for Bichromatic Problems.

Sayan Bandyapadhyay, Aritra Banik

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

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

The p-Center Problem in Tree Networks Revisited.

Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Fréchet Distance Between a Line and Avatar Point Set.

Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015

Choice Is Hard.

Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Bottleneck Segment Matching.

Aritra Banik, Matthew J. Katz, Marina Simakov

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

Conflict-free Covering.

Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

Voronoi Games and Epsilon Nets.

Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Voronoi Game on Graphs.

Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar

Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

The Discrete Voronoi Game in a Simple Polygon.

Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

One-Round Discrete Voronoi Game in ℝ² in Presence of Existing Facilities.

Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Satyaki Mukherjee

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Two-Round Discrete Voronoi Game along a Line.

Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Sreeja Das

Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2011

A Domain Specific Ontology Based Semantic Web Search Engine

Debajyoti Mukhopadhyay, Aritra Banik, Sreemoyee Mukherjee, Jhilik Bhattacharya, Young-Chon Kim

CoRR, 2011

Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point.

Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

Optimal Strategies for the One-Round Discrete Voronoi Game on a Line.

Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2007

A Technique for Automatic Construction of Ontology from Existing Database to Facilitate Semantic Web.

Debajyoti Mukhopadhyay, Aritra Banik, Sreemoyee Mukherjee

Proceedings of the 10th International Conference on Information Technology, 2007