Krzysztof Giaro - researchr alias

researchr

You are not signed in
Sign in
Sign up

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

Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphsKrzysztof Giaro, Marek Kubale. dmgt, 29(2):361-376, 2009. [doi]

A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraintsKrzysztof Giaro, Marek Kubale, P. Obszarski. DAM, 157(17):3625-3630, 2009. [doi]

2005

Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability ConstraintsKrzysztof Giaro, Marek Kubale. ppam 2006: 855-862 [doi]

2004

Compact scheduling of zero-one time operations in multi-stage systemsKrzysztof Giaro, Marek Kubale. DAM, 145(1):95-103, 2004. [doi]

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

2003

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

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]

2002

Complexity results on open shop scheduling to minimize total cost of operationsKrzysztof Giaro, Marek Kubale, Konrad Piwakowski. ijcss, 3(2):84-91, 2002. [doi]

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

Consecutive colorings of the edges of general graphsKrzysztof Giaro, Marek Kubale, Michal Malafiejski. DM, 236(1-3):131-143, 2001. [doi]

Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow TimeKrzysztof Giaro, Marek Kubale, Michal Malafiejski, Konrad Piwakowski. ppam 2002: 87-96 [doi]

NP-hardness of compact scheduling in simplified open and flow shopsKrzysztof Giaro. eor, 130(1):90-98, 2001. [doi]

2000

Edge-chromatic sum of trees and bounded cyclicity graphsKrzysztof Giaro, Marek Kubale. ipl, 75(1-2):65-69, 2000. [doi]

1999

On the Deficiency of Bipartite GraphsKrzysztof Giaro, Marek Kubale, Michal Malafiejski. DAM, 94(1-3):193-203, 1999. [doi]

1997

The complexity of consecutive D-coloring of bipartite graphs: 4 is easy, 5 is hardKrzysztof Giaro. arscom, 47, 1997.