# Search results for: Ali Nourollah

Japan Journal of Industrial and Applied Mathematics > 2017 > 34 > 2 > 407-428

Lecture Notes in Computer Science > Computational Science and Its Applications – ICCSA 2007 > Workshop on Computational Geometry and Applications (CGA 7) > 15-25

*n*-link is a sequence of

*n*links whose lengths are fixed joined together from their endpoints, free to turn about their endpoints, which act as joints. “

*Ruler Folding Problem*”, which is NP-Complete is to find the minimum length of the folded chain in one dimensional space. The best result for ruler folding problem is reported by Hopcroft et al. in one dimensional space which requires

*O*(

*nL*...

Discrete Applied Mathematics > 2011 > 159 > 14 > 1418-1424