Robert Janczewski

Publication Activity (10 Years)

Years Active: 2001-2023
Publications (10 Years): 10

Top Topics

Bipartite Graph

Computational Complexity

Top Venues

Discret. Appl. Math.

Inf. Process. Lett.

Discuss. Math. Graph Theory

Publications

Robert Janczewski, Krzysztof Turowski, Bartlomiej Wróblewski
Edge coloring of graphs of signed class 1 and 2. Discret. Appl. Math. 338 (2023)
Robert Janczewski, Krzysztof Turowski, Bartlomiej Wróblewski
Edge coloring of products of signed graphs. CoRR (2023)
Robert Janczewski, Krzysztof Turowski, Bartlomiej Wróblewski
Edge coloring of graphs of signed class 1 and 2. CoRR (2022)
Robert Janczewski, Pawel Obszarski, Krzysztof Turowski, Bartlomiej Wróblewski
Infinite chromatic games. Discret. Appl. Math. 309 (2022)
Robert Janczewski, Pawel Obszarski, Krzysztof Turowski
Weighted 2-sections and hypergraph reconstruction. Theor. Comput. Sci. 915 (2022)
Robert Janczewski, Anna Maria Trzaskowska, Krzysztof Turowski
-colorings, divisibility and circular chromatic number. Discuss. Math. Graph Theory 41 (2) (2021)
Robert Janczewski, Pawel Obszarski, Krzysztof Turowski
2-Coloring number revisited. Theor. Comput. Sci. 796 (2019)
Robert Janczewski, Anna Malafiejska, Michal Malafiejski
On incidence coloring of complete multipartite and semicubic bipartite graphs. Discuss. Math. Graph Theory 38 (1) (2018)
Robert Janczewski, Krzysztof Turowski
An O(n log n) algorithm for finding edge span of cacti. J. Comb. Optim. 31 (4) (2016)
Robert Janczewski, Krzysztof Turowski
On the hardness of computing span of subcubic graphs. Inf. Process. Lett. 116 (1) (2016)
Robert Janczewski, Anna Malafiejska, Michal Malafiejski
Interval incidence graph coloring. Discret. Appl. Math. 182 (2015)
Robert Janczewski, Krzysztof Turowski
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones. Inf. Process. Lett. 115 (2) (2015)
Robert Janczewski, Krzysztof Turowski
The Backbone Coloring Problem for Bipartite Backbones. Graphs Comb. 31 (5) (2015)
Robert Janczewski, Krzysztof Turowski
The computational complexity of the backbone coloring problem for planar graphs with connected backbones. Discret. Appl. Math. 184 (2015)
Robert Janczewski, Anna Malafiejska, Michal Malafiejski
Interval incidence coloring of bipartite graphs. Discret. Appl. Math. 166 (2014)
Damian Bogdanowicz, Krzysztof Giaro, Robert Janczewski
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem. Theor. Comput. Sci. 412 (35) (2011)
Robert Janczewski, Adrian Kosowski, Michal Malafiejski
The complexity of the L(p, q)-labeling problem for bipartite planar graphs of small degree. Discret. Math. 309 (10) (2009)
Robert Janczewski
Greedy T-colorings of graphs. Discret. Math. 309 (6) (2009)
Robert Janczewski, Anna Malafiejska, Michal Malafiejski
Interval Wavelength Assignment in All-Optical Star Networks. PPAM (1) (2009)
Michal Malafiejski, Krzysztof Giaro, Robert Janczewski, Marek Kubale
Sum Coloring of Bipartite Graphs with Bounded Degree. Algorithmica 40 (4) (2004)
Krzysztof Giaro, Robert Janczewski, Michal Malafiejski
A polynomial algorithm for finding T-span of generalized cacti. Discret. Appl. Math. 129 (2-3) (2003)
Krzysztof Giaro, Robert Janczewski, Michal Malafiejski
The complexity of the T-coloring problem for graphs with small degree. Discret. Appl. Math. 129 (2-3) (2003)
Krzysztof Giaro, Robert Janczewski, Marek Kubale, Michal Malafiejski
A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs. APPROX (2002)
Robert Janczewski
-span of graphs. Discret. Math. 234 (1-3) (2001)
Robert Janczewski, Marek Kubale, Krzysztof Manuszewski, Konrad Piwakowski
The smallest hard-to-color graph for algorithm DSATUR. Discret. Math. 236 (1-3) (2001)