We study the Length-Bounded Cut problem for special graph classes and from a parameterized complexity viewpoint. Here, we are given G, two vertices s t, positive integers β λ. The task is to find set F of at most edges such that each s-t-path length λ in G contains some edge F. Bazgan et al. [20] conjectured admits polynomial-time algorithm if input proper interval graph. confirm this conjectur...