Zobrazeno 1 - 10
of 6 776
pro vyhledávání: '"Inamdar, A."'
Autor:
Inamdar, Tanmay, Rinot, Assaf
It is proved that if there is an $\aleph_2$-Aronszajn line, then there is one that does not contain an $\aleph_2$-Countryman line. This solves a problem of Moore and stands in a sharp contrast with his Basis Theorem for linear orders of size $\aleph_
Externí odkaz:
http://arxiv.org/abs/2410.08757
We propose a novel clustering model encompassing two well-known clustering models: k-center clustering and k-median clustering. In the Hybrid k-Clusetring problem, given a set P of points in R^d, an integer k, and a non-negative real r, our objective
Externí odkaz:
http://arxiv.org/abs/2407.08295
Autor:
Mondal, Devam, Inamdar, Atharva
RNA sequencing techniques, like bulk RNA-seq and Single Cell (sc) RNA-seq, are critical tools for the biologist looking to analyze the genetic activity/transcriptome of a tissue or cell during an experimental procedure. Platforms like Illumina's next
Externí odkaz:
http://arxiv.org/abs/2407.03381
Autor:
Banik, Aritra, Fomin, Fedor V., Golovach, Petr A., Inamdar, Tanmay, Jana, Satyabrata, Saurabh, Saket
{\sc Vertex $(s, t)$-Cut} and {\sc Vertex Multiway Cut} are two fundamental graph separation problems in algorithmic graph theory. We study matroidal generalizations of these problems, where in addition to the usual input, we are given a representati
Externí odkaz:
http://arxiv.org/abs/2406.19134
Autor:
Inamdar, Tanmay
We prove that for every colouring of pairs of reals with finitely-many colours, there is a set homeomorphic to the rationals which takes no more than two colours. This was conjectured by Galvin in 1970, and a colouring of Sierpi{\'n}ski from 1933 wit
Externí odkaz:
http://arxiv.org/abs/2405.18431
Autor:
Gupta, Sushmita, Inamdar, Tanmay, Jain, Pallavi, Lokshtanov, Daniel, Panolan, Fahad, Saurabh, Saket
Classical work on metric space based committee selection problem interprets distance as ``near is better''. In this work, motivated by real-life situations, we interpret distance as ``far is better''. Formally stated, we initiate the study of ``obnox
Externí odkaz:
http://arxiv.org/abs/2405.15372
Autor:
Inamdar, Tanmay, Jain, Pallavi, Lokshtanov, Daniel, Sahu, Abhishek, Saurabh, Saket, Upasana, Anannya
In MaxSAT with Cardinality Constraint problem (CC-MaxSAT), we are given a CNF-formula $\Phi$, and $k \ge 0$, and the goal is to find an assignment $\beta$ with at most $k$ variables set to true (also called a weight $k$-assignment) such that the numb
Externí odkaz:
http://arxiv.org/abs/2403.07328
In liquid democracy, agents can either vote directly or delegate their vote to a different agent of their choice. This results in a power structure in which certain agents possess more voting weight than others. As a result, it opens up certain possi
Externí odkaz:
http://arxiv.org/abs/2403.07558
For numerous graph problems in the realm of parameterized algorithms, using the size of a smallest deletion set (called a modulator) into well-understood graph families as parameterization has led to a long and successful line of research. Recently,
Externí odkaz:
http://arxiv.org/abs/2310.03469
The property of countable metacompactness of a topological space gets its importance from Dowker's 1951 theorem that the product of a normal space X with the unit interval is again normal iff X is countably metacompact. In a recent paper, Leiderman a
Externí odkaz:
http://arxiv.org/abs/2309.13367