 | 2012 |
|---|
| 17 |       | Damian Bogdanowicz,
Krzysztof Giaro:
Matching Split Distance for Unrooted Binary Phylogenetic Trees.
IEEE/ACM Trans. Comput. Biology Bioinform. 9(1): 150-160 (2012) |
| 2011 |
|---|
| 16 | | Damian Bogdanowicz,
Krzysztof Giaro,
Robert Janczewski:
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem.
Theor. Comput. Sci. 412(35): 4721-4728 (2011) |
| 2009 |
|---|
| 15 | | Krzysztof Giaro,
Marek Kubale,
P. Obszarski:
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints.
Discrete Applied Mathematics 157(17): 3625-3630 (2009) |
| 14 | | Krzysztof Giaro,
Marek Kubale:
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs.
Discussiones Mathematicae Graph Theory 29(2): 361-376 (2009) |
| 2005 |
|---|
| 13 | | Krzysztof Giaro,
Marek Kubale:
Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints.
PPAM 2005: 855-862 |
| 2004 |
|---|
| 12 | | Michal Malafiejski,
Krzysztof Giaro,
Robert Janczewski,
Marek Kubale:
Sum Coloring of Bipartite Graphs with Bounded Degree.
Algorithmica 40(4): 235-244 (2004) |
| 11 | | Krzysztof Giaro,
Marek Kubale:
Compact scheduling of zero-one time operations in multi-stage systems.
Discrete Applied Mathematics 145(1): 95-103 (2004) |
| 2003 |
|---|
| 10 | | Krzysztof Giaro,
Robert Janczewski,
Michal Malafiejski:
The complexity of the T-coloring problem for graphs with small degree.
Discrete Applied Mathematics 129(2-3): 361-369 (2003) |
| 9 | | Krzysztof Giaro,
Robert Janczewski,
Michal Malafiejski:
A polynomial algorithm for finding T-span of generalized cacti.
Discrete Applied Mathematics 129(2-3): 371-382 (2003) |
| 2002 |
|---|
| 8 | | Krzysztof Giaro,
Robert Janczewski,
Marek Kubale,
Michal Malafiejski:
A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs.
APPROX 2002: 135-145 |
| 7 | | Krzysztof Giaro,
Marek Kubale,
Konrad Piwakowski:
Complexity results on open shop scheduling to minimize total cost of operations.
Int. J. Comput. Syst. Signal 3(2): 84-91 (2002) |
| 2001 |
|---|
| 6 | | Krzysztof Giaro,
Marek Kubale,
Michal Malafiejski,
Konrad Piwakowski:
Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time.
PPAM 2001: 87-96 |
| 5 | | Krzysztof Giaro,
Marek Kubale,
Michal Malafiejski:
Consecutive colorings of the edges of general graphs.
Discrete Mathematics 236(1-3): 131-143 (2001) |
| 4 | | Krzysztof Giaro:
NP-hardness of compact scheduling in simplified open and flow shops.
European Journal of Operational Research 130(1): 90-98 (2001) |
| 2000 |
|---|
| 3 | | Krzysztof Giaro,
Marek Kubale:
Edge-chromatic sum of trees and bounded cyclicity graphs.
Inf. Process. Lett. 75(1-2): 65-69 (2000) |
| 1999 |
|---|
| 2 | | Krzysztof Giaro,
Marek Kubale,
Michal Malafiejski:
On the Deficiency of Bipartite Graphs.
Discrete Applied Mathematics 94(1-3): 193-203 (1999) |
| 1997 |
|---|
| 1 |  | Krzysztof Giaro:
The complexity of consecutive D-coloring of bipartite graphs: 4 is easy, 5 is hard.
Ars Comb. 47: (1997) |
Data released under the ODC-BY 1.0 license — See also our legal information page