| 2008 |
|---|
| 10 | EE | Andres Figueroa,
Avraham Goldstein,
Tao Jiang,
Maciej Kurowski,
Andrzej Lingas,
Mia Persson:
Approximate clustering of incomplete fingerprints.
J. Discrete Algorithms 6(1): 103-108 (2008) |
| 2006 |
|---|
| 9 | EE | Lukasz Kowalik,
Maciej Kurowski:
Oracles for bounded-length shortest paths in planar graphs.
ACM Transactions on Algorithms 2(3): 335-363 (2006) |
| 8 | EE | Marek Chrobak,
Christoph Dürr,
Wojciech Jawor,
Lukasz Kowalik,
Maciej Kurowski:
A Note on Scheduling Equal-Length Jobs to Maximize Throughput.
J. Scheduling 9(1): 71-73 (2006) |
| 2005 |
|---|
| 7 | EE | Andres Figueroa,
Avraham Goldstein,
Tao Jiang,
Maciej Kurowski,
Andrzej Lingas,
Mia Persson:
Approximate Clustering of Fingerprint Vectors with Missing Values.
CATS 2005: 57-60 |
| 6 | EE | Maciej Kurowski:
Planar Straight-Line Drawing in an O(n)×O(n) Grid with Angular Resolution Omega(1/n).
SOFSEM 2005: 250-258 |
| 2004 |
|---|
| 5 | EE | Marek Chrobak,
Christoph Dürr,
Wojciech Jawor,
Lukasz Kowalik,
Maciej Kurowski:
A Note on Scheduling Equal-Length Jobs to Maximize Throughput
CoRR cs.DS/0410046: (2004) |
| 4 | EE | Maciej Kurowski:
A 1.235 lower bound on the number of points needed to draw all n-vertex planar graphs.
Inf. Process. Lett. 92(2): 95-98 (2004) |
| 2003 |
|---|
| 3 | EE | Lukasz Kowalik,
Maciej Kurowski:
Short path queries in planar graphs in constant time.
STOC 2003: 143-148 |
| 2 | EE | Maciej Kurowski:
Simple and efficient floor-planning.
Inf. Process. Lett. 86(3): 113-119 (2003) |
| 2002 |
|---|
| 1 | EE | Krzysztof Diks,
Lukasz Kowalik,
Maciej Kurowski:
A New 3-Color Criterion for Planar Graphs.
WG 2002: 138-149 |
