Search

Your search keyword '"Nakano, Shin-ichi"' showing total 63 results

Search Constraints

Start Over You searched for: Author "Nakano, Shin-ichi" Remove constraint Author: "Nakano, Shin-ichi" Publisher springer international publishing Remove constraint Publisher: springer international publishing
63 results on '"Nakano, Shin-ichi"'

Search Results

2. Escape from the Room

3. The Coverage Problem by Aligned Disks

4. r-Gatherings on a Star

5. Floorplans with Walls

6. One-Dimensional r-Gathering Under Uncertainty

7. Max-Min 3-Dispersion Problems

8. More Routes for Evacuation

9. Exact Algorithms for the Max-Min Dispersion Problem

10. A Simple Algorithm for r-gatherings on the Line

11. Max-Min Dispersion on a Line

12. Floorplans with Columns

13. Sequentially Swapping Colored Tokens on Graphs

14. Assigning Proximity Facilities for Gatherings

17. On r-Gatherings on the Line

18. Enumeration, Counting, and Random Generation of Ladder Lotteries

21. Exact Algorithms for the Max-Min Dispersion Problem

22. Sequentially Swapping Colored Tokens on Graphs

26. Arbitrary Pattern Formation on Infinite Grid by Asynchronous Oblivious Robots

27. Greedy Consensus Tree and Maximum Greedy Consensus Tree Problems

28. Towards Work-Efficient Parallel Parameterized Algorithms

29. Efficient Algorithm for Box Folding

30. A Two Query Adaptive Bitprobe Scheme Storing Five Elements

31. Analyzing the Quantum Annealing Approach for Solving Linear Least Squares Problems

32. Applications of V-Order: Suffix Arrays, the Burrows-Wheeler Transform & the FM-index

33. Matching Sets of Line Segments

34. A Fast Algorithm for Unbounded Monotone Integer Linear Systems with Two Variables per Inequality via Graph Decomposition

35. The Upper Bound on the Eulerian Recurrent Lengths of Complete Graphs Obtained by an IP Solver

36. Multilevel Planarity

37. Weighted Upper Edge Cover: Complexity and Approximability

38. On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs

39. Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem

40. Drawing Clustered Graphs on Disk Arrangements

41. Flat-Foldability for 1 × n Maps with Square/Diagonal Grid Patterns

42. (k, p)-Planarity: A Relaxation of Hybrid Planarity

43. Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components : (Extended Abstract)

44. The Prefix Fréchet Similarity

45. Hard and Easy Instances of L-Tromino Tilings

46. Probabilistic Analysis of Optimization Problems on Generalized Random Shortest Path Metrics

47. Maximum-Width Empty Square and Rectangular Annulus

48. A Linear Time Algorithm for the r-Gathering Problem on the Line (Extended Abstract)

49. Optimal Partition of a Tree with Social Distance

50. Topological Stability of Kinetic k-centers

Catalog

Books, media, physical & digital resources