1. Vulnerability of scheduled networks and a generalization of Menger's theorem;Berman;Networks,1996
2. Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks;Bhadra,2003
3. Dynamic algorithms for graphs with treewidth 2;Bodlaender,1993
4. Routing in carrier-based mobile networks;Brejová,2011
5. Computing shortest, fastest, and foremost journeys in dynamic networks;Bui-Xuan;Int. J. Found. Comput. Sci.,2003