Najnowsze publikacje

• Jerzy Jaromczyk, Andrzej Pezarski, Maciej Ślusarek, An optimal competitive algorithm for the minimal clique covering in circular arc graphs, European Workshop on Computational Geometry [EuroCG], (2003), 48-51
• Tomasz Kaczynski, Marian Mrozek, Maciej Ślusarek, Homology Computation by Reduction of Chain Complexes, Computers and Mathematics with Applications 35 (1998), 59-70
• Maciej Ślusarek, Optimal on-line coloring of circular arc graphs, RAIRO - Theoretical Informatics and Applications 20 (1995), 423-429
• Maciej Ślusarek, A coloring algorithm for interval graphs, International Symposium on Mathematical Foundations of Computer Science [MFCS], (1989), 471-480
• Marek Chrobak, Maciej Ślusarek, On some packing problem related to dynamic storage allocation, RAIRO - Theoretical Informatics and Applications 22 (1988), 487-499