{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:12Z","timestamp":1759639092345,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030865924"},{"type":"electronic","value":"9783030865931"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86593-1_27","type":"book-chapter","created":{"date-parts":[[2021,9,11]],"date-time":"2021-09-11T20:26:28Z","timestamp":1631391988000},"page":"385-398","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Finding Separators in Temporal Split and Permutation Graphs"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Maack","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4590-798X","authenticated-orcid":false,"given":"Hendrik","family":"Molter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1703-1236","authenticated-orcid":false,"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1450-1901","authenticated-orcid":false,"given":"Malte","family":"Renken","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,9]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","unstructured":"Bender, E.A., Richmond, L.B., Wormald, N.C.: Almost all chordal graphs split. 38(2), 214\u2013221 (1985). https:\/\/doi.org\/10.1017\/S1446788700023077","DOI":"10.1017\/S1446788700023077"},{"issue":"1","key":"27_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s41109-020-00311-0","volume":"5","author":"M Bentert","year":"2020","unstructured":"Bentert, M., Himmel, A.-S., Nichterlein, A., Niedermeier, R.: Efficient computation of optimal temporal walks under waiting-time constraints. Appl. Netw. Sci. 5(1), 73 (2020). https:\/\/doi.org\/10.1007\/s41109-020-00311-0","journal-title":"Appl. Netw. Sci."},{"key":"27_CR3","doi-asserted-by":"publisher","unstructured":"Bodlaender, H.L., Kloks, T., Kratsch, D.: Treewidth and pathwidth of permutation graphs. 8, 606\u2013616 (1995). https:\/\/doi.org\/10.1137\/S089548019223992X","DOI":"10.1137\/S089548019223992X"},{"key":"27_CR4","doi-asserted-by":"publisher","unstructured":"Borgatti, S.P., Everett, M.G.: Models of core\/periphery structures. 21(4), 375\u2013395 (2000). https:\/\/doi.org\/10.1016\/S0378-8733(99)00019-2","DOI":"10.1016\/S0378-8733(99)00019-2"},{"key":"27_CR5","doi-asserted-by":"publisher","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes\u2013A Survey (1999). https:\/\/doi.org\/10.1137\/1.9780898719796","DOI":"10.1137\/1.9780898719796"},{"key":"27_CR6","doi-asserted-by":"publisher","unstructured":"Xuan, B.B., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. 14(02), 267\u2013285 (2003). https:\/\/doi.org\/10.1142\/S0129054103001728","DOI":"10.1142\/S0129054103001728"},{"key":"27_CR7","doi-asserted-by":"publisher","unstructured":"Bu\u00df, S., Molter, H., Niedermeier, R., Rymar, M.: Algorithmic aspects of temporal betweenness, pp. 2084\u20132092 (2020). https:\/\/doi.org\/10.1145\/3394486.3403259","DOI":"10.1145\/3394486.3403259"},{"key":"27_CR8","doi-asserted-by":"publisher","unstructured":"Enright, J., Meeks, K., Mertzios, G.B., Zamaraev, V.: Deleting edges to restrict the size of an epidemic in temporal networks, 119, 60\u201377 (2021) https:\/\/doi.org\/10.1016\/j.jcss.2021.01.007","DOI":"10.1016\/j.jcss.2021.01.007"},{"key":"27_CR9","doi-asserted-by":"publisher","unstructured":"Enright, J., Meeks, K., Skerman, F.: Assigning times to minimise reachability in temporal graphs, 115, 169\u2013186 (2021). https:\/\/doi.org\/10.1016\/j.jcss.2020.08.001","DOI":"10.1016\/j.jcss.2020.08.001"},{"key":"27_CR10","doi-asserted-by":"publisher","unstructured":"Erlebach, T., Hoffmann, M., Kammer, F.: On temporal graph exploration. 119, 1\u201318 (2021). https:\/\/doi.org\/10.1016\/j.jcss.2021.01.005","DOI":"10.1016\/j.jcss.2021.01.005"},{"key":"27_CR11","doi-asserted-by":"publisher","unstructured":"Even, S., Pnueli, A., Lempel, A.: Permutation graphs and transitive graphs. 19(3), 400\u2013410 (1972). https:\/\/doi.org\/10.1145\/321707.321710","DOI":"10.1145\/321707.321710"},{"key":"27_CR12","doi-asserted-by":"publisher","unstructured":"Fluschnik, T., Molter, H., Niedermeier, R., Renken, M., Zschoche, P.: Temporal graph classes: a view through temporal separators. 806, 197\u2013218 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2019.03.031","DOI":"10.1016\/j.tcs.2019.03.031"},{"key":"27_CR13","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs (2004). ISBN 978-0-444-51530-8"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-28639-4_15","volume-title":"Parameterized and Exact Computation","author":"J Guo","year":"2004","unstructured":"Guo, J., H\u00fcffner, F., Niedermeier, R.: A structural view on parameterizing problems: distance from triviality. In: Downey, R., Fellows, M., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 162\u2013173. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28639-4_15"},{"key":"27_CR15","doi-asserted-by":"publisher","unstructured":"Kempe, D., Kleinberg, J., Kumar, A.: Connectivity and inference problems for temporal networks. 64(4), 820\u2013842 (2002). https:\/\/doi.org\/10.1006\/jcss.2002.1829","DOI":"10.1006\/jcss.2002.1829"},{"key":"27_CR16","doi-asserted-by":"publisher","unstructured":"Kendall, M.G.: A new measure of rank correlation. 30(1\/2), 81\u201393 (1938). https:\/\/doi.org\/10.2307\/2332226","DOI":"10.2307\/2332226"},{"key":"27_CR17","unstructured":"Maack, N., Molter, H., Niedermeier, R., Renken, M.: On finding separators in temporal split and permutation graphs (2021). http:\/\/arxiv.org\/abs\/2105.12003"},{"key":"27_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-642-39212-2_57","volume-title":"Automata, Languages, and Programming","author":"GB Mertzios","year":"2013","unstructured":"Mertzios, G.B., Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Temporal network optimization subject to connectivity constraints. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7966, pp. 657\u2013668. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39212-2_57"},{"key":"27_CR19","doi-asserted-by":"publisher","unstructured":"Niedermeier, R.: Invitation to fixed-parameter algorithms. (2006). https:\/\/doi.org\/10.1093\/ACPROF:OSO\/9780198566076.001.0001","DOI":"10.1093\/ACPROF:OSO\/9780198566076.001.0001"},{"key":"27_CR20","doi-asserted-by":"publisher","unstructured":"Sen, A., Deng, H., Guha, S.: On a graph partition problem with application to VLSI layout. 43(2), 87\u201394 (1992). https:\/\/doi.org\/10.1016\/0020-0190(92)90017-P","DOI":"10.1016\/0020-0190(92)90017-P"},{"key":"27_CR21","doi-asserted-by":"publisher","unstructured":"Zschoche, P., Fluschnik, T., Molter, H., Niedermeier, R.: The complexity of finding small separators in temporal graphs. 107, 72\u201392 (2020). https:\/\/doi.org\/10.1016\/j.jcss.2019.07.006","DOI":"10.1016\/j.jcss.2019.07.006"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86593-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,11]],"date-time":"2021-09-11T20:32:27Z","timestamp":1631392347000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86593-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030865924","9783030865931"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86593-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.corelab.ntua.gr\/fct2021\/","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":"94","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":"8.54","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":"The conference was held virtually due to the COVID-19 pandemic. There are papers of 2 invited talks also included.","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)"}}]}}