Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
SYNASC
/
Paper
Heuristic Algorithms for the Longest Filled Common Subsequence Problem.
Radu Stefan Mincu
,
Alexandru Popa
Venue
National
SYNASC
Year
2018
Proceedings
SYNASC
DBLP record
conf/synasc/Mincu018 ↗
Browse the full
SYNASC paper archive
.