This seminar is organized by the Faculty of Informatics, Masaryk University. The aim is to provide a forum for visiting scientists to present their work in progress and to develop new ideas in cooperation with their colleagues at FI MU. The emphasis is on emerging topics, recent results, and open problems.
These seminars are open to everybody. The contact person is Tomáš Brázdil.
The seminars are held on Mondays at 2pm in the room C417 (FI, Botanická 68a).
|May 5||Hans Raj Tiwary||Fixed Parameter Extension Complexity|
|April 9||Alexandre Duret-Lutz||Stutter-Invariance Checks & Testing Automata|
|March 5||Daniel Kráľ||Finitely describable combinatorial limits|
|December 15||Marek Trtík||Combined Numerical Analysis of C Programs|
|November 10||Jana Tůmová||Maximally-satisfying LTL strategy synthesis for robot motion planning|
|October 20||Tereza Klimošová||Strong immersions in 4-edge connected graphs|
|December 4||Mojca Bračič||Degree-universal crossing-critical families of graphs|
|December 3||Alexandre Duret-Lutz||Strength-based decomposition of the property Büchi automaton for faster model checking|
|November 26||Diana Fischer||The Quantitative mu-Calculus|
|November 13||Ezio Bartocci||Adaptive Runtime Verification|
|November 12||Felix Reidl||Kernelization and Sparse Graph Classes|
|November 5||Michaela Šikulová||Koevoluční algoritmy v kartézském genetickém programování|
|October 1||Stefan Kiefer||Model checking stochastic branching processes|
|September 26||Sebastian Ordyniak||On Finding Optimal Polytrees|