{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:09Z","timestamp":1760202669316},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_16","type":"book-chapter","created":{"date-parts":[[2013,8,15]],"date-time":"2013-08-15T23:22:47Z","timestamp":1376608967000},"page":"181-192","source":"Crossref","is-referenced-by-count":6,"title":["Exclusive Graph Searching"],"prefix":"10.1007","author":[{"given":"L\u00e9lia","family":"Blin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janna","family":"Burman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Nisse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.ipl.2008.08.011","volume":"109","author":"R. Baldoni","year":"2008","unstructured":"Baldoni, R., Bonnet, F., Milani, A., Raynal, M.: Anonymous graph exploration without collision by mobile robots. Inf. Process. Lett.\u00a0109(2), 98\u2013103 (2008)","journal-title":"Inf. Process. Lett."},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2012.08.004","volume":"219","author":"L. Barri\u00e8re","year":"2012","unstructured":"Barri\u00e8re, L., Flocchini, P., Fomin, F.V., Fraigniaud, P., Nisse, N., Santoro, N., Thilikos, D.M.: Connected graph searching. Inf. Comput.\u00a0219, 1\u201316 (2012)","journal-title":"Inf. Comput."},{"key":"16_CR3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1090\/dimacs\/005\/02","volume":"5","author":"D. Bienstock","year":"1991","unstructured":"Bienstock, D.: Graph searching, path-width, tree-width and related problems (a survey). DIMACS Ser. in Discr. Maths and Theoretical Comp. Sc.\u00a05, 33\u201349 (1991)","journal-title":"DIMACS Ser. in Discr. Maths and Theoretical Comp. Sc."},{"issue":"2","key":"16_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0196-6774(91)90003-H","volume":"12","author":"D. Bienstock","year":"1991","unstructured":"Bienstock, D., Seymour, P.D.: Monotonicity in graph searching. J. Algorithms\u00a012(2), 239\u2013245 (1991)","journal-title":"J. Algorithms"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-33651-5_29","volume-title":"Distributed Computing","author":"L. Blin","year":"2012","unstructured":"Blin, L., Burman, J., Nisse, N.: Brief announcement: Distributed exclusive and perpetual tree searching. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol.\u00a07611, pp. 403\u2013404. Springer, Heidelberg (2012)"},{"key":"16_CR6","unstructured":"Blin, L., Burman, J., Nisse, N.: Exclusive graph searching. Technical report, INRIA (2013), \n                  \n                    http:\/\/hal.archives-ouvertes.fr\/hal-00837543"},{"issue":"1-2","key":"16_CR7","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tcs.2008.02.004","volume":"399","author":"L. Blin","year":"2008","unstructured":"Blin, L., Fraigniaud, P., Nisse, N., Vial, S.: Distributed chasing of network intruders. Theor. Comput. Sci.\u00a0399(1-2), 12\u201337 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-15763-9_29","volume-title":"Distributed Computing","author":"L. Blin","year":"2010","unstructured":"Blin, L., Milani, A., Potop-Butucaru, M., Tixeuil, S.: Exclusive perpetual ring exploration without chirality. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 312\u2013327. Springer, Heidelberg (2010)"},{"key":"16_CR9","first-page":"72","volume":"6","author":"R.L. Breisch","year":"1967","unstructured":"Breisch, R.L.: An intuitive approach to speleotopology. Southwestern Cavers\u00a06, 72\u201378 (1967)","journal-title":"Southwestern Cavers"},{"key":"16_CR10","unstructured":"Breisch, R.L.: Lost in a Cave-applying graph theory to cave exploration (2012)"},{"issue":"1-2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/s00453-011-9524-3","volume":"63","author":"D. Coudert","year":"2012","unstructured":"Coudert, D., Huc, F., Mazauric, D.: A distributed algorithm for computing the node search number in trees. Algorithmica\u00a063(1-2), 158\u2013190 (2012)","journal-title":"Algorithmica"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A., Nisse, N., Suchan, K.: A unified approach for different tasks on rings in robot-based computing systems. In: 15th Workshop on Advances in Par. and Dist. Comp. Models (APDCM). IEEE (2013)","DOI":"10.1109\/IPDPSW.2013.89"},{"issue":"4","key":"16_CR13","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1137\/110826424","volume":"26","author":"D. Dereniowski","year":"2012","unstructured":"Dereniowski, D.: From pathwidth to connected pathwidth. SIAM J. Discrete Math.\u00a026(4), 1709\u20131732 (2012)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"16_CR14","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1006\/inco.1994.1064","volume":"113","author":"J.A. Ellis","year":"1994","unstructured":"Ellis, J.A., Sudborough, I.H., Turner, J.S.: The vertex separation and search number of a graph. Inf. Comput.\u00a0113(1), 50\u201379 (1994)","journal-title":"Inf. Comput."},{"key":"16_CR15","unstructured":"Flocchini, P., Huang, M.J., Luccio, F.L.: Contiguous search in the hypercube for capturing an intruder. In: 19th Int. Par. and Dist. Proc. Symp, IPDPS (2005)"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-46632-0_10","volume-title":"Algorithms and Computations","author":"P. Flocchini","year":"1999","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Hard tasks for weak robots: The role of common knowledge in pattern formation by autonomous mobile robots. In: Aggarwal, A.K., Pandu Rangan, C. (eds.) ISAAC 1999. LNCS, vol.\u00a01741, pp. 93\u2013102. Springer, Heidelberg (1999)"},{"issue":"3","key":"16_CR17","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1002\/net.20373","volume":"56","author":"F.V. Fomin","year":"2010","unstructured":"Fomin, F.V., Heggernes, P., Mihai, R.: Mixed search number and linear-width of interval and split graphs. Networks\u00a056(3), 207\u2013214 (2010)","journal-title":"Networks"},{"issue":"3","key":"16_CR18","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci.\u00a0399(3), 236\u2013245 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-02270-8_5","volume-title":"Frontiers in Algorithmics","author":"P. Heggernes","year":"2009","unstructured":"Heggernes, P., Mihai, R.: Edge search number of cographs in linear time. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) FAW 2009. LNCS, vol.\u00a05598, pp. 16\u201326. Springer, Heidelberg (2009)"},{"issue":"2","key":"16_CR20","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s00446-009-0089-1","volume":"22","author":"D. Ilcinkas","year":"2009","unstructured":"Ilcinkas, D., Nisse, N., Soguet, D.: The cost of monotonicity in distributed graph searching. Distributed Comp.\u00a022(2), 117\u2013127 (2009)","journal-title":"Distributed Comp."},{"issue":"1","key":"16_CR21","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","author":"N. Megiddo","year":"1988","unstructured":"Megiddo, N., Hakimi, S.L., Garey, M.R., Johnson, D.S., Papadimitriou, C.H.: The complexity of searching a graph. J. Assoc. Comput. Mach.\u00a035(1), 18\u201344 (1988)","journal-title":"J. Assoc. Comput. Mach."},{"key":"16_CR22","unstructured":"Parsons, T.D.: The search number of a connected graph. In: 9th Southeastern Conf. on Combinatorics, Graph Theory, and Computing, Congress. Numer., XXI, Winnipeg, Man., Utilitas Math., pp. 549\u2013554 (1978)"},{"issue":"2","key":"16_CR23","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/S0304-3975(99)00241-8","volume":"240","author":"S.-L. Peng","year":"2000","unstructured":"Peng, S.-L., Ho, C.-W., Hsu, T.-S., Ko, M.-T., Tang, C.Y.: Edge and node searching problems on trees. TCS\u00a0240(2), 429\u2013446 (2000)","journal-title":"TCS"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/3-540-45446-2_10","volume-title":"Theoretical Computer Science","author":"G. Prencipe","year":"2001","unstructured":"Prencipe, G.: Instantaneous actions vs. full asynchronicity: Controlling and coordinating a set of autonomous mobile robots. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol.\u00a02202, pp. 154\u2013171. Springer, Heidelberg (2001)"},{"issue":"1","key":"16_CR25","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/S0196-6774(02)00225-0","volume":"47","author":"K. Skodinis","year":"2003","unstructured":"Skodinis, K.: Computing optimal linear layouts of trees in linear time. J. Algorithms\u00a047(1), 40\u201359 (2003)","journal-title":"J. Algorithms"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-74839-7_25","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"K. Suchan","year":"2007","unstructured":"Suchan, K., Todinca, I.: Pathwidth of circular-arc graphs. In: Brandst\u00e4dt, A., Kratsch, D., M\u00fcller, H. (eds.) WG 2007. LNCS, vol.\u00a04769, pp. 258\u2013269. Springer, Heidelberg (2007)"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1007\/978-3-540-30551-4_77","volume-title":"Algorithms and Computation","author":"B. Yang","year":"2004","unstructured":"Yang, B., Dyer, D., Alspach, B.: Sweeping graphs with large clique number (Extended abstract). In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 908\u2013920. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:51:21Z","timestamp":1558302681000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}