{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:59:58Z","timestamp":1725494398691},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423065"},{"type":"electronic","value":"9783540477389"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-47738-1_29","type":"book-chapter","created":{"date-parts":[[2007,11,6]],"date-time":"2007-11-06T17:52:49Z","timestamp":1194371569000},"page":"308-317","source":"Crossref","is-referenced-by-count":1,"title":["Structure Theorems for Systems of Segments"],"prefix":"10.1007","author":[{"given":"J\u00e1nos","family":"Pach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f3zsef","family":"Solymosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"key":"29_CR1","first-page":"9","volume":"12","author":"M. Ajtai","year":"1982","unstructured":"M. Ajtai, V. Chv\u00e1tal, M. Newborn, and E. Szemer\u00e9di, Crossing-free subgraphs, Annals of Discrete Mathematics 12 (1982), 9\u201312.","journal-title":"Annals of Discrete Mathematics"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"I. J. Balaban, An optimal algorithm for finding segment intersections, in: Proc. 11th Annual ACM Symposium on Computational Geometry, ACM, 1995, 211\u2013219.","DOI":"10.1145\/220279.220302"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"C-28","author":"J. L. Bentley","year":"1979","unstructured":"J. L. Bentley and T. A. Ottmann, Algorithms for reporting and counting geometric intersections, IEEE Trans. Comput. C-28 (1979), 643\u2013647.","journal-title":"IEEE Trans. Comput."},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/147508.147511","volume":"39","author":"B. Chazelle","year":"1992","unstructured":"B. Chazelle and H. Edelsbrunner, An optimal algorithm for intersecting line segments in the plane, J. ACM 39 (1992), 1\u201354.","journal-title":"J. ACM"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"K. Clarkson","year":"1989","unstructured":"K. Clarkson and P. Shor, Applications of random sampling in computational geometry II, Discrete Comput. Geom. 4 (1989), 387\u2013421.","journal-title":"Discrete Comput. Geom."},{"key":"29_CR6","first-page":"295","volume":"2","author":"J. Koml\u00f3s","year":"1996","unstructured":"J. Koml\u00f3s and M. Simonovits, Szemer\u00e9di\u2019s regularity lemma and its applications in graph theory, in: Bolyai Society Mathematical Studies 2, em Combinatorics, Paul Erd\u00f6s is Eighty (Volume 2), Budapest, 1996, 295\u2013352.","journal-title":"Bolyai Society Mathematical Studies"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1006\/jctb.1994.1071","volume":"62","author":"J. Kratochv\u00edl","year":"1994","unstructured":"J. Kratochv\u00edl and J. Matou\u0161ek, Intersection graphs of segments, Journal of Combinatorial Theory, Series B 62 (1994), 289\u2013315.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"29_CR8","doi-asserted-by":"crossref","first-page":"50","DOI":"10.4064\/cm-3-1-50-57","volume":"3","author":"T. K\u00f6v\u00e1ri","year":"1954","unstructured":"T. K\u00f6v\u00e1ri, V. T. S\u00f3s, and P. Tur\u00e1n, On a problem of K. Zarankiewicz, Colloq. Math. 3 (1954), 50\u201357.","journal-title":"Colloq. Math."},{"key":"29_CR9","volume-title":"Complexity Issues in VLSI, Foundations of Computing Series","author":"T. Leighton","year":"1983","unstructured":"T. Leighton, Complexity Issues in VLSI, Foundations of Computing Series, MIT Press, Cambridge, MA, 1983."},{"key":"29_CR10","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1090\/dimacs\/006\/19","volume-title":"Discrete and Computational Geometry: Papers from the DIMACS Special Year","author":"J. Pach","year":"1991","unstructured":"J. Pach, Notes on geometric graph theory, in Discrete and Computational Geometry: Papers from the DIMACS Special Year (J. E. Goodman, R. Pollack, and W. Steiger, eds.) DIMACS Series in Discrete Mathematics and Theoretical Computer Science 6, American Mathematical Society, Providence, RI, 1991, 273\u2013285."},{"key":"29_CR11","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033203","volume-title":"Combinatorial Geometry","author":"J. Pach","year":"1995","unstructured":"J. Pach and P.K. Agarwal, Combinatorial Geometry, J. Wiley & Sons, New York, 1995."},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1137\/0220029","volume":"20","author":"J. Pach","year":"1991","unstructured":"J. Pach and M. Sharir, On vertical visibility in arrangements of segments and the queue size in the Bentley-Ottmann line sweeping algorithm, SIAM J. Comput. 20 (1991), 460\u2013470.","journal-title":"SIAM J. Comput."},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J. Pach","year":"1997","unstructured":"J. Pach and G. T\u00f3th, Graphs drawn with few crossings per edges, Combinatorica 17 (1997), 427\u2013439.","journal-title":"Combinatorica"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"M. I. Shamos and D. Hoey, Geometric intersection problems, in: Proc. 17th Annual IEEE Symp. on Found. Comput. Sci. (1975), 151\u2013162.","DOI":"10.1109\/SFCS.1976.16"},{"key":"29_CR15","series-title":"(Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976), Colloq. Internat. CNRS","first-page":"399","volume-title":"Probl\u00e9mes combinatoires et th\u00e9orie des graphes","author":"E. Szemer\u00e9di","year":"1978","unstructured":"E. Szemer\u00e9di, Regular partitions of graphs, in: Probl\u00e9mes combinatoires et th\u00e9orie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976), Colloq. Internat. CNRS, 260, CNRS, Paris, 1978, 399\u2013401."}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47738-1_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:19:26Z","timestamp":1556936366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47738-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423065","9783540477389"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-47738-1_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}