37:31A Complexity Framework For Forbidden Subgraphs - Daniel Paulusma
A 38-minute video from DIMAP: “A Complexity Framework For Forbidden Subgraphs - Daniel Paulusma”.
DIMAP
180 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:31
53:39A tight lower bound for online bounded space hypercube bin packing - Yoshiharu Kohayakawa
A 54-minute video from DIMAP: “A tight lower bound for online bounded space hypercube bin packing - Yoshiharu Kohayakawa”.
54:03Adjacency Labelling for Planar Graphs - Piotr Micek (Jagiellonian University)
A 54-minute video from DIMAP: “Adjacency Labelling for Planar Graphs - Piotr Micek (Jagiellonian University)”.
35:45An optimal approximation algorithm for Feedback Vertex Set in Tournaments - Pranabendu Misra (CMI)
A 36-minute video from DIMAP: “An optimal approximation algorithm for Feedback Vertex Set in Tournaments - Pranabendu Misra (CMI)”.
57:19Approximating pathwidth for graphs of small treewidth - Bartosz Walczak (Jagiellonian University)
A 57-minute video from DIMAP: “Approximating pathwidth for graphs of small treewidth - Bartosz Walczak (Jagiellonian University)”.
1:00:46Better-Than-2 Approximations for Weighted Tree Augmentation - Vera Traub (ETH Zürich)
A 61-minute video from DIMAP: “Better-Than-2 Approximations for Weighted Tree Augmentation - Vera Traub (ETH Zürich)”.
55:08Clique factors in randomly perturbed graphs (and related questions) - Julia Böttcher (LSE)
A 55-minute video from DIMAP: “Clique factors in randomly perturbed graphs (and related questions) - Julia Böttcher (LSE)”.
57:45Combinatorics of Pseudocircle Arrangements - Stefan Felsner (TU Berlin)
A 58-minute video from DIMAP: “Combinatorics of Pseudocircle Arrangements - Stefan Felsner (TU Berlin)”.
52:04Convergence of square tilings to the Riemann map - Agelos Georgakopoulos (University of Warwick)
A 52-minute video from DIMAP: “Convergence of square tilings to the Riemann map - Agelos Georgakopoulos (University of Warwick)”.
57:17De Bruijn Sequence Constructions: Old and New - Aaron Williams (Williams College)
A 57-minute video from DIMAP: “De Bruijn Sequence Constructions: Old and New - Aaron Williams (Williams College)”.
1:01:35Deterministic Rounding of Dynamic Fractional Matchings - Sayan Bhattacharya (University of Warwick)
A 62-minute video from DIMAP: “Deterministic Rounding of Dynamic Fractional Matchings - Sayan Bhattacharya (University of Warwick)”.
59:23Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications - Gramoz Goranci
A 59-minute video from DIMAP: “Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications - Gramoz Goranci”.
59:05Equiangular lines, spherical two-distance sets, and spectral graph theory - Yufei Zhao (MIT)
A 59-minute video from DIMAP: “Equiangular lines, spherical two-distance sets, and spectral graph theory - Yufei Zhao (MIT)”.
1:02:22Fair division of indivisible goods - Jugal Garg
A 62-minute video from DIMAP: “Fair division of indivisible goods - Jugal Garg”.
58:21Linearly sized induced odd subgraphs - Michael Krivelevich (Tel Aviv University)
A 58-minute video from DIMAP: “Linearly sized induced odd subgraphs - Michael Krivelevich (Tel Aviv University)”.
56:13Local Problems on Grids - Jan Grebik (University of Warwick)
A 56-minute video from DIMAP: “Local Problems on Grids - Jan Grebik (University of Warwick)”.
1:00:33Low-Rank Binary Matrix Approximation in Column-Sum Norm - Fahad Panolan (IIT Hyderabad)
A 61-minute video from DIMAP: “Low-Rank Binary Matrix Approximation in Column-Sum Norm - Fahad Panolan (IIT Hyderabad)”.
1:04:17Near-Optimal Algorithms for Approximate Min-Cost Flow and Dynamic Shortest Paths
A 64-minute video from DIMAP: “Near-Optimal Algorithms for Approximate Min-Cost Flow and Dynamic Shortest Paths”.
52:18New results for polynomial χ-boundedness - Sophie Spirkl (University of Waterloo)
A 52-minute video from DIMAP: “New results for polynomial χ-boundedness - Sophie Spirkl (University of Waterloo)”.
1:04:20Permutation Patterns - Sergey Kitaev (University of Strathclyde)
A 64-minute video from DIMAP: “Permutation Patterns - Sergey Kitaev (University of Strathclyde)”.
1:02:06Positive spectrahedrons - Srinivasan Arunachalam (IBM Research)
A 62-minute video from DIMAP: “Positive spectrahedrons - Srinivasan Arunachalam (IBM Research)”.
1:04:00Problems around Helly theorem -- Gil Kalai (Hebrew University of Jerusalem)
A 64-minute video from DIMAP: “Problems around Helly theorem -- Gil Kalai (Hebrew University of Jerusalem)”.
40:39Pure-Circuit: Tight Inapproximability within PPAD - John Fearnley
A 41-minute video from DIMAP: “Pure-Circuit: Tight Inapproximability within PPAD - John Fearnley”.
1:04:12Recent Applications of Expanders to Graph Algorithms - Thatchaphol Saranurak (Uni. of Michigan)
A 64-minute video from DIMAP: “Recent Applications of Expanders to Graph Algorithms - Thatchaphol Saranurak (Uni. of Michigan)”.
46:06Recent Progress on Correlation Clustering - Vincent Cohen-Addad
A 46-minute video from DIMAP: “Recent Progress on Correlation Clustering - Vincent Cohen-Addad”.
57:11Revisiting Tardos's framework for LP: faster exact solutions using approximate solvers - László Végh
A 57-minute video from DIMAP: “Revisiting Tardos's framework for LP: faster exact solutions using approximate solvers - László Végh”.
58:04Secure Quantum Computation over Classical Networks - Atul Mantri (University of Maryland)
A 58-minute video from DIMAP: “Secure Quantum Computation over Classical Networks - Atul Mantri (University of Maryland)”.
44:22Simple Graph Algorithms that Work (Almost) Everywhere - Sagnik Mukhopadhyay
A 44-minute video from DIMAP: “Simple Graph Algorithms that Work (Almost) Everywhere - Sagnik Mukhopadhyay”.
58:50Size-Ramsey numbers of powers of tight paths - Shoham Letzter (UCL)
A 59-minute video from DIMAP: “Size-Ramsey numbers of powers of tight paths - Shoham Letzter (UCL)”.
54:42Solving hard cut problems via flow augmentation - Magnus Wahlström (Royal Holloway)
A 55-minute video from DIMAP: “Solving hard cut problems via flow augmentation - Magnus Wahlström (Royal Holloway)”.
56:35The Expander Hierarchy and its Applications to Dynamic Graph Algorithms - Harald Räcke, TU Munich
A 57-minute video from DIMAP: “The Expander Hierarchy and its Applications to Dynamic Graph Algorithms - Harald Räcke, TU Munich”.
55:46Thresholds - Jeff Kahn (Rutgers)
A 56-minute video from DIMAP: “Thresholds - Jeff Kahn (Rutgers)”.
41:51Towards derandomising Markov chain Monte Carlo - Heng Guo
A 42-minute video from DIMAP: “Towards derandomising Markov chain Monte Carlo - Heng Guo”.
59:30Trees on Trees - Jean Cardinal (Université Libre de Bruxelles)
A 60-minute video from DIMAP: “Trees on Trees - Jean Cardinal (Université Libre de Bruxelles)”.
42:16Unsplittable Flow on a Path - Fabrizio Grandoni
A 42-minute video from DIMAP: “Unsplittable Flow on a Path - Fabrizio Grandoni”.
55:37Vertex Deletion Parameterized by Elimination Distance and Even Less - Bart Jansen (TU Eindhoven)
A 56-minute video from DIMAP: “Vertex Deletion Parameterized by Elimination Distance and Even Less - Bart Jansen (TU Eindhoven)”.