4 citations · 16 across the 17 of their papers we have counts for
6 papers · 1 filter
Clustering What Matters: Optimal Approximation for Clustering with Outliers
Akanksha Agrawal, Tanmay Inamdar, Saket Saurabh +1
Clustering with outliers is one of the most fundamental problems in Computer Science. Given a set of points and two integers and , the clustering with outliers aims…
(Re)packing Equal Disks into Rectangle
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar +2
The problem of packing of equal disks (or circles) into a rectangle is a fundamental geometric problem. (By a packing here we mean an arrangement of disks in a rectangle without ov…
On strong chains of sets and functions
Tanmay Inamdar
Shelah has shown that there are no chains of length increasing modulo finite in . We improve this result to sets. That is, we show that there are no chains of le…
Exact Exponential Algorithms for Clustering Problems
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar +2
In this paper we initiate a systematic study of exact algorithms for well-known clustering problems, namely -Median and -Means. In -Median, the input consists of a set …
A club guessing toolbox I
Tanmay Inamdar, Assaf Rinot
Club guessing principles were introduced by Shelah as a weakening of Jensen's diamond. Most spectacularly, they were used to prove Shelah's ZFC bound on the power of the first sing…
Was Ulam right? II: Small width and general ideals
Tanmay Inamdar, Assaf Rinot
We continue our study of Sierpinski-type colourings. In contrast to the prequel paper, we focus here on colourings for ideals stratified by their completeness degree. In particular…