Divisibility and T-span of graphs. - Robert Janczewski (Discret. Math., 2001)

The smallest hard-to-color graph for algorithm DSATUR. - Robert Janczewski; Marek Kubale; Krzysztof Manuszewski; Konrad Piwakowski (Discret. Math., 2001)

A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs. - Krzysztof Giaro; Robert Janczewski; Marek Kubale; Michal Malafiejski (APPROX, 2002)

The complexity of the T-coloring problem for graphs with small degree. - Krzysztof Giaro; Robert Janczewski; Michal Malafiejski (Discret. Appl. Math., 2003)

A polynomial algorithm for finding T-span of generalized cacti. - Krzysztof Giaro; Robert Janczewski; Michal Malafiejski (Discret. Appl. Math., 2003)

Sum Coloring of Bipartite Graphs with Bounded Degree. - Michal Malafiejski; Krzysztof Giaro; Robert Janczewski; Marek Kubale (Algorithmica, 2004)

Interval Wavelength Assignment in All-Optical Star Networks. - Robert Janczewski; Anna Malafiejska; Michal Malafiejski (PPAM (1), 2009)

Greedy T-colorings of graphs. - Robert Janczewski (Discret. Math., 2009)

The complexity of the L(p, q)-labeling problem for bipartite planar graphs of small degree. - Robert Janczewski; Adrian Kosowski; Michal Malafiejski (Discret. Math., 2009)

Consensus models: Computational complexity aspects in modern approaches to the list coloring problem. - Damian Bogdanowicz; Krzysztof Giaro; Robert Janczewski (Theor. Comput. Sci., 2011)

Interval incidence coloring of bipartite graphs. - Robert Janczewski; Anna Malafiejska; Michal Malafiejski (Discret. Appl. Math., 2014)

Interval incidence graph coloring. - Robert Janczewski; Anna Malafiejska; Michal Malafiejski (Discret. Appl. Math., 2015)

The computational complexity of the backbone coloring problem for planar graphs with connected backbones. - Robert Janczewski; Krzysztof Turowski (Discret. Appl. Math., 2015)

The Backbone Coloring Problem for Bipartite Backbones. - Robert Janczewski; Krzysztof Turowski (Graphs Comb., 2015)

The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones. - Robert Janczewski; Krzysztof Turowski (Inf. Process. Lett., 2015)

On the hardness of computing span of subcubic graphs. - Robert Janczewski; Krzysztof Turowski (Inf. Process. Lett., 2016)

An O(n log n) algorithm for finding edge span of cacti. - Robert Janczewski; Krzysztof Turowski (J. Comb. Optim., 2016)

On incidence coloring of complete multipartite and semicubic bipartite graphs. - Robert Janczewski; Anna Malafiejska; Michal Malafiejski (Discuss. Math. Graph Theory, 2018)

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

T-colorings, divisibility and circular chromatic number. - Robert Janczewski; Anna Maria Trzaskowska; Krzysztof Turowski (Discuss. Math. Graph Theory, 2021)

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)

Edge coloring of graphs of signed class 1 and 2. - Robert Janczewski; Krzysztof Turowski; Bartlomiej Wróblewski 001 (Discret. Appl. Math., 2023)

Edge coloring of products of signed graphs. - Robert Janczewski; Krzysztof Turowski; Bartlomiej Wróblewski 001 (Discuss. Math. Graph Theory, 2025)