| 2006 |
|---|
| 10 | EE | Tomasz Dzido,
Marek Kubale,
Konrad Piwakowski:
On Some Ramsey and Turan-Type Numbers for Paths and Cycles.
Electr. J. Comb. 13(1): (2006) |
| 2004 |
|---|
| 9 | | Brendan D. McKay,
Konrad Piwakowski,
Stanislaw P. Radziszowski:
Ramsey Numbers for Triangles versus Almost-Complete Graphs.
Ars Comb. 73: (2004) |
| 2002 |
|---|
| 8 | EE | 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 |
|---|
| 7 | EE | Krzysztof Giaro,
Marek Kubale,
Michal Malafiejski,
Konrad Piwakowski:
Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time.
PPAM 2001: 87-96 |
| 6 | | Konrad Piwakowski,
Stanislaw P. Radziszowski:
The Ramsey Multiplicity of K4.
Ars Comb. 60: (2001) |
| 5 | EE | Robert Janczewski,
Marek Kubale,
Krzysztof Manuszewski,
Konrad Piwakowski:
The smallest hard-to-color graph for algorithm DSATUR.
Discrete Mathematics 236(1-3): 151-165 (2001) |
| 1997 |
|---|
| 4 | EE | Marek Kubale,
Jaroslaw Pakulski,
Konrad Piwakowski:
The smallest hard-to-color graph for the SL algorithm.
Discrete Mathematics 164(1-3): 197-212 (1997) |
| 3 | EE | Konrad Piwakowski:
On Ramsey number R(4, 3, 3) and triangle-free edge-chromatic graphs in three colors.
Discrete Mathematics 164(1-3): 243-249 (1997) |
| 1996 |
|---|
| 2 | EE | Marek Kubale,
Konrad Piwakowski:
A linear time algorithm for edge coloring of binomial trees.
Discrete Mathematics 150(1-3): 247-256 (1996) |
| 1 | EE | Konrad Piwakowski:
Applying Tabu Search to Determine New Ramsey Graphs.
Electr. J. Comb. 3(1): (1996) |
