1. Approximation algorithms for disjoint st-paths with minimum activation cost;Alqahtani,2013
2. Minimum activation cost node-disjoint paths in graphs with bounded treewidth;Alqahtani,2014
3. Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks;Althaus;Wirel. Netw.,2006
4. Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph;Bhaskara,2010
5. On critically k-edge-connected graphs;Budayasa;Australas. J. Comb.,1990