-
PhD Position in Theoretical Algorithms or Graph and Network Visualization - Promotionsstelle (m/w/d)
interfaces. Topics of interest include: Planar and geometric graph algorithms Approximation and parameterized algorithms Clustering, embeddings, and structural graph theory Computational complexity and
-
that algorithmic parameters are tuned so that the over-approximation of the computed reachable set is small enough to verify a given specification. We will demonstrate our approach not only on ARCH benchmarks, but
Searches related to computional geometry algorithm
Enter an email to receive alerts for computional-geometry-algorithm positions