{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:08:07Z","timestamp":1725552487986},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121999"},{"type":"electronic","value":"9783642122002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12200-2_52","type":"book-chapter","created":{"date-parts":[[2010,4,21]],"date-time":"2010-04-21T13:53:05Z","timestamp":1271857985000},"page":"603-614","source":"Crossref","is-referenced-by-count":0,"title":["Counting Hexagonal Patches and Independent Sets in Circle Graphs"],"prefix":"10.1007","author":[{"given":"Paul","family":"Bonsma","sequence":"first","affiliation":[]},{"given":"Felix","family":"Breuer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"52_CR1","unstructured":"Blank, S.J.: Extending immersions of the circle. PhD thesis, Brandeis University (1967)"},{"key":"52_CR2","unstructured":"Bonsma, P., Breuer, F.: Finding fullerene patches in polynomial time I: Counting hexagonal patches (2008), http:\/\/arxiv.org\/abs\/0808.3881"},{"key":"52_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1007\/978-3-642-10631-6_76","volume-title":"Algorithms and Computation","author":"P. Bonsma","year":"2009","unstructured":"Bonsma, P., Breuer, F.: Finding fullerene patches in polynomial time. In: Dong, Y., Du, D.-Z., Ibarra, O.H. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 750\u2013759. Springer, Heidelberg (2009)"},{"issue":"3","key":"52_CR4","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF02579301","volume":"7","author":"A. Bouchet","year":"1987","unstructured":"Bouchet, A.: Reducing prime graphs and recognizing circle graphs. Combinatorica\u00a07(3), 243\u2013254 (1987)","journal-title":"Combinatorica"},{"key":"52_CR5","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719796","volume-title":"Graph classes, a survey","author":"A. Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph classes, a survey. SIAM, Philadelphia (1999)"},{"key":"52_CR6","unstructured":"Brinkmann, G., Coppens, B.: An efficient algorithm for the generation of planar polycyclic hydrocarbons with a given boundary. MATCH Commun. Math. Comput. Chem. (2009)"},{"key":"52_CR7","series-title":"DIMACS Ser. Discrete Math. Theoret. Comput. Sci","first-page":"27","volume-title":"Graphs and discovery","author":"G. Brinkmann","year":"2005","unstructured":"Brinkmann, G., Delgado-Friedrichs, O., von Nathusius, U.: Numbers of faces and boundary encodings of patches. In: Graphs and discovery. DIMACS Ser. Discrete Math. Theoret. Comput. Sci, vol.\u00a069, pp. 27\u201338. Amer. Math. Soc., Providence (2005)"},{"issue":"2","key":"52_CR8","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1006\/jagm.1996.0806","volume":"23","author":"G. Brinkmann","year":"1997","unstructured":"Brinkmann, G., Dress, A.W.M.: A constructive enumeration of fullerenes. J. Algorithms\u00a023(2), 345\u2013358 (1997)","journal-title":"J. Algorithms"},{"issue":"1-2","key":"52_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0166-218X(00)00328-0","volume":"116","author":"G. Brinkmann","year":"2002","unstructured":"Brinkmann, G., Nathusius, U.v., Palser, A.H.R.: A constructive enumeration of nanotube caps. Discrete Appl. Math.\u00a0116(1-2), 55\u201371 (2002)","journal-title":"Discrete Appl. Math."},{"key":"52_CR10","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1021\/ci000060o","volume":"41","author":"M. Deza","year":"2001","unstructured":"Deza, M., Fowler, P.W., Grishukhin, V.: Allowed boundary sequences for fused polycyclic patches and related algorithmic problems. J. Chem. Inf. Comput. Sci.\u00a041, 300\u2013308 (2001)","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"52_CR11","volume-title":"Graph theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph theory, 3rd edn. Springer, Berlin (2005)","edition":"3"},{"key":"52_CR12","doi-asserted-by":"publisher","first-page":"1518","DOI":"10.1016\/j.dam.2006.11.020","volume":"156","author":"M. Dutour Sikiri\u0107","year":"2008","unstructured":"Dutour Sikiri\u0107, M., Deza, M., Shtogrin, M.: Filling of a given boundary by p-gons and related problems. Discrete Appl. Math.\u00a0156, 1518\u20131535 (2008)","journal-title":"Discrete Appl. Math."},{"key":"52_CR13","doi-asserted-by":"publisher","first-page":"6941","DOI":"10.1021\/j100196a017","volume":"96","author":"M. Endo","year":"1992","unstructured":"Endo, M., Kroto, H.W.: Formation of carbon nanofibers. J. Phys. Chem.\u00a096, 6941\u20136944 (1992)","journal-title":"J. Phys. Chem."},{"key":"52_CR14","first-page":"160","volume-title":"SODA 2009","author":"D. Eppstein","year":"2009","unstructured":"Eppstein, D., Mumford, E.: Self-overlapping curves revisited. In: SODA 2009, pp. 160\u2013169. SIAM, Philadelphia (2009)"},{"issue":"4","key":"52_CR15","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1307\/mmj\/1029000526","volume":"17","author":"G.K. Francis","year":"1970","unstructured":"Francis, G.K.: Extensions to the disk of properly nested plane immersions of the circle. Michigan Math. J.\u00a017(4), 377\u2013383 (1970)","journal-title":"Michigan Math. J."},{"issue":"3","key":"52_CR16","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1145\/65950.65951","volume":"36","author":"C.P. Gabor","year":"1989","unstructured":"Gabor, C.P., Supowit, K.J., Hsu, W.L.: Recognizing circle graphs in polynomial time. J. ACM\u00a036(3), 435\u2013473 (1989)","journal-title":"J. ACM"},{"issue":"3","key":"52_CR17","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/net.3230030305","volume":"3","author":"F. Gavril","year":"1973","unstructured":"Gavril, F.: Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks\u00a03(3), 261\u2013273 (1973)","journal-title":"Networks"},{"key":"52_CR18","first-page":"189","volume":"48","author":"J.E. Graver","year":"2003","unstructured":"Graver, J.E.: The (m,k)-patch boundary code problem. MATCH Commun. Math. Comput. Chem.\u00a048, 189\u2013196 (2003)","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"52_CR19","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0166-218X(01)00180-9","volume":"118","author":"X. Guo","year":"2002","unstructured":"Guo, X., Hansen, P., Zheng, M.: Boundary uniqueness of fusenes. Discrete Appl. Math.\u00a0118, 209\u2013222 (2002)","journal-title":"Discrete Appl. Math."},{"key":"52_CR20","doi-asserted-by":"crossref","unstructured":"Nash, N., Lelait, S., Gregg, D.: Efficiently implementing maximum independent set algorithms on circle graphs. ACM J. Exp. Algorithmics\u00a013 (2009)","DOI":"10.1145\/1412228.1455265"},{"issue":"1","key":"52_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00009330","volume":"19","author":"R. Seidel","year":"1998","unstructured":"Seidel, R.: The nature and meaning of perturbations in geometric computing. Discrete Comput. Geom.\u00a019(1), 1\u201317 (1998)","journal-title":"Discrete Comput. Geom."},{"key":"52_CR22","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0925-7721(92)90019-O","volume":"2","author":"P.W. Shor","year":"1992","unstructured":"Shor, P.W., Van Wyk, C.J.: Detecting and decomposing self-overlapping curves. Comput. Geom.\u00a02, 31\u201350 (1992)","journal-title":"Comput. Geom."},{"issue":"2","key":"52_CR23","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/jagm.1994.1012","volume":"16","author":"J.P. Spinrad","year":"1994","unstructured":"Spinrad, J.P.: Recognition of circle graphs. J. Algorithms\u00a016(2), 264\u2013282 (1994)","journal-title":"J. Algorithms"},{"issue":"1","key":"52_CR24","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1109\/TCAD.1987.1270250","volume":"6","author":"K.J. Supowit","year":"1987","unstructured":"Supowit, K.J.: Finding a maximum planar subset of a set of nets in a channel. IEEE T. Comput. Aid. D.\u00a06(1), 93\u201394 (1987)","journal-title":"IEEE T. Comput. Aid. D."},{"key":"52_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-540-24587-2_15","volume-title":"Algorithms and Computation","author":"G. Valiente","year":"2003","unstructured":"Valiente, G.: A new simple algorithm for the maximum-weight independent set problem on circle graphs. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 129\u2013137. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2010: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12200-2_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:51:20Z","timestamp":1606186280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12200-2_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121999","9783642122002"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12200-2_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}