Robert Janczewski - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 23 from 23

2023

Edge coloring of graphs of signed class 1 and 2Robert Janczewski, Krzysztof Turowski, Bartlomiej Wróblewski 0001. DAM, 338:311-319, October 2023. [doi]

2022

Weighted 2-sections and hypergraph reconstructionRobert Janczewski, Pawel Obszarski, Krzysztof Turowski. TCS, 915:11-25, 2022. [doi]

Infinite chromatic gamesRobert Janczewski, Pawel Obszarski, Krzysztof Turowski, Bartlomiej Wróblewski. DAM, 309:138-146, 2022. [doi]

2021

T-colorings, divisibility and circular chromatic numberRobert Janczewski, Anna Maria Trzaskowska, Krzysztof Turowski. dmgt, 41(2):441-450, 2021. [doi]

2019

2-Coloring number revisitedRobert Janczewski, Pawel Obszarski, Krzysztof Turowski. TCS, 796:187-195, 2019. [doi]

2018

On incidence coloring of complete multipartite and semicubic bipartite graphsRobert Janczewski, Anna Malafiejska, Michal Malafiejski. dmgt, 38(1):107-119, 2018. [doi]

2016

On the hardness of computing span of subcubic graphsRobert Janczewski, Krzysztof Turowski. ipl, 116(1):26-32, 2016. [doi]

An O(n log n) algorithm for finding edge span of cactiRobert Janczewski, Krzysztof Turowski. jco, 31(4):1373-1382, 2016. [doi]

2015

2014

Interval incidence coloring of bipartite graphsRobert Janczewski, Anna Malafiejska, Michal Malafiejski. DAM, 166:131-140, 2014. [doi]

2011

Consensus models: Computational complexity aspects in modern approaches to the list coloring problemDamian Bogdanowicz, Krzysztof Giaro, Robert Janczewski. TCS, 412(35):4721-4728, 2011. [doi]

2009

The complexity of the L(p, q)-labeling problem for bipartite planar graphs of small degreeRobert Janczewski, Adrian Kosowski, Michal Malafiejski. DM, 309(10):3270-3279, 2009. [doi]

Interval Wavelength Assignment in All-Optical Star NetworksRobert Janczewski, Anna Malafiejska, Michal Malafiejski. ppam 2010: 11-20 [doi]

Greedy T-colorings of graphsRobert Janczewski. DM, 309(6):1685-1690, 2009. [doi]

2004

Sum Coloring of Bipartite Graphs with Bounded DegreeMichal Malafiejski, Krzysztof Giaro, Robert Janczewski, Marek Kubale. algorithmica, 40(4):235-244, 2004. [doi]

2003

The complexity of the T-coloring problem for graphs with small degreeKrzysztof Giaro, Robert Janczewski, Michal Malafiejski. DAM, 129(2-3):361-369, 2003. [doi]

A polynomial algorithm for finding T-span of generalized cactiKrzysztof Giaro, Robert Janczewski, Michal Malafiejski. DAM, 129(2-3):371-382, 2003. [doi]

2002

A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite GraphsKrzysztof Giaro, Robert Janczewski, Marek Kubale, Michal Malafiejski. approx 2002: 135-145 [doi]

2001

The smallest hard-to-color graph for algorithm DSATURRobert Janczewski, Marek Kubale, Krzysztof Manuszewski, Konrad Piwakowski. DM, 236(1-3):151-165, 2001. [doi]

Divisibility and ::::T::::-span of graphsRobert Janczewski. DM, 234(1-3):171-179, 2001. [doi]

Sign in or sign up to see more results.

runs on WebDSL