Jakub Kozik

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 21

Top Topics

Monotonicity Property

Greedy Strategy

Hyperspectral Image Compression

Top Venues

Electron. J. Comb.

J. Comb. Theory, Ser. B

Publications

Jakub Kozik, Bartosz Podkanowicz
Schnyder Woods and Alon-Tarsi Number of Planar Graphs. Electron. J. Comb. 31 (1) (2024)
Jakub Kozik, Piotr Micek, William T. Trotter
Dimension is polynomial in height for posets with planar cover graphs. J. Comb. Theory, Ser. B 165 (2024)
Andrzej Dorobisz, Jakub Kozik
Local Computation Algorithms for Hypergraph Coloring - following Beck's approach (full version). CoRR (2023)
Andrzej Dorobisz, Jakub Kozik
Local Computation Algorithms for Hypergraph Coloring - Following Beck's Approach. ICALP (2023)
Jakub Kozik
Improving Gebauer's construction of 3-chromatic hypergraphs with few edges. CoRR (2021)
Jakub Kozik
Improving Gebauer's Construction of 3-Chromatic Hypergraphs with Few Edges. ICALP (2021)
Lech Duraj, Jakub Kozik, Dmitry A. Shabanov
Random hypergraphs and property B. Eur. J. Comb. 91 (2021)
Lech Duraj, Jakub Kozik, Dmitry A. Shabanov
Random hypergraphs and property B. CoRR (2021)
Andrzej Dorobisz, Jakub Kozik
Local Computation Algorithms for Coloring of Uniform Hypergraphs. CoRR (2021)
Jakub Kozik, Piotr Micek, William T. Trotter
Dimension is polynomial in height for posets with planar cover graphs. CoRR (2019)
Lech Duraj, Grzegorz Gutowski, Jakub Kozik
A note on two-colorability of nonuniform hypergraphs. CoRR (2018)
Lech Duraj, Grzegorz Gutowski, Jakub Kozik
A Note on Two-Colorability of Nonuniform Hypergraphs. ICALP (2018)
Jakub Kozik, Grzegorz Matecki
Deferred On-Line Bipartite Matching. Electron. J. Comb. 25 (2) (2018)
Vida Dujmovic, Gwenaël Joret, Jakub Kozik, David R. Wood
Nonrepetitive colouring via entropy compression. Comb. 36 (6) (2016)
Jakub Kozik, Dmitry A. Shabanov
Improved algorithms for colorings of simple hypergraphs and applications. J. Comb. Theory, Ser. B 116 (2016)
Lech Duraj, Grzegorz Gutowski, Jakub Kozik
Chip Games and Paintability. Electron. J. Comb. 23 (3) (2016)
Jakub Kozik
Multipass greedy coloring of simple uniform hypergraphs. Random Struct. Algorithms 48 (1) (2016)
Adam Gagol, Gwenaël Joret, Jakub Kozik, Piotr Micek
Pathwidth and Nonrepetitive List Coloring. Electron. J. Comb. 23 (4) (2016)
Adam Gagol, Gwenaël Joret, Jakub Kozik, Piotr Micek
Pathwidth and nonrepetitive list coloring. CoRR (2016)
Jakub Kozik, Dmitry A. Shabanov
Extremal problems for colorings of simple hypergraphs and applications. Electron. Notes Discret. Math. 49 (2015)
Danila D. Cherkashin, Jakub Kozik
A note on random greedy coloring of uniform hypergraphs. Random Struct. Algorithms 47 (3) (2015)
Grzegorz Gutowski, Jakub Kozik, Piotr Micek, Xuding Zhu
Lower Bounds for On-line Graph Colorings. ISAAC (2014)
Jakub Kozik, Grzegorz Matecki
A lazy approach to on-line bipartite matching. CoRR (2014)
Jakub Kozik, Piotr Micek, Xuding Zhu
Towards an on-line version of Ohba's conjecture. Eur. J. Comb. 36 (2014)
Jakub Kozik, Dmitry A. Shabanov
Improved algorithms for colorings of simple hypergraphs and applications. CoRR (2014)
Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak
Triangle-free intersection graphs of line segments with large chromatic number. J. Comb. Theory, Ser. B 105 (2014)
Grzegorz Gutowski, Jakub Kozik, Piotr Micek, Xuding Zhu
Lower bounds for on-line graph colorings. CoRR (2014)
Jakub Kozik, Piotr Micek
Nonrepetitive Choice Number of Trees. SIAM J. Discret. Math. 27 (1) (2013)
Jakub Kozik
Multipass greedy coloring of simple uniform hypergraphs. CoRR (2013)
Danila D. Cherkashin, Jakub Kozik
A note on random greedy coloring of uniform hypergraphs. CoRR (2013)
Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek
New approach to nonrepetitive sequences. Random Struct. Algorithms 42 (2) (2013)
Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak
Triangle-Free Geometric Intersection Graphs with Large Chromatic Number. Discret. Comput. Geom. 50 (3) (2013)
Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak
Triangle-free intersection graphs of line segments with large chromatic number CoRR (2012)
Jakub Kozik, Piotr Micek
Nonrepetitive choice number of trees CoRR (2012)
Antoine Genitrini, Jakub Kozik
In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid. Ann. Pure Appl. Log. 163 (7) (2012)
Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak
Triangle-free geometric intersection graphs with large chromatic number CoRR (2012)
Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek
A new approach to nonrepetitive sequences CoRR (2011)
Jaroslaw Grytczuk, Jakub Kozik, Marcin Witkowski
Nonrepetitive sequences on arithmetic progressions CoRR (2011)
Jaroslaw Grytczuk, Jakub Kozik, Marcin Witkowski
Nonrepetitive Sequences on Arithmetic Progressions. Electron. J. Comb. 18 (1) (2011)
Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek
Nonrepetitive games CoRR (2011)
Jakub Kozik, Piotr Micek, Xuding Zhu
Towards on-line Ohba's conjecture CoRR (2011)
René David, Christophe Raffalli, Guillaume Theyssier, Katarzyna Grygiel, Jakub Kozik, Marek Zaionc
Some properties of random lambda terms Log. Methods Comput. Sci. 9 (1) (2009)
Antoine Genitrini, Jakub Kozik
Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System. LFCS (2009)
Antoine Genitrini, Jakub Kozik, Marek Zaionc
Intuitionistic vs. Classical Tautologies, Quantitative Comparison. TYPES (2007)
Jakub Kozik
Conditional Densities of Regular Languages. Electron. Notes Theor. Comput. Sci. 140 (2005)