Krzysztof Giaro

发表

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

Marek Kubale, Robert Janczewski, Michal Malafiejski, 2002, APPROX.

A Note on Polynomial Algorithm for Cost Coloring of Bipartite Graphs with Δ ≤ 4

Marek Kubale, Krzysztof Giaro, 2020, Discuss. Math. Graph Theory.

A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints

Marek Kubale, Krzysztof Giaro, Pawel Obszarski, 2009, Discret. Appl. Math..

Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time

Marek Kubale, Michal Malafiejski, Krzysztof Giaro, 2001, PPAM.

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

Marek Kubale, Krzysztof Giaro, 2009, Discuss. Math. Graph Theory.

Matching Split Distance for Unrooted Binary Phylogenetic Trees

Krzysztof Giaro, Damian Bogdanowicz, D. Bogdanowicz, 2012, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

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

Marek Kubale, Krzysztof Giaro, 2004, Discret. Appl. Math..

Consecutive colorings of the edges of general graphs

Marek Kubale, Michal Malafiejski, Krzysztof Giaro, 2001, Discret. Math..

TreeCmp: Comparison of Trees in Polynomial Time

Krzysztof Giaro, Damian Bogdanowicz, Borys Wróbel, 2012, Evolutionary Bioinformatics Online.

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

Krzysztof Giaro, Damian Bogdanowicz, D. Bogdanowicz, 2017, J. Comput. Biol..

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

Krzysztof Giaro, 1997, Ars Comb..

On a matching distance between rooted phylogenetic trees

Krzysztof Giaro, Damian Bogdanowicz, D. Bogdanowicz, 2013, Int. J. Appl. Math. Comput. Sci..

KOALA Graph Theory Internet Service

Krzysztof Giaro, Krzysztof M. Ocetkiewicz, Tomasz Goluch, 2015 .

Complexity results on open shop scheduling to minimize total cost of operations

Marek Kubale, Krzysztof Giaro, Konrad Piwakowski, 2002, Int. J. Comput. Syst. Signals.

On the Deficiency of Bipartite Graphs

Marek Kubale, Michal Malafiejski, Krzysztof Giaro, 1999, Discret. Appl. Math..

Edge-chromatic sum of trees and bounded cyclicity graphs

Marek Kubale, Krzysztof Giaro, K. Giaro, 2000, Inf. Process. Lett..

A polynomial algorithm for finding T-span of generalized cacti

Robert Janczewski, Michal Malafiejski, Krzysztof Giaro, 2003, Discret. Appl. Math..

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

Marek Kubale, Krzysztof Giaro, K. Giaro, 2005, PPAM.

On an NP-hard sorting problem

Krzysztof Giaro, 2001 .

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

Krzysztof Giaro, 2001, Eur. J. Oper. Res..

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

Robert Janczewski, Krzysztof Giaro, Damian Bogdanowicz, 2011, Theor. Comput. Sci..

Sum Coloring of Bipartite Graphs with Bounded Degree

Marek Kubale, Robert Janczewski, Michal Malafiejski, 2004, Algorithmica.

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

Robert Janczewski, Michal Malafiejski, Krzysztof Giaro, 2003, Discret. Appl. Math..

Compact Scheduling In Open Shop With Zero-One Time Operations

Krzysztof Giaro, Michał Małafiejski, Marek Rubale, 1999 .