CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Filters
1 research outputs found
On the Fine-Grained Complexity of Least Weight Subsequence in Multitrees and Bounded Treewidth DAGs
Author
Gao Jiawei
Publication venue
LIPIcs - Leibniz International Proceedings in Informatics. 14th International Symposium on Parameterized and Exact Computation (IPEC 2019)
Publication date
01/01/2019
Field of study
Get PDF
Dagstuhl Research Online Publication Server
Get PDF
