Sarmad Abbasi

According to our database, Sarmad Abbasi authored at least 12 papers between 1997 and 2011.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2011

The Cycle Discrepancy of Three-Regular Graphs.

Sarmad Abbasi, Laeeq Aslam

Graphs Comb., 2011

Effect of parallelism on the efficiency of binary tree search.

Sarmad Abbasi

Ars Comb., 2011

2010

Improving the running time of embedded upward planarity testing.

Sarmad Abbasi, Patrick Healy, Aimal Rextin

Inf. Process. Lett., 2010

2009

An Improved Upward Planarity Testing Algorithm and Related Applications.

Sarmad Abbasi, Patrick Healy, Aimal Rextin

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

2008

Complexity of question/answer games.

Sarmad Abbasi, Numan Sheikh

Theor. Comput. Sci., 2008

Question/Answer Games on Towers and Pyramids.

Sarmad Abbasi, Numan Sheikh

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007

Combinatorial Algorithms for Listing Paths in Minimal Change Order.

Zareen Alamgir, Sarmad Abbasi

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

2006

A Degree Constraint for Uniquely Hamiltonian Graphs.

Sarmad Abbasi, Asif Jamshed

Graphs Comb., 2006

Connection Preemption in Multi-Class Networks.

Fahad Rafique Dogar, Laeeq Aslam, Zartash Afzal Uzmi, Sarmad Abbasi, Young-Chon Kim

Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

2000

How Tight Is the Bollobás-Komlós Conjecture?

Sarmad Abbasi

Graphs Comb., 2000

On the genus of the star graphs.

Sarmad Abbasi

Ars Comb., 2000

1997

An O(n log n) Algorithm for Finding Dissimilar Strings.

Sarmad Abbasi, Anirvan Sengupta

Inf. Process. Lett., 1997