Jakub Kozik - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2024

Schnyder Woods and Alon-Tarsi Number of Planar GraphsJakub Kozik, Bartosz Podkanowicz. combinatorics, 31(1), 2024. [doi]

Dimension is polynomial in height for posets with planar cover graphsJakub Kozik, Piotr Micek, William T. Trotter. jctb, 165:164-196, March 2024. [doi]

2023

Local Computation Algorithms for Hypergraph Coloring - Following Beck's ApproachAndrzej Dorobisz, Jakub Kozik. icalp 2023: [doi]

2021

Random hypergraphs and property BLech Duraj, Jakub Kozik, Dmitry A. Shabanov. ejc, 91:103205, 2021. [doi]

Improving Gebauer's Construction of 3-Chromatic Hypergraphs with Few EdgesJakub Kozik. icalp 2021: [doi]

2018

A Note on Two-Colorability of Nonuniform HypergraphsLech Duraj, Grzegorz Gutowski, Jakub Kozik. icalp 2018: [doi]

Deferred On-Line Bipartite MatchingJakub Kozik, Grzegorz Matecki. combinatorics, 25(2):2, 2018. [doi]

2016

Nonrepetitive colouring via entropy compressionVida Dujmovic, Gwenaël Joret, Jakub Kozik, David R. Wood. combinatorica, 36(6):661-686, 2016. [doi]

Chip Games and PaintabilityLech Duraj, Grzegorz Gutowski, Jakub Kozik. combinatorics, 23(3):3, 2016. [doi]

Pathwidth and Nonrepetitive List ColoringAdam Gagol, Gwenaël Joret, Jakub Kozik, Piotr Micek. combinatorics, 23(4):4, 2016. [doi]

Improved algorithms for colorings of simple hypergraphs and applicationsJakub Kozik, Dmitry A. Shabanov. JCT, 116:312-332, 2016. [doi]

Multipass greedy coloring of simple uniform hypergraphsJakub Kozik. rsa, 48(1):125-146, 2016. [doi]

2015

A note on random greedy coloring of uniform hypergraphsDanila D. Cherkashin, Jakub Kozik. rsa, 47(3):407-413, 2015. [doi]

Extremal problems for colorings of simple hypergraphs and applicationsJakub Kozik, Dmitry A. Shabanov. endm, 49:441-445, 2015. [doi]

2014

2013

New approach to nonrepetitive sequencesJaroslaw Grytczuk, Jakub Kozik, Piotr Micek. rsa, 42(2):214-225, 2013. [doi]

Nonrepetitive Choice Number of TreesJakub Kozik, Piotr Micek. siamdm, 27(1):436-446, 2013. [doi]

Triangle-Free Geometric Intersection Graphs with Large Chromatic NumberArkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak. dcg, 50(3):714-726, 2013. [doi]

2012

In the full propositional logic, 5/8 of classical tautologies are intuitionistically validAntoine Genitrini, Jakub Kozik. APAL, 163(7):875-887, 2012. [doi]

2011

Nonrepetitive Sequences on Arithmetic ProgressionsJaroslaw Grytczuk, Jakub Kozik, Marcin Witkowski. combinatorics, 18(1), 2011. [doi]

2009

Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional SystemAntoine Genitrini, Jakub Kozik. lfcs 2009: 280-294 [doi]

2007

Intuitionistic vs. Classical Tautologies, Quantitative ComparisonAntoine Genitrini, Jakub Kozik, Marek Zaionc. TYPES 2008: 100-109 [doi]

2005

Conditional Densities of Regular LanguagesJakub Kozik. ENTCS, 140:67-79, 2005. [doi]

Sign in or sign up to see more results.

runs on WebDSL