{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T11:13:19Z","timestamp":1778497999715,"version":"3.51.4"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030002558","type":"print"},{"value":"9783030002565","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00256-5_14","type":"book-chapter","created":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T08:22:08Z","timestamp":1535790128000},"page":"164-175","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["$$\\forall \\exists \\mathbb {R}$$-Completeness and Area-Universality"],"prefix":"10.1007","author":[{"given":"Michael Gene","family":"Dobbins","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linda","family":"Kleist","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tillmann","family":"Miltzow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Rz\u0105\u017cewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,2]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Abrahamsen, M., Adamaszek, A., Miltzow, T.: The art gallery problem is $$\\exists \\mathbb{R}$$-complete. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. ACM (2018)","DOI":"10.1145\/3188745.3188868"},{"key":"14_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-33099-2","volume-title":"Algorithms in Real Algebraic Geometry","author":"S Basu","year":"2006","unstructured":"Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-33099-2"},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/j.comgeo.2012.09.004","volume":"46","author":"TC Biedl","year":"2013","unstructured":"Biedl, T.C., Vel\u00e1zquez, L.E.R.: Drawing planar 3-trees with given face areas. Comput. Geom. 46(3), 276\u2013285 (2013)","journal-title":"Comput. Geom."},{"key":"14_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0701-6","volume-title":"Complexity and Real Computation","author":"L Blum","year":"2012","unstructured":"Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4612-0701-6"},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0747-7171(88)80004-X","volume":"5","author":"JH Davenport","year":"1988","unstructured":"Davenport, J.H., Heintz, J.: Real quantifier elimination is doubly exponential. J. Symb. Comput. 5(1), 29\u201335 (1988)","journal-title":"J. Symb. Comput."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Dobbins, M.G., Kleist, L., Miltzow, T., Rz\u0105\u017cewski, P.: $$\\forall $$$$\\exists $$R-completeness and area-universality. CoRR, abs\/1712.05142 (2017)","DOI":"10.1007\/978-3-030-00256-5_14"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.ejc.2004.01.003","volume":"26","author":"Z Dvo\u0159\u00e1k","year":"2005","unstructured":"Dvo\u0159\u00e1k, Z., Kr\u00e1l\u2019, D., \u0160krekovski, R.: Coloring face hypergraphs on surfaces. Eur. J. Comb. 26(1), 95\u2013110 (2005)","journal-title":"Eur. J. Comb."},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.comgeo.2017.06.010","volume":"68","author":"WS Evans","year":"2018","unstructured":"Evans, W.S., et al.: Table cartogram. Comput. Geom. 68, 174\u2013185 (2018)","journal-title":"Comput. Geom."},{"issue":"1","key":"14_CR9","first-page":"290","volume":"9","author":"L Kleist","year":"2018","unstructured":"Kleist, L.: Drawing planar graphs with prescribed face areas. J. Comput. Geom. 9(1), 290\u2013311 (2018)","journal-title":"J. Comput. Geom."},{"key":"14_CR10","unstructured":"Levi, F.: Die Teilung der projektiven Ebene durch Gerade oder Pseudogerade. Ber. Math.-Phys. Kl. S\u00e4chs. Akad. Wiss 78, 256\u2013267 (1926)"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Lubiw, A., Miltzow, T., Mondal, D.: The complexity of drawing a graph in a polygonal region. CoRR, abs\/1802.06699 (2018). Accepted at Graph Drawing 2018 (GD 2018)","DOI":"10.1007\/978-3-030-04414-5_28"},{"key":"14_CR12","unstructured":"Matou\u0161ek, J.: Intersection graphs of segments and $$\\exists \\mathbb{R}$$. CoRR, abs\/1406.2636 (2014)"},{"key":"14_CR13","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/BFb0082792","volume-title":"Topology and Geometry\u2014Rohlin Seminar","author":"NE Mnev","year":"1988","unstructured":"Mnev, N.E.: The universality theorems on the classification problem of configuration varieties and convex polytopes varieties. In: Viro, O.Y., Vershik, A.M. (eds.) Topology and Geometry\u2014Rohlin Seminar. LNM, vol. 1346, pp. 527\u2013543. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/BFb0082792"},{"key":"14_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17286-1","volume-title":"Perspectives on Projective Geometry: A Guided Tour Through Real and Complex Geometry","author":"J Richter-Gebert","year":"2011","unstructured":"Richter-Gebert, J.: Perspectives on Projective Geometry: A Guided Tour Through Real and Complex Geometry. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-17286-1"},{"key":"14_CR15","unstructured":"Ringel, G.: Equiareal graphs. In: Contemporary Methods in Graph Theory, pp. 503\u2013505 (1990)"},{"issue":"2","key":"14_CR16","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/s00224-015-9662-0","volume":"60","author":"M Schaefer","year":"2017","unstructured":"Schaefer, M., \u0160tefankovi\u010d, D.: Fixed points, Nash equilibria, and the existential theory of the reals. Theory Comput. Syst. 60(2), 172\u2013193 (2017)","journal-title":"Theory Comput. Syst."},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1017\/S0963548300000407","volume":"1","author":"C Thomassen","year":"1992","unstructured":"Thomassen, C.: Plane cubic graphs with prescribed face areas. Comb. Probab. Comput. 1, 371\u2013381 (1992)","journal-title":"Comb. Probab. Comput."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00256-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:25:13Z","timestamp":1710336313000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00256-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030002558","9783030002565"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00256-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"2 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cottbus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.wg2018.b-tu.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}