{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:55Z","timestamp":1759638775386},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169250"},{"type":"electronic","value":"9783642169267"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16926-7_27","type":"book-chapter","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T07:48:26Z","timestamp":1289375306000},"page":"292-303","source":"Crossref","is-referenced-by-count":6,"title":["Graphs with Large Obstacle Numbers"],"prefix":"10.1007","author":[{"given":"Padmini","family":"Mukkamala","sequence":"first","affiliation":[]},{"given":"J\u00e1nos","family":"Pach","sequence":"additional","affiliation":[]},{"given":"Deniz","family":"Sar\u0131\u00f6z","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1112\/S0025579300013875","volume":"33","author":"N. Alon","year":"1986","unstructured":"Alon, N.: The number of polytopes, configurations and real matroids. Mathematika\u00a033(1), 62\u201371 (1986)","journal-title":"Mathematika"},{"key":"27_CR2","unstructured":"Aloupis, G., Ballinger, B., Collette, S., Langerman, S., Por, A., Wood, D.R.: Blocking coloured point sets. In: 26th European Workshop on Computational Geometry (EuroCG 2010), Dortmund, Germany (March 2010), arXiv:1002.0190v1 [math.CO]"},{"key":"27_CR3","unstructured":"Alpert, H., Koch, C., Laison, J.: Obstacle numbers of graphs. Discrete and Computational Geometry, 27 (December 2009), http:\/\/www.springerlink.com\/content\/45038g67t22463g5 (viewed on 12\/26\/09)"},{"issue":"3-4","key":"27_CR4","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF02574043","volume":"13","author":"E.M. Arkin","year":"1995","unstructured":"Arkin, E.M., Halperin, D., Kedem, K., Mitchell, J.S.B., Naor, N.: Arrangements of segments that share endpoints: single face results. Discrete Comput. Geom.\u00a013(3-4), 257\u2013270 (1995)","journal-title":"Discrete Comput. Geom."},{"key":"27_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry. Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry. Algorithms and Applications, 2nd edn. Springer, Berlin (2000)","edition":"2"},{"key":"27_CR6","series-title":"Algorithms and Combinatorics 14","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/978-3-642-60406-5_7","volume-title":"The Mathematics of Paul Erd\u0151s","author":"B. Bollob\u00e1s","year":"1997","unstructured":"Bollob\u00e1s, B., Thomason, A.: Hereditary and monotone properties of graphs. In: Graham, R.L., Ne\u0161et\u0159il, J. (eds.) The Mathematics of Paul Erd\u0151s. Algorithms and Combinatorics 14, vol.\u00a02, pp. 70\u201378. Springer, Berlin (1997)"},{"issue":"1","key":"27_CR7","first-page":"67","volume":"19","author":"A. Dumitrescu","year":"2009","unstructured":"Dumitrescu, A., Pach, J., T\u00f3th, G.: A note on blocking visibility between points. Geombinatorics\u00a019(1), 67\u201373 (2009)","journal-title":"Geombinatorics"},{"issue":"1-2","key":"27_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0166-218X(89)90045-0","volume":"25","author":"P. Erd\u0151s","year":"1989","unstructured":"Erd\u0151s, P., Hajnal, A.: Ramsey-type theorems. Discrete Appl. Math.\u00a025(1-2), 37\u201352 (1989)","journal-title":"Discrete Appl. Math."},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1090\/S0002-9904-1947-08785-1","volume":"53","author":"P. Erd\u0151s","year":"1947","unstructured":"Erd\u0151s, P.: Some remarks on the theory of graphs. Bull. Amer. Math. Soc.\u00a053, 292\u2013294 (1947)","journal-title":"Bull. Amer. Math. Soc."},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01788085","volume":"2","author":"P. Erd\u0151s","year":"1986","unstructured":"Erd\u0151s, P., Frankl, P., R\u00f6dl, V.: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent. Graph and Combinatorics\u00a02, 113\u2013121 (1986)","journal-title":"Graph and Combinatorics"},{"key":"27_CR11","unstructured":"Erd\u0151s, P., Kleitman, D.J., Rothschild, B.L.: Asymptotic enumeration of K n -free graphs. In: Colloq. Int. Teorie Comb., Roma, Tomo II, pp. 19\u201327 (1976)"},{"key":"27_CR12","first-page":"463","volume":"2","author":"P. Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compositio. Math.\u00a02, 463\u2013470 (1935)","journal-title":"Compositio. Math."},{"issue":"3","key":"27_CR13","doi-asserted-by":"publisher","first-page":"666","DOI":"10.4153\/CJM-1977-069-1","volume":"29","author":"S. Foldes","year":"1977","unstructured":"Foldes, S., Hammer, P.L.: Split graphs having Dilworth number 2. Canadian Journal of Mathematics - Journal Canadien de Mathematiques\u00a029(3), 666\u2013672 (1977)","journal-title":"Canadian Journal of Mathematics - Journal Canadien de Mathematiques"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-77200-2_4","volume-title":"Horizons of Combinatorics, Bolyai Soc. Math. Stud.","author":"J. Fox","year":"2008","unstructured":"Fox, J., Pach, J.: Erd\u0151s\u2013Hajnal-type results on intersection patterns of geometric objects. In: Horizons of Combinatorics, Bolyai Soc. Math. Stud., vol.\u00a017, pp. 79\u2013103. Springer, Berlin (2008)"},{"key":"27_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543340","volume-title":"Visibility algorithms in the plane","author":"S.K. Ghosh","year":"2007","unstructured":"Ghosh, S.K.: Visibility algorithms in the plane. Cambridge University Press, Cambridge (2007)"},{"issue":"3","key":"27_CR16","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF02187696","volume":"1","author":"J.E. Goodman","year":"1986","unstructured":"Goodman, J.E., Pollack, R.: Upper bounds for configurations and polytopes in IR d . Discrete Comput. Geom.\u00a01(3), 219\u2013227 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-58043-7_6","volume-title":"New Trends in Discrete and Computational Geometry, Algorithms Combin.","author":"J.E. Goodman","year":"1993","unstructured":"Goodman, J.E., Pollack, R.: Allowable sequences and order types in discrete and computational geometry. In: New Trends in Discrete and Computational Geometry, Algorithms Combin., vol.\u00a010, pp. 103\u2013134. Springer, Berlin (1993)"},{"issue":"2","key":"27_CR18","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00454-009-9185-z","volume":"42","author":"J. Matou\u0161ek","year":"2009","unstructured":"Matou\u0161ek, J.: Blocking visibility for points in general position. Discrete & Computational Geometry\u00a042(2), 219\u2013223 (2009)","journal-title":"Discrete & Computational Geometry"},{"key":"27_CR19","first-page":"407","volume":"6","author":"J. Matou\u0161ek","year":"1997","unstructured":"Matou\u0161ek, J., Valtr, P.: The complexity of lower envelope of segments with h endpoints. Intuitive Geometry, Bolyai Society of Math. Studies\u00a06, 407\u2013411 (1997)","journal-title":"Intuitive Geometry, Bolyai Society of Math. Studies"},{"key":"27_CR20","series-title":"CRC Press Ser. Discrete Math. Appl","first-page":"467","volume-title":"Handbook of Discrete and Computational Geometry","author":"J. O\u2019Rourke","year":"1997","unstructured":"O\u2019Rourke, J.: Visibility. In: Handbook of Discrete and Computational Geometry. CRC Press Ser. Discrete Math. Appl, pp. 467\u2013479. CRC, Boca Raton (1997)"},{"key":"27_CR21","series-title":"Contemp. Math.","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1090\/conm\/223\/03140","volume-title":"Advances in Discrete and Computational Geometry, South Hadley, MA","author":"J. O\u2019Rourke","year":"1999","unstructured":"O\u2019Rourke, J.: Open problems in the combinatorics of visibility and illumination. In: Advances in Discrete and Computational Geometry, South Hadley, MA. Contemp. Math., vol.\u00a0223, pp. 237\u2013243. Amer. Math. Soc., Providence (1999)"},{"issue":"2","key":"27_CR22","first-page":"98","volume":"13","author":"J. Pach","year":"2003","unstructured":"Pach, J.: Midpoints of segments induced by a point set. Geombinatorics\u00a013(2), 98\u2013105 (2003)","journal-title":"Geombinatorics"},{"key":"27_CR23","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033203","volume-title":"Combinatorial geometry","author":"J. Pach","year":"1995","unstructured":"Pach, J., Agarwal, P.K.: Combinatorial geometry. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons Inc., New York (1995)"},{"issue":"1","key":"27_CR24","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/rsa.3240020106","volume":"2","author":"H.J. Pr\u00f6mel","year":"1991","unstructured":"Pr\u00f6mel, H.J., Steger, A.: Excluding induced subgraphs: Quadrilaterals. Random Structures and Algorithms\u00a02(1), 55\u201371 (1991)","journal-title":"Random Structures and Algorithms"},{"issue":"1","key":"27_CR25","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/rsa.3240030104","volume":"3","author":"H.J. Pr\u00f6mel","year":"1992","unstructured":"Pr\u00f6mel, H.J., Steger, A.: Excluding induced subgraphs III: A general asymptotic. Random Structures and Algorithms\u00a03(1), 19\u201331 (1992)","journal-title":"Random Structures and Algorithms"},{"key":"27_CR26","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0166-218X(93)90237-I","volume":"44","author":"H.J. Pr\u00f6mel","year":"1993","unstructured":"Pr\u00f6mel, H.J., Steger, A.: Excluding induced subgraphs II: extremal graphs. Discrete Applied Mathematics\u00a044, 283\u2013294 (1993)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"27_CR27","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/S0195-6698(83)80036-5","volume":"4","author":"E. Szemer\u00e9di","year":"1983","unstructured":"Szemer\u00e9di, E., Trotter Jr., W.T.: A combinatorial distinction between the Euclidean and projective planes. European J. Combin.\u00a04(4), 385\u2013394 (1983)","journal-title":"European J. Combin."},{"issue":"3-4","key":"27_CR28","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF02579194","volume":"3","author":"E. Szemer\u00e9di","year":"1983","unstructured":"Szemer\u00e9di, E., Trotter Jr., W.T.: Extremal problems in discrete geometry. Combinatorica\u00a03(3-4), 381\u2013392 (1983)","journal-title":"Combinatorica"},{"issue":"3","key":"27_CR29","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1137\/0129040","volume":"29","author":"A. Tucker","year":"1975","unstructured":"Tucker, A.: Coloring a family of circular arcs. SIAM Journal on Applied Mathematics\u00a029(3), 493\u2013502 (1975), http:\/\/www.jstor.org\/stable\/2100446","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"5","key":"27_CR30","first-page":"14","volume":"5","author":"R.I. Ty\u0161kevi\u010d","year":"1979","unstructured":"Ty\u0161kevi\u010d, R.I., \u010cernjak, A.A.: Canonical decomposition of a graph determined by the degrees of its vertices. Vests\u012b Akad. Navuk BSSR Ser. F\u012bz.-Mat. Navuk\u00a05(5), 14\u201326, 138 (1979) (in Russian)","journal-title":"Vests\u012b Akad. Navuk BSSR Ser. F\u012bz.-Mat. Navuk"},{"key":"27_CR31","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1016\/B978-044482537-7\/50023-1","volume-title":"Handbook of Computational Geometry","author":"J. Urrutia","year":"2000","unstructured":"Urrutia, J.: Art gallery and illumination problems. In: Handbook of Computational Geometry, pp. 973\u20131027. North-Holland, Amsterdam (2000)"}],"container-title":["Lecture Notes in Computer Science","Graph Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16926-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,13]],"date-time":"2020-06-13T17:33:10Z","timestamp":1592069590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16926-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169250","9783642169267"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16926-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}