Krzysztof Giaro

Publication Activity (10 Years)

Years Active: 1997-2023
Publications (10 Years): 3

Top Topics

Phylogenetic Trees

Top Venues

J. Comput. Biol.

Int. J. Appl. Math. Comput. Sci.

Discuss. Math. Graph Theory

Publications

Damian Bogdanowicz, Krzysztof Giaro
Generalization of Phylogenetic Matching Metrics with Experimental Tests of Practical Advantages. J. Comput. Biol. 30 (3) (2023)
Krzysztof Giaro, Marek Kubale
. Discuss. Math. Graph Theory 40 (3) (2020)
Damian Bogdanowicz, Krzysztof Giaro
Comparing Phylogenetic Trees by Matching Nodes Using the Transfer Distance Between Partitions. J. Comput. Biol. 24 (5) (2017)
Damian Bogdanowicz, Krzysztof Giaro
On a matching distance between rooted phylogenetic trees. Int. J. Appl. Math. Comput. Sci. 23 (3) (2013)
Damian Bogdanowicz, Krzysztof Giaro
Matching Split Distance for Unrooted Binary Phylogenetic Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 9 (1) (2012)
Damian Bogdanowicz, Krzysztof Giaro, Robert Janczewski
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem. Theor. Comput. Sci. 412 (35) (2011)
Krzysztof Giaro, Marek Kubale
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs. Discuss. Math. Graph Theory 29 (2) (2009)
Krzysztof Giaro, Marek Kubale, Pawel Obszarski
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints. Discret. Appl. Math. 157 (17) (2009)
Krzysztof Giaro, Marek Kubale
Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints. PPAM (2005)
Krzysztof Giaro, Marek Kubale
Compact scheduling of zero-one time operations in multi-stage systems. Discret. Appl. Math. 145 (1) (2004)
Michal Malafiejski, Krzysztof Giaro, Robert Janczewski, Marek Kubale
Sum Coloring of Bipartite Graphs with Bounded Degree. Algorithmica 40 (4) (2004)
Krzysztof Giaro, Robert Janczewski, Michal Malafiejski
A polynomial algorithm for finding T-span of generalized cacti. Discret. Appl. Math. 129 (2-3) (2003)
Krzysztof Giaro, Robert Janczewski, Michal Malafiejski
The complexity of the T-coloring problem for graphs with small degree. Discret. Appl. Math. 129 (2-3) (2003)
Krzysztof Giaro, Marek Kubale, Konrad Piwakowski
Complexity results on open shop scheduling to minimize total cost of operations. Int. J. Comput. Syst. Signals 3 (2) (2002)
Krzysztof Giaro, Robert Janczewski, Marek Kubale, Michal Malafiejski
A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs. APPROX (2002)
Krzysztof Giaro, Marek Kubale, Michal Malafiejski
Consecutive colorings of the edges of general graphs. Discret. Math. 236 (1-3) (2001)
Krzysztof Giaro, Marek Kubale, Michal Malafiejski, Konrad Piwakowski
Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time. PPAM (2001)
Krzysztof Giaro
NP-hardness of compact scheduling in simplified open and flow shops. Eur. J. Oper. Res. 130 (1) (2001)
Krzysztof Giaro, Marek Kubale
Edge-chromatic sum of trees and bounded cyclicity graphs. Inf. Process. Lett. 75 (1-2) (2000)
Krzysztof Giaro, Marek Kubale, Michal Malafiejski
On the Deficiency of Bipartite Graphs. Discret. Appl. Math. 94 (1-3) (1999)
Krzysztof Giaro
The complexity of consecutive D-coloring of bipartite graphs: 4 is easy, 5 is hard. Ars Comb. 47 (1997)