Aritra Banik

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