An Efficient Algorithm for Generating All k-Subsets (1 <= k <= m <= n) of the Set { 1, 2, ..., n } in Lexicographical Order

@article{Semba1984AnEA,
  title={An Efficient Algorithm for Generating All k-Subsets (1 <= k <= m <= n) of the Set \{ 1, 2, ..., n \} in Lexicographical Order},
  author={Ichiro Semba},
  journal={J. Algorithms},
  year={1984},
  volume={5},
  pages={281-283}
}