Explore dynamic algorithms for Longest Increasing Subsequence (LIS) and Distance to Monotonicity in this informative conference talk. Delve into problem definitions, Patience Sorting, and the dynamic setting before examining previous work and new results. Learn about runtime improvements, grid packing techniques, and an enhanced algorithm for LIS. Gain valuable insights into these fundamental computer science concepts and their practical applications in algorithmic problem-solving.