{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q4575835","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q4575835","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q4575835","kernelVersion":"v1","immutable":true,"modified":"2026-01-24T07:36:08Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q4575835","name":"Fully polynomial-time parameterized computations for graphs and matrices of low treewidth","headline":"Fully polynomial-time parameterized computations for graphs and matrices of low treewidth","description":"scientific article; zbMATH DE number 6904120","url":"https://portal.mardi4nfdi.de/entity/Q4575835","datePublished":"2018-07-16","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q259035"},{"@id":"https://portal.mardi4nfdi.de/entity/Q270004"},{"@id":"https://portal.mardi4nfdi.de/entity/Q262250"},{"@id":"https://portal.mardi4nfdi.de/entity/Q261392"},{"@id":"https://portal.mardi4nfdi.de/entity/Q345099"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q4575732"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1137/1.9781611974782.92","url":"https://doi.org/10.1137/1.9781611974782.92"},"sameAs":["https://doi.org/10.1137/1.9781611974782.92"]},"provenance":{"prov:generatedAtTime":"2026-01-24T07:36:08Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}