78 results on '"Nakano, Shin-ichi"'
Search Results
2. Treemaps with Bounded Aspect Ratio
3. Animal Testing
4. Path Queries in Weighted Trees
5. Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations
6. Algorithms for Building Consensus MUL-trees
7. Simultaneous Embedding of Embedded Planar Graphs
8. Angle-Restricted Steiner Arborescences for Flow Map Layout
9. Dynamic Range Majority Data Structures
10. Cutting Out Polygons with a Circular Saw
11. Fast Fréchet Queries
12. Broadcasting in Heterogeneous Tree Networks with Uncertainty
13. Optimal File Distribution in Peer-to-Peer Networks
14. Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
15. Encoding 2D Range Maximum Queries
16. A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time
17. Robustness of Minimum Cost Arborescences
18. Generating Realistic Roofs over a Rectilinear Polygon
19. Dynamic Range Selection in Linear Space
20. Closest Periodic Vectors in L p Spaces
21. Hamiltonian Paths in the Square of a Tree
22. Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths
23. Computing the Visibility Polygon Using Few Variables
24. Dominating Induced Matchings for P 7-free Graphs in Linear Time
25. Covering and Piercing Disks with Two Centers
26. Recognizing Polar Planar Graphs Using New Results for Monopolarity
27. Minimizing Interference in Ad-Hoc Networks with Bounded Communication Radius
28. Improved Approximation Algorithms for Routing Shop Scheduling
29. Contraction-Based Steiner Tree Approximations in Practice
30. Succinct Indexes for Circular Patterns
31. Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph
32. The School Bus Problem on Trees
33. Adaptive Phenotype Testing for AND/OR Items
34. Computing Knapsack Solutions with Cardinality Robustness
35. On the Parameterized Complexity of Consensus Clustering
36. An Index Structure for Spaced Seed Search
37. Faster Approximate Pattern Matching in Compressed Repetitive Texts
38. Maximum Weight Digital Regions Decomposable into Digital Star-Shaped Regions
39. Max-Throughput for (Conservative) k-of-n Testing
40. Range LCP
41. Parameterized Complexity of the Firefighter Problem
42. A New Algorithm for the Characteristic String Problem under Loose Similarity Criteria
43. Two Fixed-Parameter Algorithms for the Cocoloring Problem
44. The Parameterized Complexity of Local Search for TSP, More Refined
45. Folding Equilateral Plane Graphs
46. An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles
47. Semidefinite Programming and Approximation Algorithms: A Survey
48. Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane
49. Efficient Algorithms for the Weighted k-Center Problem on a Real Line
50. Outlier Respecting Points Approximation
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.