Presentations in session 1

1. Adam Polak, Jagiellonian University, Fixed parameter tractability of non-preemptive multicoloring

2. Marcin Krzywkowski, University of Johannesburg, South Africa, An algorithm for listing all minimal double dominating sets of a tree

3. Andrzej Grzesik, Jagiellonian University, Finitely forcible limits of graphs and permutations

4. Hanna Furmańczyk, University of Gdańsk, Equitable total coloring of corona of cubic graphs

5. Andres Aristizabal, University of Wrocław, Deriving Labels and Bisimilarity for Timed Concurrent Constraint Programming

6. Maciej Bendkowski, Jagiellonian University, Asymptotic properties of combinatory logic

7. Mikołaj Bojańczyk, University of Warsaw, Transducers

8. Anna Bryniarska, Opole University, The t-norm valuation-based system for the database attributes configuration in the Dempster-Shafer’s theory.

Presentations in session 2

1. Stefan Dziembowski, University of Warsaw, Why the cryptographic currencies need a solid theory?

2. Maciej Obremski, University of Warsaw, Non-Malleable Reductions and their Applications

3. Marcin Dziubiński, Institute of Informatics, University of Warsaw, Individual Security and Network Design

4. Michał Karpiński, University of Wrocław, Smaller Selection Network for Encoding Cardinality Constraints.

Presentations in session 3

1. Wojciech Czerwiński, University of Warsaw, Separability problem

2. Tomasz Gogacz, Uniwersytet Wrocławski, Undecidability of determinacy of conjunctive queries.

3. Aleksandra Kiślak-Malinowska, University of Warmia and Mazury, Tupled pregroup grammars enjoy semantics.

4. Grzegorz Gutowski, Jagiellonian University, Avoiding Facial Repetitions

5. Bartłomiej Bosek, Uniwersytet Jagielloński, Harmonious Coloring of Hypergraphs

6. Tomasz Dzido, Institute of Informatics, University of Gdańsk, On a local similarity of graphs.

7. Krzysztof Sornat, University of Wrocław, PTAS for Minimax Approval Voting

8. Maciej Pacut, Uniwersytet Wrocławski, Data Locality and Replica Aware Virtual Cluster Embeddings.

9. Piotr Sankowski, University of Warsaw, Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings

Presentations in session 4

1. Jakub Łącki, University of Warsaw, Optimal Decremental Connectivity in Planar Graphs

2. Anna Zych, University of Warsaw, The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree

3. Arkadiusz Socała, University of Warsaw, Tight lower bound for the channel assignment problem.

4. Krzysztof Rzadca, Institute of Informatics, University of Warsaw, Partition with side effect

5. Klara Zielińska, University of Wrocław, Types by automata

6. Filip Murlak, University of Warsaw, Consistency of Injective Tree Patterns

7. Aleksy Schubert, Institute of Informatics, University of Warsaw, On the Mints Hierarchy in First-Order Intuitionistic Logic

8. Jerzy Tyszkiewicz, Institute of Informatics, University of Warsaw, Spreadsheets - theoretically

Presentations in session 5

1. Piotr Witkowski, University of Wrocław, Two-variable logic with counting and linear orders.

2. Adam Witkowski, University of Warsaw, Datalog and data trees.

3. Maciej Zielenkiewicz, University of Warsaw, On multiply-exponential write-once Turing machines

4. Szymon Toruńczyk, University of Warsaw, Orbit-finite Constraint Satisfaction Problems

Presentations in session 6

1. Dariusz Leniowski, University of Warsaw, Online bipartite matching in offline time

2. Łukasz Kowalik, University of Warsaw, A 13k-kernel for Planar Feedback Vertex Set via Region Decomposition

3. Karol Kosiński, Jagiellonian University, The game of overlaps

4. Hans de Nivelle, University of Wroclaw, Matching Algorithms

5. Magdalena Ryczkowska, Nicolaus Copernicus University, Design and selected applications of the PCJ Library. Joint talk with Łukasz Górski

6. Jarosław Duda, affiliation not declared, Asymmetric Numeral Systems as accurate replacement for Huffman coding

7. Jolanta Tańcula, Uniwersytet Opolski, Stability of computer network for the set delay

8. Bartosz Rybicki, Uniwersytet Wrocławski, An Improved Approximation for k-Median, and Positive Correlation in Budgeted Optimization

9. Jakub Michaliszyn, University of Wrocław, Model checking and interval temporal logics

Forum Informatyki Teoretycznej 2015