{"id":"https://openalex.org/W2030416545","doi":"https://doi.org/10.1016/0097-3165(89)90023-x","title":"The minimal number of lines intersected by a set of q + 2 points, blocking sets, and intersecting circles","display_name":"The minimal number of lines intersected by a set of q + 2 points, blocking sets, and intersecting circles","publication_year":1989,"publication_date":"1989-03-01","ids":{"openalex":"https://openalex.org/W2030416545","doi":"https://doi.org/10.1016/0097-3165(89)90023-x","mag":"2030416545"},"language":"en","primary_location":{"id":"doi:10.1016/0097-3165(89)90023-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0097-3165(89)90023-x","pdf_url":null,"source":{"id":"https://openalex.org/S128556326","display_name":"Journal of Combinatorial Theory Series A","issn_l":"0097-3165","issn":["0097-3165","1096-0899"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Theory, Series A","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/eae89d86-2fef-4b18-a751-4b1fb6717eb1","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109082366","display_name":"A. Blokhuis","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"A Blokhuis","raw_affiliation_strings":["Department of Mathematics and Computing Science, Eindhoven University of Technology, P. O. Box 513, 5600 MB Eindhoven, the Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computing Science, Eindhoven University of Technology, P. O. Box 513, 5600 MB Eindhoven, the Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108564835","display_name":"Aiden A. Bruen","orcid":null},"institutions":[{"id":"https://openalex.org/I125749732","display_name":"Western University","ror":"https://ror.org/02grkyz14","country_code":"CA","type":"education","lineage":["https://openalex.org/I125749732"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"A.A Bruen","raw_affiliation_strings":["Department of Mathematics, University of Western Ontario, London, Ontario, Canada N6A5B9"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Western Ontario, London, Ontario, Canada N6A5B9","institution_ids":["https://openalex.org/I125749732"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3320,"currency":"USD","value_usd":3320},"apc_paid":null,"fwci":0.2535,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.57960458,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"50","issue":"2","first_page":"308","last_page":"315"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.96670001745224,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.96670001745224,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11887","display_name":"Quasicrystal Structures and Properties","score":0.9607999920845032,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9575999975204468,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.8408108949661255},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5810033679008484},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5114661455154419},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5017268657684326},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.4237889051437378},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21828249096870422},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0853385329246521},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.03633570671081543}],"concepts":[{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.8408108949661255},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5810033679008484},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5114661455154419},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5017268657684326},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.4237889051437378},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21828249096870422},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0853385329246521},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.03633570671081543}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1016/0097-3165(89)90023-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0097-3165(89)90023-x","pdf_url":null,"source":{"id":"https://openalex.org/S128556326","display_name":"Journal of Combinatorial Theory Series A","issn_l":"0097-3165","issn":["0097-3165","1096-0899"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Theory, Series A","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/eae89d86-2fef-4b18-a751-4b1fb6717eb1","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/eae89d86-2fef-4b18-a751-4b1fb6717eb1","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Blokhuis, A & Bruen, A A 1989, 'The minimal number of lines intersected by a set of q + 2 points, blocking sets, and intersecting circles', Journal of Combinatorial Theory, Series A, vol. 50, no. 2, pp. 308-315. https://doi.org/10.1016/0097-3165(89)90023-X","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:680583","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=680583","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0097-3165","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:680583","is_oa":false,"landing_page_url":"http://repository.tue.nl/680583","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0097-3165","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/eae89d86-2fef-4b18-a751-4b1fb6717eb1","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/eae89d86-2fef-4b18-a751-4b1fb6717eb1","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Combinatorial Theory, Series A, 50(2), 308 - 315. Academic Press Inc.","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/eae89d86-2fef-4b18-a751-4b1fb6717eb1","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/eae89d86-2fef-4b18-a751-4b1fb6717eb1","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Blokhuis, A & Bruen, A A 1989, 'The minimal number of lines intersected by a set of q + 2 points, blocking sets, and intersecting circles', Journal of Combinatorial Theory, Series A, vol. 50, no. 2, pp. 308-315. https://doi.org/10.1016/0097-3165(89)90023-X","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6600000262260437,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W27924736","https://openalex.org/W132169242","https://openalex.org/W1492974404","https://openalex.org/W1995978860","https://openalex.org/W2003397547","https://openalex.org/W2069619786","https://openalex.org/W2079259333","https://openalex.org/W2124113125","https://openalex.org/W3143524342","https://openalex.org/W6601158225"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2392835431","https://openalex.org/W4245490552","https://openalex.org/W1978042415","https://openalex.org/W1999686808","https://openalex.org/W2009906976","https://openalex.org/W3214270428","https://openalex.org/W3209847352","https://openalex.org/W2145824340"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4}],"updated_date":"2026-06-19T17:40:00.097472","created_date":"2025-10-10T00:00:00"}
