 | 2011 |
|---|
| 11 |       | Sarmad Abbasi,
Laeeq Aslam:
The Cycle Discrepancy of Three-Regular Graphs.
Graphs and Combinatorics 27(1): 27-46 (2011) |
| 2010 |
|---|
| 10 | | Sarmad Abbasi,
Patrick Healy,
Aimal Rextin:
Improving the running time of embedded upward planarity testing.
Inf. Process. Lett. 110(7): 274-278 (2010) |
| 2009 |
|---|
| 9 | | Sarmad Abbasi,
Patrick Healy,
Aimal Rextin:
An Improved Upward Planarity Testing Algorithm and Related Applications.
WALCOM 2009: 334-344 |
| 2008 |
|---|
| 8 | | Sarmad Abbasi,
Numan Sheikh:
Question/Answer Games on Towers and Pyramids.
MFCS 2008: 83-95 |
| 7 | | Sarmad Abbasi,
Numan Sheikh:
Complexity of question/answer games.
Theor. Comput. Sci. 409(3): 364-381 (2008) |
| 2007 |
|---|
| 6 | | Zareen Alamgir,
Sarmad Abbasi:
Combinatorial Algorithms for Listing Paths in Minimal Change Order.
CAAN 2007: 112-130 |
| 2006 |
|---|
| 5 | | Fahad Rafique Dogar,
Laeeq Aslam,
Zartash Afzal Uzmi,
Sarmad Abbasi,
Young-Chon Kim:
Connection Preemption in Multi-Class Networks.
GLOBECOM 2006 |
| 4 | | Sarmad Abbasi,
Asif Jamshed:
A Degree Constraint for Uniquely Hamiltonian Graphs.
Graphs and Combinatorics 22(4): 433-442 (2006) |
| 2000 |
|---|
| 3 |  | Sarmad Abbasi:
On the genus of the star graphs.
Ars Comb. 55: (2000) |
| 2 | | Sarmad Abbasi:
How Tight Is the Bollobás-Komlós Conjecture?
Graphs and Combinatorics 16(2): 129-137 (2000) |
| 1997 |
|---|
| 1 | | Sarmad Abbasi,
Anirvan Sengupta:
An O(n log n) Algorithm for Finding Dissimilar Strings.
Inf. Process. Lett. 62(3): 135-139 (1997) |
Data released under the ODC-BY 1.0 license — See also our legal information page