40 results on '"Nakano, Shin-ichi"'
Search Results
2. Away from Each Other
3. One-Dimensional r-Gathering Under Uncertainty
4. r-Gatherings on a Star
5. Max-Min Dispersion on a Line
6. A Simple Algorithm for r-gatherings on the Line
7. Exact Algorithms for the Max-Min Dispersion Problem
8. Sequentially Swapping Colored Tokens on Graphs
9. Floorplans with Columns
10. Enumeration, Counting, and Random Generation of Ladder Lotteries
11. On r-Gatherings on the Line
12. Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression
13. A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares
14. A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks
15. Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
16. Generating All Triangulations of Plane Graphs (Extended Abstract)
17. Constant Time Generation of Linear Extensions
18. Generating Colored Trees
19. More Efficient Generation of Plane Triangulations
20. Constant Time Generation of Trees with Specified Diameter
21. Discovering Frequent Substructures in Large Unordered Trees
22. Efficient Generation of Plane Triangulations without Repetitions
23. Enumerating Floorplans with n Rooms
24. A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs
25. Labeling Points with Rectangles of Various Shapes
26. Convex Grid Drawings of Four-Connected Plane Graphs
27. A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
28. Grid Drawings of Four-Connected Plane Graphs
29. Box-Rectangular Drawings of Plane Graphs
30. A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs
31. A linear-time algorithm for four-partitioning four-connected planar graphs
32. A linear algorithm for optimal orthogonal drawings of triconnected cubic plane graphs
33. Minimum-width grid drawings of plane graphs extend abstract
34. Edge-coloring algorithms
35. A parallel algorithm for edge-coloring partial k-trees
36. A linear algorithm for edge-coloring partial k-trees
37. Efficient Algorithms for Airline Problem
38. A Compact Encoding of Rectangular Drawings with Efficient Query Supports
39. Listing All Plane Graphs
40. A Compact Encoding of Plane Triangulations with Efficient Query Supports
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.