Computer Science – Data Structures and Algorithms
Scientist
Computer Science
Data Structures and Algorithms
Scientist
Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles
Optimal Acyclic Hamiltonian Path Completion for Outerplanar Triangulated st-Digraphs (with Application to Upward Topological Book Embeddings)
Upward Point Set Embeddability for Convex Point Sets is in $P$
No associations
LandOfFree
Tamara Mchedlidze does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Tamara Mchedlidze, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tamara Mchedlidze will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-147598