{"id":"https://openalex.org/W3132887354","doi":"https://doi.org/10.1142/s0218195920500053","title":"How to Keep an Eye on Small Things","display_name":"How to Keep an Eye on Small Things","publication_year":2020,"publication_date":"2020-06-01","ids":{"openalex":"https://openalex.org/W3132887354","doi":"https://doi.org/10.1142/s0218195920500053","mag":"3132887354"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195920500053","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195920500053","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry &amp; Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101713320","display_name":"Bengt J. Nilsson","orcid":"https://orcid.org/0000-0002-1342-8618"},"institutions":[{"id":"https://openalex.org/I183111857","display_name":"Malm\u00f6 University","ror":"https://ror.org/05wp7an13","country_code":"SE","type":"education","lineage":["https://openalex.org/I183111857"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Bengt J. Nilsson","raw_affiliation_strings":["Department of Computer Science, Malm\u00f6 University, SE-205 06 Malm\u00f6, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Malm\u00f6 University, SE-205 06 Malm\u00f6, Sweden","institution_ids":["https://openalex.org/I183111857"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038614609","display_name":"Pawe\u0142 \u017byli\u0144ski","orcid":"https://orcid.org/0000-0001-6378-7742"},"institutions":[{"id":"https://openalex.org/I40413290","display_name":"University of Gda\u0144sk","ror":"https://ror.org/011dv8m48","country_code":"PL","type":"education","lineage":["https://openalex.org/I40413290"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Pawe\u0142 \u017byli\u0144ski","raw_affiliation_strings":["Institute of Informatics, University of Gda\u0144sk, 80-308 Gda\u0144sk, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Gda\u0144sk, 80-308 Gda\u0144sk, Poland","institution_ids":["https://openalex.org/I40413290"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101713320"],"corresponding_institution_ids":["https://openalex.org/I183111857"],"apc_list":null,"apc_paid":null,"fwci":1.249,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.8671671,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"30","issue":"02","first_page":"97","last_page":"120"},"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.9998000264167786,"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.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9921000003814697,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6770700216293335},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5935490131378174},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.5535333156585693},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5113934874534607},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.5051456093788147},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.484640896320343},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.444879412651062},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3533438742160797},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.31990665197372437},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18104690313339233},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07428675889968872}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6770700216293335},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5935490131378174},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.5535333156585693},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5113934874534607},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.5051456093788147},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.484640896320343},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.444879412651062},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3533438742160797},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.31990665197372437},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18104690313339233},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07428675889968872},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218195920500053","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195920500053","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry &amp; Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7254735828","display_name":null,"funder_award_id":"2015/17/B/ST6/01887","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"}],"funders":[{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1479913796","https://openalex.org/W1974433908","https://openalex.org/W1986642089","https://openalex.org/W1990313671","https://openalex.org/W2007572995","https://openalex.org/W2008416425","https://openalex.org/W2011999472","https://openalex.org/W2017822593","https://openalex.org/W2024874686","https://openalex.org/W2038280788","https://openalex.org/W2057025928","https://openalex.org/W2058510050","https://openalex.org/W2060049097","https://openalex.org/W2063442090","https://openalex.org/W2094658339","https://openalex.org/W2104734478","https://openalex.org/W2132339863","https://openalex.org/W2146181477","https://openalex.org/W2153108139","https://openalex.org/W2172235831","https://openalex.org/W2502636724","https://openalex.org/W4213368447","https://openalex.org/W4232146578","https://openalex.org/W4243235810","https://openalex.org/W4252017042"],"related_works":["https://openalex.org/W2608536130","https://openalex.org/W2102467404","https://openalex.org/W2987051945","https://openalex.org/W53644101","https://openalex.org/W2154329468","https://openalex.org/W2389833224","https://openalex.org/W2154141401","https://openalex.org/W1571990143","https://openalex.org/W2372903818","https://openalex.org/W1567510565"],"abstract_inverted_index":{"We":[0,45,110],"present":[1,17,84,112],"new":[2],"results":[3],"on":[4],"two":[5],"types":[6],"of":[7,28,73,145],"guarding":[8],"problems":[9],"for":[10,23,90,119,149],"polygons.":[11],"For":[12,79],"the":[13,67,80,133],"first":[14],"problem,":[15,82],"we":[16,83,130],"an":[18,70],"optimal":[19],"linear":[20],"time":[21],"algorithm":[22,64,89,118],"computing":[24,91],"a":[25,32,37,55,85,92,103,113,143],"smallest":[26],"set":[27],"points":[29,101],"that":[30,48,61,95,132],"guard":[31],"given":[33],"shortest":[34,93],"path":[35],"in":[36,49,102],"simple":[38],"polygon":[39,104],"having":[40,122],"[Formula:":[41,57,74,86,97,106,114,125,146,152,157],"see":[42,58,75,87,98,107,115,126,147,153,158],"text]":[43,59,99,108],"edges.":[44],"also":[46,111],"prove":[47,131],"polygons":[50],"with":[51,105],"holes,":[52],"there":[53],"is":[54],"constant":[56,151],"such":[60],"no":[62],"polynomial-time":[63],"can":[65],"solve":[66],"problem":[68,121,135],"within":[69],"approximation":[71,117,123],"factor":[72,124,144],"text],":[76,148,154],"unless":[77,155],"P=NP.":[78],"second":[81],"text]-FPT":[88,116],"tour":[94],"sees":[96],"specified":[100],"holes.":[109],"this":[120],"text].":[127],"In":[128],"addition,":[129],"general":[134],"cannot":[136],"be":[137],"polynomially":[138],"approximated":[139],"better":[140],"than":[141],"by":[142],"some":[150],"P":[156],"text]NP.":[159]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
