Tema	Nombre	Descripción
Topics and Lectures	Lecture #0: Intro
	Lecture #0: Intro (short)
	Lecture video #0: Intro
	Lecture #1: The push-relabel algorithm for the maximum flow problem
	Lecture #1: The push-relabel algorithm for the maximum flow problem (short)
	Lecture #2: Exact algorithms
	Lecture #2: Exact algorithms (long)
	Lecture #3: Approximation Algorithms
	Lecture #3: Approximation Algorithms (long)
	Lecture #4: Quadratic Program for MaxCut
	Lecture #4: Quadratic Program for MaxCut (long)
	Lecture #5: Parameterized algorithms
	Lecture #5: Parameterized algorithms (long)
	Lecture #6: Rearrangemnet distance of phylogenetic trees
	Lecture #6: Rearrangemnet distance of phylogenetic trees (long)
	Lecture #7: Randomized algorithms (long)
	Lecture #7: Randomized algorithms
	Lecture #8: Online Algorithms
	Lecture #8: Online Algorithms (long)
	Lecture #9: Succinct data structures
	Lecture #9: Succinct data structures (long)
	Lecture #10: Optimal Binary Search Trees and Splay Trees
	Lecture #10: Optimal Binary Search Trees and Splay Trees (long)
	Lecture #11: string matching (long)
	Lecture #11: string matching
	Lecture #12b: computational geometry
	Lecture #12a: probabilistic data structures
	Lecture #12b: computational geometry (long)
	Lecture #12a: probabilistic data structures (long)
	Lecture #13: Algorithms in Practice
	Lecture #13: Algorithms in Practice (long)
Exercises	LaTeX Template for exercise submissions
Literature and Additional Materials	[Goldberg, Tarjan '88] A new approach to the maximum-flow problem
	[Mann '17] The Top Eight Misconceptions about NP-Hardness
	[GW '95] Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
	[BS '05] On the computational complexity of the rooted subtree prune and regraft distance
	[RSW '06] The maximum agreement forest problem: Approximation algorithms and computational experiments
	[Jacobson '89] Space-efficient static trees and graphs