{"@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/Q3606403","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q3606403","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q3606403","kernelVersion":"v1","immutable":true,"modified":"2026-04-04T06:29:53Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q3606403","name":"ON A GENERALIZATION OF DEHN'S ALGORITHM","headline":"ON A GENERALIZATION OF DEHN'S ALGORITHM","description":"scientific article; zbMATH DE number 5519498","url":"https://portal.mardi4nfdi.de/entity/Q3606403","datePublished":"2009-02-26","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q1978147"},{"@id":"https://portal.mardi4nfdi.de/entity/Q584408"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q2703070"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1142/S0218196708004822","url":"https://doi.org/10.1142/S0218196708004822"},"sameAs":["https://doi.org/10.1142/S0218196708004822"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q4289478"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1383712"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1426936"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3718927"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1159282"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4786246"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3151018"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3862379"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1895679"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3377332"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1860718"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4697866"}]},"provenance":{"prov:generatedAtTime":"2026-04-04T06:29:53Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}