Publikacje

• Two-colorability of random non-uniform hypergraphs - 2025 EuroConference on Combinatorics, Graph Theory and Applications [EUroComb], (2025), Jakub Kozik, Grzegorz Ryn
• Schnyder Woods and Alon-Tarsi Number of Planar Graphs - 2024
  Electronic Journal of Combinatorics Volume 31, Issue 1 (2024) (2024), 1-13 Jakub Kozik, Bartosz Podkanowicz
• Dimension is polynomial in height for posets with planar cover graphs - 2024
  Journal of Combinatorial Theory. Series B Volume 165, March 2024 (2024), 164-196 Jakub Kozik, Piotr Micek, William T. Trotter
• Local Computation Algorithms for Hypergraph Coloring - Following Beck’s Approach - 2023 International Colloquium on Automata Languages and Programming [ICALP](MAIN) 261 (LIPIcs) (2023), 48:1-48:20 Jakub Kozik, Andrzej Dorobisz
• Improving Gebauer’s construction of 3-chromatic hypergraphs with few edges - 2021 International Colloquium on Automata Languages and Programming [ICALP] Leibniz International Proceedings in Informatics (LIPIcs) (2021), 89:1-89:9 Jakub Kozik
• Random hypergraphs and property B - 2021
  European Journal of Combinatorics Volume 91, January 2021, 103205 (2021), 1-11 Lech Duraj, Jakub Kozik, Dmitry A. Shabanov
• A Note on Two-Colorability of Nonuniform Hypergraphs - 2018 International Colloquium on Automata Languages and Programming [ICALP] 107 (Leibniz International Proceedings in Informatics) (2018), 46:1-46:13 Lech Duraj, Grzegorz Gutowski, Jakub Kozik
• Deferred On-Line Bipartite Matching - 2018
  Electronic Journal of Combinatorics 25 (2) (2018), P2.24 Jakub Kozik, Grzegorz Matecki
• Nonrepetitive colouring via entropy compression - 2016
  Combinatorica Volume 36, Issue 6 (2016), 661-686 Vida Dujmović, Gwenaël Joret, Jakub Kozik, David R. Wood
• Pathwidth and nonrepetitive list colorings - 2016
  Electronic Journal of Combinatorics Volume 23, Issue 4 (2016), 19 Adam Gągol, Gwenaël Joret, Jakub Kozik, Piotr Micek
• Chip Games and Paintability - 2016
  Electronic Journal of Combinatorics 23 (3) (2016), 12 Lech Duraj, Grzegorz Gutowski, Jakub Kozik
• Improved algorithms for colorings of simple hypergraphs and applications - 2016
  Journal of Combinatorial Theory. Series B Volume 116 (2016), 312-332 Jakub Kozik, Dmitry A. Shabanov
• Multipass greedy coloring of simple uniform hypergraphs - 2016
  Random Structures and Algorithms Volume 48, Issue 1 (2016), 125-146 Jakub Kozik
• A note on random greedy coloring of uniform hypergraphs - 2015
  Random Structures and Algorithms 47 (2015), 407-413 Danila D. Cherkashin, Jakub Kozik
• Lower Bounds for On-Line Graph Colorings - 2014
  Lecture Notes in Computer Science vol. 8889 () (2014), "Algorithms and Computation, 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings", Springer Grzegorz Gutowski, Jakub Kozik, Piotr Micek, Xuding Zhu
• Triangle-free intersection graphs of line segments with large chromatic number - 2014
  Journal of Combinatorial Theory. Series B 105 (2014), 6-10 Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michał Lasoń, Piotr Micek, William T. Trotter, Bartosz Walczak
• Towards an on-line version of Ohba’s conjecture - 2014
  European Journal of Combinatorics 36 (2014), 110-121 Jakub Kozik, Piotr Micek, Xuding Zhu
• Triangle-free geometric intersection graphs with large chromatic number - 2013
  Discrete and Computational Geometry 50 (2013), 714-726 Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michał Lasoń, Piotr Micek, William T. Trotter, Bartosz Walczak
• New approach to nonrepetitive sequences - 2013
  Random Structures and Algorithms 42 (2013), 214-225 Jarosław Grytczuk, Jakub Kozik, Piotr Micek
• Nonrepetitive choice number of trees - 2013
  SIAM Journal on Discrete Mathematics 27-1 (2013), 436-446 Jakub Kozik, Piotr Micek
• Asymptotically almost all λ-terms are strongly normalizing - 2013
  Logical Methods in Computer Science 9 (1:02) (2013), 1-30 Rene David, Katarzyna Grygiel, Jakub Kozik, Christophe Raffalli, Guillaume Theyssier, , Marek Zaionc
• In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid - 2012
  Annals of Pure and Applied Logic 163 (2012), 875–887 Antoine Genitrini, Jakub Kozik
• Nonrepetitive sequences on arithmetic progressions - 2011
  Electronic Journal of Combinatorics 18 (2011), 1-9 Jarosław Grytczuk, Jakub Kozik, Marcin Witkowski
• Dynamic Threshold Strategy for Universal Best Choice Problem - 2010
  Discrete Mathematics and Theoretical Computer Science Proceedings AM (2010), 439–452 Jakub Kozik
• Quantitative comparison of Intuitionistic and Classical logics - full propositional system - 2009
  Lecture Notes in Computer Science 5407 (2009), 280-294 Antoine Genitrini, Jakub Kozik
• On the density and the structure of the Peirce-like formulae - 2008
  Discrete Mathematics and Theoretical Computer Science Proceedings (2008), 461-474 Antoine Genitrini, Jakub Kozik, Grzegorz Matecki
• Subcritical pattern languages for and/or trees - 2008
  Discrete Mathematics and Theoretical Computer Science Proceedings (2008), 437–448 Jakub Kozik
• Intuitionistic vs. Classical Tautologies, Quantitative Comparison - 2008
  Lecture Notes in Computer Science 4941 (2008), 100-109 Antoine Genitrini, Jakub Kozik, Marek Zaionc
• Undecidable problems concerning densities of languages - 2006
  Discrete Mathematics and Theoretical Computer Science Proceedings (2006), 69-76 Jakub Kozik
• Conditional Densities of Regular Languages - 2005
  Electronic Notes in Theoretical Computer Science (2005), 67-79 Jakub Kozik