{"id":"https://openalex.org/W2285036874","doi":"https://doi.org/10.4230/lipics.fun.2016.10","title":"Spy-Game on Graphs","display_name":"Spy-Game on Graphs","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2285036874","doi":"https://doi.org/10.4230/lipics.fun.2016.10","mag":"2285036874"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:5878","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.10","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.10","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112385998","display_name":"Nathann Cohen","orcid":"https://orcid.org/0000-0002-3341-3712"},"institutions":[{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]},{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Cohen, Nathann","raw_affiliation_strings":["LRI - Laboratoire de Recherche en Informatique (LRI - B\u00e2timents 650-660 Universit\u00e9 Paris-Sud 91405 Orsay Cedex - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LRI - Laboratoire de Recherche en Informatique (LRI - B\u00e2timents 650-660 Universit\u00e9 Paris-Sud 91405 Orsay Cedex - France)","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I4210144804"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052748901","display_name":"Mathieu Hilaire","orcid":null},"institutions":[{"id":"https://openalex.org/I11559806","display_name":"\u00c9cole Normale Sup\u00e9rieure Paris-Saclay","ror":"https://ror.org/00hx6zz33","country_code":"FR","type":"education","lineage":["https://openalex.org/I11559806","https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Hilaire, Mathieu","raw_affiliation_strings":["ENS Cachan - \u00c9cole normale sup\u00e9rieure - Cachan (61, avenue du Pr\u00e9sident Wilson - 94230 Cachan - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ENS Cachan - \u00c9cole normale sup\u00e9rieure - Cachan (61, avenue du Pr\u00e9sident Wilson - 94230 Cachan - France)","institution_ids":["https://openalex.org/I11559806"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082079930","display_name":"N\u00edcolas Martins","orcid":"https://orcid.org/0009-0008-3073-1273"},"institutions":[{"id":"https://openalex.org/I243754102","display_name":"Universidade Federal do Cear\u00e1","ror":"https://ror.org/03srtnf24","country_code":"BR","type":"education","lineage":["https://openalex.org/I243754102"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Martins, N\u00edcolas A.","raw_affiliation_strings":["ParGO - Parallelism, Graphs and Optimization Research Group (Universidade Federal do Cear\u00e1 Departamento de Computa\u00e7\u00e3o Campus do Pici, Bloco 910 60440-554 Fortaleza, CE Brazil - Brazil)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ParGO - Parallelism, Graphs and Optimization Research Group (Universidade Federal do Cear\u00e1 Departamento de Computa\u00e7\u00e3o Campus do Pici, Bloco 910 60440-554 Fortaleza, CE Brazil - Brazil)","institution_ids":["https://openalex.org/I243754102"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057804168","display_name":"Nicolas Nisse","orcid":"https://orcid.org/0000-0003-4500-5078"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nisse, Nicolas","raw_affiliation_strings":["COATI - Combinatorics, Optimization and Algorithms for Telecommunications (2004 route des Lucioles BP 93 F-06902 Sophia Antipolis (France) - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"COATI - Combinatorics, Optimization and Algorithms for Telecommunications (2004 route des Lucioles BP 93 F-06902 Sophia Antipolis (France) - France)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108373946","display_name":"St\u00e9phane P\u00e9renn\u00e8s","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P\u00e9rennes, St\u00e9phane","raw_affiliation_strings":["COATI - Combinatorics, Optimization and Algorithms for Telecommunications (2004 route des Lucioles BP 93 F-06902 Sophia Antipolis (France) - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"COATI - Combinatorics, Optimization and Algorithms for Telecommunications (2004 route des Lucioles BP 93 F-06902 Sophia Antipolis (France) - France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5112385998"],"corresponding_institution_ids":["https://openalex.org/I102197404","https://openalex.org/I4210144804"],"apc_list":null,"apc_paid":null,"fwci":1.4418,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.82917156,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9976000189781189,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9761000275611877,"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/combinatorics","display_name":"Combinatorics","score":0.7872614860534668},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6625195145606995},{"id":"https://openalex.org/keywords/guard","display_name":"Guard (computer science)","score":0.6469763517379761},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4674217402935028},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4257241487503052},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42476940155029297},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4198247194290161}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7872614860534668},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6625195145606995},{"id":"https://openalex.org/C141141315","wikidata":"https://www.wikidata.org/wiki/Q2379942","display_name":"Guard (computer science)","level":2,"score":0.6469763517379761},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4674217402935028},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4257241487503052},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42476940155029297},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4198247194290161},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:5878","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.10","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:HAL:hal-01326446v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01326446","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"8th International Conference on Fun with Algorithms, FUN 2016, 2016, La Maddalena, Maddalena Islands, Italy. ⟨10.4230/LIPIcs.FUN.2016.10⟩","raw_type":"Conference papers"},{"id":"doi:10.4230/lipics.fun.2016.10","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fun.2016.10","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:5878","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.10","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[{"score":0.6700000166893005,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G1761114125","display_name":null,"funder_award_id":"ANR-11-LABX-0031-01","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G4847901217","display_name":null,"funder_award_id":"ANR-11-LABX-0031","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G7781955149","display_name":null,"funder_award_id":"INC-0083-00047.01.00/13","funder_id":"https://openalex.org/F4320323202","funder_display_name":"Funda\u00e7\u00e3o Cearense de Apoio ao Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"},{"id":"https://openalex.org/G888338008","display_name":null,"funder_award_id":"INC-0083-00047.01.00/13","funder_id":"https://openalex.org/F4320322892","funder_display_name":"Centre National de la Recherche Scientifique"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320322892","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73"},{"id":"https://openalex.org/F4320323202","display_name":"Funda\u00e7\u00e3o Cearense de Apoio ao Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/007pgtp80"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1497318709","https://openalex.org/W1549486034","https://openalex.org/W1980595063","https://openalex.org/W2028400828","https://openalex.org/W2046635105","https://openalex.org/W2057179567","https://openalex.org/W2064571607","https://openalex.org/W2065848091","https://openalex.org/W2072757898","https://openalex.org/W2092730474","https://openalex.org/W2127236073"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W4254637722","https://openalex.org/W2980401999","https://openalex.org/W3016483420","https://openalex.org/W2331628363","https://openalex.org/W2393030234","https://openalex.org/W3198851420","https://openalex.org/W2379730136","https://openalex.org/W2088149615","https://openalex.org/W3111310291"],"abstract_inverted_index":{"We":[0,155],"define":[1],"and":[2,65,142,147,168,185],"study":[3],"the":[4,39,66,77,80,101,110,133,157,161,181,186],"following":[5],"two-player":[6],"game":[7,136],"on":[8],"a":[9,85,193,196],"graph":[10],"G.":[11],"Let":[12],"k":[13,19,105,116],"in":[14,50,92,173,214],"N^*.":[15],"A":[16],"set":[17],"of":[18,25,79,124,160,183],"guards":[20,67,117,184,209],"is":[21,30,52,109,153,166,171,192,201],"occupying":[22],"some":[23,33],"vertices":[24],"G":[26,191],"while":[27],"one":[28,61,123],"spy":[29,40,64,73,102],"standing":[31],"at":[32,44,87,121,127,129],"node.":[34],"At":[35],"each":[36,56],"turn,":[37],"first":[38],"may":[41,58,68,118],"move":[42,59],"along":[43,60],"most":[45,130],"s":[46,49,152],"edges,":[47],"where":[48],"N^*":[51],"his":[53],"speed.":[54],"Then,":[55,175],"guard":[57],"edge.":[62],"The":[63,72],"occupy":[69],"same":[70],"vertices.":[71],"has":[74],"to":[75,212],"escape":[76],"surveillance":[78],"guards,":[81],"i.e.,":[82],"must":[83],"reach":[84],"vertex":[86],"distance":[88,112,128,188],"more":[89],"than":[90],"d":[91,113,131,189],"N":[93],"(a":[94],"predefined":[95],"distance)":[96],"from":[97,132],"every":[98],"guard.":[99],"Can":[100],"win":[103,213],"against":[104],"guards?":[106],"Similarly,":[107],"what":[108],"minimum":[111],"such":[114,206],"that":[115,120,164,169,202,207],"ensure":[119],"least":[122],"them":[125],"remains":[126],"spy?":[134],"This":[135],"generalizes":[137],"two":[138],"well-studied":[139],"games:":[140],"Cops":[141],"robber":[143],"games":[144],"(when":[145,151],"s=1)":[146],"Eternal":[148],"Dominating":[149],"Set":[150],"unbounded).":[154],"consider":[156],"computational":[158],"complexity":[159],"problem,":[162],"showing":[163],"it":[165,170],"NP-hard":[167],"PSPACE-hard":[172],"DAGs.":[174],"we":[176],"establish":[177],"tight":[178],"tradeoffs":[179],"between":[180],"number":[182],"required":[187,211],"when":[190],"path":[194],"or":[195],"cycle.":[197],"Our":[198],"main":[199],"result":[200],"there":[203],"exists":[204],"beta>0":[205],"Omega(n^{1+beta})":[208],"are":[210],"any":[215],"n*n":[216],"grid.":[217]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2026-05-20T08:49:12.498775","created_date":"2016-06-24T00:00:00"}