27 citations · 100 across the 31 of their papers we have counts for
1 paper · 2 filters
Aaron Adcock, Erik D. Demaine, Martin L. Demaine +4
When can t terminal pairs in an m×n grid be connected by t vertex-disjoint paths that cover all vertices of the grid? We prove that this problem is NP-complete. Our ha…