Counting Independent Sets in Claw-Free Graphs. - Konstanty Junosza-Szaniawski; Zbigniew Lonc; Michal Tuczynski (WG, 2011)

Counting Maximal Independent Sets in Subcubic Graphs. - Konstanty Junosza-Szaniawski; Michal Tuczynski (SOFSEM, 2012)

Counting independent sets via Divide Measure and Conquer method. - Konstanty Junosza-Szaniawski; Michal Tuczynski (CoRR, 2015)

On avoding r-repetitions in ℝ2. - Michal Debski; Jaroslaw Grytczuk; Urszula Pastwa; Barbara Pilat; Joanna Sokól; Michal Tuczynski; Przemyslaw Wenus; Krzysztof Wesek (Electron. Notes Discret. Math., 2017)

On the hydra number of disconnected graphs. - Angelika Nicgorska-Miskiewicz; Michal Tuczynski (Discret. Appl. Math., 2019)

On cordial labeling of hypertrees. - Michal Tuczynski; Przemyslaw Wenus; Krzysztof Wesek (Discret. Math. Theor. Comput. Sci., 2019)

Avoiding Multiple Repetitions in Euclidean Spaces. - Michal Debski; Jaroslaw Grytczuk; Barbara Nayar; Urszula Pastwa; Joanna Sokól; Michal Tuczynski; Przemyslaw Wenus; Krzysztof Wesek (SIAM J. Discret. Math., 2020)

Alon-Tarsi for hypergraphs. - Marcin Anholcer; Bartlomiej Bosek; Grzegorz Gutowski; Michal Lason; Jakub Przybylo; Oriol Serra; Michal Tuczynski; Lluís Vena; Mariusz Zajac (CoRR, 2025)