On Fair Covering and Hitting Problems.

von Bandyapadhyay, Sayan
Veröffentlicht in WG (47. : 2021 : Online) Graph-Theoretic Concepts in Computer Science (2021)

Optimal strategies for the one-round discrete Voronoi game on a line

von Banik, Aritra
Veröffentlicht in Journal of combinatorial optimization (2013)

Geometric Planar Networks on Bichromatic Points

von Bandyapadhyay, Sayan
Veröffentlicht in CALDAM (6. : 2020 : Hyderabad, Telangana) Algorithms and discrete applied mathematics (2020)

Parameterized Algorithms for Finding Highly Connected Solution

von Abhinav, Ankit
Veröffentlicht in International Computer Science Symposium (17. : 2022 : Online) Computer science - theory and applications (2022)

Structural Parameterizations of Budgeted Graph Coloring

von Bandopadhyay, Susobhan
Veröffentlicht in WALCOM (16. : 2022 : Jember) WALCOM: Algorithms and Computation (2022)

The 1-dimensional discrete Voronoi game

von Banik, Aritra
Veröffentlicht in Operations research letters (2019)

Optimal Strategies in Single Round Voronoi Game on Convex Polygons with Constraints

von Banik, Aritra
Veröffentlicht in COCOA (14. : 2020 : Online) Combinatorial optimization and applications (2020)