Aritra Banik

From MaRDI portal
Person:386422

Available identifiers

zbMath Open banik.aritraMaRDI QIDQ386422

List of research outcomes





PublicationDate of PublicationType
Parameterized complexity of non-separating and non-disconnecting paths and sets2024-08-06Paper
Dominator coloring and CD coloring in almost cluster graphs2024-01-16Paper
https://portal.mardi4nfdi.de/entity/Q61877932024-01-15Paper
On colorful vertex and edge cover problems2023-12-13Paper
On the geometric priority set cover problem2023-06-26Paper
Structural parameterizations of budgeted graph coloring2023-04-20Paper
Optimal strategies in single round Voronoi game on convex polygons with constraints2023-03-21Paper
Parameterized algorithms for finding highly connected solution2022-12-21Paper
Parameterized algorithms for finding highly connected solution2022-11-11Paper
Structural parameterizations of budgeted graph coloring2022-07-13Paper
On fair covering and hitting problems2022-06-08Paper
Geometric systems of unbiased representatives2022-04-07Paper
Geometric planar networks on bichromatic collinear points2021-11-18Paper
Voronoi game on polygons2021-08-11Paper
Fixed-parameter tractability of \((n-k)\) list coloring2021-06-11Paper
https://portal.mardi4nfdi.de/entity/Q51362212020-11-25Paper
Fixed-parameter tractable algorithms for tracking shortest paths2020-11-06Paper
Approximation algorithms for geometric conflict free covering problems2020-10-23Paper
Sensor network topology design and analysis for efficient data gathering by a mobile mule2020-10-12Paper
Geometric planar networks on bichromatic points2020-07-21Paper
Some (in)tractable parameterizations of coloring and list-coloring2020-07-07Paper
Tracking paths2020-06-05Paper
List-coloring -- parameterizing from triviality2020-04-22Paper
Fixed-parameter tractability of \((n-k)\) list coloring2020-02-25Paper
A polynomial sized kernel for tracking paths problem2020-02-12Paper
The 1-dimensional discrete Voronoi game2020-02-10Paper
A polynomial sized kernel for tracking paths problem2020-01-16Paper
Parameterized complexity of geometric covering problems having conflicts2020-01-16Paper
The discrete Voronoi game in a simple polygon2019-10-07Paper
The discrete Voronoi game in \(\mathbb{R}^2\)2018-11-01Paper
Selecting and covering colored points2018-10-26Paper
Fréchet distance between a line and avatar point set2018-07-26Paper
Fixed-parameter tractable algorithms for tracking set problems2018-06-05Paper
Fréchet Distance Between a Line and Avatar Point Set2018-04-19Paper
Discrete Voronoi games and \(\epsilon\)-nets, in two and three dimensions2018-01-19Paper
The $p$-Center Problem in Tree Networks Revisited2017-10-17Paper
Parameterized complexity of geometric covering problems having conflicts2017-09-22Paper
Tracking Paths2017-07-21Paper
Polynomial Time Algorithms for Bichromatic Problems2017-04-07Paper
Choice Is Hard2016-01-11Paper
Voronoi game on graphs2014-12-02Paper
Minimum enclosing circle of a set of fixed points and a mobile point2014-08-13Paper
Two-Round Discrete Voronoi Game along a Line2014-04-03Paper
Optimal strategies for the one-round discrete Voronoi game on a line2013-12-09Paper
An Existential Proof of the Conjecture on Packing Anchored Rectangles2013-10-31Paper
The Discrete Voronoi Game in a Simple Polygon2013-06-11Paper
Voronoi Game on Graphs2013-04-12Paper
Optimal strategies for the one-round discrete Voronoi game on a line2011-08-17Paper
Minimum enclosing circle of a set of fixed points and a mobile point2011-02-20Paper

Research outcomes over time

This page was built for person: Aritra Banik