Nonrepetitive colorings of graphs. - Sebastian Czerwinski; Jaroslaw Grytczuk (Electron. Notes Discret. Math., 2007)

Invisible runners in finite fields. - Sebastian Czerwinski; Jaroslaw Grytczuk (Inf. Process. Lett., 2008)

Lucky labelings of graphs. - Sebastian Czerwinski; Jaroslaw Grytczuk; Wiktor Zelazny (Inf. Process. Lett., 2009)

Random runners are very lonely. - Sebastian Czerwinski (J. Comb. Theory A, 2012)

Additive Coloring of Planar Graphs. - Tomasz Bartnicki; Bartlomiej Bosek; Sebastian Czerwinski; Jaroslaw Grytczuk; Grzegorz Matecki; Wiktor Zelazny (Graphs Comb., 2014)

The lonely runner problem for lacunary sequences. - Sebastian Czerwinski (Discret. Math., 2018)

Generalized arboricity of graphs with large girth. - Tomasz Bartnicki; Bartlomiej Bosek; Sebastian Czerwinski; Michal Farnik; Jaroslaw Grytczuk; Zofia Miechowicz (Discret. Math., 2019)

On harmonious coloring of hypergraphs. - Sebastian Czerwinski (Discret. Math. Theor. Comput. Sci., 2024)

Strong Arboricity of Graphs. - Tomasz Bartnicki; Sebastian Czerwinski; Jaroslaw Grytczuk; Zofia Miechowicz (Graphs Comb., 2025)