{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:11:38Z","timestamp":1742922698916,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030604394"},{"type":"electronic","value":"9783030604400"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60440-0_5","type":"book-chapter","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T09:03:18Z","timestamp":1602752598000},"page":"54-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Clique-Width of Point Configurations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4785-7496","authenticated-orcid":false,"given":"Onur","family":"\u00c7a\u011f\u0131r\u0131c\u0131","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2125-1514","authenticated-orcid":false,"given":"Petr","family":"Hlin\u011bn\u00fd","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1212-4927","authenticated-orcid":false,"given":"Filip","family":"Pokr\u00fdvka","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4474-3562","authenticated-orcid":false,"given":"Abhisekh","family":"Sankaran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,9]]},"reference":[{"key":"5_CR1","unstructured":"Adler, H., Adler, I.: A note on clique-width and tree-width for structures. CoRR abs\/0806.0103 (2008). http:\/\/arxiv.org\/abs\/0806.0103"},{"issue":"3","key":"5_CR2","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1023\/A:1021231927255","volume":"19","author":"O Aichholzer","year":"2002","unstructured":"Aichholzer, O., Aurenhammer, F., Krasser, H.: Enumerating order types for small point sets with applications. Order 19(3), 265\u2013281 (2002)","journal-title":"Order"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-030-35802-0_8","volume-title":"Graph Drawing and Network Visualization","author":"O Aichholzer","year":"2019","unstructured":"Aichholzer, O., et al.: Minimal representations of order types by geometric graphs. In: Archambault, D., T\u00f3th, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 101\u2013113. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35802-0_8"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.comgeo.2005.07.005","volume":"36","author":"O Aichholzer","year":"2007","unstructured":"Aichholzer, O., Krasser, H.: Abstract order type extension and new results on the rectilinear crossing number. Comput. Geom. 36(1), 2\u201315 (2007)","journal-title":"Comput. Geom."},{"issue":"1\u20132","key":"5_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1142\/S0218195917600044","volume":"27","author":"O Aichholzer","year":"2017","unstructured":"Aichholzer, O., Kusters, V., Mulzer, W., Pilz, A., Wettstein, M.: An optimal algorithm for reconstructing point set order types from radial orderings. Int. J. Comput. Geom. Appl. 27(1\u20132), 57\u201384 (2017)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Aloupis, G., Iacono, J., Langerman, S., \u00d6zkan, \u00d6., Wuhrer, S.: The complexity of order type isomorphism. In: SODA, pp. 405\u2013415. SIAM (2014)","DOI":"10.1137\/1.9781611973402.30"},{"issue":"6","key":"5_CR7","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1016\/j.ic.2005.11.006","volume":"204","author":"A Blumensath","year":"2006","unstructured":"Blumensath, A., Courcelle, B.: Recognizability, hypergraph operations, and logical types. Inf. Comput. 204(6), 853\u2013919 (2006)","journal-title":"Inf. Comput."},{"issue":"2","key":"5_CR8","first-page":"21","volume":"10","author":"\u00c9 Bonnet","year":"2019","unstructured":"Bonnet, \u00c9., Giannopoulos, P.: Orthogonal terrain guarding is NP-complete. JoCG 10(2), 21\u201344 (2019)","journal-title":"JoCG"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second order logic of graphs I: recognizable sets of finite graphs. Inf. Comput. 85, 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"5_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977619","volume-title":"Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach, Encyclopedia of Mathematics and Its Applications","author":"B Courcelle","year":"2012","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach, Encyclopedia of Mathematics and Its Applications, vol. 138. Cambridge University Press, Cambridge (2012)"},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BFb0017394","volume-title":"Graph Grammars and Their Application to Computer Science","author":"B Courcelle","year":"1991","unstructured":"Courcelle, B., Engelfriet, J., Rozenberg, G.: Context-free handle-rewriting hypergraph grammars. In: Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Graph Grammars 1990. LNCS, vol. 532, pp. 253\u2013268. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0017394"},{"key":"5_CR13","unstructured":"Demaine, E., Fekete, S., Keldenich, P., Krupke, D., Mitchell, J.: Geometric optimization challenge, part of CG Week in Zurich, Switzerland, 22\u201326 June 2020 (2020). https:\/\/cgshop.ibr.cs.tu-bs.de\/competition\/cg-shop-2020\/"},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1142\/S021819591750008X","volume":"27","author":"V Froese","year":"2017","unstructured":"Froese, V., Kanj, I.A., Nichterlein, A., Niedermeier, R.: Finding points in general position. Int. J. Comput. Geom. Appl. 27(4), 277\u2013296 (2017)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"7","key":"5_CR15","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1016\/j.dam.2009.10.018","volume":"158","author":"R Ganian","year":"2010","unstructured":"Ganian, R., Hlin\u011bn\u00fd, P.: On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. Discrete Appl. Math. 158(7), 851\u2013867 (2010)","journal-title":"Discrete Appl. Math."},{"key":"5_CR16","unstructured":"Goaoc, X., Hubard, A., de Joannis de Verclos, R., Sereni, J., Volec, J.: Limits of order types. In: Symposium on Computational Geometry. LIPIcs, vol. 34, pp. 300\u2013314. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2015)"},{"issue":"3","key":"5_CR17","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1137\/0212032","volume":"12","author":"JE Goodman","year":"1983","unstructured":"Goodman, J.E., Pollack, R.: Multidimensional sorting. SIAM J. Comput. 12(3), 484\u2013507 (1983)","journal-title":"SIAM J. Comput."},{"key":"5_CR18","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF02187696","volume":"1","author":"JE Goodman","year":"1986","unstructured":"Goodman, J.E., Pollack, R.: Upper bounds for configurations and polytopes in $$R^d$$. Discrete Comput. Geom. 1, 219\u2013227 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Goodman, J.E., Pollack, R., Sturmfels, B.: Coordinate representation of order types requires exponential storage. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 405\u2013410. ACM (1989)","DOI":"10.1145\/73007.73046"},{"key":"5_CR20","unstructured":"Grelier, N.: Minimum convex partition of point sets is NP-hard. CoRR abs\/1911.07697 (2019). http:\/\/arxiv.org\/abs\/1911.07697"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1137\/070685920","volume":"38","author":"P Hlin\u011bn\u00fd","year":"2008","unstructured":"Hlin\u011bn\u00fd, P., Oum, S.: Finding branch-decomposition and rank-decomposition. SIAM J. Comput. 38, 1012\u20131032 (2008)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"5_CR22","doi-asserted-by":"publisher","first-page":"1316","DOI":"10.1137\/100791506","volume":"40","author":"J King","year":"2011","unstructured":"King, J., Krohn, E.: Terrain guarding is NP-hard. SIAM J. Comput. 40(5), 1316\u20131339 (2011)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"5_CR23","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TIT.1986.1057165","volume":"32","author":"DT Lee","year":"1986","unstructured":"Lee, D.T., Lin, A.K.: Computational complexity of art gallery problems. IEEE Trans. Inf. Theory 32(2), 276\u2013282 (1986)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"5_CR24","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S Oum","year":"2006","unstructured":"Oum, S., Seymour, P.D.: Approximating clique-width and branch-width. J. Comb. Theory Ser. B 96(4), 514\u2013528 (2006)","journal-title":"J. Comb. Theory Ser. B"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-38768-5_21","volume-title":"Computing and Combinatorics","author":"N Rajgopal","year":"2013","unstructured":"Rajgopal, N., Ashok, P., Govindarajan, S., Khopkar, A., Misra, N.: Hitting and piercing rectangles induced by a point set. In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol. 7936, pp. 221\u2013232. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38768-5_21"},{"issue":"3","key":"5_CR26","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7(3), 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"issue":"1","key":"5_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218195916500011","volume":"26","author":"B Roy","year":"2016","unstructured":"Roy, B.: Point visibility graph recognition is NP-hard. Int. J. Comput. Geom. Appl. 26(1), 1\u201332 (2016)","journal-title":"Int. J. Comput. Geom. Appl."}],"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-60440-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:00:35Z","timestamp":1710266435000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60440-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030604394","9783030604400"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60440-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 October 2020","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":"Leeds","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algorithms.leeds.ac.uk\/wg2020\/","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":"94","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":"32","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":"34% - 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":"3.7","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":"2.1","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}