TCS Group at Jagiellonian - Poke

TCS Group at Jagiellonian @UCudhkyXnp3qlrLUfB5uxB3A@youtube.com

198 subscribers - no pronouns :c

Theoretical Computer Science Department of Jagiellonian Univ

Videos Playlists

Recently Uploaded Popular Oldest

Sergey Norin - Brambles, stack number and topological overlap

Marcin Briański - Separating polynomial χ-boundedness from χ-boundedness and thereabouts

Raphael Steiner - New bounds for relatives of Hadwiger's conjecture

Marek Sokołowski - Graphs of bounded twin width are quasi polynomially χ-bounded

Mathieu Mari - A (2+ε)-Approximation Algorithm for Maximum Independent Set of Rectangles

Pat Morin - Free Sets in Planar Graphs

Jarosław Byrka - (in Polish) Online Facility Location with Linear Delay

Lars Rohwedder - A 2+ϵ-approximation algorithm for preemptive weighted flow time on a single machine

Sławomir Lasota - Improved lower bound for the reachability problem of vector addition systems

James Davies - Ringel's circle problem

Grzegorz Gutowski - On a problem of Steinhaus

István Tomon - Ramsey properties of semilinear graphs

Barnaby Martin - QCSP monsters and the future of the Chen Conjecture

Jan Derbisz - (in Polish) Circular arc graphs and the Helly property

Nicolas Bousquet - Local certification of/on sparse graph classes

Zdeněk Dvořák - On asymptotic dimension of planar and geometric graphs

Torsten Mütze - Efficient generation of elimination trees and Hamilton paths on graph associahedra

David Wood - Universality in minor closed graph classes

Bartłomiej Kielak - Inducibility of small oriented graphs

Daniel Kráľ - Uniform Turán density of hypergraphs

Virginia Vassilevska-Williams - A refined laser method and slightly faster matrix multiplication

Krzysztof Turowski - Degree Distribution of Dynamic Graphs (June 16, 2021)

Paweł Rzążewski - Treewidth of graphs with forbidden induced subgraphs (June 9, 2021)

Marthe Bonamy - Exploring the space of colourings with Kempe changes (June 2, 2021)

Piotr Kawałek - (in Polish) Constant depth circuits (May 26, 2021)

Paweł Idziak - (in Polish) Modular circuits satisfiability of intermediate complexity (May 26, 2021)

Grzegorz Gutowski - Filling blanks in matrices to avoid singularity (May 12, 2021)

Louis Esperet - Universal graphs and labelling schemes (May 5, 2021)

Daniel Kráľ - Quasirandom combinatorial structures (April 28, 2021)

Paweł Gawrychowski - Fully Dynamic Longest Increasing Subsequence (April 21, 2021)

Michał Seweryn - Dimension of posets with k-outerplanar cover graphs (April 14, 2021)

Mikołaj Bojańczyk - (in Polish) Recognisable languages over monads (April 7, 2021)

Andrzej Dorobisz - Local computation algorithms for coloring of uniform hypergraphs (March 31, 2021)

Marcin Pilipczuk - (in Polish) Recent progress in understanding H-free graphs for H being a path...

Stefan Felsner - Combinatorics of Pseudocircle Arrangements (March 17, 2021)

Bartosz Walczak - Approximating Pathwidth for Graphs of Small Treewidth (March 10, 2021)