{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:42:41Z","timestamp":1726044161896},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030307851"},{"type":"electronic","value":"9783030307868"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-30786-8_20","type":"book-chapter","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T17:22:57Z","timestamp":1568222577000},"page":"258-270","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximum Matchings and Minimum Blocking Sets in $$\\varTheta _6$$ -Graphs"],"prefix":"10.1007","author":[{"given":"Therese","family":"Biedl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmad","family":"Biniaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Veronika","family":"Irvine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kshitij","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Kindermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Lubiw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,12]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11589440_1","volume-title":"Discrete and Computational Geometry","author":"BM \u00c1brego","year":"2005","unstructured":"\u00c1brego, B.M., et al.: Matching points with circles and squares. In: Akiyama, J., Kano, M., Tan, X. (eds.) JCDCG 2004. LNCS, vol. 3742, pp. 1\u201315. Springer, Heidelberg (2005). \n                    https:\/\/doi.org\/10.1007\/11589440_1"},{"issue":"1","key":"20_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s00454-008-9099-1","volume":"41","author":"BM \u00c1brego","year":"2009","unstructured":"\u00c1brego, B.M., et al.: Matching points with squares. Discrete Comput. Geom. 41(1), 77\u201395 (2009)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"20_CR3","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.comgeo.2012.02.005","volume":"46","author":"O Aichholzer","year":"2013","unstructured":"Aichholzer, O., et al.: Blocking Delaunay triangulations. Comput. Geom.: Theory Appl. 46(2), 154\u2013159 (2013)","journal-title":"Comput. Geom.: Theory Appl."},{"issue":"4","key":"20_CR4","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1109\/TPDS.2003.1195412","volume":"14","author":"KM Alzoubi","year":"2003","unstructured":"Alzoubi, K.M., Li, X., Wang, Y., Wan, P., Frieder, O.: Geometric spanners for wireless ad hoc networks. IEEE Trans. Parallel Distrib. Syst. 14(4), 408\u2013421 (2003)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"6\u20137","key":"20_CR5","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.comgeo.2011.01.001","volume":"44","author":"B Aronov","year":"2011","unstructured":"Aronov, B., Dulieu, M., Hurtado, F.: Witness (Delaunay) graphs. Comput. Geom.: Theory Appl. 44(6\u20137), 329\u2013344 (2011)","journal-title":"Comput. Geom.: Theory Appl."},{"issue":"7","key":"20_CR6","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1016\/j.comgeo.2011.06.004","volume":"46","author":"B Aronov","year":"2013","unstructured":"Aronov, B., Dulieu, M., Hurtado, F.: Witness Gabriel graphs. Comput. Geom.: Theory Appl. 46(7), 894\u2013908 (2013)","journal-title":"Comput. Geom.: Theory Appl."},{"issue":"10","key":"20_CR7","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.ipl.2014.04.007","volume":"114","author":"F Aurenhammer","year":"2014","unstructured":"Aurenhammer, F., Paulini, G.: On shape Delaunay tessellations. Inf. Process. Lett. 114(10), 535\u2013541 (2014)","journal-title":"Inf. Process. Lett."},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.tcs.2013.11.031","volume":"555","author":"J Babu","year":"2014","unstructured":"Babu, J., Biniaz, A., Maheshwari, A., Smid, M.H.M.: Fixed-orientation equilateral triangle matching of point sets. Theor. Comput. Sci. 555, 55\u201370 (2014). Also in WALCOM 2013","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"20_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-006-0649-0","volume":"22","author":"D Bauer","year":"2006","unstructured":"Bauer, D., Broersma, H., Schmeichel, E.: Toughness in graphs\u2013a survey. Graphs Comb. 22(1), 1\u201335 (2006)","journal-title":"Graphs Comb."},{"key":"20_CR10","first-page":"258","volume":"247","author":"C Berge","year":"1958","unstructured":"Berge, C.: Sur le couplage maximum d\u2019un graphe. Comptes Rendus de l\u2019Acad\u00e9mie des Sciences, Paris 247, 258\u2013259 (1958)","journal-title":"Comptes Rendus de l\u2019Acad\u00e9mie des Sciences, Paris"},{"unstructured":"Biedl, T., Biniaz, A., Irvine, V., Jain, K., Kindermann, P., Lubiw, A.: Maximum matchings and minimum blocking sets in \n                    \n                      \n                    \n                    $$\\theta _6$$\n                  -graphs. Arxiv report (2019). \n                    https:\/\/arxiv.org\/abs\/1901.01476","key":"20_CR11"},{"issue":"9","key":"20_CR12","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1016\/j.comgeo.2015.07.003","volume":"48","author":"A Biniaz","year":"2015","unstructured":"Biniaz, A., Maheshwari, A., Smid, M.H.M.: Higher-order triangular-distance Delaunay graphs: graph-theoretical properties. Comput. Geom.: Theory Appl. 48(9), 646\u2013660 (2015). Also in CALDAM 2015","journal-title":"Comput. Geom.: Theory Appl."},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2015.06.040","volume":"596","author":"A Biniaz","year":"2015","unstructured":"Biniaz, A., Maheshwari, A., Smid, M.H.M.: Matchings in higher-order Gabriel graphs. Theor. Comput. Sci. 596, 67\u201378 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-16926-7_25","volume-title":"Graph Theoretic Concepts in Computer Science","author":"N Bonichon","year":"2010","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Ilcinkas, D.: Connections between theta-graphs, delaunay triangulations, and orthogonal surfaces. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 266\u2013278. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-16926-7_25"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"2361","DOI":"10.1137\/1.9781611975482.144","volume-title":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Prosenjit Bose","year":"2019","unstructured":"Bose, P., De Carufel, J.L., Hill, D., Smid, M.H.M.: On the spanning and routing ratio of theta-four. In: Chan, T.M. (ed.) Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2361\u20132370. SIAM (2019)"},{"doi-asserted-by":"crossref","unstructured":"Bose, P., Fagerberg, R., Van Renssen, A., Verdonschot, S.: Competitive routing in the half-\n                    \n                      \n                    \n                    $$\\theta _6$$\n                  -graph. In: Rabani, Y. (ed.) Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1319\u20131328. SIAM (2012)","key":"20_CR16","DOI":"10.1137\/1.9781611973099.104"},{"issue":"2","key":"20_CR17","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.comgeo.2014.08.005","volume":"48","author":"P Bose","year":"2015","unstructured":"Bose, P., Morin, P., van Renssen, A., Verdonschot, S.: The \n                    \n                      \n                    \n                    $$\\theta _5$$\n                  -graph is a spanner. Comput. Geom. 48(2), 108\u2013119 (2015). Also in WG 2013","journal-title":"Comput. Geom."},{"issue":"2","key":"20_CR18","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0022-0000(89)90044-5","volume":"39","author":"P Chew","year":"1989","unstructured":"Chew, P.: There are planar graphs almost as good as the complete graph. J. Comput. Syst. Sci. 39(2), 205\u2013219 (1989)","journal-title":"J. Comput. Syst. Sci."},{"doi-asserted-by":"crossref","unstructured":"Clarkson, K.L.: Approximation algorithms for shortest path motion planning. In: Aho, A.V. (ed.) Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC), pp. 56\u201365. ACM (1987)","key":"20_CR19","DOI":"10.1145\/28395.28402"},{"unstructured":"Damian, M., Iacono, J., Winslow, A.: Spanning properties of Theta-Theta-6. \n                    arXiv:1808.04744\n                    \n                   (2018)","key":"20_CR20"},{"key":"20_CR21","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF02187810","volume":"5","author":"MB Dillencourt","year":"1990","unstructured":"Dillencourt, M.B.: Toughness and Delaunay triangulations. Discrete Comput. Geom. 5, 575\u2013601 (1990)","journal-title":"Discrete Comput. Geom."},{"unstructured":"Drysdale III, R.L.S.: A practical algorithm for computing the Delaunay triangulation for convex distance functions. In: Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 159\u2013168 (1990)","key":"20_CR22"},{"key":"20_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/3-540-68530-8_14","volume-title":"Algorithms \u2014 ESA 1998","author":"M Fischer","year":"1998","unstructured":"Fischer, M., Lukovszki, T., Ziegler, M.: Geometric searching in walkthrough animations with weak spanners in real time. In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 163\u2013174. Springer, Heidelberg (1998). \n                    https:\/\/doi.org\/10.1007\/3-540-68530-8_14"},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-19487-8_23","volume-title":"SWAT 88","author":"JM Keil","year":"1988","unstructured":"Keil, J.M.: Approximating the complete Euclidean graph. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol. 318, pp. 208\u2013213. Springer, Heidelberg (1988). \n                    https:\/\/doi.org\/10.1007\/3-540-19487-8_23"},{"key":"20_CR25","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"JM Keil","year":"1992","unstructured":"Keil, J.M., Gutwin, C.A.: Classes of graphs which approximate the complete Euclidean graph. Discrete Comput. Geom. 7, 13\u201328 (1992)","journal-title":"Discrete Comput. Geom."},{"doi-asserted-by":"crossref","unstructured":"Morin, P., Verdonschot, S.: On the average number of edges in Theta graphs. Online J. Anal. Comb., page to appear (2014). Also in ANALCO 2014","key":"20_CR26","DOI":"10.1137\/1.9781611973204.12"},{"issue":"3","key":"20_CR27","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0012-365X(79)90133-X","volume":"28","author":"T Nishizeki","year":"1979","unstructured":"Nishizeki, T., Baybars, I.: Lower bounds on the cardinality of the maximum matchings of planar graphs. Discrete Math. 28(3), 255\u2013267 (1979)","journal-title":"Discrete Math."},{"key":"20_CR28","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"22","author":"WT Tutte","year":"1947","unstructured":"Tutte, W.T.: The factorization of linear graphs. J. Lond. Math. Soc. 22, 107\u2013111 (1947)","journal-title":"J. Lond. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30786-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T17:25:13Z","timestamp":1568222713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30786-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030307851","9783030307868"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30786-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 September 2019","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":"Vall de N\u00faria","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wg2019.sau.thilikos.info\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"87","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":"29","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":"33% - 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.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":"1-2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}