Get started
Author

Sarmad Abbasi

How Tight Is the Bollobás-Komlós Conjecture?
2000 · Sarmad Abbasi · Graphs and Combinatorics · 10
Connection Preemption in Multi-Class Networks
2008 · Fahad Rafique Dogar, Laeeq Aslam, et al. · 9
A Degree Constraint for Uniquely Hamiltonian Graphs
2006 · Sarmad Abbasi, Asif Jamshed · Graphs and Combinatorics · 8
CAM01-3: Connection Preemption in Multi-Class Networks
2006 · Fahad Rafique Dogar, Laeeq Aslam, et al. · Globecom · 8
Improving the running time of embedded upward planarity testing
2010 · Sarmad Abbasi, Patrick Healy, et al. · Information Processing Letters · 7
Spanning subgraphs of dense graphs and a combinatorial problem on strings
1998 · Sarmad Abbasi, Endre Szemerédi · 5
On the Genus of the Star Graph
1993 · Abbasi, Sarmad · Rutgers University Community Repository (Rutgers University) · 4
Combinatorial Algorithms for Listing Paths in Minimal Change Order
2007 · Zareen Alamgir, Sarmad Abbasi · Springer eBooks · 3
Do Answers Help in Posing Questions
1998 · Sarmad Abbasi · 3
The Cycle Discrepancy of Three-Regular Graphs
2010 · Sarmad Abbasi, Laeeq Aslam · Graphs and Combinatorics · 2
Longest Common Consecutive Substring in Two Random Strings
1997 · Sarmad Abbasi · 2
An Improved Upward Planarity Testing Algorithm and Related Applications
2009 · Sarmad Abbasi, Patrick Healy, et al. · Lecture notes in computer science · 1
Complexity of question/answer games
2008 · Sarmad Abbasi, Numan Sheikh · Theoretical Computer Science · 1
An O(n log n) algorithm for finding dissimilar strings
1997 · Sarmad Abbasi, Anirvan Sengupta · Information Processing Letters · 1
Effect of parallelism on the efficiency of binary tree search.
2011 · Sarmad Abbasi · Ars Combinatoria
Question/Answer Games on Towers and Pyramids
2008 · Sarmad Abbasi, Numan Sheikh · Lecture notes in computer science
Works count: 19
Citation count: 64
H-index: 5
I10-index: 1
Year
Topic
Type