Monday seminar

Our regular monday seminar takes place at Faculty of Information Technology in building TH:A, room 1247. We start at 01:00 PM, refreshment 🍽️ is usually available from 12:15 PM in the kitchen on the same floor. All talks are streamed via Zoom.

Next seminar ()

Jan Volec: Sidorenko property and quasirandomness in regular tournaments

We give a complete characterization of tournaments \(H\) that have the Sidorenko property with respect to nearly regular tournaments, i.e., the density of \(H\) among all nearly regular tournaments is minimized by a random tournament. Our result answers two questions of Noel, Ranganathan and Simbaqueba regarding quasirandom forcing in the setting of nearly regular tournaments.

This is a joint work with Dan Kráľ, Matjaž Krnc, Filip Kučerák and Bernard Lidický.

Full Schedule

13 Apr 2026 David Bradley-Williams Extending partial automorphisms of graphs
30 Mar 2026 Ondřej Suchý Parameterized Complexity of Directed Traveling Salesman Problem
23 Mar 2026 Jan Volec Sidorenko property and quasirandomness in regular tournaments
16 Mar 2026 Krisztina Szilágyi A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs 🎥
9 Mar 2026 Mykhaylo Tyomkyn On plane rigidity matroids 🎥
2 Mar 2026 Joanna Jasińska Permuton limit of a generalization of the Mallows and k-card-minimum models 🎥
23 Feb 2026 Max Julius Frommknecht SAT-Based Large Neighborhood Search for Multi-Agent Pathfinding 🎥
16 Feb 2026 Niall Smith Discrepancy of Hamilton Cycles in Random Subgraphs 🎥
15 Dec 2025 Frederik Garbe Infinitely Many Counterexamples to a Conjecture of Lovász 🎥
8 Dec 2025 Foivos Fioravantes Exact Algorithms for Distance to Unique Vertex Cover
1 Dec 2025 Robert Hancock Typical Ramsey properties of the primes and abelian groups 🎥
24 Nov 2025 Jan Grebík Translational monotilings 🎥
3 Nov 2025 Maria Saumell Mendiola Guarding a 1.5D terrain with Imprecise Viewpoints 🎥
27 Oct 2025 Jan Jedelský Transductions between sparse graph classes
20 Oct 2025 Krisztina Szilágyi Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees 🎥
13 Oct 2025 Jan Matyáš Křišťan Heterogeneous facility location game with discrete utility 🎥
29 Sep 2025 Tomáš Jakl A categorical view on the Constraint Satisfaction Problem: the wonderland of adjunctions
22 Sep 2025 Petr Laštovička NAC-coloring search: complexity and algorithms 🎥
23 Jun 2025 Eduard Eiben The Parameterized Complexity of Coordinated Motion Planning
12 May 2025 Daniela Černá Shattering triples with six permutations 🎥
5 May 2025 Alexander Clifton Rainbow Separating Path Systems 🎥
28 Apr 2025 Michal Opler Solving Multiagent Path Finding on Highly Centralized Networks 🎥
14 Apr 2025 Bartłomiej Kielak Curves on the torus with few intersections 🎥
7 Apr 2025 Jan Starý Ultrafilters as dictators 🎥
31 Mar 2025 Lluís Sabater Rojas Eliminating Majority Illusions 🎥
24 Mar 2025 Václav Blažej On the Parameterized Complexity of Eulerian Strong Component Arc Deletion 🎥
17 Mar 2025 Herman Goulet-Ouellet Density of group languages under ergodic probability measures 🎥
3 Mar 2025 Václav Rozhoň Applications of beyond-worst-case heaps 🎥
24 Feb 2025 Jan Matyáš Křišťan Decreasing verification radius in local certification 🎥
17 Feb 2025 Petr Šťastný Symbolic Execution of Interpreted Languages 🎥
9 Dec 2024 Václav Blažej Flow Augmentation - Solving edge cutting problems using a cutting-edge method
2 Dec 2024 Tung Anh Vu (Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs 🎥
25 Nov 2024 Ondřej Suchý Parameterized Algorithms for Traveling Salesperson Problem and Its Generalizations 🎥
18 Nov 2024 Krisztina Szilágyi XNLP-hardness of Parameterized Problems on Planar Graphs 🎥
11 Nov 2024 Jan Legerský Flexibility, NAC-colorings and stable cuts 🎥
4 Nov 2024 Foivos Fioravantes A parameterized point of view on forming small coalitions 🎥
21 Oct 2024 Tomáš Jakl Introducing project ALGACOM - Algorithms and Game Comonads
14 Oct 2024 Manolis Vasilakis Structural Parameterizations for Bounded Degree Vertex Deletion Revisited 🎥
7 Oct 2024 Michal Opler An Optimal Algorithm for Sorting Pattern-Avoiding Sequences 🎥
30 Sep 2024 Nikolaos Melissinos Parameterised distance to local irregularity 🎥
23 Sep 2024 Tesshu Hanaka Multi Agent Path Finding with Crossing Cost 🎥
23 Sep 2024 Hirotaka Ono Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover 🎥
13 May 2024 Pavel Dvořák Almost Complete Characterization of Functionality of Random Graphs 🎥
6 May 2024 Michal Opler Optimization with pattern-avoiding input 🎥
29 Apr 2024 Jan Matyáš Křišťan Reconfiguration Using Generalized Token Jumping 🎥
22 Apr 2024 Grzegorz Lisowski Discovering Hidden Subelections 🎥
15 Apr 2024 Jan Starý Ramsey properties of ultrafilters 🎥
8 Apr 2024 Jan Volec Subgraphs with a positive minimum semidegree in digraphs with large outdegree 🎥
25 Mar 2024 José Gaspar Smutný The Parameterized Complexity of Maximum Betweenness Centrality 🎥
18 Mar 2024 Foivos Fioravantes Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology
11 Mar 2024 Dominika Draesslerová Taxonomic classification with maximal exact matches in KATKA kernels and minimizer digests
26 Feb 2024 Štěpán Plachý Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching 🎥
19 Feb 2024 Radovan Červený Generating faster algorithms for d-Path Vertex Cover 🎥
18 Dec 2023 Gaurav Kucheriya Characterization of edge-ordered graphs with linear extremal functions
11 Dec 2023 Maria Saumell Mendiola Computing largest minimum color-spanning intervals of imprecise points
4 Dec 2023 Michal Opler The Hierarchy of Hereditary Sorting Operators 🎥
27 Nov 2023 Matěj Konečný EPPA numbers of graphs 🎥
20 Nov 2023 Arun Kumar Das Approximation Algorithms for Orthogonal Line Centers
13 Nov 2023 Denys Bulavka Strict Erdős-Ko-Rado theorems for simplicial complexes 🎥
6 Nov 2023 Martin Doležal Categorical approach to graph limits
30 Oct 2023 Nikolaos Melissinos Odd Chromatic Number of Graph Classes 🎥
23 Oct 2023 Jan Matyáš Křišťan Shortest Dominating Set Reconfiguration under Token Sliding 🎥
16 Oct 2023 Rostilav Horčík Classical Planning and Cost-Adversarial Planning Games 🎥
9 Oct 2023 Foivos Fioravantes Recontamination helps a lot to hunt a rabbit 🎥
2 Oct 2023 Ondřej Guth On expressive power of regular expressions with subroutine calls and lookaround assertions 🎥
25 Sep 2023 Pavel Dvořák Sliding Window Algorithms for Weighted Matching 🎥
5 Jun 2023 Harmender Gahlawat On the cop number of string graphs 🎥
22 May 2023 Ivan Bliznets Fair Division with Minimal Withheld Information in Social Networks 🎥
15 May 2023 Michal Dvořák Establishing Herd Immunity is Hard Even in Simple Geometric Networks 🎥
2 May 2023 Kristýna Pekárková Matrices with Bounded Graver Bases
24 Apr 2023 Jan Starý Unfriendly Partitions 🎥
17 Apr 2023 Vít Jelínek On Fishburn numbers 🎥
3 Apr 2023 Štěpán Plachý On the smallest synchronizing terms of finite tree automata
27 Mar 2023 Kristina Asimi Promise CSP (standard and seen from the other side) 🎥
20 Mar 2023 Kristian Hengster-Movric Models of Disagreement and Polarization on Social Networks 🎥
13 Mar 2023 Václav Blažej Constrained Level Planarity
6 Mar 2023 Nikolaos Melissinos Digraph Coloring and Distance to Acyclicity 🎥
27 Feb 2023 Radek Hušek Counting Cycle Double Covers 🎥
20 Feb 2023 Jan Pokorný The Parameterized Complexity of Network Microaggregation 🎥
12 Dec 2022 Jan Hubička Introduction to big Ramsey degrees 🎥
5 Dec 2022 Jakub Balabán Bounding twin-width using red potential 🎥
28 Nov 2022 Georg Grasegger Paradoxical motions and edge colorings
21 Nov 2022 Kateřina Trlifajová Sizes of countable sets 🎥
14 Nov 2022 Tung Anh Vu Capacitated k-Center in Low Doubling and Highway Dimension
7 Nov 2022 Foivos Fioravantes Complexity of Finding Maximum Locally Irregular Induced Subgraphs 🎥
31 Oct 2022 Michal Opler Griddings of permutations and hardness of pattern matching
24 Oct 2022 Václav Blažej On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations 🎥
17 Oct 2022 Jan Matyáš Křišťan Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set 🎥
10 Oct 2022 Jocelyn Thiebaut Sparse tournaments and their generalisation 🎥
3 Oct 2022 Dušan Knop Scheduling Kernels via Configuration LP
26 Sep 2022 Antonio Bellon Time-Varying Semidefinite Programming: Geometry of the Trajectory of Solutions 🎥
19 Sep 2022 Jan Volec The sixth Ramsey number is at most 147
2 May 2022 Petr Fišer SAT-Based Generation of Optimum Circuits 🎥
25 Apr 2022 Pavel Paták Shellability 🎥
11 Apr 2022 Francesco Dolce Representing infinite words on cellular automata
4 Apr 2022 Tomáš Jakl Game comonads in Finite Model Theory 🎥
28 Mar 2022 Michal Opler Long paths, deep trees and permutation pattern-counting 🎥
14 Mar 2022 Jan Legerský Flexibility of braced Penrose tilings and other infinite frameworks 🎥
7 Mar 2022 Sanjukta Roy Fractional Matchings under Preferences: Stability and Optimality 🎥
28 Feb 2022 Pavel Hrabák Agents Heterogeneity in Cellular Models of Pedestrian Flow 🎥
21 Feb 2022 Christoph Kirsch Quantum Advantage for All 🎥
14 Feb 2022 Jocelyn Thiebaut On the Approximation Hardness of Geodetic Set and its Variants 🎥
13 Dec 2021 Abhishek Sahu Dynamic Parameterized Problems 🎥
6 Dec 2021 Filip Křikava Large-scale program analysis for language evolution 🎥
22 Nov 2021 Eng Keat Hng Minimum Degree Conditions for Powers of Cycles and Paths 🎥
15 Nov 2021 Maria Saumell Mendiola Minimum Color Spanning Circle in Imprecise Setup 🎥
8 Nov 2021 Ondřej Suchý Beyond Max-Cut: λ-Extendible Properties Parameterized Above the Poljak-Turzík Bound 🎥
1 Nov 2021 Robert Šámal Interval representation of balanced separators in graphs avoiding a minor 🎥
25 Oct 2021 Andreas Emil Feldmann The Parameterized Complexity of the Survivable Network Design Problem 🎥
18 Oct 2021 Václav Blažej Bears with Hats and Independence Polynomials 🎥
16 Oct 2021 Maria Saumell Mendiola Minimum Color Spanning Circle in Imprecise Setup
11 Oct 2021 Ondřej Guth Automata Approach to Inexact Tree Pattern Matching Using 1-degree Edit Distance 🎥
4 Oct 2021 Jan Volec Existence of common graphs with large chromatic number 🎥
20 Sep 2021 Radovan Červený On Kernels for d-Path Vertex Cover 🎥