default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJakub Kozik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Jakub Kozik, Bartosz Podkanowicz:
Schnyder Woods and Alon-Tarsi Number of Planar Graphs. Electron. J. Comb. 31(1) (2024)- [j18]Jakub Kozik, Piotr Micek, William T. Trotter:
Dimension is polynomial in height for posets with planar cover graphs. J. Comb. Theory B 165: 164-196 (2024) - 2023
- [c7]Andrzej Dorobisz
, Jakub Kozik:
Local Computation Algorithms for Hypergraph Coloring - Following Beck's Approach. ICALP 2023: 48:1-48:20 - [i19]Andrzej Dorobisz, Jakub Kozik:
Local Computation Algorithms for Hypergraph Coloring - following Beck's approach (full version). CoRR abs/2305.02831 (2023) - 2021
- [j17]Lech Duraj, Jakub Kozik, Dmitry A. Shabanov:
Random hypergraphs and property B. Eur. J. Comb. 91: 103205 (2021) - [c6]Jakub Kozik:
Improving Gebauer's Construction of 3-Chromatic Hypergraphs with Few Edges. ICALP 2021: 89:1-89:9 - [i18]Jakub Kozik:
Improving Gebauer's construction of 3-chromatic hypergraphs with few edges. CoRR abs/2102.11674 (2021) - [i17]Lech Duraj, Jakub Kozik, Dmitry A. Shabanov:
Random hypergraphs and property B. CoRR abs/2102.12968 (2021) - [i16]Andrzej Dorobisz, Jakub Kozik:
Local Computation Algorithms for Coloring of Uniform Hypergraphs. CoRR abs/2103.10990 (2021)
2010 – 2019
- 2019
- [i15]Jakub Kozik, Piotr Micek, William T. Trotter:
Dimension is polynomial in height for posets with planar cover graphs. CoRR abs/1907.00380 (2019) - 2018
- [j16]Jakub Kozik, Grzegorz Matecki:
Deferred On-Line Bipartite Matching. Electron. J. Comb. 25(2): 2 (2018) - [c5]Lech Duraj, Grzegorz Gutowski, Jakub Kozik:
A Note on Two-Colorability of Nonuniform Hypergraphs. ICALP 2018: 46:1-46:13 - [i14]Lech Duraj, Grzegorz Gutowski, Jakub Kozik:
A note on two-colorability of nonuniform hypergraphs. CoRR abs/1803.03060 (2018) - 2016
- [j15]Vida Dujmovic, Gwenaël Joret, Jakub Kozik, David R. Wood:
Nonrepetitive colouring via entropy compression. Comb. 36(6): 661-686 (2016) - [j14]Lech Duraj, Grzegorz Gutowski, Jakub Kozik:
Chip Games and Paintability. Electron. J. Comb. 23(3): 3 (2016) - [j13]Adam Gagol, Gwenaël Joret, Jakub Kozik, Piotr Micek:
Pathwidth and Nonrepetitive List Coloring. Electron. J. Comb. 23(4): 4 (2016) - [j12]Jakub Kozik, Dmitry A. Shabanov:
Improved algorithms for colorings of simple hypergraphs and applications. J. Comb. Theory B 116: 312-332 (2016) - [j11]Jakub Kozik:
Multipass greedy coloring of simple uniform hypergraphs. Random Struct. Algorithms 48(1): 125-146 (2016) - [i13]Adam Gagol, Gwenaël Joret, Jakub Kozik, Piotr Micek:
Pathwidth and nonrepetitive list coloring. CoRR abs/1601.01886 (2016) - 2015
- [j10]Jakub Kozik, Dmitry A. Shabanov:
Extremal problems for colorings of simple hypergraphs and applications. Electron. Notes Discret. Math. 49: 441-445 (2015) - [j9]Danila D. Cherkashin, Jakub Kozik:
A note on random greedy coloring of uniform hypergraphs. Random Struct. Algorithms 47(3): 407-413 (2015) - 2014
- [j8]Jakub Kozik, Piotr Micek, Xuding Zhu:
Towards an on-line version of Ohba's conjecture. Eur. J. Comb. 36: 110-121 (2014) - [j7]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak:
Triangle-free intersection graphs of line segments with large chromatic number. J. Comb. Theory B 105: 6-10 (2014) - [c4]Grzegorz Gutowski, Jakub Kozik, Piotr Micek, Xuding Zhu:
Lower Bounds for On-line Graph Colorings. ISAAC 2014: 507-515 - [i12]Grzegorz Gutowski, Jakub Kozik, Piotr Micek, Xuding Zhu:
Lower bounds for on-line graph colorings. CoRR abs/1404.7259 (2014) - [i11]Jakub Kozik, Dmitry A. Shabanov:
Improved algorithms for colorings of simple hypergraphs and applications. CoRR abs/1409.6921 (2014) - [i10]Jakub Kozik, Grzegorz Matecki:
A lazy approach to on-line bipartite matching. CoRR abs/1410.3764 (2014) - 2013
- [j6]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak:
Triangle-Free Geometric Intersection Graphs with Large Chromatic Number. Discret. Comput. Geom. 50(3): 714-726 (2013) - [j5]Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek:
New approach to nonrepetitive sequences. Random Struct. Algorithms 42(2): 214-225 (2013) - [j4]Jakub Kozik, Piotr Micek:
Nonrepetitive Choice Number of Trees. SIAM J. Discret. Math. 27(1): 436-446 (2013) - [i9]Danila D. Cherkashin, Jakub Kozik:
A note on random greedy coloring of uniform hypergraphs. CoRR abs/1310.1368 (2013) - [i8]Jakub Kozik:
Multipass greedy coloring of simple uniform hypergraphs. CoRR abs/1310.5984 (2013) - 2012
- [j3]Antoine Genitrini, Jakub Kozik:
In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid. Ann. Pure Appl. Log. 163(7): 875-887 (2012) - [i7]Jakub Kozik, Piotr Micek:
Nonrepetitive choice number of trees. CoRR abs/1207.5155 (2012) - [i6]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak:
Triangle-free intersection graphs of line segments with large chromatic number. CoRR abs/1209.1595 (2012) - [i5]Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michal Lason, Piotr Micek, William T. Trotter, Bartosz Walczak:
Triangle-free geometric intersection graphs with large chromatic number. CoRR abs/1212.2058 (2012) - 2011
- [j2]Jaroslaw Grytczuk, Jakub Kozik, Marcin Witkowski:
Nonrepetitive Sequences on Arithmetic Progressions. Electron. J. Comb. 18(1) (2011) - [i4]Jaroslaw Grytczuk, Jakub Kozik, Marcin Witkowski:
Nonrepetitive sequences on arithmetic progressions. CoRR abs/1102.5438 (2011) - [i3]Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek:
A new approach to nonrepetitive sequences. CoRR abs/1103.3809 (2011) - [i2]Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek:
Nonrepetitive games. CoRR abs/1103.3810 (2011) - [i1]Jakub Kozik, Piotr Micek, Xuding Zhu:
Towards on-line Ohba's conjecture. CoRR abs/1111.5458 (2011)
2000 – 2009
- 2009
- [j1]René David, Christophe Raffalli, Guillaume Theyssier, Katarzyna Grygiel, Jakub Kozik, Marek Zaionc:
Some properties of random lambda terms. Log. Methods Comput. Sci. 9(1) (2009) - [c3]Antoine Genitrini, Jakub Kozik:
Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System. LFCS 2009: 280-294 - 2007
- [c2]Antoine Genitrini, Jakub Kozik, Marek Zaionc:
Intuitionistic vs. Classical Tautologies, Quantitative Comparison. TYPES 2007: 100-109 - 2004
- [c1]Jakub Kozik:
Conditional Densities of Regular Languages. CLA 2004: 67-79
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
