Události

Herman Goulet-Ouellet will present research on the densities of group languages under ergodic probability measures and their connection to...

Petr Šťastný will discuss symbolic execution, a program analysis technique that examines possible program states to provide insight into program...

Václav Blažej will introduce a method that simplifies a minimal cut into a minimum cut, enabling solutions to generalized problems like l -Bundled...

Ondřej Suchý will explore parameterized algorithms for the traveling salesman problem and its generalization, focusing on local search, structural...

Krisztina Szilágyi discusses the complexity of parameterized problems on planar graphs, particularly their hardness within the XNLP and XALP...

Foivos Fioravantes will present intractability results and efficient algorithms, including the FPT algorithm and the polynomial kernel, with insights...

Tomas Jakl proposes the use of game comonands, which have their roots in category theory, to address the limitations of parameterized complexity by...

Manolis Vasilakis will focus on the setting of structural parameterizations for graph problems, particularly how fine-grained complexity hypotheses,...

Michal Opler present a deterministic comparison-based algorithm that sorts sequences avoiding a fixed permutation π in linear time, even if π is a...

The speaker Nikolaos Melissinos (FIT CTU) will talk about the complexity of finding optimal vertex and edge controllers in graphs.

Přednášející budou z Japonska - Hirotaka Ono z Nagoya University a Tesshu Hanaka z Kyushu University.

Jan Matyáš Křišťan from the Faculty of Information Technology will discuss the problem of reconfiguration in graphical problems, where he will...

Jan Matyáš Křišťan from the Faculty of Information Technology will discuss the problem of reconfiguration in graphical problems, where he will...

Grzegorz Lisowski from the AGH University of Krakow will discuss finding consistent voter groups in ordinal elections, addressing complexity and...

Jan Starý from the Department of Applied Mathematics, FIT CTU, will discuss the corresponding Ramsey property of ultrafilters themselves.

Jan Volec from FNSPE CTU will discuss subgraphs with a positive minimum semidegree in digraphs with large outdegree