Follow
Krzysztof Giaro
Title
Cited by
Cited by
Year
TreeCmp: comparison of trees in polynomial time
D Bogdanowicz, K Giaro, B Wróbel
Evolutionary Bioinformatics 8, EBO. S9657, 2012
1202012
Matching split distance for unrooted binary phylogenetic trees
D Bogdanowicz, K Giaro
IEEE/ACM Transactions on Computational Biology and Bioinformatics 9 (1), 150-160, 2011
922011
Consecutive colorings of the edges of general graphs
K Giaro, M Kubale, M Małafiejski
Discrete Mathematics 236 (1-3), 131-143, 2001
692001
The complexity of consecutive D-coloring of bipartite graphs: 4 is easy, 5 is hard
K Giaro
Ars Combinatoria 47, 287-300, 1997
591997
Compact scheduling of zero–one time operations in multi-stage systems
K Giaro, M Kubale
Discrete Applied Mathematics 145 (1), 95-103, 2004
582004
On the deficiency of bipartite graphs
K Giaro, M Kubale, M Małafiejski
Discrete Applied Mathematics 94 (1-3), 193-203, 1999
581999
Consecutive edge-colorings of complete and incomplete Cartesian products of graphs
K Giaro, M Kubale
Congressus Numerantium, 143-150, 1997
561997
On a matching distance between rooted phylogenetic trees
D Bogdanowicz, K Giaro
International Journal of Applied Mathematics and Computer Science 23 (3 …, 2013
552013
Edge-chromatic sum of trees and bounded cyclicity graphs
K Giaro, M Kubale
Information Processing Letters 75 (1-2), 65-69, 2000
472000
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
K Giaro, M Kubale, P Obszarski
Discrete Applied Mathematics 157 (17), 3625-3630, 2009
452009
NP-hardness of compact scheduling in simplified open and flow shops
K Giaro
European Journal of Operational Research 130 (1), 90-98, 2001
402001
A 27/26-approximation algorithm for the chromatic sum coloring of bipartite graphs
K Giaro, R Janczewski, M Kubale, M Małafiejski
Approximation Algorithms for Combinatorial Optimization: 5th International …, 2002
352002
Compact scheduling in open shop with zero-one time operations
K Giaro, M Rubale, M Malafiejski
INFOR: Information Systems and Operational Research 37 (1), 37-47, 1999
301999
Wprowadzenie do algorytmów kwantowych
K Giaro, M Kamiński
Akademicka Oficyna Wydawnicza EXIT, 2003
262003
Compact task scheduling on dedicated processors with no waiting periods
K Giaro
PhD thesis, Technical University of Gdansk, EIT faculty, Gdansk, 1999 (in …, 1999
241999
Visual TreeCmp: Comprehensive Comparison of Phylogenetic Trees on the Web
T Goluch, D Bogdanowicz, K Giaro
Methods in Ecology and Evolution 11 (4), 494-499, 2020
192020
Comparing phylogenetic trees by matching nodes using the transfer distance between partitions
D Bogdanowicz, K Giaro
Journal of Computational Biology 24 (5), 422-435, 2017
182017
Optymalizacja dyskretna: modele i metody kolorowania grafów
M Kubale, J Białogrodzki, P Borowiecki, T Dzido, H Furmańczyk, K Giaro, ...
Wydawnictwa Naukowo-Techniczne, 2002
152002
Sum coloring of bipartite graphs with bounded degree
M Malafiejski, K Giaro, R Janczewski, M Kubale
Algorithmica 40, 235-244, 2004
142004
A correct description of the interaction between a magnetic moment and its image
K Giaro, W Gorzkowski, T Motylewski
Physica C: Superconductivity 168 (5-6), 479-481, 1990
111990
The system can't perform the operation now. Try again later.
Articles 1–20