Conference program

Proceedings

Printed proceedings were distributed to each participant.

The electronic proceedings of the symposium have been published, please see http://www.doria.fi/handle/10024/143322.

Program

The conference is held at The university of Turku, in building Quantum. The building is located at the top of the so-called “university hill”. The talks are held in the Quantum auditorium, except on Wednesday, when talks are in lecture room XVI in the first floor of Quantum building.

The address of the building is “Quantum, Vesilinnantie 5, 20500 Turku”. Please see the map under the section “Useful Info” to get an idea of the campus.

Monday 15th
18:00 – 21:00 Get-together and registration
Tuesday 16th
8:30 – Registration
8:50 – 9:00 Opening words: Rector Kalervo Väänänen
9:00 – 10:00 Invited talk:
Alexandr Kostochka
Recent results on disjoint and longest cycles in graphs
10:00 – 10:30 Coffee break
10:30 – 11:00 Danila Cherkashin, Fedor Petrovy
On small n-uniform hypergraphs with positive discrepancy
11:00 – 11:30 Ville Junnila, Tero Laihonen, Gabrielle Paris
Location in circulant graphs
11:30 – 12:00 A.V. Pastor
On critically 3-connected graphs with exactly two vertices of degree 3
12:00 – 13:30 Lunch
13:30 – 14:30 Invited talk:
Volker Diekert
Solving equations in free partially commutative monoids: developments over the past 20 years
14:30 – 15:00 Esa Sahla
A New Proof for Undecidability of the Bi-Infinite Post Correspondence Problem
15:00 – 15:30 Coffee break
15:30 – 16:00 Marina Maslennikova, Emanuele Rodaro
Trim Strongly Connected Synchronizing Automata and Ideal Languages
16:00 – 16:30 Andrew Ryzhikov, Anton Shemyakov
Subset Synchronization in Monotonic Automata
16:30 – 17:00 Vladimir V. Gusev, Elena Pribavkina, Marek Szykula
Around the Road Coloring Theorem
Wednesday 17th – LECTURE ROOM XVI
9:00 – 10:00 Invited talk:
Väänänen
On the logic of dependence and independence
10:00 – 10:30 Coffee break
10:30 – 11:00 Antti Valmari, Lauri Hella
The Logics Taught and Used at High schools Are Not the Same
11:00 – 11:30 Yaroslav Salii
Order-theoretic characteristics and dynamic programming for precedence constrained TSP
11:30 – 12:00 Ilia Ponomarenko
– Testing Isomorphism of Central Cayley Graphs Over Almost Simple Groups in Polynomial Time
12:00 – 13:30 Lunch
13:30 – 14:30 Invited talk:
Aleksi Saarela
Studying word equations by geometric and algebraic methods
14:30 – 15:00 Aleksei Yu. Kondratev, Vladimir V. Mazalov
Nucleolus as Tournament Solution
15:00 – 15:30 Coffee break
15:30 – 16:00 Vladimir D. Matveenko, Alexei V. Korolev
Network analysis based on a typology of nodes
16:00 – 16:30 Kamil Khadiev, Rishat Ibrahimov
Width Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams with Repeated Test
16:30 – 17:00 Elena Bozhenkova, Irina Virbitskaite
Some Space-Time Characteristics of Relational Structures
Thursday 18th
9:00 – 10:00 Invited talk:
Alexei Miasnikov
Non-commutative discrete optimization: geometry, compression, and complexity
10:00 – 10:30 Coffee break
10:30 – 11:00 Dmitri V. Karpov
Large contractible subgraphs of a 3-connected graph
11:00 – 11:30 Ville Junnila, Tero Laihonen, Tuomo Lehtilä
Two New Classes of Locating-Dominating Codes
11:30 – 12:00 Vladimir Edemskiy, Nikita Sokolovskiy, Aleksandra Tsurina
Notes about the linear complexity of cyclotomic sequences of order six and appropriate cyclic codes
12:00 – 13:30 Lunch
13:30 – 14:00 Sergey Afonin
Decision Problems and Application of Rational Sets of Regular Languages
14:00 – 14:30 Anni Hakanen, Tero Laihonen
On resolving several objects in the king grid
14:30 – 15:00 Spare time
15:00 – 19:00 City Excursion
19:00 – Symposium Dinner
Friday 19th
9:00 – 10:00 Invited talk:
Igor Potapov
Decision problems in matrix semigroups: limitations and algorithms
10:00 – 10:30 Coffee break
10:30 – 11:00 A.E. Guterman, A.M. Maksaev
On the scrambling index of non-negative matrices
11:00 – 11:30 Jarkko Peltomäki, Ville Salo
On winning shifts of generalized Thue-Morse substitutions
11:30 – 12:00 Anna Rettieva
Cooperation in Dynamic Multicriteria Games with Random Horizons
12:00 – 13:30 Lunch
13:30 – 14:00 Yana Teplitskaya
Regularity of the maximal distance minimizers
14:00 – 14:30 Irina Cheplyukova, Yuri Pavlov
On the dynamics of a confguration graph with random vertex degrees and bounded number of edges
14:30 – 15:00 Marina Leri, Yuri Pavlov
On robustness of configuration graphs in random environment
15:00 – 15:30 Coffee break
15:30 – End of Symposium

1,252 total views, 1 views today