{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:07:47Z","timestamp":1743095267955,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030752415"},{"type":"electronic","value":"9783030752422"}],"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-75242-2_13","type":"book-chapter","created":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T15:22:29Z","timestamp":1620141749000},"page":"187-201","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs"],"prefix":"10.1007","author":[{"given":"Rajesh","family":"Chitnis","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,4]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1016\/j.jctb.2016.10.001","volume":"122","author":"I Adler","year":"2017","unstructured":"Adler, I., Kolliopoulos, S.G., Krause, P.K., Lokshtanov, D., Saurabh, S., Thilikos, D.M.: Irrelevant vertices for the planar disjoint paths problem. J. Comb. Theory Ser. B 122, 815\u2013843 (2017). https:\/\/doi.org\/10.1016\/j.jctb.2016.10.001","journal-title":"J. Comb. Theory Ser. B"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Amiri, S.A., Kreutzer, S., Marx, D., Rabinovich, R.: Routing with congestion in acyclic digraphs. Inf. Process. Lett. 151 (2019). https:\/\/doi.org\/10.1016\/j.ipl.2019.105836","DOI":"10.1016\/j.ipl.2019.105836"},{"key":"13_CR3","unstructured":"Chitnis, R.: A tight lower bound for edge-disjoint paths on planar DAGs (2021). http:\/\/arxiv.org\/abs\/2101.10742"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-90530-3_7","volume-title":"Computer Science \u2013 Theory and Applications","author":"R Chitnis","year":"2018","unstructured":"Chitnis, R., Feldmann, A.E.: A tight lower bound for Steiner orientation. In: Fomin, F.V., Podolskii, V.V. (eds.) CSR 2018. LNCS, vol. 10846, pp. 65\u201377. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-90530-3_7"},{"issue":"8","key":"13_CR5","doi-asserted-by":"publisher","first-page":"3200","DOI":"10.1007\/s00453-019-00580-x","volume":"81","author":"R Chitnis","year":"2019","unstructured":"Chitnis, R., Feldmann, A.E., Such\u00fd, O.: A tight lower bound for planar Steiner orientation. Algorithmica 81(8), 3200\u20133216 (2019). https:\/\/doi.org\/10.1007\/s00453-019-00580-x","journal-title":"Algorithmica"},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1137\/18M122371X","volume":"49","author":"RH Chitnis","year":"2020","unstructured":"Chitnis, R.H., Feldmann, A.E., Hajiaghayi, M.T., Marx, D.: Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions). SIAM J. Comput. 49(2), 318\u2013364 (2020). https:\/\/doi.org\/10.1137\/18M122371X","journal-title":"SIAM J. Comput."},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Chuzhoy, J., Kim, D.H.K., Li, S.: Improved approximation for node-disjoint paths in planar graphs. In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, 18\u201321 June 2016, pp. 556\u2013569. ACM (2016). https:\/\/doi.org\/10.1145\/2897518.2897538","DOI":"10.1145\/2897518.2897538"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Chuzhoy, J., Kim, D.H.K., Nimavat, R.: New hardness results for routing on disjoint paths. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, 19\u201323 June 2017, pp. 86\u201399. ACM (2017). https:\/\/doi.org\/10.1145\/3055399.3055411","DOI":"10.1145\/3055399.3055411"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Chuzhoy, J., Kim, D.H.K., Nimavat, R.: Almost polynomial hardness of node-disjoint paths in grids. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, 25\u201329 June 2018, pp. 1220\u20131233. ACM (2018). https:\/\/doi.org\/10.1145\/3188745.3188772","DOI":"10.1145\/3188745.3188772"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Chuzhoy, J., Kim, D.H.K., Nimavat, R.: Improved approximation for node-disjoint paths in grids with sources on the boundary. In: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, 9\u201313 July 2018, Prague, Czech Republic. LIPIcs, vol. 107, pp. 38:1\u201338:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.38","DOI":"10.4230\/LIPIcs.ICALP.2018.38"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Cygan, M., Marx, D., Pilipczuk, M., Pilipczuk, M.: The planar directed $$k$$-vertex-disjoint paths problem is fixed-parameter tractable. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26\u201329 October 2013, Berkeley, CA, USA, pp. 197\u2013206. IEEE Computer Society (2013). https:\/\/doi.org\/10.1109\/FOCS.2013.29","DOI":"10.1109\/FOCS.2013.29"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph theory. In: Graduate Texts in Mathematics, vol. 173, p. 7 (2012)","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multi-commodity flow problems. In: 16th Annual Symposium on Foundations of Computer Science, Berkeley, California, USA, 13\u201315 October 1975, pp. 184\u2013193. IEEE Computer Society (1975). https:\/\/doi.org\/10.1109\/SFCS.1975.21","DOI":"10.1109\/SFCS.1975.21"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J.E., Wyllie, J.: The directed subgraph homeomorphism problem. Theor. Comput. Sci. 10, 111\u2013121 (1980). https:\/\/doi.org\/10.1016\/0304-3975(80)90009-2","journal-title":"Theor. Comput. Sci."},{"key":"13_CR16","unstructured":"Frank, A.: Packing paths, cuts, and circuits-a survey. In: Paths, Flows and VLSI-Layout, pp. 49\u2013100 (1990)"},{"issue":"2","key":"13_CR17","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of $$k$$-SAT. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001). https:\/\/doi.org\/10.1006\/jcss.2000.1727","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"13_CR18","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001). https:\/\/doi.org\/10.1006\/jcss.2001.1774","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"13_CR19","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/j.jctb.2011.07.004","volume":"102","author":"K Kawarabayashi","year":"2012","unstructured":"Kawarabayashi, K., Kobayashi, Y., Reed, B.A.: The disjoint paths problem in quadratic time. J. Comb. Theory Ser. B 102(2), 424\u2013435 (2012). https:\/\/doi.org\/10.1016\/j.jctb.2011.07.004","journal-title":"J. Comb. Theory Ser. B"},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Lokshtanov, D., Misra, P., Pilipczuk, M., Saurabh, S., Zehavi, M.: An exponential time parameterized algorithm for planar disjoint paths. In: Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, 22\u201326 June 2020, pp. 1307\u20131316 (2020). https:\/\/doi.org\/10.1145\/3357713.3384250","DOI":"10.1145\/3357713.3384250"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-642-39212-2_4","volume-title":"Automata, Languages, and Programming","author":"D Marx","year":"2013","unstructured":"Marx, D.: The square root phenomenon in planar graphs. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7966, p. 28. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39212-2_4"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Marx, D., Pilipczuk, M., Pilipczuk, M.: On subexponential parameterized algorithms for Steiner tree and directed subset TSP on planar graphs. In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, 7\u20139 October 2018, pp. 474\u2013484. IEEE Computer Society (2018). https:\/\/doi.org\/10.1109\/FOCS.2018.00052","DOI":"10.1109\/FOCS.2018.00052"},{"key":"13_CR23","doi-asserted-by":"publisher","unstructured":"Marx, D., Sidiropoulos, A.: The limited blessing of low dimensionality: when $$1-1\/d$$ is the best possible exponent for $$d$$-dimensional geometric problems. In: 30th Annual Symposium on Computational Geometry, SOCG 2014, Kyoto, Japan, 08\u201311 June 2014, p. 67. ACM (2014). https:\/\/doi.org\/10.1145\/2582112.2582124","DOI":"10.1145\/2582112.2582124"},{"key":"13_CR24","doi-asserted-by":"publisher","unstructured":"Robertson, N., Seymour, P.D.: Graph minors XIII. The disjoint paths problem. J. Comb. Theory Ser. B 63(1), 65\u2013110 (1995). https:\/\/doi.org\/10.1006\/jctb.1995.1006","DOI":"10.1006\/jctb.1995.1006"},{"issue":"4","key":"13_CR25","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1137\/S0097539792224061","volume":"23","author":"A Schrijver","year":"1994","unstructured":"Schrijver, A.: Finding $$k$$ disjoint paths in a directed planar graph. SIAM J. Comput. 23(4), 780\u2013788 (1994). https:\/\/doi.org\/10.1137\/S0097539792224061","journal-title":"SIAM J. Comput."},{"key":"13_CR26","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol. 24. Springer, Heidelberg (2003)"},{"key":"13_CR27","doi-asserted-by":"publisher","unstructured":"Schrijver, A.: Finding $$k$$ partially disjoint paths in a directed planar graph. Building bridges II. Bolyai Soc. Math. Stud. 28, 417\u2013444 (2019). https:\/\/doi.org\/10.1007\/978-3-662-59204-5_13","DOI":"10.1007\/978-3-662-59204-5_13"},{"issue":"1","key":"13_CR28","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/070697781","volume":"24","author":"A Slivkins","year":"2010","unstructured":"Slivkins, A.: Parameterized tractability of edge-disjoint paths on directed acyclic graphs. SIAM J. Discret. Math. 24(1), 146\u2013157 (2010). https:\/\/doi.org\/10.1137\/070697781","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"13_CR29","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0166-218X(93)E0177-Z","volume":"61","author":"J Vygen","year":"1995","unstructured":"Vygen, J.: NP-completeness of some edge-disjoint paths problems. Discret. Appl. Math. 61(1), 83\u201390 (1995). https:\/\/doi.org\/10.1016\/0166-218X(93)E0177-Z","journal-title":"Discret. Appl. 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-75242-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T15:26:15Z","timestamp":1620141975000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75242-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030752415","9783030752422"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75242-2_13","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":"4 May 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2021\/","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":"27","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":"35% - 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":"10","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":"Due to the Corona pandemic the conference was held virtually.","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)"}}]}}