The following pages link to Nam Dũng Hoàng (Q324837):
Displaying 12 items.
- On the path avoiding forbidden pairs polytope (Q324839) (← links)
- (Q827090) (redirect page) (← links)
- An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\) (Q827092) (← links)
- (Q1935939) (redirect page) (← links)
- Steiner tree packing revisited (Q1935940) (← links)
- QuickhullDisk: a faster convex hull algorithm for disks (Q2286150) (← links)
- Fair ticket pricing in public transport as a constrained cost allocation game (Q2341202) (← links)
- Quicker than Quickhull (Q2354631) (← links)
- (Q3391377) (← links)
- Algorithmic Cost Allocation Games: Theory and Applications (Q5176374) (← links)
- Solving Time Dependent Shortest Path Problems on Airway Networks Using Super-Optimal Wind (Q5240227) (← links)
- How Many Steiner Terminals Can You Connect in 20 Years? (Q5265171) (← links)