Aritra Banik

Orcid: 0000-0002-7544-6125

According to our database1, Aritra Banik authored at least 47 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Conflict and Fairness in Resource Allocation.
CoRR, 2024

2023
On Colorful Vertex and Edge Cover Problems.
Algorithmica, December, 2023

On the geometric priority set cover problem.
Comput. Geom., June, 2023

Structural parameterizations of budgeted graph coloring.
Theor. Comput. Sci., 2023

Parameterized algorithms for finding highly connected solution.
Theor. Comput. Sci., 2023

Dominator Coloring and CD Coloring in Almost Cluster Graphs.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

2022
Geometric systems of unbiased representatives.
Inf. Process. Lett., 2022

Dominator Coloring Parameterized by Cluster Vertex Deletion Number.
CoRR, 2022

Parameterized Complexity of Graph Partitioning into Connected Clusters.
CoRR, 2022

Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021
Voronoi game on polygons.
Theor. Comput. Sci., 2021

Geometric planar networks on bichromatic collinear points.
Theor. Comput. Sci., 2021

On Fair Covering and Hitting Problems.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

On Geometric Priority Set Cover Problems.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020
Fixed-parameter tractable algorithms for Tracking Shortest Paths.
Theor. Comput. Sci., 2020

List-coloring - Parameterizing from triviality.
Theor. Comput. Sci., 2020

Fixed-Parameter Tractability of (n - k) List Coloring.
Theory Comput. Syst., 2020

Tracking Paths.
Discret. Appl. Math., 2020

Approximation algorithms for geometric conflict free covering problems.
Comput. Geom., 2020

Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule.
Algorithmica, 2020

Parameterized Complexity of Geometric Covering Problems Having Conflicts.
Algorithmica, 2020

A Polynomial Sized Kernel for Tracking Paths Problem.
Algorithmica, 2020

Optimal Strategies in Single Round Voronoi Game on Convex Polygons with Constraints.
Proceedings of the Combinatorial Optimization and Applications, 2020

Geometric Planar Networks on Bichromatic Points.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019
The discrete Voronoi game in a simple polygon.
Theor. Comput. Sci., 2019

The 1-dimensional discrete Voronoi game.
Oper. Res. Lett., 2019

2018
Selecting and covering colored points.
Discret. Appl. Math., 2018

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

Some (in)tractable Parameterizations of Coloring and List-Coloring.
Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

Fixed-Parameter Tractable Algorithms for Tracking Set Problems.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017
The discrete Voronoi game in R<sup>2</sup>.
Comput. Geom., 2017

Efficient data retrieval in faulty sensor networks using a mobile mule.
Proceedings of the 15th International Symposium on Modeling and Optimization in Mobile, 2017

Network Optimization on Partitioned Pairs of Points.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Polynomial Time Algorithms for Bichromatic Problems.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016
Discrete Voronoi games and ϵ-nets, in two and three dimensions.
Comput. Geom., 2016

The p-Center Problem in Tree Networks Revisited.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

2015
Voronoi game on graphs.
Theor. Comput. Sci., 2015

Choice Is Hard.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Bottleneck Segment Matching.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

Conflict-free Covering.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
Minimum enclosing circle of a set of fixed points and a mobile point.
Comput. Geom., 2014

Voronoi Games and Epsilon Nets.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Optimal strategies for the one-round discrete Voronoi game on a line.
J. Comb. Optim., 2013

One-Round Discrete Voronoi Game in ℝ<sup>2</sup> in Presence of Existing Facilities.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Two-Round Discrete Voronoi Game along a Line.
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
CoRR, 2011

2007
A Technique for Automatic Construction of Ontology from Existing Database to Facilitate Semantic Web.
Proceedings of the 10th International Conference on Information Technology, 2007


  Loading...