Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STACS
/
Paper
A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem.
Lech Duraj
Venue
A
STACS
Year
2020
Proceedings
STACS
DBLP record
conf/stacs/Duraj20 ↗
Browse the full
STACS paper archive
.