37:40Abhishek Sahu: Dynamic Parameterized Problems
A 38-minute video from G2OAT: “Abhishek Sahu: Dynamic Parameterized Problems”.
120 subscribers on YouTube
Shorts, livestreams, trailers and promos are never listed. Unless a curator approved this channel in full, only individually picked videos appear.
37:40A 38-minute video from G2OAT: “Abhishek Sahu: Dynamic Parameterized Problems”.
47:40A 48-minute video from G2OAT: “Adam Kabela: Disproving a conjecture on layered permutation density maximisers”.
51:30A 52-minute video from G2OAT: “Alexander Clifton: Rainbow Separating Path Systems”.
48:58A 49-minute video from G2OAT: “Andreas Emil Feldmann: The Parameterized Complexity of the Survivable Network Design Problem”.
36:11A 36-minute video from G2OAT: “Antonio Bellon: Time-Varying Semidefinite Programming: Geometry of the Trajectory of Solutions”.
47:07Advanced
A 47-minute video from G2OAT: “Bartłomiej Kielak: Curves on the torus with few intersections”.
59:01A 59-minute video from G2OAT: “Christoph Kirsch: Quantum Advantage for All”.
35:44A 36-minute video from G2OAT: “Daniela Černá: Shattering triples with six permutations”.
51:20A 51-minute video from G2OAT: “David Bradley-Williams: Extending partial automorphisms of graphs”.
56:08A 56-minute video from G2OAT: “David Mikšaník: Coloring graphs with Δ-1 colors”.
35:06A 35-minute video from G2OAT: “Denys Bulavka: Strict Erdős-Ko-Rado theorems for simplicial complexes”.
51:48Advanced
A 52-minute video from G2OAT: “Eduard Eiben: Removing Connected Obstacles in the Plane Is FPT”.
50:38A 51-minute video from G2OAT: “Eduard Eiben: The Parameterized Complexity of Coordinated Motion Planning”.
36:01Advanced
A 36-minute video from G2OAT: “Eng Keat Hng: Minimum degree conditions for powers of cycles and paths”.
39:26A 39-minute video from G2OAT: “Filip Křikava: Large-scale program analysis for language evolution”.
41:04Advanced
A 41-minute video from G2OAT: “Foivos Fioravantes: A parameterized point of view on forming small coalitions”.
26:21A 26-minute video from G2OAT: “Foivos Fioravantes: Complexity of Finding Maximum Locally Irregular Induced Subgraphs”.
33:06A 33-minute video from G2OAT: “Foivos Fioravantes: Recontamination helps a lot to hunt a rabbit”.
47:26A 47-minute video from G2OAT: “Francesco Dolce: On Lyndon words and Lyndon trees”.
51:55A 52-minute video from G2OAT: “Frederik Garbe: Infinitely Many Counterexamples to a Conjecture of Lovász”.
30:37A 31-minute video from G2OAT: “Grzegorz Lisowski: Discovering Hidden Subelections”.
30:15A 30-minute video from G2OAT: “Hanka Řada: Flip processes for permutations”.
36:01A 36-minute video from G2OAT: “Harmender Gahlawat: On the cop number of string graphs”.
34:20A 34-minute video from G2OAT: “Harmender Gahlawat: Subexponential Algos and Linear Kernels for Terminal Cycles in Planar Graphs”.
48:56A 49-minute video from G2OAT: “Herman Goulet-Ouellet: Density of group languages under ergodic probability measures”.
20:33A 21-minute video from G2OAT: “Hirotaka Ono: Theoretical Aspects of Generating Instances with Unique Solutions: Unique Vertex Cover”.
58:05A 58-minute video from G2OAT: “Igor Balla: The factorization norm and an inverse theorem for MaxCut”.
57:55Advanced
A 58-minute video from G2OAT: “Ioannis Eleftheriadis: Algorithmic-meta theorems via model theory”.
41:25A 41-minute video from G2OAT: “Ivan Bliznets: Fair Division with Minimal Withheld Information in Social Networks”.
45:24A 45-minute video from G2OAT: “Jakub Balabán: Bounding twin-width using red potential”.
55:03Advanced
A 55-minute video from G2OAT: “Jakub Gajarský: Efficient reversal of transductions of sparse graph classes”.
48:04A 48-minute video from G2OAT: “Jakub Mareček - On the Ergodic Control of Ensembles”.
57:38Advanced
A 58-minute video from G2OAT: “Jan Grebík: Translational monotilings”.
55:40Intro
A 56-minute video from G2OAT: “Jan Hubička: Introduction to big Ramsey degrees”.
58:05A 58-minute video from G2OAT: “Jan Legerský: Flexibility of braced Penrose tilings and other infinite frameworks”.
40:49A 41-minute video from G2OAT: “Jan Legerský: Flexibility, NAC-colorings and stable cuts”.