| Publication | Date of Publication | Type |
|---|
| Local computation algorithms for hypergraph coloring -- following Beck's approach | 2024-11-14 | Paper |
Schnyder woods and Alon-Tarsi number of planar graphs
The Electronic Journal of Combinatorics | 2024-03-19 | Paper |
Dimension is polynomial in height for posets with planar cover graphs
Journal of Combinatorial Theory. Series B | 2024-01-15 | Paper |
A note on two-colorability of nonuniform hypergraphs
(available as arXiv preprint) | 2021-07-28 | Paper |
| Improving Gebauer's construction of 3-chromatic hypergraphs with few edges | 2021-02-23 | Paper |
Random hypergraphs and property B
European Journal of Combinatorics | 2021-02-08 | Paper |
Deferred on-line bipartite matching
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
Nonrepetitive colouring via entropy compression
Combinatorica | 2017-04-25 | Paper |
| scientific article; zbMATH DE number 6683507 (Why is no real title available?) | 2017-02-10 | Paper |
| On the density and the structure of the Peirce-like formulae | 2017-02-10 | Paper |
| Dynamic threshold strategy for universal best choice problem | 2017-02-10 | Paper |
Pathwidth and nonrepetitive list coloring
The Electronic Journal of Combinatorics | 2017-01-18 | Paper |
Pathwidth and nonrepetitive list coloring
The Electronic Journal of Combinatorics | 2017-01-18 | Paper |
| Extremal problems for colorings of simple hypergraphs and applications | 2016-10-14 | Paper |
Chip games and paintability
The Electronic Journal of Combinatorics | 2016-07-13 | Paper |
Chip games and paintability
The Electronic Journal of Combinatorics | 2016-07-13 | Paper |
Multipass greedy coloring of simple uniform hypergraphs
Random Structures & Algorithms | 2016-02-03 | Paper |
Improved algorithms for colorings of simple hypergraphs and applications
Journal of Combinatorial Theory. Series B | 2015-12-11 | Paper |
A note on random greedy coloring of uniform hypergraphs
Random Structures & Algorithms | 2015-11-13 | Paper |
Lower bounds for on-line graph colorings
Algorithms and Computation | 2015-09-11 | Paper |
Triangle-free intersection graphs of line segments with large chromatic number
Journal of Combinatorial Theory. Series B | 2014-08-27 | Paper |
Towards an on-line version of Ohba's conjecture
European Journal of Combinatorics | 2014-03-25 | Paper |
Triangle-free geometric intersection graphs with large chromatic number
Discrete & Computational Geometry | 2013-11-06 | Paper |
| Conditional densities of regular languages | 2013-10-02 | Paper |
Nonrepetitive choice number of trees
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
Asymptotically almost all \lambda-terms are strongly normalizing
Logical Methods in Computer Science | 2013-04-09 | Paper |
New approach to nonrepetitive sequences
Random Structures & Algorithms | 2013-03-12 | Paper |
In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid
Annals of Pure and Applied Logic | 2012-04-10 | Paper |
Nonrepetitive sequences on arithmetic progressions
The Electronic Journal of Combinatorics | 2011-11-22 | Paper |
Nonrepetitive sequences on arithmetic progressions
The Electronic Journal of Combinatorics | 2011-11-22 | Paper |
| Undecidable problems concerning densities of languages | 2010-07-28 | Paper |
Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System
Logical Foundations of Computer Science | 2009-02-24 | Paper |
Intuitionistic vs. Classical Tautologies, Quantitative Comparison
Lecture Notes in Computer Science | 2008-06-03 | Paper |
