Události

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

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.