1 citations · 1 across the 10 of their papers we have counts for
10 papers
From One Solution to Many: An Oracle-Based FPT Framework for Diverse Solutions under Generalized Diversity Measures
Pradeesha Ashok, Sobyasachi Chatterjee, Soumi Nandi +2
The problem of computing \emph{diverse} solutions has recently emerged as an important area of study, motivated by applications in fairness, robustness, and security. Instead of re…
Covering Points with Rectangular Boundaries
Madhumita Kundu, Daniel Lokshtanov, Soumi Nandi +2
Geometric covering problems ask for a small family of geometric objects whose union covers a given point set. We study the more restrictive \emph{boundary covering} variant, where…
About almost covering subsets of the hypercube
Arijit Ghosh, Chandrima Kayal, Soumi Nandi
Let be a field, and consider the hypercube in . Sziklai and Weiner (Journal of Combinatorial Theory, Series A 2022) showed that if a p…
A geometric proof of the infinite -theorem for hyperplane piercing
Sutanoya Chakraborty, Arijit Ghosh, Soumi Nandi
We provide a geometric proof of the -theorem for piercing compact connected sets by hyperplanes. Our argument uses only elementary properties of convex sets and…
Helly theorem for affine spaces without dimensions
Sutanoya Chakraborty, Arijit Ghosh, Soumi Nandi
We prove a no-dimensional Helly theorem for affine spaces and convex sets using the unboundedness framework of Aronov, Goodman, and Pollack (Computational Geometry, 2002). This gen…
Stabbing boxes with finitely many axis-parallel lines and flats
Sutanoya Chakraborty, Arijit Ghosh, Soumi Nandi
In this short note, we provide the necessary and sufficient condition for an infinite collection of axis-parallel boxes in to be pierceable by finitely many axis-p…
On higher multiplicity hyperplane and polynomial covers for symmetry preserving subsets of the hypercube
Arijit Ghosh, Chandrima Kayal, Soumi Nandi +1
Alon and Füredi (European J. Combin. 1993) gave a tight bound for the following hyperplane covering problem: find the minimum number of hyperplanes required to cover all points of…
Finite k-Transversals of Infinite Families of Fat Convex Sets
Sutanoya Chakraborty, Arijit Ghosh, Soumi Nandi
We prove an infinite -theorem for piercing fat compact convex sets in $\RR^d$ with -flats. Additionally, we develop a new framework through which infinite -theorem…
Colorful two-piercing theorem for boxes
Sourav Chakraborty, Arijit Ghosh, Soumi Nandi
We prove a colorful extension of a Helly-type theorem by Danzer and Grünbaum (Combinatorica, 1982) concerning two-piercing families of axis-parallel boxes in . We als…
Almost covering all the layers of hypercube with multiplicities
Arijit Ghosh, Chandrima Kayal, Soumi Nandi
Given a hypercube in and , the -th layer of denotes the set of a…