David Eisenstat questions

David Eisenstat answers

• Divide n people into m groups k times with minimal overlap
• Dynamic (time-indexed) Maximum Flow - Ford-Fulkerson
• Square tiles merging algorithm
• Path with least maximum edge weight
• Graph labeling in which two cycles share at most one vertex
• Can we algorithmically find expected hitting time for 2D random walk without simulating/approximating?
• How to prove that lower bound of a sorting networks depth is lgn?
• Making Minimal Changes to Change Range of the Array
• How to find maximum element on left hand side of an element which is smaller than the element?
• Number of ways to tile a W x H Grid with 2 x 1 and 1 x 2 dominos?