DC Field
Value
Language
dc.contributor.author
Szeider, Stefan
-
dc.date.accessioned
2023-02-21T13:51:39Z
-
dc.date.available
2023-02-21T13:51:39Z
-
dc.date.issued
2022
-
dc.identifier.citation
<div class="csl-bib-body"> <div class="csl-entry">Szeider, S. (2022). <i>From Twin-Width to Propositional Logic and Back</i> [Conference Presentation]. Workshop on Graph Classes, Optimization, and Width Parameters (GROW), Slovenia.</div> </div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/153793
-
dc.language.iso
en
-
dc.subject
Twin-Width
en
dc.title
From Twin-Width to Propositional Logic and Back
en
dc.type
Presentation
en
dc.type
Vortrag
de
dc.type.category
Conference Presentation
-
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
tuw.publication.orgunit
E192-01 - Forschungsbereich Algorithms and Complexity
-
tuw.event.name
Workshop on Graph Classes, Optimization, and Width Parameters (GROW)
en
tuw.event.startdate
19-09-2022
-
tuw.event.enddate
22-09-2022
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.country
SI
-
tuw.event.presenter
Szeider, Stefan
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
80
-
wb.sciencebranch.value
20
-
item.cerifentitytype
Publications
-
item.cerifentitytype
Publications
-
item.fulltext
no Fulltext
-
item.grantfulltext
none
-
item.openairecristype
http://purl.org/coar/resource_type/c_18cf
-
item.openairecristype
http://purl.org/coar/resource_type/c_18cf
-
item.openairetype
Presentation
-
item.openairetype
Vortrag
-
item.languageiso639-1
en
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity
-
crisitem.author.parentorg
E192 - Institut für Logic and Computation
-
Appears in Collections:
Presentation
Show simple item record

Items in reposiTUm are protected by copyright, with all rights reserved, unless otherwise indicated.

Page view(s)

24
checked on Jun 2, 2023

Google ScholarTM

Check