Jakub Kozik

Orcid: 0000-0002-1362-7780

According to our database1, Jakub Kozik authored at least 31 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Dimension is polynomial in height for posets with planar cover graphs.
J. Comb. Theory, Ser. B, March, 2024

Schnyder Woods and Alon-Tarsi Number of Planar Graphs.
Electron. J. Comb., 2024

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

Local Computation Algorithms for Hypergraph Coloring - Following Beck's Approach.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2021
Random hypergraphs and property B.
Eur. J. Comb., 2021

Local Computation Algorithms for Coloring of Uniform Hypergraphs.
CoRR, 2021

Improving Gebauer's Construction of 3-Chromatic Hypergraphs with Few Edges.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2018
Deferred On-Line Bipartite Matching.
Electron. J. Comb., 2018

A Note on Two-Colorability of Nonuniform Hypergraphs.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2016
Multipass greedy coloring of simple uniform hypergraphs.
Random Struct. Algorithms, 2016

Improved algorithms for colorings of simple hypergraphs and applications.
J. Comb. Theory, Ser. B, 2016

Pathwidth and Nonrepetitive List Coloring.
Electron. J. Comb., 2016

Chip Games and Paintability.
Electron. J. Comb., 2016

Nonrepetitive colouring via entropy compression.
Comb., 2016

2015
A note on random greedy coloring of uniform hypergraphs.
Random Struct. Algorithms, 2015

Extremal problems for colorings of simple hypergraphs and applications.
Electron. Notes Discret. Math., 2015

2014
Triangle-free intersection graphs of line segments with large chromatic number.
J. Comb. Theory, Ser. B, 2014

Towards an on-line version of Ohba's conjecture.
Eur. J. Comb., 2014

A lazy approach to on-line bipartite matching.
CoRR, 2014

Lower Bounds for On-line Graph Colorings.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013
Nonrepetitive Choice Number of Trees.
SIAM J. Discret. Math., 2013

New approach to nonrepetitive sequences.
Random Struct. Algorithms, 2013

Triangle-Free Geometric Intersection Graphs with Large Chromatic Number.
Discret. Comput. Geom., 2013

2012
In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid.
Ann. Pure Appl. Log., 2012

2011
Towards on-line Ohba's conjecture
CoRR, 2011

Nonrepetitive games
CoRR, 2011

Nonrepetitive Sequences on Arithmetic Progressions.
Electron. J. Comb., 2011

2009
Some properties of random lambda terms
Log. Methods Comput. Sci., 2009

Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

2007
Intuitionistic vs. Classical Tautologies, Quantitative Comparison.
Proceedings of the Types for Proofs and Programs, International Conference, 2007

2004
Conditional Densities of Regular Languages.
Proceedings of the Second Workshop on Computational Logic and Applications, 2004


  Loading...