The following pages link to Ioannis Mantas (Q831708):
Displaying 7 items.
- New variants of perfect non-crossing matchings (Q831710) (← links)
- Farthest color Voronoi diagrams: complexity and algorithms (Q2081623) (← links)
- On selecting a fraction of leaves with disjoint neighborhoods in a plane tree (Q2161244) (← links)
- On selecting leaves with disjoint neighborhoods in embedded trees (Q2326573) (← links)
- (Q6052039) (← links)
- New variants of perfect non-crossing matchings (Q6180638) (← links)
- Subdivision methods for sum-of-distances problems: Fermat-Weber point, \(n\)-ellipses and the min-sum cluster Voronoi diagram (media exposition) (Q6539581) (← links)
