| |
|
Maciej ŚlusarekPhD
| phone: | 664 6939 | | fax: | (+48-12) 664 69 13 | | email: |  | | office: | ul. Gronostajowa 3, 30-387 Krakow
| | room: | 107 |
students info
| 
|
| research interests |
| approximation strategies for hard problems | | graph problems, on-line algorithms | | computational geometry, homology algorithms |
| selected publications |
| J.Jaromczyk, A.Pezarski, M.Ślusarek, An optimal competitive algorithm for the minimal clique covering in circular arc graphs, Proc. 19th European Workshop on Computational Geometry, Bonn, 2003, 48-51. | | T.Kaczyński, M.Mrozek, M.Ślusarek, Homology Computation by Reduction of Chain Complexes, Computers and Mathematics with Applications, 35 (1998), 59-70. | | M. Ślusarek, Optimal on-line coloring of circular arc graphs, RAIRO Informatique Theorique et Applications, 20 (1995), 423-429. | | M. Ślusarek, A coloring algorithm for interval graphs, Proc. Mathematical Foundations of Computer Science 1989, Lecture Notes in Computer Science 379, 471-480. | | M. Chrobak, M. Ślusarek, On some packing problem related to dynamic storage allocation, RAIRO Informatique Theorique et Applications, 22 (1988), 487-499. | | M. Ślusarek, A note on the dynamic storage allocation problem, Information Processing Letters, 20 (1985), 223-227. | |
|
