{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:28:25Z","timestamp":1742952505360,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030174019"},{"type":"electronic","value":"9783030174026"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17402-6_17","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T13:37:00Z","timestamp":1558359420000},"page":"199-211","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Searching by Heterogeneous Agents"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4000-4818","authenticated-orcid":false,"given":"Dariusz","family":"Dereniowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1902-7580","authenticated-orcid":false,"given":"\u0141ukasz","family":"Kuszner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8409-4881","authenticated-orcid":false,"given":"Robert","family":"Ostrowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.tcs.2015.02.038","volume":"580","author":"O Amini","year":"2015","unstructured":"Amini, O., Coudert, D., Nisse, N.: Non-deterministic graph searching in trees. Theoret. Comput. Sci. 580, 101\u2013121 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"17_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., et al.: Connected graph searching. Inf. Comput. 219, 1\u201316 (2012)","journal-title":"Inf. Comput."},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Barri\u00e8re, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Capture of an intruder by mobile agents. In: Proceedings of the Fourteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2002, pp. 200\u2013209. ACM (2002)","DOI":"10.1145\/564870.564906"},{"key":"17_CR4","unstructured":"B\u00e4rtschi, A., et al.: Energy-efficient delivery by heterogeneous mobile agents. In: 34th Symposium on Theoretical Aspects of Computer Science, STACS, pp. 10:1\u201310:14 (2017)"},{"issue":"3","key":"17_CR5","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1007\/s00453-016-0124-0","volume":"77","author":"L Blin","year":"2017","unstructured":"Blin, L., Burman, J., Nisse, N.: Exclusive graph searching. Algorithmica 77(3), 942\u2013969 (2017)","journal-title":"Algorithmica"},{"key":"17_CR6","first-page":"283","volume":"81","author":"N Clarke","year":"2006","unstructured":"Clarke, N., Connon, E.: Cops, robber, and alarms. Ars Comb. 81, 283\u2013296 (2006)","journal-title":"Ars Comb."},{"key":"17_CR7","first-page":"97","volume":"56","author":"N Clarke","year":"2000","unstructured":"Clarke, N., Nowakowski, R.: Cops, robber, and photo radar. Ars Comb. 56, 97\u2013103 (2000)","journal-title":"Ars Comb."},{"key":"17_CR8","first-page":"91","volume":"60","author":"N Clarke","year":"2001","unstructured":"Clarke, N., Nowakowski, R.: Cops, robber and traps. Utilitas Mathematica 60, 91\u201398 (2001)","journal-title":"Utilitas Mathematica"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-642-23719-5_59","volume-title":"Algorithms \u2013 ESA 2011","author":"J Czyzowicz","year":"2011","unstructured":"Czyzowicz, J., G\u0105sieniec, L., Kosowski, A., Kranakis, E.: Boundary patrolling by mobile agents with distinct maximal speeds. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 701\u2013712. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23719-5_59"},{"issue":"9","key":"17_CR10","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.ipl.2008.12.022","volume":"109","author":"D Dereniowski","year":"2009","unstructured":"Dereniowski, D.: Maximum vertex occupation time and inert fugitive: recontamination does help. Inf. Process. Lett. 109(9), 422\u2013426 (2009)","journal-title":"Inf. Process. Lett."},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"5700","DOI":"10.1016\/j.tcs.2011.06.017","volume":"412","author":"D Dereniowski","year":"2011","unstructured":"Dereniowski, D.: Connected searching of weighted trees. Theoret. Comput. Sci. 412, 5700\u20135713 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tcs.2012.07.006","volume":"463","author":"D Dereniowski","year":"2012","unstructured":"Dereniowski, D.: Approximate search strategies for weighted trees. Theoret. Comput. Sci. 463, 96\u2013113 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"17_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. 26(4), 1709\u20131732 (2012)","journal-title":"SIAM J. Discrete Math."},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.tcs.2015.03.022","volume":"607","author":"D Dereniowski","year":"2015","unstructured":"Dereniowski, D., Dyer, D., Tifenbach, R., Yang, B.: The complexity of zero-visibility cops and robber. Theoret. Comput. Sci. 607, 135\u2013148 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.tcs.2015.05.055","volume":"608","author":"D Dereniowski","year":"2015","unstructured":"Dereniowski, D., Klasing, R., Kosowski, A., Kuszner, \u0141.: Rendezvous of heterogeneous mobile agents in edge-weighted networks. Theoret. Comput. Sci. 608, 219\u2013230 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Dyer, D., Yang, B., Yasar, \u00d6.: On the fast searching problem. In: 4th International Conference Algorithmic Aspects in Information and Management, AAIM 2008, pp. 143\u2013154 (2008)","DOI":"10.1007\/978-3-540-68880-8_15"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-662-46078-8_16","volume-title":"SOFSEM 2015: Theory and Practice of Computer Science","author":"A Farrugia","year":"2015","unstructured":"Farrugia, A., G\u0105sieniec, L., Kuszner, \u0141., Pacheco, E.: Deterministic rendezvous in restricted graphs. In: Italiano, G.F., Margaria-Steffen, T., Pokorn\u00fd, J., Quisquater, J.-J., Wattenhofer, R. (eds.) SOFSEM 2015. LNCS, vol. 8939, pp. 189\u2013200. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46078-8_16"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-45249-9_1","volume-title":"Distributed Computing and Networking","author":"O Feinerman","year":"2014","unstructured":"Feinerman, O., Korman, A., Kutten, S., Rodeh, Y.: Fast rendezvous on a cycle by agents with different speeds. In: Chatterjee, M., Cao, J., Kothapalli, K., Rajsbaum, S. (eds.) ICDCN 2014. LNCS, vol. 8314, pp. 1\u201313. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-45249-9_1"},{"issue":"2","key":"17_CR19","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s00453-004-1117-y","volume":"41","author":"F Fomin","year":"2004","unstructured":"Fomin, F., Heggernes, P., Telle, J.: Graph searching, elimination trees, and a generalization of bandwidth. Algorithmica 41(2), 73\u201387 (2004)","journal-title":"Algorithmica"},{"issue":"12","key":"17_CR20","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.1016\/j.ic.2008.09.002","volume":"206","author":"P Fraigniaud","year":"2008","unstructured":"Fraigniaud, P., Nisse, N.: Monotony properties of connected visible graph searching. Inf. Comput. 206(12), 1383\u20131393 (2008)","journal-title":"Inf. Comput."},{"issue":"5","key":"17_CR21","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/j.dam.2009.11.003","volume":"158","author":"S Gaspers","year":"2010","unstructured":"Gaspers, S., Messinger, M.E., Nowakowski, R., Pralat, P.: Parallel cleaning of a network with brushes. Discrete Appl. Math. 158(5), 467\u2013478 (2010)","journal-title":"Discrete Appl. Math."},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Ilcinkas, D., Nisse, N., Soguet, D.: The cost of monotonicity in distributed graph searching. Distrib. Comput. 22(2), 117\u2013127 (2009)","DOI":"10.1007\/s00446-009-0089-1"},{"issue":"2","key":"17_CR23","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s00446-014-0226-3","volume":"28","author":"A Kawamura","year":"2015","unstructured":"Kawamura, A., Kobayashi, Y.: Fence patrolling by mobile agents with distinct speeds. Distrib. Comput. 28(2), 147\u2013154 (2015)","journal-title":"Distrib. Comput."},{"issue":"2","key":"17_CR24","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1145\/151261.151263","volume":"40","author":"A LaPaugh","year":"1993","unstructured":"LaPaugh, A.: Recontamination does not help to search a graph. J. ACM 40(2), 224\u2013245 (1993)","journal-title":"J. ACM"},{"key":"17_CR25","unstructured":"Luna, G.D., Flocchini, P., Santoro, N., Viglietta, G., Yamashita, M.: Self-stabilizing meeting in a polygon by anonymous oblivious robots. CoRR abs\/1705.00324 (2017). http:\/\/arxiv.org\/abs\/1705.00324"},{"key":"17_CR26","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.ic.2016.11.007","volume":"252","author":"E Markou","year":"2017","unstructured":"Markou, E., Nisse, N., P\u00e9rennes, S.: Exclusive graph searching vs. pathwidth. Inf. Comput. 252, 243\u2013260 (2017)","journal-title":"Inf. Comput."},{"issue":"1","key":"17_CR27","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","author":"N Megiddo","year":"1988","unstructured":"Megiddo, N., Hakimi, S., Garey, M., Johnson, D., Papadimitriou, C.: The complexity of searching a graph. J. ACM 35(1), 18\u201344 (1988)","journal-title":"J. ACM"},{"key":"17_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-02270-8_20","volume-title":"Frontiers in Algorithmics","author":"R Mihai","year":"2009","unstructured":"Mihai, R., Todinca, I.: Pathwidth is NP-hard for weighted trees. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) FAW 2009. LNCS, vol. 5598, pp. 181\u2013195. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02270-8_20"},{"key":"17_CR29","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/BFb0070400","volume-title":"Theory and Applications of Graphs","author":"T Parsons","year":"1978","unstructured":"Parsons, T.: Pursuit-evasion in a graph. In: Alavi, Y., Lick, D.R. (eds.) Theory and Applications of Graphs. Lecture Notes in Mathematics, vol. 642, pp. 426\u2013441. Springer, Heidelberg (1978). https:\/\/doi.org\/10.1007\/BFb0070400"},{"key":"17_CR30","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.trb.2017.01.011","volume":"99","author":"Z Qian","year":"2017","unstructured":"Qian, Z., Li, J., Li, X., Zhang, M., Wang, H.: Modeling heterogeneous traffic flow: a pragmatic approach. Transp. Res. Part B: Methodol. 99, 183\u2013204 (2017)","journal-title":"Transp. Res. Part B: Methodol."},{"key":"17_CR31","doi-asserted-by":"crossref","unstructured":"Sundaram, S., Krishnamoorthy, K., Casbeer, D.: Pursuit on a graph under partial information from sensors. CoRR abs\/1609.03664 (2016)","DOI":"10.23919\/ACC.2017.7963613"},{"issue":"18","key":"17_CR32","doi-asserted-by":"publisher","first-page":"5770","DOI":"10.1016\/j.disc.2008.05.033","volume":"309","author":"B Yang","year":"2009","unstructured":"Yang, B., Dyer, D., Alspach, B.: Sweeping graphs with large clique number. Discrete Math. 309(18), 5770\u20135780 (2009)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17402-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:56:27Z","timestamp":1710334587000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17402-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174019","9783030174026"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17402-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"95","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}