20 results on '"Nagamochi, Hiroshi"'
Search Results
2. A refined exact algorithm for Edge Dominating Set
3. Parameterized edge dominating set in graphs with degree bounded by 3
4. FPTASs for trimming weighted trees
5. Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs
6. Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
7. Cop–robber guarding game with cycle robber-region
8. Re-embedding a 1-plane graph for a straight-line drawing in linear time
9. A plane graph representation of triconnected graphs
10. Drawing slicing graphs with face areas
11. Approximating a vehicle scheduling problem with time windows and handling times
12. An improved approximation algorithm for capacitated multicast routings in networks
13. Approximability of the capacitated [formula omitted]-edge dominating set problem
14. Minimum cost source location problem with local 3-vertex-connectivity requirements
15. A robust algorithm for bisecting a triconnected graph with two resource sets
16. On the one-sided crossing minimization in a bipartite graph with large degrees
17. An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
18. Simpler algorithms for testing two-page book embedding of partitioned graphs
19. Complexity and kernels for bipartition into degree-bounded induced graphs
20. Approximability of the capacitated b-edge dominating set problem
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.