Algoritmy v kombinatorických úlohách
| Thesis title in Czech: | Algoritmy v kombinatorických úlohách |
|---|---|
| Thesis title in English: | Algorithms in combinatorial problems |
| Academic year of topic announcement: | 2025/2026 |
| Thesis type: | dissertation |
| Thesis language: | |
| Department: | Department of Mathematics Education (32-KDM) |
| Supervisor: | doc. RNDr. Antonín Slavík, Ph.D., DSc. |
| Author: | Mgr. Lukáš Macek - assigned and confirmed by the Study Dept. |
| Date of registration: | 01.10.2025 |
| Date of assignment: | 04.10.2025 |
| Confirmed by Study dept. on: | 12.10.2025 |
| Guidelines |
| Cílem disertační práce bude studovat algoritmické aspekty vybraných kombinatorických úloh. Pozornost bude zaměřena například na otázky výpočetní složitosti u parkovacích úloh, herní strategie, asymptotické chování her a další problémy. |
| References |
| - C. H. Yan: Parking functions. In M. Bóna (ed.), Handbook of Enumerative Combinatorics, CRC Press, 2015, 835–893
- G. Iba, J. Tanton: Candy Sharing, The American Mathematical Monthly 110 (2003), 25-35. - G. Cairns: Equitable Candy Sharing, The American Mathematical Monthly 124 (2017), 518-526. - C. Duffy, T. F. Lidbetter, M.E. Messinger, R. J. Nowakowski: A Variation on Chip-Firing: the diffusion game, Discrete Mathematics and Theoretical Computer Science 20 (2018), article no. 4. - J. Long, B. Narayanan: Diffusion on graphs is eventually periodic, Journal of Combinatorics 10 (2019), 235–241 |