# Maciej Kurowski

According to our database

Collaborative distances:

^{1}, Maciej Kurowski authored at least 9 papers between 2002 and 2008.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2008

J. Discrete Algorithms, 2008

2006

ACM Trans. Algorithms, 2006

J. Sched., 2006

2005

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

Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

Proceedings of the Theory of Computing 2005, 2005

2004

A 1.235 lower bound on the number of points needed to draw all <i>n</i>-vertex planar graphs.

Inf. Process. Lett., 2004

2003

Inf. Process. Lett., 2003

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2002

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002