| 2007 |
|---|
| 18 | EE | Adrian Kosowski,
Michal Malafiejski,
Tomasz Noinski:
Application of an Online Judge & Contester System in Academic Tuition.
ICWL 2007: 343-354 |
| 17 | EE | Adrian Kosowski,
Michal Malafiejski,
Pawel Zylinski:
Cooperative mobile guards in grids.
Comput. Geom. 37(2): 59-71 (2007) |
| 16 | EE | Lukasz Kuszner,
Michal Malafiejski:
A polynomial algorithm for some preemptive multiprocessor task scheduling problems.
European Journal of Operational Research 176(1): 145-150 (2007) |
| 15 | EE | Adrian Kosowski,
Michal Malafiejski,
Pawel Zylinski:
Packing [1, Delta] -factors in graphs of small degree.
J. Comb. Optim. 14(1): 63-86 (2007) |
| 2006 |
|---|
| 14 | EE | Adrian Kosowski,
Michal Malafiejski,
Pawel Zylinski:
An Efficient Algorithm for Mobile Guarded Guards in Simple Grids.
ICCSA (1) 2006: 141-150 |
| 13 | EE | Adrian Kosowski,
Michal Malafiejski,
Pawel Zylinski:
Fault Tolerant Guarding of Grids.
ICCSA (1) 2006: 161-170 |
| 12 | EE | Adrian Kosowski,
Michal Malafiejski,
Pawel Zylinski:
An approximation algorithm for maximum P3-packing in subcubic graphs.
Inf. Process. Lett. 99(6): 230-233 (2006) |
| 2005 |
|---|
| 11 | EE | Michal Malafiejski,
Pawel Zylinski:
Weakly Cooperative Guards in Grids.
ICCSA (1) 2005: 647-656 |
| 10 | EE | Adrian Kosowski,
Michal Malafiejski,
Pawel Zylinski:
On Bounded Load Routings for Modeling k-Regular Connection Topologies.
ISAAC 2005: 614-623 |
| 9 | EE | Adrian Kosowski,
Michal Malafiejski,
Pawel Zylinski:
Parallel Processing Subsystems with Redundancy in a Distributed Environment.
PPAM 2005: 1002-1009 |
| 2004 |
|---|
| 8 | EE | Michal Malafiejski,
Krzysztof Giaro,
Robert Janczewski,
Marek Kubale:
Sum Coloring of Bipartite Graphs with Bounded Degree.
Algorithmica 40(4): 235-244 (2004) |
| 2003 |
|---|
| 7 | EE | 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) |
| 6 | EE | 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 |
|---|
| 5 | EE | 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 |
| 2001 |
|---|
| 4 | EE | Krzysztof Giaro,
Marek Kubale,
Michal Malafiejski,
Konrad Piwakowski:
Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time.
PPAM 2001: 87-96 |
| 3 | EE | Krzysztof Giaro,
Marek Kubale,
Michal Malafiejski:
Consecutive colorings of the edges of general graphs.
Discrete Mathematics 236(1-3): 131-143 (2001) |
| 2 | EE | Michal Malafiejski:
The complexity of the chromatic sum problem on cubic planar graphs and regular graphs.
Electronic Notes in Discrete Mathematics 8: 62 (2001) |
| 1999 |
|---|
| 1 | EE | Krzysztof Giaro,
Marek Kubale,
Michal Malafiejski:
On the Deficiency of Bipartite Graphs.
Discrete Applied Mathematics 94(1-3): 193-203 (1999) |
