Perfect matchings in antipodally colored lattice of subsets. - Michal Debski (Discret. Math., 2012)

Sequences of large radius. - Michal Debski; Zbigniew Lonc (Eur. J. Comb., 2014)

On a topological relaxation of a conjecture of Erdős and Nešetřil. - Michal Debski (Eur. J. Comb., 2015)

Harmonious and achromatic colorings of fragmentable hypergraphs. - Michal Debski; Zbigniew Lonc; Pawel Rzazewski (Electron. Notes Discret. Math., 2015)

The strong chromatic index of sparse graphs. - Michal Debski; Jaroslaw Grytczuk; Malgorzata Sleszynska-Nowak (Inf. Process. Lett., 2015)

Grasshopper Avoidance of Patterns. - Michal Debski; Urszula Pastwa; Krzysztof Wesek (Electron. J. Comb., 2016)

Universal Cycle Packings and Coverings for k-Subsets of an n-Set. - Michal Debski; Zbigniew Lonc (Graphs Comb., 2016)

Web-Enabled Discovery and Launch. - Michal Debski; Jakub Janusz Koperwas (MoMM, 2017)

Sequences of radius k for complete bipartite graphs. - Michal Debski; Zbigniew Lonc; Pawel Rzazewski (Discret. Appl. Math., 2017)

Fractional strong chromatic index of bipartite graphs. - Michal Debski (Discret. Math., 2017)

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)

Graph coloring and Graham's greatest common divisor problem. - Bartlomiej Bosek; Michal Debski; Jaroslaw Grytczuk; Joanna Sokól; Malgorzata Sleszynska-Nowak; Wiktor Zelazny (Discret. Math., 2018)

Achromatic and Harmonious Colorings of Circulant Graphs. - Michal Debski; Zbigniew Lonc; Pawel Rzazewski (J. Graph Theory, 2018)

Strong chromatic index of unit distance graphs. - Michal Debski (J. Graph Theory, 2019)

Improved bounds for centered colorings. - Michal Debski; Stefan Felsner; Piotr Micek; Felix Schröder (SODA, 2020)

Bundling all shortest paths. - Michal Debski; Konstanty Junosza-Szaniawski; Zbigniew Lonc (Discret. Appl. Math., 2020)

Strong chromatic index of K1, t-free graphs. - Michal Debski; Konstanty Junosza-Szaniawski; Malgorzata Sleszynska-Nowak (Discret. Appl. Math., 2020)

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)

Strong Cliques in Claw-Free Graphs. - Michal Debski; Malgorzata Sleszynska-Nowak (Graphs Comb., 2021)

t-Strong Cliques and the Degree-Diameter Problem. - Michal Debski; Malgorzata Sleszynska-Nowak (SIAM J. Discret. Math., 2021)

Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws. - Michal Debski; Zbigniew Lonc; Karolina Okrasa; Marta Piecyk; Pawel Rzazewski (ISAAC, 2022)

Strong edge coloring of circle graphs. - Michal Debski; Malgorzata Sleszynska-Nowak (Eur. J. Comb., 2022)

Fractional meanings of nonrepetitiveness. - Joanna Chybowska-Sokól; Michal Debski; Jaroslaw Grytczuk; Konstanty Junosza-Szaniawski; Barbara Nayar; Urszula Pastwa; Krzysztof Wesek (J. Comb. Theory A, 2022)

Conflict-free chromatic number versus conflict-free chromatic index. - Michal Debski; Jakub Przybylo (J. Graph Theory, 2022)

Faster 3-Coloring of Small-Diameter Graphs. - Michal Debski; Marta Piecyk; Pawel Rzazewski (SIAM J. Discret. Math., 2022)

Extensions and reductions of squarefree words. - Michal Debski; Jaroslaw Grytczuk; Bartlomiej Pawlik (Discret. Math., 2024)

Edge colorings avoiding patterns. - Michal Debski (Eur. J. Comb., 2024)