{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:56:23Z","timestamp":1725573383996},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309352"},{"type":"electronic","value":"9783540324263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11602613_61","type":"book-chapter","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T08:24:24Z","timestamp":1133511864000},"page":"604-613","source":"Crossref","is-referenced-by-count":1,"title":["Configurations with Few Crossings in Topological Graphs"],"prefix":"10.1007","author":[{"given":"Christian","family":"Knauer","sequence":"first","affiliation":[]},{"given":"\u00c9tienne","family":"Schramm","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Spillner","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"61_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"61_CR2","first-page":"529","volume-title":"Handbook of Discrete and Computational Geometry, ch.\u00a024","author":"D. Halperin","year":"2004","unstructured":"Halperin, D.: Arrangements. In: Handbook of Discrete and Computational Geometry, ch.\u00a024, pp. 529\u2013562. CRC Press, Boca Raton (2004)"},{"key":"61_CR3","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/BF01990536","volume":"33","author":"K. Jansen","year":"1993","unstructured":"Jansen, K., Woeginger, G.J.: The complexity of detecting crossingfree configurations in the plane. BIT\u00a033, 580\u2013595 (1993)","journal-title":"BIT"},{"key":"61_CR4","unstructured":"Knauer, C., Schramm, \u00c9., Spillner, A., Wolff, A.: Configurations with few crossings in topological graphs. Techical Report 2005-24, Universit\u00e4t Karlsruhe (September 2005), http:\/\/www.ubka.uni-karlsruhe.de\/cgi-bin\/psview?document=\/ira\/2005\/24"},{"issue":"2","key":"61_CR5","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/0404022","volume":"4","author":"J. Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J., Lubiw, A., Ne\u0161et\u0159il, J.: Noncrossing subgraphs in topological layouts. SIAM J. Disc. Math.\u00a04(2), 223\u2013244 (1991)","journal-title":"SIAM J. Disc. Math."},{"key":"61_CR6","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.V.: An $ {O} (\\sqrt{|V|} |{E}|)$ algorithm for finding maximum matching in general graphs. In: Proc.\u00a0IEEE Symp.\u00a0Found.\u00a0Comp.\u00a0Sci., pp. 17\u201327 (1980)","DOI":"10.1109\/SFCS.1980.12"},{"key":"61_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0012-365X(93)90124-C","volume":"119","author":"F. Rendl","year":"1993","unstructured":"Rendl, F., Woeginger, G.: Reconstructing sets of orthogonal line segments in the plane. Discrete Mathematics\u00a0119, 167\u2013174 (1993)","journal-title":"Discrete Mathematics"},{"key":"61_CR8","doi-asserted-by":"publisher","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","volume":"6","author":"W.T. Tutte","year":"1954","unstructured":"Tutte, W.T.: A short proof of the factor theorem for finite graphs. Canad. J. Math.\u00a06, 347\u2013352 (1954)","journal-title":"Canad. J. Math."},{"key":"61_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF01305952","volume":"14","author":"V.V. Vazirani","year":"1994","unstructured":"Vazirani, V.V.: A theory of alternating paths and blossoms for proving correctness of the O (| V |1\/2 | E |) general graph matching algorithm. Combinatorica\u00a014, 71\u201391 (1994)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11602613_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:03:01Z","timestamp":1619506981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602613_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309352","9783540324263"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11602613_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}