The following pages link to Sarmad Abbasi (Q290229):
Displaying 13 items.
- An \(O(n\log n)\) algorithm for finding dissimilar strings (Q290231) (← links)
- The cycle discrepancy of three-regular graphs (Q659662) (← links)
- A degree constraint for uniquely Hamiltonian graphs (Q882780) (← links)
- Improving the running time of embedded upward planarity testing (Q991781) (← links)
- How tight is the Bollobás-Komlós conjecture? (Q1576569) (← links)
- Complexity of question/answer games (Q2378516) (← links)
- (Q3166461) (← links)
- Question/Answer Games on Towers and Pyramids (Q3599117) (← links)
- An Improved Upward Planarity Testing Algorithm and Related Applications (Q3605509) (← links)
- (Q4552198) (← links)
- (Q5445377) (← links)
- Combinatorial Algorithms for Listing Paths in Minimal Change Order (Q5458510) (← links)
- An Explicit Version of Saidak’s Argument for the Infinitude of Primes (Q6618069) (← links)
