The following pages link to Francis Suraweera (Q673228):
Displayed 16 items.
- NC algorithms for the Single Most Vital Edge problem with respect to shortest paths (Q673229) (← links)
- A parallel cost-optimal algorithm to compute the supremum of max-min powers (Q1195163) (← links)
- An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem (Q1209346) (← links)
- FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS (Q2999094) (← links)
- (Q3123382) (← links)
- (Q3338324) (← links)
- The Rectilinear k-Bends TSP (Q3578326) (← links)
- (Q3710539) (← links)
- Use of Doubly Chained Tree Structures in File Organisation for Optimal Searching (Q3714491) (← links)
- Classroom notes Integer solutions of the equation y<sup>2</sup> = 3x<sup>3</sup> − 3 (Q3728979) (← links)
- Minimum-Entropy Tree Structures with a Given Terminal Node Assignment (Q3754631) (← links)
- Analysis of a Modified Address Calculation Sorting Algorithm (Q3813308) (← links)
- (Q4329061) (← links)
- (Q4430846) (← links)
- (Q4929402) (← links)
- Reduction rules deliver efficient FPT-algorithms for covering points with lines (Q5406200) (← links)