A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints. - Krzysztof Giaro; Marek Kubale; Pawel Obszarski (Discret. Appl. Math., 2009)

Edge-coloring of 3-uniform hypergraphs. - Pawel Obszarski; Andrzej Jastrzebski (Discret. Appl. Math., 2017)

Equitable coloring of hypergraphs. - Hanna Furmanczyk; Pawel Obszarski (Discret. Appl. Math., 2019)

2-Coloring number revisited. - Robert Janczewski; Pawel Obszarski; Krzysztof Turowski (Theor. Comput. Sci., 2019)

Infinite chromatic games. - Robert Janczewski; Pawel Obszarski; Krzysztof Turowski; Bartlomiej Wróblewski 001 (Discret. Appl. Math., 2022)

Weighted 2-sections and hypergraph reconstruction. - Robert Janczewski; Pawel Obszarski; Krzysztof Turowski (Theor. Comput. Sci., 2022)

The Game Chromatic Number of Complete Multipartite Graphs with No Singletons. - Pawel Obszarski; Krzysztof Turowski; Hubert Zieba (CoRR, 2023)