243 results on '"Nakano, Shin-ichi"'
Search Results
2. Listing All Plane Graphs : (Extended Abstract)
3. A Compact Encoding of Plane Triangulations with Efficient Query Supports : (Extended Abstract)
4. A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks
5. A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares
6. A Compact Encoding of Unordered Binary Trees
7. Generating All Triangulations of Plane Graphs (Extended Abstract)
8. Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
9. A Compact Encoding of Rectangular Drawings with Efficient Query Supports
10. Efficient Algorithms for Airline Problem
11. A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs
12. Constant Time Generation of Linear Extensions
13. Generating Colored Trees
14. Constant Time Generation of Trees with Specified Diameter
15. More Efficient Generation of Plane Triangulations
16. How to Obtain the Complete List of Caterpillars : Extended Abstract
17. Discovering Frequent Substructures in Large Unordered Trees
18. Efficient Generation of Plane Triangulations without Repetitions
19. Enumerating Floorplans with n Rooms
20. Efficient Generation of Triconnected Plane Triangulations
21. Labeling Points with Rectangles of Various Shapes
22. A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs : Extended Abstract
23. Rectangular Drawings of Plane Graphs Without Designated Corners : Extended Abstract
24. Convex Grid Drawings of Four-Connected Plane Graphs : (Extended Abstract)
25. A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
26. Box-Rectangular Drawings of Plane Graphs
27. Grid Drawings of Four-Connected Plane Graphs
28. A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs
29. A linear algorithm for optimal orthogonal drawings of triconnected cubic plane graphs
30. A linear-time algorithm for four-partitioning four-connected planar graphs
31. Rectangular grid drawings of plane graphs
32. Edge-coloring algorithms
33. Minimum-width grid drawings of plane graphs extend abstract
34. A parallel algorithm for edge-coloring partial k-trees
35. A linear algorithm for edge-coloring partial k-trees
36. Tree Enumeration
37. Geometric Object Enumeration
38. Scheduling file transfers under port and channel constraints
39. Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression
40. A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares
41. A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks
42. Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
43. Generating All Triangulations of Plane Graphs (Extended Abstract)
44. Constant Time Generation of Linear Extensions
45. Generating Colored Trees
46. More Efficient Generation of Plane Triangulations
47. Constant Time Generation of Trees with Specified Diameter
48. Discovering Frequent Substructures in Large Unordered Trees
49. Efficient Generation of Plane Triangulations without Repetitions
50. Enumerating Floorplans with n Rooms
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.