{"id":"https://openalex.org/W2799900533","doi":"https://doi.org/10.1145/3186897","title":"Exact Algorithms for Terrain Guarding","display_name":"Exact Algorithms for Terrain Guarding","publication_year":2018,"publication_date":"2018-04-16","ids":{"openalex":"https://openalex.org/W2799900533","doi":"https://doi.org/10.1145/3186897","mag":"2799900533"},"language":"en","primary_location":{"id":"doi:10.1145/3186897","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3186897","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.tue.nl/ws/files/108330597/Main.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043929563","display_name":"Pradeesha Ashok","orcid":"https://orcid.org/0000-0003-2174-0051"},"institutions":[{"id":"https://openalex.org/I181514455","display_name":"International Institute of Information Technology Bangalore","ror":"https://ror.org/05h9eqy10","country_code":"IN","type":"education","lineage":["https://openalex.org/I181514455"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Pradeesha Ashok","raw_affiliation_strings":["International Institute of Information Technology Bangalore, Bengaluru, Karnataka, India"],"affiliations":[{"raw_affiliation_string":"International Institute of Information Technology Bangalore, Bengaluru, Karnataka, India","institution_ids":["https://openalex.org/I181514455"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075328697","display_name":"Fedor V. Fomin","orcid":"https://orcid.org/0000-0003-1955-4612"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Fedor V. Fomin","raw_affiliation_strings":["University of Bergen, Bergen, Norway"],"affiliations":[{"raw_affiliation_string":"University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000594690","display_name":"Sudeshna Kolay","orcid":"https://orcid.org/0000-0002-2975-4856"},"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":"Sudeshna Kolay","raw_affiliation_strings":["Eindhoven University of Technology, Netherlands, Eindhoven, Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Netherlands, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015806060","display_name":"Saket Saurabh","orcid":"https://orcid.org/0000-0001-7847-6402"},"institutions":[{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Saket Saurabh","raw_affiliation_strings":["University of Bergen and Institute of Mathematical Sciences, Tharamani, Chennai, Tamil Nadu, India"],"affiliations":[{"raw_affiliation_string":"University of Bergen and Institute of Mathematical Sciences, Tharamani, Chennai, Tamil Nadu, India","institution_ids":["https://openalex.org/I59611059"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082025487","display_name":"Meirav Zehavi","orcid":"https://orcid.org/0000-0002-3636-5322"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Meirav Zehavi","raw_affiliation_strings":["Ben-Gurion University, Beersheba, Israel"],"affiliations":[{"raw_affiliation_string":"Ben-Gurion University, Beersheba, Israel","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5043929563"],"corresponding_institution_ids":["https://openalex.org/I181514455"],"apc_list":null,"apc_paid":null,"fwci":9.3189,"has_fulltext":true,"cited_by_count":17,"citation_normalized_percentile":{"value":0.97645532,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"14","issue":"2","first_page":"1","last_page":"20"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9968000054359436,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.8161722421646118},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6407201290130615},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6231681704521179},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6042014360427856},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5628204941749573},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.46611669659614563},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.465408593416214},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4247216582298279}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8161722421646118},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6407201290130615},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6231681704521179},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6042014360427856},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5628204941749573},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.46611669659614563},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.465408593416214},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4247216582298279},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3186897","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3186897","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:publications/58bcab69-eace-4999-9cf6-8c5af8462c3c","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/58bcab69-eace-4999-9cf6-8c5af8462c3c","pdf_url":"https://pure.tue.nl/ws/files/108330597/Main.pdf","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":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Ashok, P, Fomin, F V, Kolay, S, Saurabh, S & Zehavi, M 2018, 'Exact algorithms for terrain guarding', ACM Transactions on Algorithms, vol. 14, no. 2, 25. https://doi.org/10.1145/3186897","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/58bcab69-eace-4999-9cf6-8c5af8462c3c","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/58bcab69-eace-4999-9cf6-8c5af8462c3c","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":"ACM Transactions on Algorithms, 14(2):25. Association for Computing Machinery, Inc","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:publications/58bcab69-eace-4999-9cf6-8c5af8462c3c","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/58bcab69-eace-4999-9cf6-8c5af8462c3c","pdf_url":"https://pure.tue.nl/ws/files/108330597/Main.pdf","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":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Ashok, P, Fomin, F V, Kolay, S, Saurabh, S & Zehavi, M 2018, 'Exact algorithms for terrain guarding', ACM Transactions on Algorithms, vol. 14, no. 2, 25. https://doi.org/10.1145/3186897","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2799900533.pdf","grobid_xml":"https://content.openalex.org/works/W2799900533.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W35252975","https://openalex.org/W1922419250","https://openalex.org/W1970504456","https://openalex.org/W1983156760","https://openalex.org/W1995725694","https://openalex.org/W1999396007","https://openalex.org/W2004151341","https://openalex.org/W2059897834","https://openalex.org/W2080414714","https://openalex.org/W2094658339","https://openalex.org/W2105739218","https://openalex.org/W2115708125","https://openalex.org/W2116087731","https://openalex.org/W2129637633","https://openalex.org/W2143474538","https://openalex.org/W2158584754","https://openalex.org/W2164603914","https://openalex.org/W2169377804","https://openalex.org/W2191206483","https://openalex.org/W2202656516","https://openalex.org/W2261811080","https://openalex.org/W2361638598","https://openalex.org/W2404720911","https://openalex.org/W2405970943","https://openalex.org/W2502636724","https://openalex.org/W2546555264","https://openalex.org/W2761528772","https://openalex.org/W2914414140","https://openalex.org/W4300427837"],"related_works":["https://openalex.org/W1034070228","https://openalex.org/W4389156785","https://openalex.org/W4299992882","https://openalex.org/W2949506010","https://openalex.org/W2173621488","https://openalex.org/W2113885662","https://openalex.org/W4288277589","https://openalex.org/W2998616538","https://openalex.org/W2964749573","https://openalex.org/W2401679980"],"abstract_inverted_index":{"Given":[0],"a":[1,21,43,47,87,154,160,227],"1.5-dimensional":[2],"terrain":[3],"T":[4,15,29,37,61,64,105,121,192,199,222,232],",":[5,125,226,236],"also":[6,205],"known":[7,130],"as":[8],"an":[9,180],"x":[10],"-monotone":[11],"polygonal":[12],"chain,":[13],"the":[14,34,54,114,137,150,174,212],"errain":[16,65,106,122,193,200,223,233],"G":[17,66,107,123,194,201,224,234],"uarding":[18,67,108,124,195,202,225,235],"problem":[19,68,85],"seeks":[20],"set":[22],"of":[23,25,33,53,113,153,231],"points":[24,35],"minimum":[26],"size":[27,151],"on":[28,36],"that":[30,42,83,104,217],"guards":[31,46],"all":[32],".":[38,62,203],"Here,":[39],"we":[40,172,215],"say":[41],"point":[44,48,52],"p":[45],"q":[49],"if":[50,147],"no":[51],"line":[55],"segment":[56],"pq":[57],"is":[58,109,129,166,237],"strictly":[59],"below":[60],"The":[63],"has":[69],"been":[70],"extensively":[71],"studied":[72],"for":[73,120,188],"over":[74],"20":[75],"years.":[76],"In":[77,111,135,169],"2005":[78],"it":[79,158,165],"was":[80],"already":[81],"established":[82],"this":[84,143,170],"admits":[86,159],"constant-factor":[88],"approximation":[89,118],"algorithm":[90,162,187],"(SODA":[91,100],"2005).":[92],"However,":[93],"only":[94],"in":[95,117,142],"2010":[96],"King":[97],"and":[98,163,196],"Krohn":[99],"2010)":[101],"finally":[102],"showed":[103],"NP-hard.":[110],"spite":[112],"remarkable":[115],"developments":[116],"algorithms":[119],"next":[126],"to":[127,211],"nothing":[128],"about":[131],"its":[132],"parameterized":[133,148],"complexity.":[134],"particular,":[136],"most":[138],"intriguing":[139],"open":[140],"questions":[141],"direction":[144],"ask":[145],"whether,":[146],"by":[149,178],"k":[152,184],"solution":[155],"guard":[156],"set,":[157],"subexponential-time":[161],"whether":[164],"fixed-parameter":[167,238],"tractable.":[168,239],"article,":[171],"answer":[173],"first":[175],"question":[176],"affirmatively":[177],"developing":[179],"n":[181],"O":[182,220],"(\u221a":[183],")":[185],"-time":[186],"both":[189],"D":[190,218],"iscrete":[191,219],"C":[197],"ontinuous":[198],"We":[204],"make":[206],"non-trivial":[207],"progress":[208],"with":[209],"respect":[210],"second":[213],"question:":[214],"show":[216],"rthogonal":[221],"well-studied":[228],"special":[229],"case":[230]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-03T22:45:19.894376","created_date":"2025-10-10T00:00:00"}