Conditional Densities of Regular Languages. - Jakub Kozik (CLA, 2004)

Intuitionistic vs. Classical Tautologies, Quantitative Comparison. - Antoine Genitrini; Jakub Kozik; Marek Zaionc (TYPES, 2007)

Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System. - Antoine Genitrini; Jakub Kozik (LFCS, 2009)

Some properties of random lambda terms - René David; Christophe Raffalli; Guillaume Theyssier; Katarzyna Grygiel; Jakub Kozik; Marek Zaionc (Log. Methods Comput. Sci., 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)

Towards on-line Ohba's conjecture - Jakub Kozik; Piotr Micek; Xuding Zhu (CoRR, 2011)

In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid. - Antoine Genitrini; Jakub Kozik (Ann. Pure Appl. Log., 2012)

Triangle-Free Geometric Intersection Graphs with Large Chromatic Number. - Arkadiusz Pawlik; Jakub Kozik; Tomasz Krawczyk; Michal Lason; Piotr Micek; William T. Trotter; Bartosz Walczak (Discret. Comput. Geom., 2013)

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

Nonrepetitive Choice Number of Trees. - Jakub Kozik; Piotr Micek (SIAM J. Discret. Math., 2013)

Lower Bounds for On-line Graph Colorings. - Grzegorz Gutowski; Jakub Kozik; Piotr Micek; Xuding Zhu (ISAAC, 2014)

A lazy approach to on-line bipartite matching. - Jakub Kozik; Grzegorz Matecki (CoRR, 2014)

Towards an on-line version of Ohba's conjecture. - Jakub Kozik; Piotr Micek; Xuding Zhu (Eur. J. Comb., 2014)

Triangle-free intersection graphs of line segments with large chromatic number. - Arkadiusz Pawlik; Jakub Kozik; Tomasz Krawczyk; Michal Lason; Piotr Micek; William T. Trotter; Bartosz Walczak (J. Comb. Theory B, 2014)

Extremal problems for colorings of simple hypergraphs and applications. - Jakub Kozik; Dmitry A. Shabanov (Electron. Notes Discret. Math., 2015)

A note on random greedy coloring of uniform hypergraphs. - Danila D. Cherkashin; Jakub Kozik (Random Struct. Algorithms, 2015)

Nonrepetitive colouring via entropy compression. - Vida Dujmovic; Gwenaël Joret; Jakub Kozik; David R. Wood (Comb., 2016)

Chip Games and Paintability. - Lech Duraj; Grzegorz Gutowski; Jakub Kozik (Electron. J. Comb., 2016)

Pathwidth and Nonrepetitive List Coloring. - Adam Gagol; Gwenaël Joret; Jakub Kozik; Piotr Micek (Electron. J. Comb., 2016)

Improved algorithms for colorings of simple hypergraphs and applications. - Jakub Kozik; Dmitry A. Shabanov (J. Comb. Theory B, 2016)

Multipass greedy coloring of simple uniform hypergraphs. - Jakub Kozik (Random Struct. Algorithms, 2016)

A Note on Two-Colorability of Nonuniform Hypergraphs. - Lech Duraj; Grzegorz Gutowski; Jakub Kozik (ICALP, 2018)

Deferred On-Line Bipartite Matching. - Jakub Kozik; Grzegorz Matecki (Electron. J. Comb., 2018)

Improving Gebauer's Construction of 3-Chromatic Hypergraphs with Few Edges. - Jakub Kozik (ICALP, 2021)

Local Computation Algorithms for Coloring of Uniform Hypergraphs. - Andrzej Dorobisz; Jakub Kozik (CoRR, 2021)

Random hypergraphs and property B. - Lech Duraj; Jakub Kozik; Dmitry A. Shabanov (Eur. J. Comb., 2021)

Local Computation Algorithms for Hypergraph Coloring - Following Beck's Approach. - Andrzej Dorobisz; Jakub Kozik (ICALP, 2023)

Local Computation Algorithms for Hypergraph Coloring - following Beck's approach (full version). - Andrzej Dorobisz; Jakub Kozik (CoRR, 2023)

Schnyder Woods and Alon-Tarsi Number of Planar Graphs. - Jakub Kozik; Bartosz Podkanowicz (Electron. J. Comb., 2024)

Dimension is polynomial in height for posets with planar cover graphs. - Jakub Kozik; Piotr Micek; William T. Trotter (J. Comb. Theory B, 2024)