- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| j8 |      | Sarmad Abbasi: Effect of parallelism on the efficiency of binary tree search. Ars Comb. 100: 349-363 (2011) |
| j7 |  | Sarmad Abbasi, Laeeq Aslam: The Cycle Discrepancy of Three-Regular Graphs. Graphs and Combinatorics 27(1): 27-46 (2011) |
| 2010 | ||
| j6 | | Sarmad Abbasi, Patrick Healy, Aimal Rextin: Improving the running time of embedded upward planarity testing. Inf. Process. Lett. 110(7): 274-278 (2010) |
| 2009 | ||
| c4 | | Sarmad Abbasi, Patrick Healy, Aimal Rextin: An Improved Upward Planarity Testing Algorithm and Related Applications. WALCOM 2009: 334-344 |
| 2008 | ||
| j5 | | Sarmad Abbasi, Numan Sheikh: Complexity of question/answer games. Theor. Comput. Sci. 409(3): 364-381 (2008) |
| c3 | | |
| 2007 | ||
| c2 | | Zareen Alamgir, Sarmad Abbasi: Combinatorial Algorithms for Listing Paths in Minimal Change Order. CAAN 2007: 112-130 |
| 2006 | ||
| j4 | | Sarmad Abbasi, Asif Jamshed: A Degree Constraint for Uniquely Hamiltonian Graphs. Graphs and Combinatorics 22(4): 433-442 (2006) |
| c1 | | Fahad Rafique Dogar, Laeeq Aslam, Zartash Afzal Uzmi, Sarmad Abbasi, Young-Chon Kim: Connection Preemption in Multi-Class Networks. GLOBECOM 2006 |
| 2000 | ||
| j3 | | |
| j2 | | Sarmad Abbasi: How Tight Is the Bollobás-Komlós Conjecture? Graphs and Combinatorics 16(2): 129-137 (2000) |
| 1997 | ||
| j1 | | Sarmad Abbasi, Anirvan Sengupta: An O(n log n) Algorithm for Finding Dissimilar Strings. Inf. Process. Lett. 62(3): 135-139 (1997) |
| 1 | Zareen Alamgir | |
| 2 | Laeeq Aslam | |
| 3 | Fahad R. Dogar (Fahad Rafique Dogar) | |
| 4 | Patrick Healy | |
| 5 | Asif Jamshed | |
| 6 | Young-Chon Kim | |
| 7 | Aimal Rextin | |
| 8 | Anirvan Sengupta | |
| 9 | Numan Sheikh | |
| 10 | Zartash Afzal Uzmi |
Colors in the list of coauthors
Last update Sun May 19 05:22:20 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page