The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Maciej Kurowski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002