@article{oai:iwate-u.repo.nii.ac.jp:00010348,
 author = {YAMANAKA, Katsuhisa and NAKANO, Shin-ichi},
 issue = {6},
 journal = {IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences},
 month = {Jun},
 note = {A ladder lottery, known as the “Amidakuji” in Japan, is a network with n vertical lines and many horizontal lines each of which connects two consecutive vertical lines. Each ladder lottery corresponds to a permutation. Ladder lotteries are frequently used as natural models in many areas. Given a permutation π, an algorithm to enumerate all ladder lotteries of π with the minimum number of horizontal lines is known. In this paper, given a permutation π and an integer k, we design an algorithm to enumerate all ladder lotteries of π with exactly k horizontal lines.},
 pages = {1163--1170},
 title = {Efficient Enumeration of All Ladder Lotteries with k Bars},
 volume = {E97-A},
 year = {2014}
}