A (2+ε)-Approximation Algorithm for Maximum Independent Set of Rectangles
55:35
A (2+ε)-Approximation Algorithm for Maximum Independent Set of Rectangles
Selected Topics in Graph Theory lecture 14: Undirected Reachability in Deterministic Logspace
1:26:28
Selected Topics in Graph Theory lecture 14: Undirected Reachability in Deterministic Logspace
Selected Topics in Graph Theory lecture 13: zig-zag construction of expanders
1:29:53
Selected Topics in Graph Theory lecture 13: zig-zag construction of expanders
Selected Topics in Graph Theory lecture 12: Cheeger inequalities
1:21:31
Selected Topics in Graph Theory lecture 12: Cheeger inequalities
Flexible List Colorings with Special Degeneracy Conditions
53:28
Flexible List Colorings with Special Degeneracy Conditions
Selected Topics in Graph Theory lecture 11: Introduction to expanders
1:27:46
Selected Topics in Graph Theory lecture 11: Introduction to expanders
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
1:06:37
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
Selected Topics in Graph Theory lecture 10: chi-boundedness
1:23:35
Selected Topics in Graph Theory lecture 10: chi-boundedness
Selected Topics in Graph Theory, Lecture 9: Perfect Graphs.
1:08:41
Selected Topics in Graph Theory, Lecture 9: Perfect Graphs.
Selected Topics in Graph Theory Lecture 8: coloring planar graphs
1:33:46
Selected Topics in Graph Theory Lecture 8: coloring planar graphs
Selected Topics in Graph Theory, lecture 7: Minors in Planar Graphs
1:27:30
Selected Topics in Graph Theory, lecture 7: Minors in Planar Graphs
Selected Topics in Graph Theory Lecture 6: Robertson-Seymour theorems
1:25:24
Selected Topics in Graph Theory Lecture 6: Robertson-Seymour theorems
Selected Topics in Graph Theory Lecture 5: WQOs, Kruskal's theorem
1:15:59
Selected Topics in Graph Theory Lecture 5: WQOs, Kruskal's theorem
Reducing randomness in Isolation Lemma on decomposable graphs
52:22
Reducing randomness in Isolation Lemma on decomposable graphs
Selected Topics in Graph Theory Lecture 4: Grid Minor Theorem
1:12:25
Selected Topics in Graph Theory Lecture 4: Grid Minor Theorem
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles
49:00
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles
Vertex Deletion into Bipartite Permutation Graphs
47:52
Vertex Deletion into Bipartite Permutation Graphs
Selected Topics in Graph Theory Lecture 3: Brambles
1:29:24
Selected Topics in Graph Theory Lecture 3: Brambles
WZTG lecture 2: graph minors, treewidth
1:21:09
WZTG lecture 2: graph minors, treewidth
Selected Topics in Graph Theory, lecture 1: matchings
1:22:05
Selected Topics in Graph Theory, lecture 1: matchings
Parameterized Algorithms lecture 13: Exponential Time Hypothesis
1:29:32
Parameterized Algorithms lecture 13: Exponential Time Hypothesis
Improving Schroeppel and Shamir’s Algorithm for Subset Sum via Orthogonal Vectors
48:53
Improving Schroeppel and Shamir’s Algorithm for Subset Sum via Orthogonal Vectors
Parameterized Algorithms lecture 12: W-hardness
1:29:41
Parameterized Algorithms lecture 12: W-hardness
Parameterized Algorithms lecture 11: Representative sets
1:29:14
Parameterized Algorithms lecture 11: Representative sets
Parameterized Inapproximability for Steiner Orientation by Gap Amplification
56:38
Parameterized Inapproximability for Steiner Orientation by Gap Amplification
Parameterized Algorithms Lecture 10: LP-guided branching
1:25:10
Parameterized Algorithms Lecture 10: LP-guided branching
Parameterized Algorithms 9: Important Separators
1:26:05
Parameterized Algorithms 9: Important Separators
Parameterized Algorithms Lecture 8: Algebraic Algorithm for k-Path
1:10:49
Parameterized Algorithms Lecture 8: Algebraic Algorithm for k-Path
Parameterized Algorithms Lecture 7, part 2: Baker's technique
27:18
Parameterized Algorithms Lecture 7, part 2: Baker's technique
Parameterized Algorithms lecture 7: Inclusion-Exclusion, Fast Subset Convolution
1:07:20
Parameterized Algorithms lecture 7: Inclusion-Exclusion, Fast Subset Convolution