[FKS12]	Michal Forišek, Lucia Keller, and Monika Steinová, Advice Complexity of Online Coloring for Paths, Language and Automata Theory and Applications (LATA 2012), 2012, pp. 228-239. [ bib ]
[FS12]	Michal Forišek and Monika Steinová, Metaphors and analogies for teaching algorithms, SIGCSE '12: Proceedings of the 43rd ACM technical symposium on Computer Science Education (New York, NY, USA), ACM, 2012, pp. 15-20. [ bib ]
[For10b]	Michal Forišek, The difficulty of programming contests increases, Teaching Fundamentals Concepts of Informatics (Proceedings of ISSEP 2010) (Richard Kralovic, ed.), 2010, The original publication is available at www.springerlink.com. [ bib | .pdf ]
[FS10]	Michal Forišek and Monika Steinová, Didactic Games For Teaching Information Theory, Teaching Fundamentals Concepts of Informatics (Proceedings of ISSEP 2010) (Richard Kralovic, ed.), 2010, The original publication is available at www.springerlink.com. [ bib | .pdf ]
[For10a]	Michal Forišek, Computational complexity of two-dimensional platform games, Proceedings of Fun with Algorithms 2010, 2010, The original publication is available at www.springerlink.com. [ bib | .pdf ]
[BFO+10]	Hans-Joachim Böckenhauer, Michal Forišek, Ján Oravec, Björn Steffen, Kathleen Steinhöfel, and Monika Steinová, The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification, RAIRO Theoretical Informatics and Applications 44 (2010). [ bib | DOI ]
[For09b]	Michal Forišek, Using Item Response Theory To Rate (Not Only) Programmers, Olympiads in Informatics (Valentina Dagiene, ed.), vol. 3, 2009, pp. 3-16. [ bib | .pdf ]
[For09a]	Michal Forišek, Theoretical and Practical Aspects of Programming Contest Ratings, Ph.D. thesis, Comenius University Bratislava, 2009. [ bib | .pdf ]
[For08]	Michal Forišek, Rating Algorithms For Programming Contests, 2008, Rigorous Thesis, Comenius University Bratislava. [ bib ]
[FKK+07]	Michal Forišek, Branislav Katreniak, Jana Katreniaková, Rastislav Kralovič, Richard Královič, Vladimír Koutný, Dana Pardubská, Tomáš Plachetka, and Branislav Rovan, Online bandwidth allocation, Algorithms - ESA 2007 (Lars Arge, Michael Hoffmann, and Emo Welzl, eds.), Lecture Notes in Computer Science, vol. 4698, Springer, 2007, pp. 546-557. [ bib ]
[For07b]	Michal Forišek, Slovak IOI 2007 Team Selection and Preparation, Olympiads in Informatics (Valentina Dagiene, ed.), vol. 1, 2007. [ bib | .pdf ]
[For07a]	Michal Forišek, Approximating Rational Numbers by Fractions, Fun with Algorithms, 2007, The original publication is available at www.springerlink.com, pp. 156-165. [ bib | .pdf ]
[For06b]	Michal Forišek, On the Suitability of Programming Tasks for Automated Evaluation, Informatics in Education 5 (2006), 63-76. [ bib | .pdf ]
[For06a]	Michal Forišek, Security of Programming Contest Systems, Information Technologies at School (Valentina Dagiene and Roland Mittermeir, eds.), 2006, pp. 553-563. [ bib | .pdf ]
[FW06]	Michal Forišek and Michal Winczer, Non-formal Activities as Scaffolding to Informatics Achievement, Information Technologies at School (Valentina Dagiene and Roland Mittermeir, eds.), 2006, pp. 529-534. [ bib | .pdf ]
[For05b]	Michal Forišek, Representation of Integers and Reals, Published by TopCoder, Inc. http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=integersReals. [ bib ]
[For05a]	Michal Forišek, Computational Complexity, Published by TopCoder, Inc. http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=complexity1. [ bib ]
[For04]	Michal Forišek, On suitability of tasks for the IOI competition, Personal communication to the IOI General Assembly. [ bib | .html ]