Computer Science – Discrete Mathematics
Scientist
Computer Science
Discrete Mathematics
Scientist
Computing the obstacle number of a plane graph
Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs
Generalized Delaunay Graphs with respect to any Convex Set are Plane Graphs
Small (2,s)-colorable graphs without 1-obstacle representations
No associations
LandOfFree
Deniz Sarioz does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Deniz Sarioz, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deniz Sarioz will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-365875