The Art Gallery Theorem as Solution to the Watchman Problem.
48:28
Partitioning a Polygon into Monotone Pieces by the Line Sweep Method
28:02
the traveling salesman problem is NP-complete
57:30
IDWSDS 2024 - S17: Causal Inference
1:49:55
How To Speak Fluently In English About Almost Anything
42:24
An Introduction to NVIDIA Tensor Cores
37:39
the edge-dispoint paths and survey design problems solved by the Ford-Fulkerson algorithm
47:39
solving the bipartite matching problem with the Ford-Fulkerson algorithm to compute maximum flow
1:19:51