Krzysztof Giaro

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