The following pages link to Aritra Banik (Q386422):
Displaying 49 items.
- Optimal strategies for the one-round discrete Voronoi game on a line (Q386423) (← links)
- Minimum enclosing circle of a set of fixed points and a mobile point (Q396467) (← links)
- Voronoi game on graphs (Q476871) (← links)
- Discrete Voronoi games and \(\epsilon\)-nets, in two and three dimensions (Q679740) (← links)
- Fréchet distance between a line and avatar point set (Q722543) (← links)
- Some (in)tractable parameterizations of coloring and list-coloring (Q777282) (← links)
- Geometric planar networks on bichromatic points (Q779176) (← links)
- The discrete Voronoi game in \(\mathbb{R}^2\) (Q1616243) (← links)
- Selecting and covering colored points (Q1801049) (← links)
- Sensor network topology design and analysis for efficient data gathering by a mobile mule (Q2006940) (← links)
- Voronoi game on polygons (Q2044961) (← links)
- Geometric systems of unbiased representatives (Q2122784) (← links)
- List-coloring -- parameterizing from triviality (Q2173305) (← links)
- Tracking paths (Q2185723) (← links)
- Approximation algorithms for geometric conflict free covering problems (Q2206716) (← links)
- Fixed-parameter tractable algorithms for tracking shortest paths (Q2210499) (← links)
- The 1-dimensional discrete Voronoi game (Q2294280) (← links)
- The discrete Voronoi game in a simple polygon (Q2326396) (← links)
- Fixed-parameter tractable algorithms for tracking set problems (Q2636554) (← links)
- Geometric planar networks on bichromatic collinear points (Q2664940) (← links)
- On fair covering and hitting problems (Q2672421) (← links)
- Optimal strategies in single round Voronoi game on convex polygons with constraints (Q2692236) (← links)
- Polynomial Time Algorithms for Bichromatic Problems (Q2971630) (← links)
- Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point (Q3078388) (← links)
- Optimal Strategies for the One-Round Discrete Voronoi Game on a Line (Q3087952) (← links)
- Choice Is Hard (Q3459872) (← links)
- Fréchet Distance Between a Line and Avatar Point Set (Q4636580) (← links)
- Voronoi Game on Graphs (Q4914437) (← links)
- The Discrete Voronoi Game in a Simple Polygon (Q4925237) (← links)
- (Q5136221) (← links)
- Tracking Paths (Q5283356) (← links)
- The $p$-Center Problem in Tree Networks Revisited (Q5369508) (← links)
- Two-Round Discrete Voronoi Game along a Line (Q5405931) (← links)
- Fixed-parameter tractability of \((n-k)\) list coloring (Q5918286) (← links)
- Parameterized algorithms for finding highly connected solution (Q5918560) (← links)
- Structural parameterizations of budgeted graph coloring (Q5918737) (← links)
- Parameterized complexity of geometric covering problems having conflicts (Q5919304) (← links)
- A polynomial sized kernel for tracking paths problem (Q5919306) (← links)
- Fixed-parameter tractability of \((n-k)\) list coloring (Q5919471) (← links)
- Parameterized complexity of geometric covering problems having conflicts (Q5920095) (← links)
- Structural parameterizations of budgeted graph coloring (Q5925707) (← links)
- Parameterized algorithms for finding highly connected solution (Q5970787) (← links)
- A polynomial sized kernel for tracking paths problem (Q5970989) (← links)
- On colorful vertex and edge cover problems (Q6088300) (← links)
- On the geometric priority set cover problem (Q6103173) (← links)
- (Q6187793) (← links)
- Parameterized complexity of non-separating and non-disconnecting paths and sets (Q6583997) (← links)
- Cuts in Graphs with Matroid Constraints (Q6734242) (← links)
- Multivariate Exploration of Metric Dilation (Q6761566) (← links)
