dblp.uni-trier.dewww.uni-trier.de

Maciej Kurowski

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
10EEAndres 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
9EELukasz Kowalik, Maciej Kurowski: Oracles for bounded-length shortest paths in planar graphs. ACM Transactions on Algorithms 2(3): 335-363 (2006)
8EEMarek 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
7EEAndres Figueroa, Avraham Goldstein, Tao Jiang, Maciej Kurowski, Andrzej Lingas, Mia Persson: Approximate Clustering of Fingerprint Vectors with Missing Values. CATS 2005: 57-60
6EEMaciej Kurowski: Planar Straight-Line Drawing in an O(n)×O(n) Grid with Angular Resolution Omega(1/n). SOFSEM 2005: 250-258
2004
5EEMarek 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)
4EEMaciej 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
3EELukasz Kowalik, Maciej Kurowski: Short path queries in planar graphs in constant time. STOC 2003: 143-148
2EEMaciej Kurowski: Simple and efficient floor-planning. Inf. Process. Lett. 86(3): 113-119 (2003)
2002
1EEKrzysztof Diks, Lukasz Kowalik, Maciej Kurowski: A New 3-Color Criterion for Planar Graphs. WG 2002: 138-149

Coauthor Index

1Marek Chrobak [5] [8]
2Krzysztof Diks [1]
3Christoph Dürr [5] [8]
4Andres Figueroa [7] [10]
5Avraham Goldstein [7] [10]
6Wojciech Jawor [5] [8]
7Tao Jiang [7] [10]
8Lukasz Kowalik [1] [3] [5] [8] [9]
9Andrzej Lingas [7] [10]
10Mia Persson [7] [10]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)