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
Tight complexity bounds for fpt subgraph problems parameterized by clique-width
Author
Marx Dániel
Rossmanith Peter
Publication venue
'Springer Science and Business Media LLC'
Publication date
01/01/2012
Field of study
No full text
No full text
