Combinatorial Algorithms: 30th International Workshop, IWOCA 2019, Pisa, Italy,
101,52 €
Combinatorial Algorithms. - Computing the k-Crossing Visibility Region of a Point in a Polygon. - On Erd's'Szekeres-type problems for k-convex point sets. - Algorithms and Hardness results on Liar's Dominating Set and k-tuple Dominating Set.
Jetzt bei Ebay:
