{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:42Z","timestamp":1759637802159},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319946665"},{"type":"electronic","value":"9783319946672"}],"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-319-94667-2_12","type":"book-chapter","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T07:56:24Z","timestamp":1530604584000},"page":"141-152","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs"],"prefix":"10.1007","author":[{"given":"Christine","family":"Dahn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nils M.","family":"Kriege","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.7155\/jgaa.00347","volume":"19","author":"C Auer","year":"2015","unstructured":"Auer, C., Brandenburg, F.J., Glei\u00dfner, A., Reislhuber, J.: 1-planarity of graphs with a rotation system. J. Graph Algorithms Appl. 19(1), 67\u201386 (2015)","journal-title":"J. Graph Algorithms Appl."},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-40104-6_9","volume-title":"Algorithms and Data Structures","author":"MJ Bannister","year":"2013","unstructured":"Bannister, M.J., Cabello, S., Eppstein, D.: Parameterized complexity of 1-planarity. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 97\u2013108. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40104-6_9"},{"issue":"10","key":"12_CR3","doi-asserted-by":"publisher","first-page":"3241","DOI":"10.1088\/0305-4470\/15\/10\/028","volume":"15","author":"F Barahona","year":"1982","unstructured":"Barahona, F.: On the computational complexity of Ising spin glass models. J. Phys. A Math. Gen. 15(10), 3241 (1982)","journal-title":"J. Phys. A Math. Gen."},{"unstructured":"Barahona, F.: Balancing signed toroidal graphs in polynomial time. Departamento de Matematicas, Universidad de Chile, Santiago, Chile (1983)","key":"12_CR4"},{"issue":"3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0167-6377(83)90016-0","volume":"2","author":"F Barahona","year":"1983","unstructured":"Barahona, F.: The max-cut problem on graphs not contractible to K5. Oper. Res. Lett. 2(3), 107\u2013111 (1983)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"12_CR6","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1287\/opre.36.3.493","volume":"36","author":"F Barahona","year":"1988","unstructured":"Barahona, F., Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: An application of combinatorial optimization to statistical physics and circuit layout design. Oper. Res. 36(3), 493\u2013513 (1988)","journal-title":"Oper. Res."},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"issue":"1\u20132","key":"12_CR8","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/BF02178370","volume":"80","author":"C Simone De","year":"1995","unstructured":"De Simone, C., Diehl, M., J\u00fcnger, M., Mutzel, P., Reinelt, G., Rinaldi, G.: Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm. J. Stat. Phys. 80(1\u20132), 487\u2013496 (1995)","journal-title":"J. Stat. Phys."},{"unstructured":"Galluccio, A., Loebl, M.: Max cut in toroidal graphs. Instituto di Analisi dei Sistemi ed Informatica, Consiglio Nazionale delle Ricerche, Oktober 1998","key":"12_CR9"},{"issue":"6","key":"12_CR10","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM (JACM) 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/BF02591727","volume":"29","author":"M Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel, M., Nemhauser, G.L.: A polynomial algorithm for the max-cut problem on graphs without long odd cycles. Math. Program. 29(1), 28\u201340 (1984)","journal-title":"Math. Program."},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0167-6377(81)90020-1","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Pulleyblank, W.R.: Weakly bipartite graphs and the max-cut problem. Oper. Res. Lett. 1(1), 23\u201327 (1981)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"12_CR13","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0204019","volume":"4","author":"F Hadlock","year":"1975","unstructured":"Hadlock, F.: Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput. 4(3), 221\u2013225 (1975)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"12_CR14","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput. 2(3), 135\u2013158 (1973)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Proceedings of a symposium on the Complexity of Computer Computations, New York. The IBM Research Symposia Series, pp. 85\u2013103. Plenum Press, New York (1972)","key":"12_CR15","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1002\/jgt.21630","volume":"72","author":"VP Korzhik","year":"2013","unstructured":"Korzhik, V.P., Mohar, B.: Minimal obstructions for 1-immersions and hardness of 1-planarity testing. J. Graph Theory 72(1), 30\u201371 (2013)","journal-title":"J. Graph Theory"},{"unstructured":"Liers, F., Pardella, G.: A simple MAX-CUT algorithm for planar graphs. In: Cafieri, S., Mucherino, A., Nannicini, G., Tarissan, F., Liberti, L., (eds.) Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, 2\u20134 June 2009, pp. 351\u2013354 (2009)","key":"12_CR17"},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10589-010-9335-5","volume":"51","author":"F Liers","year":"2012","unstructured":"Liers, F., Pardella, G.: Partitioning planar graphs: a fast combinatorial approach for max-cut. Comput. Optim. Appl. 51(1), 323\u2013344 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"5","key":"12_CR19","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1137\/S0097539796309326","volume":"28","author":"S Mahajan","year":"1999","unstructured":"Mahajan, S., Ramesh, H.: Derandomizing approximation algorithms based on semidefinite programming. SIAM J. Comput. 28(5), 1641\u20131663 (1999)","journal-title":"SIAM J. Comput."},{"key":"12_CR20","series-title":"Synthesis Lectures on Quantum Computing","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-02518-1","volume-title":"Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice","author":"CC McGeoch","year":"2014","unstructured":"McGeoch, C.C.: Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice. Synthesis Lectures on Quantum Computing. Morgan & Claypool Publishers, San Rafael (2014)"},{"unstructured":"Mutzel, P.: Graphenalgorithmen, Master Vertiefungsvorlesung. Fakult\u00e4t f\u00fcr Informatik, TU Dortmund (2016)","key":"12_CR21"},{"issue":"3","key":"12_CR22","first-page":"502","volume":"10","author":"GI Orlova","year":"1972","unstructured":"Orlova, G.I., Dorfman, Y.G.: Finding the maximum cut in a graph. Eng. Cybern. 10(3), 502\u2013506 (1972)","journal-title":"Eng. Cybern."},{"issue":"3","key":"12_CR23","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J Pach","year":"1997","unstructured":"Pach, J., T\u00f3th, G.: Graphs drawn with few crossings per edge. Combinatorica 17(3), 427\u2013439 (1997)","journal-title":"Combinatorica"},{"issue":"3","key":"12_CR24","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43(3), 425\u2013440 (1991)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"12_CR25","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1109\/12.53581","volume":"39","author":"W-K Shih","year":"1990","unstructured":"Shih, W.-K., Sun, W., Kuo, Y.-S.: Unifying maximum cut and minimum cut of a planar graph. IEEE Trans. Comput. 39(5), 694\u2013697 (1990)","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94667-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T22:02:17Z","timestamp":1661551337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94667-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319946665","9783319946672"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94667-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}