Longest increasing subsequences in windows based on canonical antichain partition

Authors:
Erdong Chen;Linji Yang;Hao Yuan
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, PR China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, PR China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, PR China
Venue:
Theoretical Computer Science
Year:
2007

Citing 4
Cited 3

New clique and independent set algorithms for circle graphs

Discrete Applied Mathematics
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms

SIAM Journal on Computing
Enumerating longest increasing subsequences and patience sorting

Information Processing Letters
Longest increasing subsequences in sliding windows

Theoretical Computer Science

An algorithm for solving the longest increasing circular subsequence problem

Information Processing Letters
Sequential dependencies

Proceedings of the VLDB Endowment
Effective Computations on Sliding Windows

SIAM Journal on Computing

Quantified Score

Hi-index	5.23

Visualization

Abstract

Given a sequence @p"1@p"2...@p"n, a longest increasing subsequence (LIS) in a window @p=@p"l@p"l"+"1...@p"r is a longest subsequence @s=@p"i"""1@p"i"""2...@p"i"""T such that l@?i"1|0@?i@?n-w}@?{@p,@p|i