{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:03:47Z","timestamp":1742915027900,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319788241"},{"type":"electronic","value":"9783319788258"}],"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-78825-8_6","type":"book-chapter","created":{"date-parts":[[2018,4,16]],"date-time":"2018-04-16T18:59:07Z","timestamp":1523905147000},"page":"61-74","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Maximum Crossing Number"],"prefix":"10.1007","author":[{"given":"Markus","family":"Chimani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Felsner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Ueckerdt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Valtr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,17]]},"reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"crossref","first-page":"54","DOI":"10.37236\/143","volume":"16","author":"M Alpert","year":"2009","unstructured":"Alpert, M., Feder, E., Harborth, H.: The maximum of the maximum rectilinear crossing numbers of $$d$$-regular graphs of order $$n$$. Electron. J. Combin. 16(1), 54 (2009)","journal-title":"Electron. J. Combin."},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-319-42634-1_37","volume-title":"Computing and Combinatorics","author":"S Bald","year":"2016","unstructured":"Bald, S., Johnson, M.P., Liu, O.: Approximating the maximum rectilinear crossing number. In: Dinh, T.N., Thai, M.T. (eds.) COCOON 2016. LNCS, vol. 9797, pp. 455\u2013467. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42634-1_37"},{"key":"6_CR3","unstructured":"Baltzer, R.: Eine Erinnerung an M\u00f6bius und seinen Freund Weiske. Berichte \u00fcber die Verhandlungen der K\u00f6niglich S\u00e4chsischen Gesellschaft der Wissenschaften zu Leipzig. Mathematisch-Physische Classe 37, 1\u20136 (1885)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-48523-6_17","volume-title":"Automata, Languages and Programming","author":"P Berman","year":"1999","unstructured":"Berman, P., Karpinski, M.: On some tighter inapproximability results (Extended Abstract). In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 200\u2013209. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48523-6_17"},{"issue":"4","key":"6_CR5","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.jda.2008.08.003","volume":"7","author":"OA \u00c7akiroglu","year":"2009","unstructured":"\u00c7akiroglu, O.A., Erten, C., Karatas, \u00d6., S\u00f6zdinler, M.: Crossing minimization in weighted bipartite graphs. J. Discret. Algorithms 7(4), 439\u2013452 (2009)","journal-title":"J. Discret. Algorithms"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.7155\/jgaa.00458","volume":"22","author":"M Chimani","year":"2018","unstructured":"Chimani, M., Felsner, S., Kobourov, S., Ueckerdt, T., Valtr, P., Wolff, A.: On the maximum crossing number. J. Graph Algorithms Appl. 22, 67\u201387 (2018)","journal-title":"J. Graph Algorithms Appl."},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P Eades","year":"1994","unstructured":"Eades, P., Wormald, N.C.: Edge crossings in drawings of bipartite graphs. Algorithmica 11, 379\u2013403 (1994)","journal-title":"Algorithmica"},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1002\/sapm1977562159","volume":"56","author":"W Furry","year":"1977","unstructured":"Furry, W., Kleitman, D.: Maximal rectilinear crossing of cycles. Stud. Appl. Math. 56(2), 159\u2013167 (1977)","journal-title":"Stud. Appl. Math."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"MR Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Alg. Disc. Methods 4, 312\u2013316 (1983)","journal-title":"SIAM J. Alg. Disc. Methods"},{"issue":"6","key":"6_CR10","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Gr\u00fcnbaum, B.: Arrangements and spreads. In: CBMS Regional Conference Series in Mathematics, vol. 10. AMS, Providence, RI (1972)","DOI":"10.1090\/cbms\/010"},{"issue":"2","key":"6_CR12","first-page":"77","volume":"26","author":"H Harborth","year":"1976","unstructured":"Harborth, H.: Parity of numbers of crossings for complete $$n$$-partite graphs. Mathematica Slovaca 26(2), 77\u201395 (1976)","journal-title":"Mathematica Slovaca"},{"issue":"4","key":"6_CR13","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. J. ACM 48(4), 798\u2013859 (2001)","journal-title":"J. ACM"},{"key":"6_CR14","unstructured":"Kang, M., Pikhurko, O., Ravsky, A., Schacht, M., Verbitsky, O.: Obfuscated drawings of planar graphs. ArXiv (2008). http:\/\/arxiv.org\/abs\/0803.0858v3"},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1137\/S0097539705447372","volume":"37","author":"S Khot","year":"2007","unstructured":"Khot, S., Kindler, G., Mossel, E., O\u2019Donnell, R.: Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM J. Comput. 37(1), 319\u2013357 (2007)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"6_CR16","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/PL00009322","volume":"18","author":"L Lov\u00e1sz","year":"1997","unstructured":"Lov\u00e1sz, L., Pach, J., Szegedy, M.: On Conway\u2019s thrackle conjecture. Discret. Comput. Geom. 18(4), 369\u2013376 (1997)","journal-title":"Discret. Comput. Geom."},{"issue":"4","key":"6_CR17","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/s00454-005-1168-0","volume":"33","author":"H Nagamochi","year":"2005","unstructured":"Nagamochi, H.: An improved bound on the one-sided minimum crossing number in two-layered drawings. Discret. Comput. Geom. 33(4), 569\u2013591 (2005)","journal-title":"Discret. Comput. Geom."},{"key":"6_CR18","unstructured":"Piazza, B., Ringeisen, R., Stueckle, S.: Properties of nonminimum crossings for some classes of graphs. In: Proceedings of Graph Theory, Combinatorics, and Applications, pp. 975\u2013989 (1991)"},{"key":"6_CR19","first-page":"9","volume":"2","author":"R Ringeisen","year":"1991","unstructured":"Ringeisen, R., Stueckle, S., Piazza, B.: Subgraphs and bounds on maximum crossings. Bull. Inst. Combin. Appl. 2, 9\u201327 (1991)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"6_CR20","unstructured":"Ringel, G.: Extremal problems in the theory of graphs. In: Proceedings of Theory of Graphs and its Applications (Smolenice 1963), pp. 85\u201390 (1964)"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Schaefer, M.: The graph crossing number and its variants: a survey. Electron. J. Combin. 100 p. (2014). Dynamic Survey #DS21. http:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/DS21","DOI":"10.37236\/2713"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"1773","DOI":"10.1137\/S0097539797331671","volume":"30","author":"F Shahrokhi","year":"2001","unstructured":"Shahrokhi, F., S\u00fdkora, O., Sz\u00e9kely, L.A., Vrt\u2019o, I.: On bipartite drawings and the linear arrangement problem. SIAM J. Comput. 30, 1773\u20131789 (2001)","journal-title":"SIAM J. Comput."},{"key":"6_CR23","volume-title":"Lehrbuch der Kombinatorik: Ausf\u00fchrliche Darstellung der Lehre von den kombinatorischen Operationen (Permutieren, Kombinieren, Variieren)","author":"H Staudacher","year":"1893","unstructured":"Staudacher, H.: Lehrbuch der Kombinatorik: Ausf\u00fchrliche Darstellung der Lehre von den kombinatorischen Operationen (Permutieren, Kombinieren, Variieren). J. Maier, Stuttgart (1893)"},{"issue":"1","key":"6_CR24","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/BF01504336","volume":"17","author":"E Steinitz","year":"1923","unstructured":"Steinitz, E.: \u00dcber die Maximalzahl der Doppelpunkte bei ebenen Polygonen von gerader Seitenzahl. Mathematische Zeitschrift 17(1), 116\u2013129 (1923)","journal-title":"Mathematische Zeitschrift"},{"issue":"1","key":"6_CR25","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.tcs.2008.02.032","volume":"396","author":"O Verbitsky","year":"2008","unstructured":"Verbitsky, O.: On the obfuscation complexity of planar graphs. Theoret. Comput. Sci. 396(1), 294\u2013300 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR26","unstructured":"Woodall, D.R.: Thrackles and deadlock. In: Welsh, D. (ed.) Proceedings of Combinatorial Mathematics and its Applications, pp. 335\u2013347. Academic Press, Cambridge (1971)"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node- and edge-deletion NP-complete problems. In: Proceedings of 10th Annual ACM Symposium Theory Computer (STOC 1978), pp. 253\u2013264. ACM (1978)","DOI":"10.1145\/800133.804355"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78825-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:07:46Z","timestamp":1709809666000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-78825-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319788241","9783319788258"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78825-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Newcastle","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/carma.newcastle.edu.au\/meetings\/iwoca\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}