Jakub Kozik - RankMe

46 papers A* 3B 2Misc 1Journal 38Unranked 2

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