Computer Science – Computational Geometry
Scientist
Computer Science
Computational Geometry
Scientist
A pair of trees without a simultaneous geometric embedding in the plane
Computing roots of directed graphs is graph isomorphism hard
Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time
The density of iterated crossing points and a gap result for triangulations of finite point sets
No associations
LandOfFree
Martin Kutz does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Martin Kutz, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Martin Kutz will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-203110