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.

Spring 2013

The seminars are held on Mondays at 2pm in the room G215 (Gotex, Šumavská 15, building B, 1st floor, door 2.91 b).

Date Speaker Title
June 24 Stanislav Živný TBA
June 17 Marek Krčál Computational homotopy theory
May 20 O-joung Kwon Graphs of small rank-width are pivot-minors of graphs of small tree-width
May 13 Eunjung Kim Fast algorithm for planar-F-deletion via protrusion decompostion
April 30 Vojtech Forejt Playing Stochastic Games Precisely
March 11 Michael Lampis Model Checking Lower Bounds for Simple Graphs

Autumn 2012

The seminars are held on Mondays at 2pm in the room G215 (Gotex, Šumavská 15, building B, 1st floor, door 2.91 b).

Date Speaker Title
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

Spring 2012

The seminars are held on Mondays at 2pm in the room G215 (Gotex, Šumavská 15, building B, 1st floor, door 2.91 b).

Date Speaker Title
June 13 Branislav Bosansky Double-oracle Algorithms for Solving Large Games
May 21 Pavel Pudlak Existence vs. constructibility: how difficult is it to construct a Ramsey graph?
May 14 Alexandre Duret-Lutz From PSL to Transition-based Generalized Büchi Automata
April 12 Andreas Gaiser Proving Termination of Probabilistic Programs Using Patterns
January 19 Michal Pechoucek Models, Algorithms and Applications of Security Games

Autumn 2011

The seminars are held on Mondays at 2pm in the room G215 (Gotex, Šumavská 15, building B, 1st floor, door 2.91 b).

Date Speaker Title
December 19 Patrice Ossona de Mendez Low tree depth decompositions
November 3 Andrew Treglown Embedding spanning subgraphs via degree sequence conditions
October 24 Jakub Mareček Recent Trends in Convex Programming, with Applications
October 10 Reshma Ramadurai On Induced Vertex Folkman Numbers
October 3 Krishnendu Chatterjee Partial-observation stochastic games: How to win when belief fails
September 26 Xu Chu (Dennis) Ding Provably Correct and Optimal Control Strategies for Dynamical Systems - Bridging the Gap between Computer Science and Control Design

Spring 2011

Date Speaker Title
June 15 Alexander Langer A Practical Approach to Solve Hard Optimization Problems of Graphs with Small Treewidth
May 30 Michal Koucký Exact algorithms for solving stochastic games
May 18 Luke Postle 3-Connected Minor Minimal Non-Projective Planar Graphs with an Internal 3-Separation
May 9 Dominik Wojtczak The Computational Complexity of Nash Equilibria in Stochastic Games
May 2 Demetres Christofides Randomised algorithms for the majority problem
April 18 Pavol Černý Streaming string transducers
April 11 Stefan Kiefer On Probabilistic Parallel Programs with Process Creation and Synchronisation