default search action
Aritra Banik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c33]Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh:
Cuts in Graphs with Matroid Constraints. ESA 2024: 17:1-17:15 - [c32]Susobhan Bandopadhyay, Aritra Banik, Diptapriyo Majumdar, Abhishek Sahu:
Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints. MFCS 2024: 16:1-16:18 - [i16]Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta, Pallavi Jain, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale:
Conflict and Fairness in Resource Allocation. CoRR abs/2403.04265 (2024) - [i15]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 abs/2404.15487 (2024) - [i14]Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana
, Saket Saurabh:
Cuts in Graphs with Matroid Constraints. CoRR abs/2406.19134 (2024) - 2023
- [j24]Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore:
On Colorful Vertex and Edge Cover Problems. Algorithmica 85(12): 3816-3827 (2023) - [j23]Aritra Banik
On the geometric priority set cover problem. Comput. Geom. 112: 101984 (2023) - [j22]Susobhan Bandopadhyay
Structural parameterizations of budgeted graph coloring. Theor. Comput. Sci. 940(Part): 209-221 (2023) - [j21]Ankit Abhinav
Parameterized algorithms for finding highly connected solution. Theor. Comput. Sci. 942: 47-56 (2023) - [c31]Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman:
Dominator Coloring and CD Coloring in Almost Cluster Graphs. WADS 2023: 106-119 - [i13]Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore:
On Colorful Vertex and Edge Cover Problems. CoRR abs/2308.15842 (2023) - 2022
- [j20]Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore, Leonardo Martínez-Sandoval
Geometric systems of unbiased representatives. Inf. Process. Lett. 176: 106232 (2022) - [c30]Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh:
Parameterized Algorithms for Finding Highly Connected Solution. CSR 2022: 1-16 - [c29]Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi
Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets. MFCS 2022: 6:1-6:15 - [c28]Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman:
Structural Parameterizations of Budgeted Graph Coloring. WALCOM 2022: 340-351 - [i12]Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh:
Parameterized Complexity of Graph Partitioning into Connected Clusters. CoRR abs/2202.12042 (2022) - [i11]Aritra Banik, Prahlad Narasimhan Kasthurirangan
Dominator Coloring Parameterized by Cluster Vertex Deletion Number. CoRR abs/2210.17321 (2022) - 2021
- [j19]Aritra Banik, Arun Kumar Das
Voronoi game on polygons. Theor. Comput. Sci. 882: 125-142 (2021) - [j18]Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore
Geometric planar networks on bichromatic collinear points. Theor. Comput. Sci. 895: 124-136 (2021) - [c27]Aritra Banik, Rajiv Raman, Saurabh Ray:
On Geometric Priority Set Cover Problems. ISAAC 2021: 12:1-12:14 - [c26]Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore:
On Fair Covering and Hitting Problems. WG 2021: 39-51 - [i10]Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman:
Structural Parameterizations of Budgeted Graph Coloring. CoRR abs/2110.14498 (2021) - 2020
- [j17]Aritra Banik, Fahad Panolan
Parameterized Complexity of Geometric Covering Problems Having Conflicts. Algorithmica 82(1): 1-19 (2020) - [j16]Aritra Banik, Pratibha Choudhary
A Polynomial Sized Kernel for Tracking Paths Problem. Algorithmica 82(1): 41-63 (2020) - [j15]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): 2784-2808 (2020) - [j14]Aritra Banik, Vibha Sahlot
Approximation algorithms for geometric conflict free covering problems. Comput. Geom. 89: 101591 (2020) - [j13]Aritra Banik, Matthew J. Katz, Eli Packer, Marina Simakov:
Tracking Paths. Discret. Appl. Math. 282: 22-34 (2020) - [j12]Aritra Banik, Ashwin Jacob
Fixed-Parameter Tractability of (n - k) List Coloring. Theory Comput. Syst. 64(7): 1307-1316 (2020) - [j11]Pranav Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman:
List-coloring - Parameterizing from triviality. Theor. Comput. Sci. 821: 102-110 (2020) - [j10]Aritra Banik, Pratibha Choudhary
Fixed-parameter tractable algorithms for Tracking Shortest Paths. Theor. Comput. Sci. 846: 1-13 (2020) - [c25]Sayan Bandyapadhyay
Geometric Planar Networks on Bichromatic Points. CALDAM 2020: 79-91 - [c24]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: 515-529 - [i9]Aritra Banik, Pratibha Choudhary, Venkatesh Raman, Saket Saurabh:
Fixed-parameter tractable algorithms for Tracking Shortest Paths. CoRR abs/2001.08977 (2020) - [i8]Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore, Leonardo Martínez-Sandoval:
Geometric Systems of Unbiased Representatives. CoRR abs/2002.05488 (2020)
2010 – 2019
- 2019
- [j9]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Sreeja Das:
The 1-dimensional discrete Voronoi game. Oper. Res. Lett. 47(2): 115-121 (2019) - [j8]Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid:
The discrete Voronoi game in a simple polygon. Theor. Comput. Sci. 793: 28-35 (2019) - [c23]Aritra Banik, Bhaswar B. Bhattacharya, Sujoy Bhore, Leonardo Martínez-Sandoval:
Geometric Systems of Unbiased Representatives. CCCG 2019: 38-43 - [c22]Aritra Banik, Ashwin Jacob
Fixed-Parameter Tractability of (n-k) List Coloring. IWOCA 2019: 61-69 - [i7]Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore, Martin Nöllenburg:
Geometric Planar Networks on Bichromatic Points. CoRR abs/1911.08924 (2019) - 2018
- [j7]Aritra Banik, Fahad Panolan
Fréchet Distance Between a Line and Avatar Point Set. Algorithmica 80(9): 2616-2636 (2018) - [j6]Esther M. Arkin, Aritra Banik
Selecting and covering colored points. Discret. Appl. Math. 250: 75-86 (2018) - [c21]Aritra Banik, Pratibha Choudhary:
Fixed-Parameter Tractable Algorithms for Tracking Set Problems. CALDAM 2018: 93-104 - [c20]Pranav Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman:
Some (in)tractable Parameterizations of Coloring and List-Coloring. FAW 2018: 126-139 - [c19]Aritra Banik
A Polynomial Sized Kernel for Tracking Paths Problem. LATIN 2018: 94-107 - 2017
- [j5]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Satyaki Mukherjee:
The discrete Voronoi game in R2. Comput. Geom. 63: 53-62 (2017) - [c18]Sayan Bandyapadhyay, Aritra Banik:
Polynomial Time Algorithms for Bichromatic Problems. CALDAM 2017: 12-23 - [c17]Aritra Banik, Matthew J. Katz, Eli Packer, Marina Simakov:
Tracking Paths. CIAC 2017: 67-79 - [c16]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: 6:1-6:12 - [c15]Aritra Banik, Fahad Panolan
Parameterized Complexity of Geometric Covering Problems Having Conflicts. WADS 2017: 61-72 - [c14]Harel Yedidsion, Aritra Banik, Paz Carmi, Matthew J. Katz, Michael Segal
Efficient data retrieval in faulty sensor networks using a mobile mule. WiOpt 2017: 1-8 - [i6]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 abs/1710.00876 (2017) - 2016
- [j4]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: 41-58 (2016) - [c13]Aritra Banik, Fahad Panolan
Fréchet Distance Between a Line and Avatar Point Set. FSTTCS 2016: 32:1-32:14 - [c12]Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song:
The p-Center Problem in Tree Networks Revisited. SWAT 2016: 6:1-6:15 - [i5]Aritra Banik, Binay K. Bhattacharya, Sandip Das, Tsunehiko Kameda, Zhao Song:
The $p$-Center Problem in Tree Networks Revisited. CoRR abs/1604.07535 (2016) - [i4]Sayan Bandyapadhyay, Aritra Banik:
Polynomial Time Algorithms for Bichromatic Problems. CoRR abs/1610.00300 (2016) - 2015
- [j3]Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar
Voronoi game on graphs. Theor. Comput. Sci. 562: 270-282 (2015) - [c11]Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov:
Conflict-free Covering. CCCG 2015 - [c10]Aritra Banik, Matthew J. Katz, Marina Simakov:
Bottleneck Segment Matching. CCCG 2015 - [c9]Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov:
Choice Is Hard. ISAAC 2015: 318-328 - [i3]Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid:
Discrete Voronoi Games and ε-Nets, in Two and Three Dimensions. CoRR abs/1501.04843 (2015) - 2014
- [j2]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das:
Minimum enclosing circle of a set of fixed points and a mobile point. Comput. Geom. 47(9): 891-898 (2014) - [c8]Aritra Banik, Jean-Lou De Carufel, Anil Maheshwari, Michiel H. M. Smid:
Voronoi Games and Epsilon Nets. CCCG 2014 - [i2]Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar:
Voronoi Game on Graphs. CoRR abs/1407.8474 (2014) - 2013
- [j1]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das:
Optimal strategies for the one-round discrete Voronoi game on a line. J. Comb. Optim. 26(4): 655-669 (2013) - [c7]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Sreeja Das:
Two-Round Discrete Voronoi Game along a Line. FAW-AAIM 2013: 210-220 - [c6]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das, Satyaki Mukherjee:
One-Round Discrete Voronoi Game in ℝ2 in Presence of Existing Facilities. CCCG 2013 - [c5]Aritra Banik, Sandip Das, Anil Maheshwari, Michiel H. M. Smid:
The Discrete Voronoi Game in a Simple Polygon. COCOON 2013: 197-207 - [c4]Sayan Bandyapadhyay, Aritra Banik, Sandip Das, Hirak Sarkar:
Voronoi Game on Graphs. WALCOM 2013: 77-88 - 2011
- [c3]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das:
Optimal Strategies for the One-Round Discrete Voronoi Game on a Line. COCOON 2011: 213-224 - [c2]Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das:
Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point. WALCOM 2011: 98-109 - [i1]Debajyoti Mukhopadhyay, Aritra Banik, Sreemoyee Mukherjee, Jhilik Bhattacharya, Young-Chon Kim:
A Domain Specific Ontology Based Semantic Web Search Engine. CoRR abs/1102.0695 (2011)
2000 – 2009
- 2007
- [c1]Debajyoti Mukhopadhyay, Aritra Banik, Sreemoyee Mukherjee:
A Technique for Automatic Construction of Ontology from Existing Database to Facilitate Semantic Web. ICIT 2007: 246-251
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: