A New 3-Color Criterion for Planar Graphs. - Krzysztof Diks; Lukasz Kowalik; Maciej Kurowski (WG, 2002)

Short path queries in planar graphs in constant time. - Lukasz Kowalik; Maciej Kurowski (STOC, 2003)

Simple and efficient floor-planning. - Maciej Kurowski (Inf. Process. Lett., 2003)

A 1.235 lower bound on the number of points needed to draw all n-vertex planar graphs. - Maciej Kurowski (Inf. Process. Lett., 2004)

Approximate Clustering of Fingerprint Vectors with Missing Values. - Andres Figueroa; Avraham Goldstein; Tao Jiang 001; Maciej Kurowski; Andrzej Lingas; Mia Persson (CATS, 2005)

Planar Straight-Line Drawing in an O(n)×O(n) Grid with Angular Resolution Omega(1/n). - Maciej Kurowski (SOFSEM, 2005)

A Note on Scheduling Equal-Length Jobs to Maximize Throughput. - Marek Chrobak; Christoph Dürr; Wojciech Jawor; Lukasz Kowalik; Maciej Kurowski (J. Sched., 2006)

Oracles for bounded-length shortest paths in planar graphs. - Lukasz Kowalik; Maciej Kurowski (ACM Trans. Algorithms, 2006)

Approximate clustering of incomplete fingerprints. - Andres Figueroa; Avraham Goldstein; Tao Jiang 001; Maciej Kurowski; Andrzej Lingas; Mia Persson (J. Discrete Algorithms, 2008)