( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Lower Bounds for On-line Graph Colorings.

, , , и . ISAAC, том 8889 из Lecture Notes in Computer Science, стр. 507-515. Springer, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Benjamin Kozik

Susanne Kozik

Benjamin Kozik

Benjamin Kozik

Benjamin Kozik

 

Другие публикации лиц с тем же именем

Multipass greedy coloring of simple uniform hypergraphs.. Random Struct. Algorithms, 48 (1): 125-146 (2016)Intuitionistic vs. Classical Tautologies, Quantitative Comparison., , и . TYPES, том 4941 из Lecture Notes in Computer Science, стр. 100-109. Springer, (2007)A Note on Two-Colorability of Nonuniform Hypergraphs., , и . ICALP, том 107 из LIPIcs, стр. 46:1-46:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Improving Gebauer's Construction of 3-Chromatic Hypergraphs with Few Edges.. ICALP, том 198 из LIPIcs, стр. 89:1-89:9. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)A note on random greedy coloring of uniform hypergraphs., и . Random Struct. Algorithms, 47 (3): 407-413 (2015)Triangle-free intersection graphs of line segments with large chromatic number, , , , , , и . CoRR, (2012)Nonrepetitive games, , и . CoRR, (2011)In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid., и . Ann. Pure Appl. Log., 163 (7): 875-887 (2012)Triangle-Free Geometric Intersection Graphs with Large Chromatic Number., , , , , , и . Discret. Comput. Geom., 50 (3): 714-726 (2013)Triangle-free intersection graphs of line segments with large chromatic number., , , , , , и . J. Comb. Theory B, (2014)