Michael Skotnica

collaborators

4 papers

cs.CC2022

VEST is W[2]-hard

Michael Skotnica

In this short note, we show that the problem of VEST is $W [2]$ -hard for parameter $k$ . This strengthens a result of Matoušek, who showed $W [1]$ -hardness of that problem. The conseq…

cs.DM2022

How Expressive Are Friendly School Partitions?

Josef Minařík, Shay Moran, Michael Skotnica

A natural procedure for assigning students to classes in the beginning of the school-year is to let each student write down a list of $d$ other students with whom she/he wants to b…

math.CO2019

Shellings and sheddings induced by collapses

Thomas Magnard, Michael Skotnica, Martin Tancer

We say that a pure simplicial complex $K$ of dimension $d$ satisfies the removal-collapsibility condition if $K$ is either empty or $K$ becomes collap…

cs.DM2019

No-three-in-line problem on a torus: periodicity

Michael Skotnica

Let $τ_{m, n}$ denote the maximal number of points on the discrete torus (discrete toric grid) of sizes $m \times n$ with no three collinear points. The value $τ_{m, n}$ is known for…