| |
|
Maciej ŚlusarekPhD
| phone: | (+48) 12 664 75 65 | | fax: | (+48) 12 664 66 72 | | email: |  | | office: | ul. Łojasiewicza 6, 30-348 Kraków
| | room: | 3147 | | office hours: | Wednesday 14:00 - 16:00 | | |
| for students |
| |
| 
|
| research interests |
| computational geometry, homology algorithms | | approximation strategies for hard problems | | graph problems, on-line 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. |
| grants |
| 1992 - 1995 |
Computer Science in Krakow |
| |
UE project TEMPUS |
| |
JEP-4349 |
|
|
