List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Oracles for bounded-length shortest paths in planar graphs ACM Transactions on Algorithms | 2015-09-02 | Paper |
| Short path queries in planar graphs in constant time Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
| A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs Information Processing Letters | 2009-08-27 | Paper |
| Simple and efficient floor-planning Information Processing Letters | 2009-03-23 | Paper |
| A note on scheduling equal-length jobs to maximize throughput Journal of Scheduling | 2007-05-15 | Paper |
| SOFSEM 2005: Theory and Practice of Computer Science Lecture Notes in Computer Science | 2005-12-07 | Paper |
| scientific article; zbMATH DE number 1953089 (Why is no real title available?) | 2003-07-25 | Paper |
Research outcomes over time
This page was built for person: Maciej Kurowski
