Aritra Banik

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 60

Top Topics

Parameterized Complexity

Top Venues

Theor. Comput. Sci.

Publications

Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M, Bodhayan Roy, Sasanka Roy, Abhishek Sahu
Minimum Consistent Subset in Trees and Interval Graphs. CoRR (2024)
Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh
Cuts in Graphs with Matroid Constraints. CoRR (2024)
Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta, Pallavi Jain, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
Conflict and Fairness in Resource Allocation. CoRR (2024)
Susobhan Bandopadhyay, Aritra Banik, Diptapriyo Majumdar, Abhishek Sahu
Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints. MFCS (2024)
Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman
Dominator Coloring and CD Coloring in Almost Cluster Graphs. WADS (2023)
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore
On Colorful Vertex and Edge Cover Problems. CoRR (2023)
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore
On Colorful Vertex and Edge Cover Problems. Algorithmica 85 (12) (2023)
Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman
Structural parameterizations of budgeted graph coloring. Theor. Comput. Sci. 940 (Part) (2023)
Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh
Parameterized algorithms for finding highly connected solution. Theor. Comput. Sci. 942 (2023)
Aritra Banik, Rajiv Raman, Saurabh Ray
On the geometric priority set cover problem. Comput. Geom. 112 (2023)
Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman
Dominator Coloring Parameterized by Cluster Vertex Deletion Number. CoRR (2022)
Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman
Structural Parameterizations of Budgeted Graph Coloring. WALCOM (2022)
Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore, Leonardo Martínez-Sandoval
Geometric systems of unbiased representatives. Inf. Process. Lett. 176 (2022)
Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh
Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets. MFCS (2022)
Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh
Parameterized Algorithms for Finding Highly Connected Solution. CSR (2022)
Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh
Parameterized Complexity of Graph Partitioning into Connected Clusters. CoRR (2022)
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg
Geometric planar networks on bichromatic collinear points. Theor. Comput. Sci. 895 (2021)
Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman
Structural Parameterizations of Budgeted Graph Coloring. CoRR (2021)
Aritra Banik, Rajiv Raman, Saurabh Ray
On Geometric Priority Set Cover Problems. ISAAC (2021)
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore
On Fair Covering and Hitting Problems. WG (2021)
Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvattomananda
Voronoi game on polygons. Theor. Comput. Sci. 882 (2021)
Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
A Polynomial Sized Kernel for Tracking Paths Problem. Algorithmica 82 (1) (2020)
Aritra Banik, Pratibha Choudhary, Venkatesh Raman, Saket Saurabh
Fixed-parameter tractable algorithms for Tracking Shortest Paths. CoRR (2020)
Aritra Banik, Pratibha Choudhary, Venkatesh Raman, Saket Saurabh
Fixed-parameter tractable algorithms for Tracking Shortest Paths. Theor. Comput. Sci. 846 (2020)
Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore, Leonardo Martínez-Sandoval
Geometric Systems of Unbiased Representatives. CoRR (2020)
Aritra Banik, Arun Kumar Das, Sandip Das, Anil Maheshwari, Swami Sarvottamananda
Optimal Strategies in Single Round Voronoi Game on Convex Polygons with Constraints. COCOA (2020)
Harel Yedidsion, Stav Ashur, Aritra Banik, Paz Carmi, Matthew J. Katz, Michael Segal
Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule. Algorithmica 82 (10) (2020)
Aritra Banik, Matthew J. Katz, Eli Packer, Marina Simakov
Tracking Paths. Discret. Appl. Math. 282 (2020)
Aritra Banik, Vibha Sahlot, Saket Saurabh
Approximation algorithms for geometric conflict free covering problems. Comput. Geom. 89 (2020)
Pranav Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman
List-coloring - Parameterizing from triviality. Theor. Comput. Sci. 821 (2020)
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg
Geometric Planar Networks on Bichromatic Points. CALDAM (2020)
Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh
Parameterized Complexity of Geometric Covering Problems Having Conflicts. Algorithmica 82 (1) (2020)
Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman
Fixed-Parameter Tractability of (n - k) List Coloring. Theory Comput. Syst. 64 (7) (2020)
Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg
Geometric Planar Networks on Bichromatic Points. CoRR (2019)
Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Sreeja Das
The 1-dimensional discrete Voronoi game. Oper. Res. Lett. 47 (2) (2019)
Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid
The discrete Voronoi game in a simple polygon. Theor. Comput. Sci. 793 (2019)
Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman
Fixed-Parameter Tractability of (n-k) List Coloring. IWOCA (2019)
Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore, Leonardo Martínez-Sandoval
Geometric Systems of Unbiased Representatives. CCCG (2019)
Aritra Banik, Pratibha Choudhary, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh
A Polynomial Sized Kernel for Tracking Paths Problem. LATIN (2018)
Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
Fréchet Distance Between a Line and Avatar Point Set. Algorithmica 80 (9) (2018)
Pranav Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman
Some (in)tractable Parameterizations of Coloring and List-Coloring. FAW (2018)
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov
Selecting and covering colored points. Discret. Appl. Math. 250 (2018)
Aritra Banik, Pratibha Choudhary
Fixed-Parameter Tractable Algorithms for Tracking Set Problems. CALDAM (2018)
Aritra Banik, Matthew J. Katz, Eli Packer, Marina Simakov
Tracking Paths. CIAC (2017)
Sayan Bandyapadhyay, Aritra Banik
Polynomial Time Algorithms for Bichromatic Problems. CALDAM (2017)
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Su Jia, Matthew J. Katz, Tyler Mayer, Joseph S. B. Mitchell
Network Optimization on Partitioned Pairs of Points. CoRR (2017)
Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh
Parameterized Complexity of Geometric Covering Problems Having Conflicts. WADS (2017)
Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Satyaki Mukherjee
. Comput. Geom. 63 (2017)
Harel Yedidsion, Aritra Banik, Paz Carmi, Matthew J. Katz, Michael Segal
Efficient data retrieval in faulty sensor networks using a mobile mule. WiOpt (2017)
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Su Jia, Matthew J. Katz, Tyler Mayer, Joseph S. B. Mitchell
Network Optimization on Partitioned Pairs of Points. ISAAC (2017)
Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song
The $p$-Center Problem in Tree Networks Revisited. CoRR (2016)
Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
Fréchet Distance Between a Line and Avatar Point Set. FSTTCS (2016)
Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song
The p-Center Problem in Tree Networks Revisited. SWAT (2016)
Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid
Discrete Voronoi games and ϵ-nets, in two and three dimensions. Comput. Geom. 55 (2016)
Sayan Bandyapadhyay, Aritra Banik
Polynomial Time Algorithms for Bichromatic Problems. CoRR (2016)
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov
Conflict-free Covering. CCCG (2015)
Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar
Voronoi game on graphs. Theor. Comput. Sci. 562 (2015)
Aritra Banik, Matthew J. Katz, Marina Simakov
Bottleneck Segment Matching. CCCG (2015)
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov
Choice Is Hard. ISAAC (2015)
Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid
Discrete Voronoi Games and ε-Nets, in Two and Three Dimensions. CoRR (2015)
Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid
Voronoi Games and Epsilon Nets. CCCG (2014)
Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das
Minimum enclosing circle of a set of fixed points and a mobile point. Comput. Geom. 47 (9) (2014)
Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar
Voronoi Game on Graphs. CoRR (2014)
Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar
Voronoi Game on Graphs. WALCOM (2013)
Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid
The Discrete Voronoi Game in a Simple Polygon. COCOON (2013)
Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Sreeja Das
Two-Round Discrete Voronoi Game along a Line. FAW-AAIM (2013)
Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Satyaki Mukherjee
in Presence of Existing Facilities. CCCG (2013)
Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das
Optimal strategies for the one-round discrete Voronoi game on a line. J. Comb. Optim. 26 (4) (2013)
Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das
Optimal Strategies for the One-Round Discrete Voronoi Game on a Line. COCOON (2011)
Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das
Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point. WALCOM (2011)
Debajyoti Mukhopadhyay, Aritra Banik, Sreemoyee Mukherjee, Jhilik Bhattacharya, Young-Chon Kim
A Domain Specific Ontology Based Semantic Web Search Engine CoRR (2011)
Debajyoti Mukhopadhyay, Aritra Banik, Sreemoyee Mukherjee
A Technique for Automatic Construction of Ontology from Existing Database to Facilitate Semantic Web. ICIT (2007)