Teach & Supervise

2026/2027

• Winter semester:
  • 1-AIN-152-22 Linear Algebra
  • 1-AIN-413 Graphs, Graph Algorithms and Optimization | GIT

Earlier semesters (2023–2026)

2025/2026

• Winter semester:
  • 1-AIN-152-22 Linear Algebra
  • 1-AIN-413 Graphs, Graph Algorithms and Optimization | GIT
• Summer semester:
  • 1-AIN-160 Discrete Mathematics (2)
  • 2-AIN-205: Algorithmic Solution of Hard Problems

2024/2025

• Winter semester:
  • 1-AIN-121 Discrete Mathematics (1)
  • 1-AIN-413 Graphs, Graph Algorithms and Optimization | GIT
• Summer semester:
  • 1-AIN-160 Discrete Mathematics (2)
  • 2-AIN-205: Algorithmic Solution of Hard Problems

2023/2024

• Winter semester:
  • 1-AIN-121 Discrete Mathematics (1)
  • 1-AIN-413 Graphs, Graph Algorithms and Optimization | GIT
• Summer semester:
  • 1-AIN-160 Discrete Mathematics (2)
  • 1-AIN-412/22 Logic for computer science

Theses

Supervisor

Bachelor students

• Vladyslav Peresada, Asymmetric Graphs, 2025
• Samuel Varchol, Graph neural networks and extensibility of partial graph automorphisms, 2026
• Vladimír Jančár, Machine learning for generation of graphs of given degree and girth, 2026, won dean’s award for the best bachelor thesis in informatics

Master students

• Marek Danihel, Graphs identified by Weisfeiler-Leman algorithm, 2027

Opponent

• Matúš Nemčík, Path covering number of cubic graphs, 2026
• Erik Kolesár, Adaptive Temporal Summarization Benchmark for Robust Evaluation of Pre-trained Large Language Models, 2026
• Timotea Chalupová, Token graphs, 2024

Led student projects

• https://github.com/TIS2024-FMFI/kolmogorov (Metamath graph exploration tool)