{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,26]],"date-time":"2026-07-26T04:10:36Z","timestamp":1785039036329,"version":"3.55.0"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031066771","type":"print"},{"value":"9783031066788","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-06678-8_1","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:03:31Z","timestamp":1653779011000},"page":"3-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Distance from\u00a0Triviality 2.0: Hybrid Parameterizations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0656-7572","authenticated-orcid":false,"given":"Akanksha","family":"Agrawal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2116-6048","authenticated-orcid":false,"given":"M. S.","family":"Ramanujan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,5,29]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal, A., et al.: Deleting, eliminating and decomposing to hereditary classes are all FPT-equivalent (2021). https:\/\/doi.org\/10.48550\/ARXIV.2104.09950, https:\/\/arxiv.org\/abs\/2104.09950","DOI":"10.48550\/ARXIV.2104.09950"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, A., et al.: Deleting, eliminating and decomposing to hereditary classes are all FPT-equivalent. In: ACM-SIAM Symposium on Discrete Algorithms (SODA) SIAM, pp. 1726\u20131736 (2022)","DOI":"10.1137\/1.9781611977073.79"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Agrawal, A., Kanesh, L., Panolan, F., Ramanujan, M.S., Saurabh, S.: An FPT algorithm for elimination distance to bounded degree graphs. In: 38th International Symposium on Theoretical Aspects of Computer Science (STACS), vol. 187, pp. 5:1\u20135:11 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2021.5","DOI":"10.4230\/LIPIcs.STACS.2021.5"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Agrawal, A., Ramanujan, M.S.: On the parameterized complexity of clique elimination distance. In: Cao, Y., Pilipczuk, M. (eds.) 15th International Symposium on Parameterized and Exact Computation, (IPEC), vol. 180, pp. 1:1\u20131:13 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2020.1","DOI":"10.4230\/LIPIcs.IPEC.2020.1"},{"issue":"2","key":"1_CR5","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308\u2013340 (1991). https:\/\/doi.org\/10.1016\/0196-6774(91)90006-K","journal-title":"J. Algorithms"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-642-16926-7_22","volume-title":"Graph Theoretic Concepts in Computer Science","author":"R van Bevern","year":"2010","unstructured":"van Bevern, R., Komusiewicz, C., Moser, H., Niedermeier, R.: Measuring indifference: unit interval vertex deletion. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 232\u2013243. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16926-7_22"},{"issue":"2","key":"1_CR7","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00453-015-0045-3","volume":"75","author":"J Bulian","year":"2015","unstructured":"Bulian, J., Dawar, A.: Graph isomorphism parameterized by elimination distance to bounded degree. Algorithmica 75(2), 363\u2013382 (2015). https:\/\/doi.org\/10.1007\/s00453-015-0045-3","journal-title":"Algorithmica"},{"issue":"4","key":"1_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett. 58(4), 171\u2013176 (1996). https:\/\/doi.org\/10.1016\/0020-0190(96)00050-6","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"1_CR9","doi-asserted-by":"publisher","first-page":"21:1","DOI":"10.1145\/2629595","volume":"11","author":"Y Cao","year":"2015","unstructured":"Cao, Y., Marx, D.: Interval deletion is fixed-parameter tractable. ACM Trans. Algorithms 11(3), 21:1-21:35 (2015). https:\/\/doi.org\/10.1145\/2629595","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/s00453-015-0014-x","volume":"75","author":"Y Cao","year":"2015","unstructured":"Cao, Y., Marx, D.: Chordal editing is fixed-parameter tractable. Algorithmica 75(1), 118\u2013137 (2015). https:\/\/doi.org\/10.1007\/s00453-015-0014-x","journal-title":"Algorithmica"},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990). https:\/\/doi.org\/10.1016\/0890-5401(90)90043-H","journal-title":"Inf. Comput."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Handbook of Graph Grammars and Computing by Graph Transformations, vol. 1: Foundations, pp. 313\u2013400. World Scientific (1997)","DOI":"10.1142\/9789812384720_0005"},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125\u2013150 (2000). https:\/\/doi.org\/10.1007\/s002249910009","journal-title":"Theory Comput. Syst."},{"issue":"1\u20133","key":"1_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discret. Appl. Math. 101(1\u20133), 77\u2013114 (2000). https:\/\/doi.org\/10.1016\/S0166-218X(99)00184-5","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jctb.2006.04.003","volume":"97","author":"B Courcelle","year":"2007","unstructured":"Courcelle, B., Oum, S.: Vertex-minors, monadic second-order logic, and a conjecture by seese. J. Comb. Theory Ser. B 97(1), 91\u2013126 (2007). https:\/\/doi.org\/10.1016\/j.jctb.2006.04.003","journal-title":"J. Comb. Theory Ser. B"},{"key":"1_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"1_CR17","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. TCS, Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.jcss.2021.04.005","volume":"121","author":"E Eiben","year":"2021","unstructured":"Eiben, E., Ganian, R., Hamm, T., Kwon, O.: Measuring what matters: a hybrid approach to dynamic programming with treewidth. J. Comput. Syst. Sci. 121, 57\u201375 (2021). https:\/\/doi.org\/10.1016\/j.jcss.2021.04.005","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.jcss.2018.05.005","volume":"97","author":"E Eiben","year":"2018","unstructured":"Eiben, E., Ganian, R., Kwon, O.: A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. J. Comput. Syst. Sci. 97, 121\u2013146 (2018). https:\/\/doi.org\/10.1016\/j.jcss.2018.05.005","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR20","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. TTCSAES, Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Golovach, P.A., Thilikos, D.M.: Parameterized complexity of elimination distance to first-order logic properties. In: 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), pp. 1\u201313 (2021). https:\/\/doi.org\/10.1109\/LICS52264.2021.9470540","DOI":"10.1109\/LICS52264.2021.9470540"},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Lokshtanov, D., Misra, N., Saurabh, S.: Planar $${F}$$-deletion: approximation, kernelization and optimal FPT algorithms. In: 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 470\u2013479 (2012). https:\/\/doi.org\/10.1109\/FOCS.2012.62","DOI":"10.1109\/FOCS.2012.62"},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S., Zehavi, M.: Hitting topological minors is FPT. In: Proccedings of the 52nd Annual ACM-SIGACT Symposium on Theory of Computing (STOC), pp. 1317\u20131326 (2020). https:\/\/doi.org\/10.1145\/3357713.3384318","DOI":"10.1145\/3357713.3384318"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Ganian, R., Ordyniak, S., Ramanujan, M.S.: Going beyond primal treewidth for (M)ILP. In: Singh, S.P., Markovitch, S. (eds.) Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, pp. 815\u2013821. AAAI Press (2017)","DOI":"10.1609\/aaai.v31i1.10644"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-319-66263-3_2","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2017","author":"R Ganian","year":"2017","unstructured":"Ganian, R., Ramanujan, M.S., Szeider, S.: Backdoor treewidth for SAT. In: Gaspers, S., Walsh, T. (eds.) SAT 2017. LNCS, vol. 10491, pp. 20\u201337. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66263-3_2"},{"key":"1_CR26","doi-asserted-by":"publisher","unstructured":"Ganian, R., Ramanujan, M.S., Szeider, S.: Combining treewidth and backdoors for CSP. In: 34th Symposium on Theoretical Aspects of Computer Science (STACS), vol. 66, pp. 36:1\u201336:17 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2017.36","DOI":"10.4230\/LIPIcs.STACS.2017.36"},{"issue":"2","key":"1_CR27","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1145\/3014587","volume":"13","author":"R Ganian","year":"2017","unstructured":"Ganian, R., Ramanujan, M.S., Szeider, S.: Discovering archipelagos of tractability for constraint satisfaction and counting. ACM Trans. Algorithms 13(2), 291\u20132932 (2017). https:\/\/doi.org\/10.1145\/3014587","journal-title":"ACM Trans. Algorithms"},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Guo, J., H\u00fcffner, F., Niedermeier, R.: A structural view on parameterizing problems: distance from triviality. In: Parameterized and Exact Computation, First International Workshop, (IWPEC), vol. 3162, pp. 162\u2013173 (2004). https:\/\/doi.org\/10.1007\/978-3-540-28639-4_15","DOI":"10.1007\/978-3-540-28639-4_15"},{"issue":"3","key":"1_CR29","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1093\/comjnl\/bxm052","volume":"51","author":"P Hlinen\u00fd","year":"2008","unstructured":"Hlinen\u00fd, P., Oum, S., Seese, D., Gottlob, G.: Width parameters beyond tree-width and their applications. Comput. J. 51(3), 326\u2013362 (2008). https:\/\/doi.org\/10.1093\/comjnl\/bxm052","journal-title":"Comput. J."},{"key":"1_CR30","unstructured":"Jacob, A., de Kroon, J.J.H., Majumdar, D., Raman, V.: Parameterized complexity of deletion to scattered graph classes. CoRR abs\/2105.04660 (2021). https:\/\/arxiv.org\/abs\/2105.04660"},{"key":"1_CR31","doi-asserted-by":"publisher","unstructured":"Jacob, A., Majumdar, D., Raman, V.: Parameterized complexity of deletion to scattered graph classes. In: 15th International Symposium on Parameterized and Exact Computation, (IPEC), vol. 180, pp. 18:1\u201318:17 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2020.18","DOI":"10.4230\/LIPIcs.IPEC.2020.18"},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-030-86838-3_6","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"BMP Jansen","year":"2021","unstructured":"Jansen, B.M.P., de Kroon, J.J.H.: FPT algorithms to compute the elimination distance to bipartite graphs and more. In: Kowalik, \u0141ukasz, Pilipczuk, Micha\u0142, Rz\u0105\u017cewski, Pawe\u0142 (eds.) WG 2021. LNCS, vol. 12911, pp. 80\u201393. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86838-3_6"},{"key":"1_CR33","doi-asserted-by":"publisher","unstructured":"Jansen, B.M.P., de Kroon, J.J.H., Wlodarczyk, M.: Vertex deletion parameterized by elimination distance and even less. In: Proceedings of the 53rd Annual ACM-SIGACT Symposium on Theory of Computing (STOC), pp. 1757\u20131769 (2021). https:\/\/doi.org\/10.1145\/3406325.3451068","DOI":"10.1145\/3406325.3451068"},{"key":"1_CR34","doi-asserted-by":"publisher","unstructured":"Jansen, B.M.P., Lokshtanov, D., Saurabh, S.: A near-optimal planarization algorithm. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1802\u20131811 (2014). https:\/\/doi.org\/10.1137\/1.9781611973402.130","DOI":"10.1137\/1.9781611973402.130"},{"issue":"2","key":"1_CR35","doi-asserted-by":"publisher","first-page":"21:1","DOI":"10.1145\/2797140","volume":"12","author":"EJ Kim","year":"2016","unstructured":"Kim, E.J., et al.: Linear kernels and single-exponential algorithms via protrusion decompositions. ACM Trans. Algorithms 12(2), 21:1-21:41 (2016). https:\/\/doi.org\/10.1145\/2797140","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"1_CR36","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"JM Lewis","year":"1980","unstructured":"Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. Syst. Sci. 20(2), 219\u2013230 (1980). https:\/\/doi.org\/10.1016\/0022-0000(80)90060-4","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR37","doi-asserted-by":"publisher","unstructured":"Lindermayr, A., Siebertz, S., Vigny, A.: Elimination distance to bounded degree on planar graphs. In: 45th International Symposium on Mathematical Foundations of Computer Science, (MFCS), vol. 170, pp. 65:1\u201365:12 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2020.65","DOI":"10.4230\/LIPIcs.MFCS.2020.65"},{"key":"1_CR38","doi-asserted-by":"publisher","unstructured":"Lokshtanov, D., Narayanaswamy, N.S., Raman, V., Ramanujan, M.S., Saurabh, S.: Faster parameterized algorithms using linear programming. ACM Trans. Algorithms 11(2), 15:1\u201315:31 (2014). https:\/\/doi.org\/10.1145\/2566616. https:\/\/doi.org\/10.1145\/2566616","DOI":"10.1145\/2566616"},{"key":"1_CR39","doi-asserted-by":"publisher","unstructured":"Lokshtanov, D., Ramanujan, M.S., Saurabh, S., Zehavi, M.: Reducing CMSO model checking to highly connected graphs. In: 45th International Colloquium on Automata, Languages, and Programming, (ICALP), vol. 107, pp. 135:1\u2013135:14 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.135","DOI":"10.4230\/LIPIcs.ICALP.2018.135"},{"issue":"4","key":"1_CR40","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/s00453-008-9233-8","volume":"57","author":"D Marx","year":"2010","unstructured":"Marx, D.: Chordal deletion is fixed-parameter tractable. Algorithmica 57(4), 747\u2013768 (2010). https:\/\/doi.org\/10.1007\/s00453-008-9233-8","journal-title":"Algorithmica"},{"issue":"6","key":"1_CR41","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1016\/j.ejc.2005.01.010","volume":"27","author":"J Nesetril","year":"2006","unstructured":"Nesetril, J., de Mendez, P.O.: Tree-depth, subgraph coloring and homomorphism bounds. Eur. J. Comb. 27(6), 1022\u20131041 (2006). https:\/\/doi.org\/10.1016\/j.ejc.2005.01.010","journal-title":"Eur. J. Comb."},{"key":"1_CR42","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006). https:\/\/doi.org\/10.1093\/acprof:oso\/9780198566076.001.0001"},{"issue":"1","key":"1_CR43","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jctb.2005.03.003","volume":"95","author":"S Oum","year":"2005","unstructured":"Oum, S.: Rank-width and vertex-minors. J. Comb. Theory Ser. B 95(1), 79\u2013100 (2005). https:\/\/doi.org\/10.1016\/j.jctb.2005.03.003","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"1_CR44","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/1435375.1435385","volume":"5","author":"S Oum","year":"2008","unstructured":"Oum, S.: Approximating rank-width and clique-width quickly. ACM Trans. Algorithms 5(1), 101\u20131020 (2008). https:\/\/doi.org\/10.1145\/1435375.1435385","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"1_CR45","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1137\/050629616","volume":"22","author":"S Oum","year":"2008","unstructured":"Oum, S.: Rank-width and well-quasi-ordering. SIAM J. Discret. Math. 22(2), 666\u2013682 (2008). https:\/\/doi.org\/10.1137\/050629616","journal-title":"SIAM J. Discret. Math."},{"key":"1_CR46","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.dam.2016.08.006","volume":"231","author":"S Oum","year":"2017","unstructured":"Oum, S.: Rank-width: algorithmic and structural results. Discret. Appl. Math. 231, 15\u201324 (2017). https:\/\/doi.org\/10.1016\/j.dam.2016.08.006","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"1_CR47","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S Oum","year":"2006","unstructured":"Oum, S., Seymour, P.D.: Approximating clique-width and branch-width. J. Comb. Theory Ser. B 96(4), 514\u2013528 (2006). https:\/\/doi.org\/10.1016\/j.jctb.2005.10.006","journal-title":"J. Comb. Theory Ser. B"},{"issue":"4","key":"1_CR48","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.orl.2003.10.009","volume":"32","author":"BA Reed","year":"2004","unstructured":"Reed, B.A., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett. 32(4), 299\u2013301 (2004). https:\/\/doi.org\/10.1016\/j.orl.2003.10.009","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1_CR49","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N Robertson","year":"1995","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","journal-title":"J. Comb. Theory Ser. B"},{"key":"1_CR50","doi-asserted-by":"publisher","unstructured":"Sau, I., Stamoulis, G., Thilikos, D.M.: An FPT-algorithm for recognizing k-apices of minor-closed graph classes. In: 47th International Colloquium on Automata, Languages, and Programming, (ICALP), vol. 168, pp. 95:1\u201395:20 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.95","DOI":"10.4230\/LIPIcs.ICALP.2020.95"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06678-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T17:00:40Z","timestamp":1675702840000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06678-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066771","9783031066788"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06678-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.informatik.uni-trier.de\/iwoca-2022","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":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","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":"35","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":"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":"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)"}}]}}