The following pages link to Tomio Hirata (Q751324):
Displaying 21 items.
- The intersection searching problem for c-oriented polygons (Q751326) (← links)
- A sufficient condition for a graph to be weakly k-linked (Q790839) (← links)
- Edge-contraction problems (Q794164) (← links)
- A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs (Q987802) (← links)
- Finding shortest safari routes in simple polygons (Q1014417) (← links)
- Approximation algorithms for the weighted independent set problem in sparse graphs (Q1028454) (← links)
- A unified linear-time algorithm for computing distance maps (Q1350616) (← links)
- Complexity of projected images of convex subdivisions (Q1841991) (← links)
- 3-D Voronoi tessellation algorithms (Q2388259) (← links)
- A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be Hamiltonian (Q2864339) (← links)
- (Q3129924) (← links)
- AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES (Q4289632) (← links)
- Approximation algorithms for the maximum satisfiability problem (Q4375642) (← links)
- (Q4418985) (← links)
- (Q4525743) (← links)
- (Q4703908) (← links)
- CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES" (Q4949994) (← links)
- An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem (Q5301444) (← links)
- New Bounds for the Nearly Equitable Edge Coloring Problem (Q5387764) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897568) (← links)
- An approximation algorithm for MAX 3-SAT (Q6487958) (← links)
