110 results on '"Nakano, Shin-ichi"'
Search Results
2. Variants of Euclidean k-Center Clusterings
3. Away from Each Other
4. Escape from the Room
5. The Coverage Problem by Aligned Disks
6. Floorplans with Walls
7. One-Dimensional r-Gathering Under Uncertainty
8. Max-Min 3-Dispersion Problems
9. r-Gatherings on a Star
10. Max-Min Dispersion on a Line
11. A Simple Algorithm for r-gatherings on the Line
12. Exact Algorithms for the Max-Min Dispersion Problem
13. More Routes for Evacuation
14. Sequentially Swapping Colored Tokens on Graphs
15. Floorplans with Columns
16. Tree Enumeration
17. Assigning Proximity Facilities for Gatherings
18. Geometric Object Enumeration
19. Tree Enumeration
20. Geometric Object Enumeration
21. Enumeration, Counting, and Random Generation of Ladder Lotteries
22. On r-Gatherings on the Line
23. Long-Term and Spatial Variation in the Diversity of Littoral Benthic Macroinvertebrate Fauna in Lake Biwa, Japan
24. Developing a Regional Network of Biodiversity Observation in the Asia-Pacific Region: Achievements and Challenges of AP BON
25. Biodiversity in Aquatic Systems and Environments
26. A Dynamic Resilience Perspective Toward Integrated Ecosystem Management: Biodiversity, Landscape, and Climate
27. Predator Diversity Changes the World: From Gene to Ecosystem
28. Biodiversity Researches on Microbial Loop in Aquatic Systems
29. Origin and Diversification of Freshwater Fishes in Lake Biwa
30. Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression
31. A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares
32. A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks
33. A Compact Encoding of Unordered Binary Trees
34. Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
35. Generating All Triangulations of Plane Graphs (Extended Abstract)
36. Constant Time Generation of Linear Extensions
37. Generating Colored Trees
38. More Efficient Generation of Plane Triangulations
39. Constant Time Generation of Trees with Specified Diameter
40. Discovering Frequent Substructures in Large Unordered Trees
41. How to Obtain the Complete List of Caterpillars
42. A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
43. Efficient Generation of Plane Triangulations without Repetitions
44. Enumerating Floorplans with n Rooms
45. A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs
46. Labeling Points with Rectangles of Various Shapes
47. Efficient Generation of Triconnected Plane Triangulations
48. Rectangular Drawings of Plane Graphs Without Designated Corners
49. Convex Grid Drawings of Four-Connected Plane Graphs
50. A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.