Intertwined Infinite Binary Words. - Jaroslaw Grytczuk (Discret. Appl. Math., 1996)

Infinite self-similar words. - Jaroslaw Grytczuk (Discret. Math., 1996)

Pattern avoiding colorings of Euclidean spaces. - Jaroslaw Grytczuk (Ars Comb., 2002)

Thue-like Sequences and Rainbow Arithmetic Progressions. - Jaroslaw Grytczuk (Electron. J. Comb., 2002)

Nonrepetitive colorings of graphs. - Noga Alon; Jaroslaw Grytczuk; Mariusz Haluszczak; Oliver Riordan (Random Struct. Algorithms, 2002)

Schütte's Tournament Problem and Intersecting Families of Sets. - Mieczyslaw Borowiecki; Jaroslaw Grytczuk; Mariusz Haluszczak; Zsolt Tuza (Comb. Probab. Comput., 2003)

Non-repetitive colorings of infinite sets. - Jaroslaw Grytczuk; Wieslaw Sliwa (Discret. Math., 2003)

Minimal Partitions Of A Box Into Boxes. - Jaroslaw Grytczuk; Andrzej P. Kisielewicz; Krzysztof Przeslawski (Comb., 2004)

On-line Ramsey Theory. - Jaroslaw Grytczuk; Mariusz Haluszczak; Henry A. Kierstead (Electron. J. Comb., 2004)

Another variation on Conway's recursive sequence. - Jaroslaw Grytczuk (Discret. Math., 2004)

Nonrepetitive colorings of graphs. - Noga Alon; Jaroslaw Grytczuk (Electron. Notes Discret. Math., 2005)

Nonrepetitive colorings of trees. - Bostjan Bresar; Jaroslaw Grytczuk; Sandi Klavzar; Staszek Niwczyk; Iztok Peterin (Discret. Math., 2007)

Pattern avoidance on graphs. - Jaroslaw Grytczuk (Discret. Math., 2007)

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

Nonrepetitive Colorings of Graphs - A Survey. - Jaroslaw Grytczuk (Int. J. Math. Math. Sci., 2007)

The Map-Coloring Game. - Tomasz Bartnicki; Jaroslaw Grytczuk; Hal A. Kierstead; Xuding Zhu (Am. Math. Mon., 2007)

Game Chromatic Number of Cartesian Product Graphs. - Tomasz Bartnicki; Bostjan Bresar; Jaroslaw Grytczuk; Matjaz Kovse; Zofia Miechowicz; Iztok Peterin (Electron. J. Comb., 2008)

Breaking the rhythm on graphs. - Noga Alon; Jaroslaw Grytczuk (Discret. Math., 2008)

The game of arboricity. - Tomasz Bartnicki; Jaroslaw Grytczuk; Hal A. Kierstead (Discret. Math., 2008)

Thue type problems for graphs, points, and numbers. - Jaroslaw Grytczuk (Discret. Math., 2008)

On-line Ramsey Numbers for Paths and Stars. - Jaroslaw Grytczuk; Hal A. Kierstead; Pawel Pralat (Discret. Math. Theor. Comput. Sci., 2008)

A Note on the Game Chromatic Index of Graphs. - Tomasz Bartnicki; Jaroslaw Grytczuk (Graphs Comb., 2008)

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)

Weight choosability of graphs. - Tomasz Bartnicki; Jaroslaw Grytczuk; Stanislaw Niwczyk (J. Graph Theory, 2009)

Nonrepetitive Sequences on Arithmetic Progressions. - Jaroslaw Grytczuk; Jakub Kozik; Marcin Witkowski (Electron. J. Comb., 2011)

Nonrepetitive games - Jaroslaw Grytczuk; Jakub Kozik; Piotr Micek (CoRR, 2011)

Nonrepetitive list colourings of paths. - Jaroslaw Grytczuk; Jakub Przybylo; Xuding Zhu (Random Struct. Algorithms, 2011)

Preface. - Jaroslaw Grytczuk; Zbigniew Lonc (Discret. Math., 2012)

Coloring chip configurations on graphs and digraphs. - Mieczyslaw Borowiecki; Jaroslaw Grytczuk; Monika Pilsniak (Inf. Process. Lett., 2012)

Online version of the theorem of Thue. - Jaroslaw Grytczuk; Piotr Szafruga; Michal Zmarz (Inf. Process. Lett., 2013)

New approach to nonrepetitive sequences. - Jaroslaw Grytczuk; Jakub Kozik; Piotr Micek (Random Struct. Algorithms, 2013)

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

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

Splitting Multidimensional Necklaces and Measurable Colorings of Euclidean Spaces. - Jaroslaw Grytczuk; Wojciech Lubawski (SIAM J. Discret. Math., 2015)

How to play Thue games. - Jaroslaw Grytczuk; Karol Kosinski; Michal Zmarz (Theor. Comput. Sci., 2015)

Fractional and j-Fold Coloring of the Plane. - Jaroslaw Grytczuk; Konstanty Junosza-Szaniawski; Joanna Sokól; Krzysztof Wesek (Discret. Comput. Geom., 2016)

Nonrepetitive colorings of line arrangements. - Jaroslaw Grytczuk; Karol Kosinski; Michal Zmarz (Eur. J. Comb., 2016)

Majority Choosability of Digraphs. - Marcin Anholcer; Bartlomiej Bosek; Jaroslaw Grytczuk (Electron. J. Comb., 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)

Centroidal Localization Game. - Bartlomiej Bosek; Przemyslaw Gordinowicz; Jaroslaw Grytczuk; Nicolas Nisse; Joanna Sokól; Malgorzata Sleszynska-Nowak (Electron. J. Comb., 2018)

Localization game on geometric and planar graphs. - Bartlomiej Bosek; Przemyslaw Gordinowicz; Jaroslaw Grytczuk; Nicolas Nisse; Joanna Sokól; Malgorzata Sleszynska-Nowak (Discret. Appl. Math., 2018)

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)

Weight choosability of oriented hypergraphs. - Marcin Anholcer; Bartlomiej Bosek; Jaroslaw Grytczuk (Ars Math. Contemp., 2019)

Majority coloring game. - Bartlomiej Bosek; Jaroslaw Grytczuk; Gabriel Jakóbczak (Discret. Appl. Math., 2019)

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

Local Dimension is Unbounded for Planar Posets. - Bartlomiej Bosek; Jaroslaw Grytczuk; William T. Trotter (Electron. J. Comb., 2020)

Extremal Square-Free Words. - Jaroslaw Grytczuk; Hubert Kordulewski; Artur Niewiadomski 002 (Electron. J. Comb., 2020)

The Alon-Tarsi number of a planar graph minus a matching. - Jaroslaw Grytczuk; Xuding Zhu (J. Comb. Theory B, 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)

Variations on Twins in Permutations. - Andrzej Dudek; Jaroslaw Grytczuk; Andrzej Rucinski 001 (Electron. J. Comb., 2021)

Hat chromatic number of graphs. - Bartlomiej Bosek; Andrzej Dudek; Michal Farnik; Jaroslaw Grytczuk; Przemyslaw Mazur (Discret. Math., 2021)

From the 1-2-3 conjecture to the Riemann hypothesis. - Jaroslaw Grytczuk (Eur. J. Comb., 2021)

Patterns in Ordered (random) Matchings. - Andrzej Dudek; Jaroslaw Grytczuk; Andrzej Rucinski 001 (LATIN, 2022)

Graph polynomials and paintability of plane graphs. - Jaroslaw Grytczuk; Stanislav Jendrol'; Mariusz Zajac (Discret. Appl. Math., 2022)

Graph polynomials and group coloring of graphs. - Bartlomiej Bosek; Jaroslaw Grytczuk; Grzegorz Gutowski; Oriol Serra; Mariusz Zajac (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)

More Variations on Shuffle Squares. - Jaroslaw Grytczuk; Bartlomiej Pawlik; Mariusz Pleszczynski (Symmetry, 2023)

New bounds on the maximum number of neighborly boxes in Rd. - Noga Alon; Jaroslaw Grytczuk; Andrzej P. Kisielewicz; Krzysztof Przeslawski (Eur. J. Comb., 2023)

Ordered Unavoidable Sub-Structures in Matchings and Random Matchings. - Andrzej Dudek; Jaroslaw Grytczuk; Andrzej Rucinski 001 (Electron. J. Comb., 2024)

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

Majority choosability of countable graphs. - Marcin Anholcer; Bartlomiej Bosek; Jaroslaw Grytczuk (Eur. J. Comb., 2024)

Shuffle Squares and Nest-Free Graphs. - Jaroslaw Grytczuk; Bartlomiej Pawlik; Andrzej Rucinski 001 (WORDS, 2025)

Mrs. Correct and majority colorings. - Marcin Anholcer; Bartlomiej Bosek; Jaroslaw Grytczuk; Grzegorz Gutowski; Jakub Przybylo; Mariusz Zajac (Discret. Math., 2025)

Twins in ordered hyper-matchings. - Andrzej Dudek; Jaroslaw Grytczuk; Andrzej Rucinski 001 (Discuss. Math. Graph Theory, 2025)

Erdős-Szekeres type theorems for ordered uniform matchings. - Andrzej Dudek; Jaroslaw Grytczuk; Andrzej Rucinski 001 (J. Comb. Theory B, 2025)

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