@inproceedings{https___doi.org_10.4230_lipics.csl.2023.33,
    doi = {10.4230/LIPICS.CSL.2023.33},
    url = {https://drops.dagstuhl.de/opus/volltexte/2023/17494/},
    author = {Staniszewski, Konrad},
    keywords = {Parity Games, Circuits, Tree-Depth, Clique-Width, Theory of computation → Algorithmic game theory},
    language = {en},
    title = {Parity Games of Bounded Tree-Depth},
    publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
    year = {2023},
    copyright = {Creative Commons Attribution 4.0 International license},
    date-added = {2023-11-24 9:10:15 +0100}
}

@inproceedings{https___doi.org_10.4230_lipics.csl.2023.33, doi = {10.4230/LIPICS.CSL.2023.33}, url = {https://drops.dagstuhl.de/opus/volltexte/2023/17494/}, author = {Staniszewski, Konrad}, keywords = {Parity Games, Circuits, Tree-Depth, Clique-Width, Theory of computation → Algorithmic game theory}, language = {en}, title = {Parity Games of Bounded Tree-Depth}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, year = {2023}, copyright = {Creative Commons Attribution 4.0 International license}, date-added = {2023-11-24 9:10:15 +0100} }