Události

José Gaspar Smutný will discuss finding key network members using the Maximum Betweenness Centrality problem.

Foivos Fioravantes  from DTCS FIT will discuss Multiagent Path Finding, showing its complexity, proposing FPT algorithms, and emphasizing graph...

Dominika Draesslerová from DTCS FIT will discuss using MEMs and compressed representations like KATKA kernel for taxonomic classification,...

Štěpán Plachý from DTCS FIT will discuss an algorithm to construct four DFAs identifying shortest characteristic factors, aiding sublinear run...

Radovan Červený from DTCS FIT will discuss an automated framework for generating parameterized branching algorithms, simplifying implementation,...

Gaurav Kucheriya from MFF UK will discuss edge-ordered graphs with linear extremal functions and explores extensions to longer paths, building on...

Maria Saumell Mendiola from the DTCS will discuss a geometric facility location problem involving placing points in intervals of different colors...

Michal Opler from the DTCS, FIT CTU, will discuss the hierarchy of hereditary sorting operators, examining how different classes impact the...

Matěj Konečný from the Faculty of Mathematics and Physics, Charles University, will discuss the concept of partial automorphisms in graphs and...

Arun Kumar Das from the Department of Theoretical Computer Science, FIT CTU, will discuss approximation algorithms for orthogonal line centers.

Denys Bulavka from the Faculty of Mathematics and Physics, Charles University, will discuss strict Erdős-Ko-Rado theorems for simplicial complexes.

Martin Doležal from the Institute of Mathematics CAS will show the use of category theory not only in graph theory but also in the world of graph...

Nikolaos Melissinos from the Department of Theoretical Computer Science, FIT CTU, will initiate the systematic study of odd colouring and odd...

Jan Matyáš Křišťan from the DTCS FIT CTU will present novel algorithms that efficiently compute a shortest reconfiguration sequence between...

Foivos Fioravantes from the Department of Theoretical Computer Science, FIT CTU, will discuss the computational complexity of the “Hunters and...

Ondřej Guth from the Department of Theoretical Computer Science, FIT CTU, will discuss the expressive power of regular expressions with subroutine...