{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T19:05:47Z","timestamp":1775847947884,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540688655","type":"print"},{"value":"9783540688808","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68880-8_25","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T06:37:59Z","timestamp":1217486279000},"page":"259-270","source":"Crossref","is-referenced-by-count":2,"title":["No l Grid-Points in Spaces of Small Dimension"],"prefix":"10.1007","author":[{"given":"Hanno","family":"Lefmann","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0097-3165(82)90049-8","volume":"32","author":"M. Ajtai","year":"1982","unstructured":"Ajtai, M., Koml\u00f3s, J., Pintz, J., Spencer, J., Szemer\u00e9di, E.: Extremal Uncrowded Hypergraphs. J. Comb. Theory Ser. A\u00a032, 321\u2013335 (1982)","journal-title":"J. Comb. Theory Ser. A"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1023\/A:1015233631926","volume":"43","author":"I. B\u00e1r\u00e1ny","year":"2001","unstructured":"B\u00e1r\u00e1ny, I., Harcos, G., Pach, J., Tardos, G.: Covering Lattice Points by Subspaces. Per. Math. Hung.\u00a043, 93\u2013103 (2001)","journal-title":"Per. Math. Hung."},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1137\/S0097539797323716","volume":"29","author":"C. Bertram\u2013Kretzberg","year":"1999","unstructured":"Bertram\u2013Kretzberg, C., Lefmann, H.: The Algorithmic Aspects of Uncrowded Hypergraphs. SIAM J. on Comput.\u00a029, 201\u2013230 (1999)","journal-title":"SIAM J. on Comput."},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0925-7721(02)00127-X","volume":"25","author":"P. Brass","year":"2003","unstructured":"Brass, P., Knauer, C.: On Counting Point-Hyperplane Incidences. Comp. Geo.\u00a025, 13\u201320 (2003)","journal-title":"Comp. Geo."},{"key":"25_CR5","first-page":"417","volume-title":"Research Problems in Discrete Geometry","author":"P. Brass","year":"2005","unstructured":"Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry, pp. 417\u2013421. Springer, Heidelberg (2005)"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF02522826","volume":"17","author":"R.-F. Cohen","year":"1996","unstructured":"Cohen, R.-F., Eades, P., Lin, T., Ruskey, F.: Three-Dimensional Graph Drawing. Algorithmica\u00a017, 199\u2013208 (1996)","journal-title":"Algorithmica"},{"key":"25_CR7","unstructured":"Dudeney, H.E.: Amusements in Mathematics, Nelson, London, pp. 94\u2013222 (1917)"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/rsa.3240060208","volume":"6","author":"R.A. Duke","year":"1995","unstructured":"Duke, R.A., Lefmann, H., R\u00f6dl, V.: On Uncrowded Hypergraphs. Rand. Struct. & Algorithms\u00a06, 209\u2013212 (1995)","journal-title":"Rand. Struct. & Algorithms"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF01191203","volume":"12","author":"P. Erd\u0151s","year":"1992","unstructured":"Erd\u0151s, P., Graham, R.L., Rusza, I., Taylor, H.: Bounds for Arrays of Dots with Distinct Slopes or Lengths. Combinatorica\u00a012, 39\u201344 (1992)","journal-title":"Combinatorica"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1112\/jlms\/s1-26.3.176","volume":"26","author":"P. Erd\u00f6s","year":"1951","unstructured":"Erd\u00f6s, P., Roth, K.-F.: On a Problem of Heilbronn. J. London Math. Soc.\u00a026, 198\u2013204 (1951)","journal-title":"J. London Math. Soc."},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0097-3165(92)90012-J","volume":"60","author":"A. Flammenkamp","year":"1992","unstructured":"Flammenkamp, A.: Progress in the No-three-in-a-Line-Problem. J. Comb. Theory, Ser. A\u00a060, 305\u2013311 (1992)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jcta.1997.2829","volume":"81","author":"A. Flammenkamp","year":"1998","unstructured":"Flammenkamp, A.: Progress in the No-three-in-a-Line-Problem. II. J. Comb. Theory, Ser. A\u00a081, 108\u2013113 (1998)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0404019","volume":"4","author":"Z. F\u00fcredi","year":"1991","unstructured":"F\u00fcredi, Z.: Maximal Independent Subsets in Steiner Systems and in Planar Sets. SIAM J. Disc. Math.\u00a04, 196\u2013199 (1991)","journal-title":"SIAM J. Disc. Math."},{"key":"25_CR14","first-page":"1","volume":"166","author":"S.W. Golomb","year":"1991","unstructured":"Golomb, S.W.: Construction of Signals with Favourable Correlation Properties. Surveys in Combinatorics, London Mathematical Society LNS\u00a0166, 1\u201339 (1991)","journal-title":"Surveys in Combinatorics, London Mathematical Society LNS"},{"key":"25_CR15","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1109\/TIT.1982.1056526","volume":"28","author":"S.W. Golomb","year":"1982","unstructured":"Golomb, S.W., Taylor, H.: Two-dimensional Synchronization Patterns for Minimum Ambiguity. IEEE Transactions Information Theory IT-28, 600\u2013604 (1982)","journal-title":"IEEE Transactions Information Theory IT-"},{"key":"25_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-3585-4","volume-title":"Unsolved Problems in Number Theory","author":"R. Guy","year":"1994","unstructured":"Guy, R.: Unsolved Problems in Number Theory, 2nd edn. Springer, Heidelberg (1994)","edition":"2"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Pach, J., Thiele, T., T\u00f3th, G.: Three Dimensional Grid Drawings of Graphs. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry. Contemporary Math. 223, pp. 251\u2013255. AMS (1999)","DOI":"10.1090\/conm\/223\/03142"},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s00453-006-0158-9","volume":"47","author":"A. P\u00f3r","year":"2007","unstructured":"P\u00f3r, A., Wood, D.W.: No-Three-in-Line-in-3D. Algorithmica\u00a047, 481\u2013488 (2007)","journal-title":"Algorithmica"},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0012-365X(72)90084-2","volume":"2","author":"J. Spencer","year":"1972","unstructured":"Spencer, J.: Tur\u00e1n\u2019s Theorem for k-Graphs. Disc. Math.\u00a02, 183\u2013186 (1972)","journal-title":"Disc. Math."},{"key":"25_CR20","unstructured":"Thiele, T.: Geometric Selection Problems and Hypergraphs, PhD thesis, FU Berlin (1995)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68880-8_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:17:04Z","timestamp":1620015424000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68880-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688655","9783540688808"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68880-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}