Krzysztof Giaro

According to our database, Krzysztof Giaro authored at least 21 papers between 1997 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Generalization of Phylogenetic Matching Metrics with Experimental Tests of Practical Advantages.

Damian Bogdanowicz, Krzysztof Giaro

J. Comput. Biol., March, 2023

2020

A note on polynomial algorithm for cost coloring of bipartite graphs with <i>? \le 4</i>.

Krzysztof Giaro, Marek Kubale

Discuss. Math. Graph Theory, 2020

2017

Comparing Phylogenetic Trees by Matching Nodes Using the Transfer Distance Between Partitions.

Damian Bogdanowicz, Krzysztof Giaro

J. Comput. Biol., 2017

2013

On a matching distance between rooted phylogenetic trees.

Damian Bogdanowicz, Krzysztof Giaro

Int. J. Appl. Math. Comput. Sci., 2013

2012

Matching Split Distance for Unrooted Binary Phylogenetic Trees.

Damian Bogdanowicz, Krzysztof Giaro

IEEE ACM Trans. Comput. Biol. Bioinform., 2012

2011

Consensus models: Computational complexity aspects in modern approaches to the list coloring problem.

Damian Bogdanowicz, Krzysztof Giaro, Robert Janczewski

Theor. Comput. Sci., 2011

2009

Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs.

Krzysztof Giaro, Marek Kubale

Discuss. Math. Graph Theory, 2009

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

2005

Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints.

Krzysztof Giaro, Marek Kubale

Proceedings of the Parallel Processing and Applied Mathematics, 2005

2004

Compact scheduling of zero-one time operations in multi-stage systems.

Krzysztof Giaro, Marek Kubale

Discret. Appl. Math., 2004

Sum Coloring of Bipartite Graphs with Bounded Degree.

Michal Malafiejski, Krzysztof Giaro, Robert Janczewski, Marek Kubale

Algorithmica, 2004

2003

A polynomial algorithm for finding T-span of generalized cacti.

Krzysztof Giaro, Robert Janczewski, Michal Malafiejski

Discret. Appl. Math., 2003

The complexity of the T-coloring problem for graphs with small degree.

Krzysztof Giaro, Robert Janczewski, Michal Malafiejski

Discret. Appl. Math., 2003

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

A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs.

Krzysztof Giaro, Robert Janczewski, Marek Kubale, Michal Malafiejski

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001

NP-hardness of compact scheduling in simplified open and flow shops.

Krzysztof Giaro

Eur. J. Oper. Res., 2001

Consecutive colorings of the edges of general graphs.

Krzysztof Giaro, Marek Kubale, Michal Malafiejski

Discret. Math., 2001

Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time.

Krzysztof Giaro, Marek Kubale, Michal Malafiejski, Konrad Piwakowski

Proceedings of the Parallel Processing and Applied Mathematics, 2001

2000

Edge-chromatic sum of trees and bounded cyclicity graphs.

Krzysztof Giaro, Marek Kubale

Inf. Process. Lett., 2000

1999

On the Deficiency of Bipartite Graphs.

Krzysztof Giaro, Marek Kubale, Michal Malafiejski

Discret. Appl. Math., 1999

1997

The complexity of consecutive D-coloring of bipartite graphs: 4 is easy, 5 is hard.

Krzysztof Giaro

Ars Comb., 1997