This sesssion starts at 10:30 and ends at 12:46.| Time | Name | Affiliation | Talk title |
|---|
| 10:30 | Adam Polak | Jagiellonian University | Fixed parameter tractability of non-preemptive multicoloring
|
| 10:47 | Marcin Krzywkowski | University of Johannesburg, South Africa | An algorithm for listing all minimal double dominating sets of a tree
|
| 11:04 | Andrzej Grzesik | Jagiellonian University | Finitely forcible limits of graphs and permutations
|
| 11:21 | Hanna Furmańczyk | University of Gdańsk | Equitable total coloring of corona of cubic graphs |
| 11:38 | Andres Aristizabal | University of Wrocław | Deriving Labels and Bisimilarity for Timed Concurrent Constraint Programming
|
| 11:55 | Maciej Bendkowski | Jagiellonian University | Asymptotic properties of combinatory logic |
| 12:12 | Mikołaj Bojańczyk | University of Warsaw | Transducers
|
| 12:29 | Anna Bryniarska | Opole University | The t-norm valuation-based system for the database attributes configuration in the Dempster-Shafer’s theory.
|
Forum Informatyki Teoretycznej 2015