Krzysztof Wesek

Orcid: 0000-0003-3582-562X

According to our database1, Krzysztof Wesek authored at least 11 papers between 2016 and 2023.

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

2023
Coloring distance graphs on the plane.
Discret. Math., July, 2023

2022
Fractional meanings of nonrepetitiveness.
J. Comb. Theory, Ser. A, 2022

2020
Avoiding Multiple Repetitions in Euclidean Spaces.
SIAM J. Discret. Math., 2020

2019
On cordial labeling of hypertrees.
Discret. Math. Theor. Comput. Sci., 2019

Tight lower bounds for semi-online scheduling on two uniform machines with known optimum.
Central Eur. J. Oper. Res., 2019

2018
Online Coloring and L(2, 1)-Labeling of Unit Disk Intersection Graphs.
SIAM J. Discret. Math., 2018

Tight upper bounds for semi-online scheduling on two uniform machines with known optimum.
Central Eur. J. Oper. Res., 2018

2017
On avoding r-repetitions in ℝ<sup>2</sup>.
Electron. Notes Discret. Math., 2017

2016
Nonrepetitive and pattern-free colorings of the plane.
Eur. J. Comb., 2016

Fractional and j-Fold Coloring of the Plane.
Discret. Comput. Geom., 2016

Grasshopper Avoidance of Patterns.
Electron. J. Comb., 2016


  Loading...