Longest increasing subsequences in windows based on canonical antichain partition

Erdong Chen, Linji Yang, Hao Yuan. Longest increasing subsequences in windows based on canonical antichain partition. Theoretical Computer Science, 378(3):223-236, 2007. [doi]

@article{ChenYY07,
  title = {Longest increasing subsequences in windows based on canonical antichain partition},
  author = {Erdong Chen and Linji Yang and Hao Yuan},
  year = {2007},
  doi = {10.1016/j.tcs.2007.02.032},
  url = {http://dx.doi.org/10.1016/j.tcs.2007.02.032},
  tags = {rule-based, partitioning},
  researchr = {https://researchr.org/publication/ChenYY07},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {378},
  number = {3},
  pages = {223-236},
}