Robert Janczewski

25 papers Journal 23Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Edge coloring of products of signed graphs.
Discuss. Math. Graph Theory
Robert Janczewski, Krzysztof Turowski, Bartlomiej Wróblewski
2023 J jnl
Edge coloring of graphs of signed class 1 and 2.
Discret. Appl. Math.
Robert Janczewski, Krzysztof Turowski, Bartlomiej Wróblewski
2023 J jnl
Edge coloring of products of signed graphs.
CoRR
Robert Janczewski, Krzysztof Turowski, Bartlomiej Wróblewski
2022 J jnl
Edge coloring of graphs of signed class 1 and 2.
CoRR
Robert Janczewski, Krzysztof Turowski, Bartlomiej Wróblewski
2022 J jnl
Infinite chromatic games.
Discret. Appl. Math.
Robert Janczewski, Pawel Obszarski, Krzysztof Turowski, Bartlomiej Wróblewski
2022 J jnl
Weighted 2-sections and hypergraph reconstruction.
Theor. Comput. Sci.
Robert Janczewski, Pawel Obszarski, Krzysztof Turowski
2019 J jnl
2-Coloring number revisited.
Theor. Comput. Sci.
Robert Janczewski, Pawel Obszarski, Krzysztof Turowski
2018 J jnl
On incidence coloring of complete multipartite and semicubic bipartite graphs.
Discuss. Math. Graph Theory
Robert Janczewski, Anna Malafiejska, Michal Malafiejski
2016 J jnl
An O(n log n) algorithm for finding edge span of cacti.
J. Comb. Optim.
Robert Janczewski, Krzysztof Turowski
2016 J jnl
On the hardness of computing span of subcubic graphs.
Inf. Process. Lett.
Robert Janczewski, Krzysztof Turowski
2015 J jnl
Interval incidence graph coloring.
Discret. Appl. Math.
Robert Janczewski, Anna Malafiejska, Michal Malafiejski
2015 J jnl
The Backbone Coloring Problem for Bipartite Backbones.
Graphs Comb.
Robert Janczewski, Krzysztof Turowski
2015 J jnl
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones.
Inf. Process. Lett.
Robert Janczewski, Krzysztof Turowski
2015 J jnl
The computational complexity of the backbone coloring problem for planar graphs with connected backbones.
Discret. Appl. Math.
Robert Janczewski, Krzysztof Turowski
2014 J jnl
Interval incidence coloring of bipartite graphs.
Discret. Appl. Math.
Robert Janczewski, Anna Malafiejska, Michal Malafiejski
2011 J jnl
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem.
Theor. Comput. Sci.
Damian Bogdanowicz, Krzysztof Giaro, Robert Janczewski
2009 J jnl
Greedy T-colorings of graphs.
Discret. Math.
Robert Janczewski
2009 — conf
Interval Wavelength Assignment in All-Optical Star Networks.
PPAM (1)
Robert Janczewski, Anna Malafiejska, Michal Malafiejski
2009 J jnl
The complexity of the L(p, q)-labeling problem for bipartite planar graphs of small degree.
Discret. Math.
Robert Janczewski, Adrian Kosowski, Michal Malafiejski
2004 J jnl
Sum Coloring of Bipartite Graphs with Bounded Degree.
Algorithmica
Michal Malafiejski, Krzysztof Giaro, Robert Janczewski, Marek Kubale
2003 J jnl
A polynomial algorithm for finding T-span of generalized cacti.
Discret. Appl. Math.
Krzysztof Giaro, Robert Janczewski, Michal Malafiejski
2003 J jnl
The complexity of the T-coloring problem for graphs with small degree.
Discret. Appl. Math.
Krzysztof Giaro, Robert Janczewski, Michal Malafiejski
2002 — conf
A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs.
APPROX
Krzysztof Giaro, Robert Janczewski, Marek Kubale, Michal Malafiejski
2001 J jnl
Divisibility and
Discret. Math.
Robert Janczewski
2001 J jnl
The smallest hard-to-color graph for algorithm DSATUR.
Discret. Math.
Robert Janczewski, Marek Kubale, Krzysztof Manuszewski, Konrad Piwakowski