{"@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/Q596102","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q596102","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q596102","kernelVersion":"v1","immutable":true,"modified":"2026-01-04T08:22:05Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q596102","name":"Algorithms for multi-level graph planarity testing and layout","headline":"Algorithms for multi-level graph planarity testing and layout","description":"scientific article; zbMATH DE number 2085513","url":"https://portal.mardi4nfdi.de/entity/Q596102","datePublished":"2004-08-10","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q596100"},{"@id":"https://portal.mardi4nfdi.de/entity/Q596101"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q123643"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/J.TCS.2004.02.033","url":"https://doi.org/10.1016/J.TCS.2004.02.033"},"sameAs":["https://doi.org/10.1016/J.TCS.2004.02.033"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q3154375"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4796197"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3731621"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3985344"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1322570"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2766816"}]},"provenance":{"prov:generatedAtTime":"2026-01-04T08:22:05Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}