{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:18:15Z","timestamp":1742930295734,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031442735"},{"type":"electronic","value":"9783031442742"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-44274-2_25","type":"book-chapter","created":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T01:02:06Z","timestamp":1696035726000},"page":"344-358","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Forbidden Patterns in\u00a0Temporal Graphs Resulting from\u00a0Encounters in\u00a0a\u00a0Corridor"],"prefix":"10.1007","author":[{"given":"Michel","family":"Habib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minh-Hang","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mika\u00ebl","family":"Rabie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Viennot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,30]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Even, S.: Efficient and reliable broadcast is achievable in an eventually connected network. In: Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, pp. 278\u2013281 (1984)","DOI":"10.1145\/800222.806754"},{"key":"25_CR2","doi-asserted-by":"publisher","unstructured":"Axiotis, K., Fotakis, D.: On the size and the approximability of minimum temporally connected subgraphs. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, 11\u201315 July 2016, Rome, Italy. LIPIcs, vol. 55, pp. 149:1\u2013149:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2016.149","DOI":"10.4230\/LIPIcs.ICALP.2016.149"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Bandlow, J.: An elementary proof of the hook formula. Electron. J. Combin. R45 (2008)","DOI":"10.37236\/769"},{"issue":"5","key":"25_CR4","first-page":"387","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. IJPEDS 27(5), 387\u2013408 (2012)","journal-title":"IJPEDS"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2021.04.004","volume":"121","author":"A Casteigts","year":"2021","unstructured":"Casteigts, A., Peters, J.G., Schoeters, J.: Temporal cliques admit sparse spanners. J. Comput. Syst. Sci. 121, 1\u201317 (2021)","journal-title":"J. Comput. Syst. Sci."},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-46908-4_25","volume-title":"Topics in Combinatorics and Graph Theory: Essays in Honour of Gerhard Ringel","author":"P Damaschke","year":"1990","unstructured":"Damaschke, P.: Forbidden ordered subgraphs. In: Bodendiek, R., Henn, R. (eds.) Topics in Combinatorics and Graph Theory: Essays in Honour of Gerhard Ringel, pp. 219\u2013229. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/978-3-642-46908-4_25"},{"issue":"1","key":"25_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1137\/19M1280399","volume":"35","author":"L Feuilloley","year":"2021","unstructured":"Feuilloley, L., Habib, M.: Graph classes and forbidden patterns on three vertices. SIAM J. Discret. Math. 35(1), 55\u201390 (2021)","journal-title":"SIAM J. Discret. Math."},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"316","DOI":"10.4153\/CJM-1954-030-1","volume":"6","author":"JS Frame","year":"1954","unstructured":"Frame, J.S., Robinson, G.D.B., Thrall, R.M.: The hook graphs of the symmetric group. Can. J. Math. 6, 316\u2013324 (1954)","journal-title":"Can. J. Math."},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Guzm\u00e1n-Pro, S., Hell, P., Hern\u00e1ndez-Cruz, C.: Describing hereditary properties by forbidden circular orderings. Appl. Math. Comput. 438, 127555 (2023)","DOI":"10.1016\/j.amc.2022.127555"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-662-44777-2_46","volume-title":"Algorithms - ESA 2014","author":"P Hell","year":"2014","unstructured":"Hell, P., Mohar, B., Rafiey, A.: Ordering without forbidden patterns. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 554\u2013565. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44777-2_46"},{"issue":"3","key":"25_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme, P., Saram\u00e4ki, J.: Temporal networks. Phys. Rep. 519(3), 97\u2013125 (2012)","journal-title":"Phys. Rep."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Kumar, A.: Connectivity and inference problems for temporal networks. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 504\u2013513 (2000)","DOI":"10.1145\/335305.335364"},{"issue":"2","key":"25_CR13","first-page":"2","volume":"24","author":"M Laurent","year":"2017","unstructured":"Laurent, M., Seminaroti, M., Tanigawa, S.: A structural characterization for certifying Robinsonian matrices. Electron. J. Comb. 24(2), 2 (2017)","journal-title":"Electron. J. Comb."},{"issue":"4","key":"25_CR14","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1080\/15427951.2016.1177801","volume":"12","author":"O Michail","year":"2016","unstructured":"Michail, O.: An introduction to temporal graphs: an algorithmic perspective. Internet Math. 12(4), 239\u2013280 (2016)","journal-title":"Internet Math."},{"issue":"3","key":"25_CR15","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/jgt.3190060307","volume":"6","author":"DJ Skrien","year":"1982","unstructured":"Skrien, D.J.: A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs. J. Graph Theory 6(3), 309\u2013316 (1982)","journal-title":"J. Graph Theory"},{"issue":"4","key":"25_CR16","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/S0195-6698(84)80039-6","volume":"5","author":"RP Stanley","year":"1984","unstructured":"Stanley, R.P.: On the number of reduced decompositions of elements of coxeter groups. Eur. J. Comb. 5(4), 359\u2013372 (1984)","journal-title":"Eur. J. Comb."},{"issue":"3","key":"25_CR17","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10801-006-0015-6","volume":"24","author":"BE Tenner","year":"2006","unstructured":"Tenner, B.E.: Reduced decompositions and permutation patterns. J. Algebraic Combin. 24(3), 263\u2013284 (2006). https:\/\/doi.org\/10.1007\/s10801-006-0015-6","journal-title":"J. Algebraic Combin."},{"key":"25_CR18","unstructured":"Villani, N.: Dynamic unit disk graph recognition. Master\u2019s thesis, Universit\u00e9 de Bordeaux (2021). https:\/\/perso.crans.org\/vanille\/share\/satge\/report.pdf"},{"key":"25_CR19","unstructured":"Villani, N., Casteigts, A.: Some thoughts on dynamic unit disk graphs. Algorithmic Aspects of Temporal Graphs IV (2021). https:\/\/www.youtube.com\/watch?v=yZRNLjbfxxs. Satellite workshop of ICALP"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-44274-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T01:05:01Z","timestamp":1709859901000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44274-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031442735","9783031442742"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44274-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"30 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jersey City, NJ","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.bgu.ac.il\/~SSS2023","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":"78","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":"32","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":"8","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":"41% - 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":"5","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)"}},{"value":"4 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}