11 results on '"Nagamochi, Hiroshi"'
Search Results
2. Extending Steinitz’s Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra
3. Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings
4. A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs
5. Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
6. Convex drawings of hierarchical planar graphs and clustered planar graphs.
7. An algorithm for constructing star-shaped drawings of plane graphs
8. Drawing slicing graphs with face areas
9. Convex drawings of graphs with non-convex boundary constraints
10. Drawing c-planar biconnected clustered graphs
11. On the one-sided crossing minimization in a bipartite graph with large degrees
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.