Události

Alexander Clifton introduces the concept of rainbow separating path systems in graphs, which distinguish every pair of edges using color-coded paths....

Michal Opler will present new results on the complexity and algorithms for Multiagent Path Finding in highly centralized networks.

Bartłomiej Kielak will present a solution to a classical problem about curves on the torus intersecting at most k times. He proves that their...

Jan Starý will demonstrate how ultrafilters provide an elegant proof of Arrow’s theorem, showing that no fair voting system exists without a...

Lluís Sabater Rojas will present an algorithmic analysis of eliminating majority illusions in social networks. He will discuss how network topology...

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 Rozhoň 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.