The complexity of consecutive D-coloring of bipartite graphs: 4 is easy, 5 is hard. - Krzysztof Giaro (Ars Comb., 1997)

On the Deficiency of Bipartite Graphs. - Krzysztof Giaro; Marek Kubale; Michal Malafiejski (Discret. Appl. Math., 1999)

Edge-chromatic sum of trees and bounded cyclicity graphs. - Krzysztof Giaro; Marek Kubale (Inf. Process. Lett., 2000)

Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time. - Krzysztof Giaro; Marek Kubale; Michal Malafiejski; Konrad Piwakowski (PPAM, 2001)

Consecutive colorings of the edges of general graphs. - Krzysztof Giaro; Marek Kubale; Michal Malafiejski (Discret. Math., 2001)

NP-hardness of compact scheduling in simplified open and flow shops. - Krzysztof Giaro (Eur. J. Oper. Res., 2001)

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

Complexity results on open shop scheduling to minimize total cost of operations. - Krzysztof Giaro; Marek Kubale; Konrad Piwakowski (Int. J. Comput. Syst. Signals, 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)

Compact scheduling of zero-one time operations in multi-stage systems. - Krzysztof Giaro; Marek Kubale (Discret. Appl. Math., 2004)

Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints. - Krzysztof Giaro; Marek Kubale (PPAM, 2005)

A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints. - Krzysztof Giaro; Marek Kubale; Pawel Obszarski (Discret. Appl. Math., 2009)

Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs. - Krzysztof Giaro; Marek Kubale (Discuss. Math. Graph Theory, 2009)

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

Matching Split Distance for Unrooted Binary Phylogenetic Trees. - Damian Bogdanowicz; Krzysztof Giaro (IEEE ACM Trans. Comput. Biol. Bioinform., 2012)

On a matching distance between rooted phylogenetic trees. - Damian Bogdanowicz; Krzysztof Giaro (Int. J. Appl. Math. Comput. Sci., 2013)

Comparing Phylogenetic Trees by Matching Nodes Using the Transfer Distance Between Partitions. - Damian Bogdanowicz; Krzysztof Giaro (J. Comput. Biol., 2017)

A note on polynomial algorithm for cost coloring of bipartite graphs with ? le 4. - Krzysztof Giaro; Marek Kubale (Discuss. Math. Graph Theory, 2020)

Generalization of Phylogenetic Matching Metrics with Experimental Tests of Practical Advantages. - Damian Bogdanowicz; Krzysztof Giaro (J. Comput. Biol., 2023)