G²OAT seminar

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

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

Rostislav Horčík from the Artificial Intelligence Center, FEE CTU, will present a brief introduction to classical planning and applications...

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

Pavel Dvořák from Charles University and the Tata Institute of Fundamental Research, Mumbai, will discuss the maximum weighted matching problem in...

Ivan Bliznets from Utrecht University will present a study of a few graph-based problems motivated by the fair allocation of resources in a social...

Michal Dvořák, a master programme student, will give a talk on how hard it is to establish herd immunity even in simple geometric networks.

Kristýna Pekárková from the Faculty of Informatics, Masaryk University, will give a talk on Matrices with Bounded Graver Bases.

Jan Starý from the Department of Applied Mathematics, FIT CTU, will give a talk on Unfriendly Partitions.

Vít Jelínek from the Department of Applied Mathematics, Charles University, will give a talk on Fishburn numbers.