An O(n log n) Algorithm for Finding Dissimilar Strings. - Sarmad Abbasi; Anirvan Sengupta (Inf. Process. Lett., 1997)

On the genus of the star graphs. - Sarmad Abbasi (Ars Comb., 2000)

How Tight Is the Bollobás-Komlós Conjecture? - Sarmad Abbasi (Graphs Comb., 2000)

Connection Preemption in Multi-Class Networks. - Fahad Rafique Dogar; Laeeq Aslam 001; Zartash Afzal Uzmi; Sarmad Abbasi; Young-Chon Kim (GLOBECOM, 2006)

A Degree Constraint for Uniquely Hamiltonian Graphs. - Sarmad Abbasi; Asif Jamshed (Graphs Comb., 2006)

Combinatorial Algorithms for Listing Paths in Minimal Change Order. - Zareen Alamgir; Sarmad Abbasi (CAAN, 2007)

Question/Answer Games on Towers and Pyramids. - Sarmad Abbasi; Numan Sheikh (MFCS, 2008)

Complexity of question/answer games. - Sarmad Abbasi; Numan Sheikh (Theor. Comput. Sci., 2008)

An Improved Upward Planarity Testing Algorithm and Related Applications. - Sarmad Abbasi; Patrick Healy; Aimal Rextin (WALCOM, 2009)

Improving the running time of embedded upward planarity testing. - Sarmad Abbasi; Patrick Healy; Aimal Rextin (Inf. Process. Lett., 2010)

Effect of parallelism on the efficiency of binary tree search. - Sarmad Abbasi (Ars Comb., 2011)

The Cycle Discrepancy of Three-Regular Graphs. - Sarmad Abbasi; Laeeq Aslam 001 (Graphs Comb., 2011)