forallexistsR-Completeness and Area-Universality

Michael Gene Dobbins; Linda Kleist; Till Miltzow; Pawel Rzazewski

doi:10.1007/978-3-030-00256-514

forallexistsR-Completeness and Area-Universality

Michael Gene Dobbins
, Linda Kleist
, Till Miltzow
, Pawel Rzazewski

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Original language	English
Title of host publication	Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings
Editors	Andreas Brandstädt, Ekkehard Köhler, Klaus Meer
Publisher	Springer
Pages	164-175
Number of pages	12
Volume	11159
DOIs	https://doi.org/10.1007/978-3-030-00256-514
Publication status	Published - 2018

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer

Access to Document

10.1007/978-3-030-00256-514

Cite this

Dobbins, M. G., Kleist, L., Miltzow, T., & Rzazewski, P. (2018). forallexistsR-Completeness and Area-Universality. In A. Brandstädt, E. Köhler, & K. Meer (Eds.), Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings (Vol. 11159, pp. 164-175). (Lecture Notes in Computer Science). Springer. https://doi.org/10.1007/978-3-030-00256-514

Dobbins, Michael Gene ; Kleist, Linda ; Miltzow, Till et al. / forallexistsR-Completeness and Area-Universality. Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings. editor / Andreas Brandstädt ; Ekkehard Köhler ; Klaus Meer. Vol. 11159 Springer, 2018. pp. 164-175 (Lecture Notes in Computer Science).

@inproceedings{ef4f53775c914cb998cd1847ff0892d6,

title = "forallexistsR-Completeness and Area-Universality",

author = "Dobbins, \{Michael Gene\} and Linda Kleist and Till Miltzow and Pawel Rzazewski",

year = "2018",

doi = "10.1007/978-3-030-00256-514",

language = "English",

volume = "11159",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "164--175",

editor = "Andreas Brandst{\"a}dt and Ekkehard K{\"o}hler and Klaus Meer",

booktitle = "Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings",

}

Dobbins, MG, Kleist, L, Miltzow, T & Rzazewski, P 2018, forallexistsR-Completeness and Area-Universality. in A Brandstädt, E Köhler & K Meer (eds), Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings. vol. 11159, Lecture Notes in Computer Science, Springer, pp. 164-175. https://doi.org/10.1007/978-3-030-00256-514

forallexistsR-Completeness and Area-Universality. / Dobbins, Michael Gene; Kleist, Linda; Miltzow, Till et al.
Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings. ed. / Andreas Brandstädt; Ekkehard Köhler; Klaus Meer. Vol. 11159 Springer, 2018. p. 164-175 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - forallexistsR-Completeness and Area-Universality

AU - Dobbins, Michael Gene

AU - Kleist, Linda

AU - Miltzow, Till

AU - Rzazewski, Pawel

PY - 2018

Y1 - 2018

U2 - 10.1007/978-3-030-00256-514

DO - 10.1007/978-3-030-00256-514

M3 - Conference contribution

VL - 11159

T3 - Lecture Notes in Computer Science

SP - 164

EP - 175

BT - Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings

A2 - Brandstädt, Andreas

A2 - Köhler, Ekkehard

A2 - Meer, Klaus

PB - Springer

ER -

Dobbins MG, Kleist L, Miltzow T, Rzazewski P. forallexistsR-Completeness and Area-Universality. In Brandstädt A, Köhler E, Meer K, editors, Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings. Vol. 11159. Springer. 2018. p. 164-175. (Lecture Notes in Computer Science). doi: 10.1007/978-3-030-00256-514