{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:15:05Z","timestamp":1725887705459},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319591070"},{"type":"electronic","value":"9783319591087"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59108-7_3","type":"book-chapter","created":{"date-parts":[[2017,5,16]],"date-time":"2017-05-16T08:43:06Z","timestamp":1494924186000},"page":"30-39","source":"Crossref","is-referenced-by-count":1,"title":["On Sets of Line Segments Featuring a Cactus Structure"],"prefix":"10.1007","author":[{"given":"Boris","family":"Brimkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,17]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Balaban, I.J.: An optimal algorithm for finding segment intersections. In: Proceedings of 11-th Annual ACM Symposium on Computational Geometry, pp. 211\u2013219 (1995)","DOI":"10.1145\/220279.220302"},{"issue":"2","key":"3_CR2","doi-asserted-by":"crossref","first-page":"199","DOI":"10.7155\/jgaa.00255","volume":"16","author":"B Ben-Moshe","year":"2012","unstructured":"Ben-Moshe, B., Dvir, A., Segal, M., Tamir, A.: Centdian computation in cactus graphs. J. Graph Algorithms Appl. 16(2), 199\u2013224 (2012)","journal-title":"J. Graph Algorithms Appl."},{"key":"3_CR3","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"28","author":"JL Bentley","year":"1979","unstructured":"Bentley, J.L., Ottmann, T.A.: Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput. 28, 643\u2013647 (1979)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"3_CR4","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.comgeo.2006.03.006","volume":"37","author":"P Bose","year":"2007","unstructured":"Bose, P., Maheshwari, A., Morin, P., Morrison, J., Smid, M., Vahrenhold, J.: Space-efficient geometric divide-and-conquer algorithms. Comput. Geometry 37(3), 209\u2013227 (2007)","journal-title":"Comput. Geometry"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-540-77050-3_32","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"M Br\u00e9villiers","year":"2007","unstructured":"Br\u00e9villiers, M., Chevallier, N., Schmitt, D.: Triangulations of line segment sets in the plane. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 388\u2013399. Springer, Heidelberg (2007). doi:\n10.1007\/978-3-540-77050-3_32"},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/j.dam.2015.10.032","volume":"216","author":"B Brimkov","year":"2017","unstructured":"Brimkov, B., Hicks, I.V.: Memory efficient algorithms for cactus graphs and block graphs. Discrete Appl. Math. 216, 393\u2013407 (2017)","journal-title":"Discrete Appl. Math."},{"issue":"8","key":"3_CR7","doi-asserted-by":"crossref","first-page":"1653","DOI":"10.1080\/00207160.2013.775423","volume":"90","author":"VE Brimkov","year":"2013","unstructured":"Brimkov, V.E.: Approximability issues of guarding a set of segments. Int. J. Comput. Math. 90(8), 1653\u20131667 (2013)","journal-title":"Int. J. Comput. Math."},{"issue":"15","key":"3_CR8","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1016\/j.tcs.2010.08.014","volume":"412","author":"VE Brimkov","year":"2011","unstructured":"Brimkov, V.E., Leach, A., Mastroianni, M., Wu, J.: Guarding a set of line segments in the plane. Theoret. Comput. Sci. 412(15), 1313\u20131324 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1016\/j.dam.2011.11.023","volume":"160","author":"VE Brimkov","year":"2012","unstructured":"Brimkov, V.E., Leach, A., Wu, J., Mastroianni, M.: Approximation algorithms for a geometric set cover problem. Discrete Appl. Math. 160, 1039\u20131052 (2012)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"3_CR10","doi-asserted-by":"crossref","first-page":"7","DOI":"10.7155\/jgaa.00043","volume":"6","author":"N Castro de","year":"2002","unstructured":"de Castro, N., Cobos, F.J., Dana, J.C., M\u00e1rquez, A., Noy, M.: Triangle-free planar graphs and segment intersection graphs. J. Graph Algorithms Appl. 6(1), 7\u201326 (2002)","journal-title":"J. Graph Algorithms Appl."},{"issue":"8","key":"3_CR11","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1016\/j.comgeo.2010.04.005","volume":"43","author":"TM Chan","year":"2010","unstructured":"Chan, T.M., Chen, E.Y.: Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection. Comput. Geometry 43(8), 636\u2013646 (2010)","journal-title":"Comput. Geometry"},{"key":"3_CR12","unstructured":"Chen, E.Y., Chan, T.M.: A space-efficient algorithm for line segment intersection. In: Proceedings of the 15th Canadian Conference on Computational Geometry, pp. 68\u201371 (2003)"},{"key":"3_CR13","unstructured":"Chazelle, B.M.: Reporting and counting arbitrary planar intersections. Report CS-83-16, Department of Computer Science, Brown University, Providence, RI, USA (1983)"},{"issue":"10","key":"3_CR14","doi-asserted-by":"crossref","first-page":"1815","DOI":"10.1016\/j.disc.2012.01.024","volume":"312","author":"MC Francis","year":"2012","unstructured":"Francis, M.C., Kratochv\u00edl, J., Vysko\u010dil, T.: Segment representation of a subclass of co-planar graphs. Discrete Math. 312(10), 1815\u20131818 (2012)","journal-title":"Discrete Math."},{"key":"3_CR15","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1073\/pnas.39.4.315","volume":"39","author":"F Harary","year":"1953","unstructured":"Harary, F., Uhlenbeck, G.: On the number of Husimi trees I. Proc. Natl. Acad. Sci. 39, 315\u2013322 (1953)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1063\/1.1747725","volume":"18","author":"K Husimi","year":"1950","unstructured":"Husimi, K.: Note on Mayers\u2019 theory of cluster integrals. J. Chem. Phys. 18, 682\u2013684 (1950)","journal-title":"J. Chem. Phys."},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/11847250_15","volume-title":"Parameterized and Exact Computation","author":"J K\u00e1ra","year":"2006","unstructured":"K\u00e1ra, J., Kratochv\u00edl, J.: Fixed parameter tractability of independent set in segment intersection graphs. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 166\u2013174. Springer, Heidelberg (2006). doi:\n10.1007\/11847250_15"},{"key":"3_CR18","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems, part 1: the p-center. SIAM J. Appl. Math 37, 513\u2013537 (1979)","journal-title":"SIAM J. Appl. Math"},{"key":"3_CR19","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/j.1538-7305.1980.tb03008.x","volume":"59","author":"WLG Koontz","year":"1980","unstructured":"Koontz, W.L.G.: Economic evaluation of loop feeder relief alternatives. Bell Syst. Tech. J. 59, 277\u2013281 (1980)","journal-title":"Bell Syst. Tech. J."},{"key":"3_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F Preparata","year":"1985","unstructured":"Preparata, F., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)"},{"key":"3_CR21","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1145\/362814.362819","volume":"13","author":"JC Tiernan","year":"1970","unstructured":"Tiernan, J.C.: An efficient search algorithm to find the elementary circuits of a graph. Commun. ACM 13, 722\u2013726 (1970)","journal-title":"Commun. ACM"},{"key":"3_CR22","first-page":"26","volume":"46","author":"K Wagner","year":"1936","unstructured":"Wagner, K.: Bemerkungen zum Vierfarbenproblem. Jahresbericht der Deutschen Mathematiker-Vereinigung 46, 26\u201332 (1936)","journal-title":"Jahresbericht der Deutschen Mathematiker-Vereinigung"},{"key":"3_CR23","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.comgeo.2006.09.001","volume":"38","author":"J Vahrenhold","year":"2007","unstructured":"Vahrenhold, J.: Line-segment intersection made in-place. Comput. Geometry 38, 213\u2013230 (2007)","journal-title":"Comput. Geometry"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Image Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59108-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,16]],"date-time":"2017-05-16T08:44:20Z","timestamp":1494924260000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59108-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319591070","9783319591087"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59108-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}