{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T05:27:19Z","timestamp":1767245239141,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T00:00:00Z","timestamp":1596153600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T00:00:00Z","timestamp":1596153600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100007543","name":"Grantov\u00e1 Agentura, Univerzita Karlova","doi-asserted-by":"publisher","award":["1277018","SVV-2017-260452"],"award-info":[{"award-number":["1277018","SVV-2017-260452"]}],"id":[{"id":"10.13039\/100007543","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["TOTAL (677651)","CUTACOMBS (714704)"],"award-info":[{"award-number":["TOTAL (677651)","CUTACOMBS (714704)"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2018\/31\/D\/ST6\/00062","2015\/17\/B\/ST6\/01873"],"award-info":[{"award-number":["2018\/31\/D\/ST6\/00062","2015\/17\/B\/ST6\/01873"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2021,8]]},"abstract":"Abstract<\/jats:title>Let$${\\mathcal {C}}$$<\/jats:tex-math>C<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>and$${\\mathcal {D}}$$<\/jats:tex-math>D<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>be hereditary graph classes. Consider the following problem: given a graph$$G\\in {\\mathcal {D}}$$<\/jats:tex-math>G<\/mml:mi>\u2208<\/mml:mo>D<\/mml:mi><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>, find a largest, in terms of the number of vertices, induced subgraph ofG<\/jats:italic>that belongs to$${\\mathcal {C}}$$<\/jats:tex-math>C<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>. We prove that it can be solved in$$2^{o(n)}$$<\/jats:tex-math>2<\/mml:mn>o<\/mml:mi>(<\/mml:mo>n<\/mml:mi>)<\/mml:mo><\/mml:mrow><\/mml:msup><\/mml:math><\/jats:alternatives><\/jats:inline-formula>time, wheren<\/jats:italic>is the number of vertices ofG<\/jats:italic>, if the following conditions are satisfied:the graphs in$${\\mathcal {C}}$$<\/jats:tex-math>C<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>are sparse, i.e., they have linearly many edges in terms of the number of vertices;<\/jats:p><\/jats:list-item>the graphs in$${\\mathcal {D}}$$<\/jats:tex-math>D<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>admit balanced separators of size governed by their density, e.g.,$${\\mathcal {O}}(\\varDelta )$$<\/jats:tex-math>O<\/mml:mi>(<\/mml:mo>\u0394<\/mml:mi>)<\/mml:mo><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>or$${\\mathcal {O}}(\\sqrt{m})$$<\/jats:tex-math>O<\/mml:mi>(<\/mml:mo>m<\/mml:mi><\/mml:msqrt>)<\/mml:mo><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>, where$$\\varDelta$$<\/jats:tex-math>\u0394<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>andm<\/jats:italic>denote the maximum degree and the number of edges, respectively; and<\/jats:p><\/jats:list-item>the considered problem admits a single-exponential fixed-parameter algorithm when parameterized by the treewidth of the input graph.<\/jats:p><\/jats:list-item><\/jats:list>This leads, for example, to the following corollaries for specific classes$${\\mathcal {C}}$$<\/jats:tex-math>C<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>and$${\\mathcal {D}}$$<\/jats:tex-math>D<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>:a largest induced forest in a$$P_t$$<\/jats:tex-math>P<\/mml:mi>t<\/mml:mi><\/mml:msub><\/mml:math><\/jats:alternatives><\/jats:inline-formula>-free graph can be found in$$2^{\\tilde{{\\mathcal {O}}}(n^{2\/3})}$$<\/jats:tex-math>2<\/mml:mn>O<\/mml:mi>~<\/mml:mo><\/mml:mover>(<\/mml:mo>n<\/mml:mi>2<\/mml:mn>\/<\/mml:mo>3<\/mml:mn><\/mml:mrow><\/mml:msup>)<\/mml:mo><\/mml:mrow><\/mml:mrow><\/mml:msup><\/mml:math><\/jats:alternatives><\/jats:inline-formula>time, for every fixedt<\/jats:italic>; and<\/jats:p><\/jats:list-item>a largest induced planar graph in a string graph can be found in$$2^{\\tilde{{\\mathcal {O}}}(n^{2\/3})}$$<\/jats:tex-math>2<\/mml:mn>O<\/mml:mi>~<\/mml:mo><\/mml:mover>(<\/mml:mo>n<\/mml:mi>2<\/mml:mn>\/<\/mml:mo>3<\/mml:mn><\/mml:mrow><\/mml:msup>)<\/mml:mo><\/mml:mrow><\/mml:mrow><\/mml:msup><\/mml:math><\/jats:alternatives><\/jats:inline-formula>time.<\/jats:p><\/jats:list-item><\/jats:list><\/jats:p>","DOI":"10.1007\/s00453-020-00745-z","type":"journal-article","created":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T07:02:51Z","timestamp":1596178971000},"page":"2634-2650","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs"],"prefix":"10.1007","volume":"83","author":[{"given":"Jana","family":"Novotn\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karolina","family":"Okrasa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7696-3848","authenticated-orcid":false,"given":"Pawe\u0142","family":"Rz\u0105\u017cewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik Jan","family":"van Leeuwen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bartosz","family":"Walczak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,31]]},"reference":[{"key":"745_CR1","doi-asserted-by":"crossref","unstructured":"Abrishami, T., Chudnovsky, M., Pilipczuk, M., Rz\u0105\u017cewski, P., Seymour, P.: Induced subgraphs of bounded treewidth and the container method. CoRR abs\/2003.05185. arXiv:2003.05185 (2020)","DOI":"10.1137\/1.9781611976465.116"},{"key":"745_CR2","unstructured":"Alekseev, V.E.: The effect of local constraints on the complexity of determination of the graph independence number. Combinatorial-algebraic methods in applied mathematics, pp. 3\u201313 (1982). (in Russian)"},{"issue":"1\u20133","key":"745_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0166-218X(03)00387-1","volume":"132","author":"VE Alekseev","year":"2003","unstructured":"Alekseev, V.E.: On easy and hard hereditary classes of graphs with respect to the independent set problem. Discrete Appl. Math. 132(1\u20133), 17\u201326 (2003). https:\/\/doi.org\/10.1016\/S0166-218X(03)00387-1","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"745_CR4","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s00453-018-0479-5","volume":"81","author":"G Bacs\u00f3","year":"2019","unstructured":"Bacs\u00f3, G., Lokshtanov, D., Marx, D., Pilipczuk, M., Tuza, Z., van Leeuwen, E.J.: Subexponential-time algorithms for maximum independent set in $${P}_t$$-free and broom-free graphs. Algorithmica 81(2), 421\u2013438 (2019)","journal-title":"Algorithmica"},{"issue":"2","key":"745_CR5","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/s00453-015-0054-2","volume":"76","author":"I Bliznets","year":"2016","unstructured":"Bliznets, I., Fomin, F.V., Pilipczuk, M., Villanger, Y.: Largest chordal and interval subgraphs faster than $$2^n$$. Algorithmica 76(2), 569\u2013594 (2016). https:\/\/doi.org\/10.1007\/s00453-015-0054-2","journal-title":"Algorithmica"},{"issue":"2","key":"745_CR6","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/130947374","volume":"45","author":"HL Bodlaender","year":"2016","unstructured":"Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: A $$c^k n$$ 5-approximation algorithm for treewidth. SIAM J. Comput. 45(2), 317\u2013378 (2016). https:\/\/doi.org\/10.1137\/130947374","journal-title":"SIAM J. Comput."},{"issue":"2","key":"745_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0095-8956(74)90052-5","volume":"16","author":"JA Bondy","year":"1974","unstructured":"Bondy, J.A., Simonovits, M.: Cycles of even length in graphs. J. Combin. Theory Ser. B 16(2), 97\u2013105 (1974)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"7","key":"745_CR8","doi-asserted-by":"publisher","first-page":"3047","DOI":"10.1007\/s00453-019-00568-7","volume":"81","author":"\u00c9 Bonnet","year":"2019","unstructured":"Bonnet, \u00c9., Rz\u0105\u017cewski, P.: Optimality program in segment and string graphs. Algorithmica 81(7), 3047\u20133073 (2019). https:\/\/doi.org\/10.1007\/s00453-019-00568-7","journal-title":"Algorithmica"},{"key":"745_CR9","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.dam.2016.06.016","volume":"231","author":"C Brause","year":"2017","unstructured":"Brause, C.: A subexponential-time algorithm for the maximum independent set problem in $$P_t$$-free graphs. Discrete Appl. Math. 231, 113\u2013118 (2017). https:\/\/doi.org\/10.1016\/j.dam.2016.06.016","journal-title":"Discrete Appl. Math."},{"key":"745_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2017.09.033","volume":"705","author":"N Chiarelli","year":"2018","unstructured":"Chiarelli, N., Hartinger, T.R., Johnson, M., Milani\u010d, M., Paulusma, D.: Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity. Theor. Comput. Sci. 705, 75\u201383 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2017.09.033","journal-title":"Theor. Comput. Sci."},{"key":"745_CR11","unstructured":"Chudnovsky, M., Pilipczuk, M., Pilipczuk, M., Thomass\u00e9, S.: On the maximum weight independent set problem in graphs without induced cycles of length at least five. CoRR abs\/1903.04761. arXiv:1903.04761 (2019)"},{"key":"745_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Berlin (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"745_CR13","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.ic.2017.04.009","volume":"256","author":"M Cygan","year":"2017","unstructured":"Cygan, M., Marx, D., Pilipczuk, M., Pilipczuk, M.: Hitting forbidden subgraphs in graphs of bounded treewidth. Inf. Comput. 256, 62\u201382 (2017). https:\/\/doi.org\/10.1016\/j.ic.2017.04.009","journal-title":"Inf. Comput."},{"key":"745_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.jctb.2018.12.007","volume":"137","author":"Z Dvo\u0159\u00e1k","year":"2019","unstructured":"Dvo\u0159\u00e1k, Z., Norin, S.: Treewidth of graphs with balanced separations. J. Combin. Theory Ser. B 137, 137\u2013144 (2019). https:\/\/doi.org\/10.1016\/j.jctb.2018.12.007","journal-title":"J. Combin. Theory Ser. B"},{"key":"745_CR15","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Gaspers, S., Lokshtanov, D., Saurabh, S.: Exact algorithms via monotone local search. In: STOC 2016, pp. 764\u2013775. ACM (2016)","DOI":"10.1145\/2897518.2897551"},{"key":"745_CR16","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Todinca, I., Villanger, Y.: Exact algorithm for the maximum induced planar subgraph problem. In: ESA 2011, LNCS, vol. 6942, pp. 287\u2013298. Springer (2011)","DOI":"10.1007\/978-3-642-23719-5_25"},{"issue":"1","key":"745_CR17","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/140964801","volume":"44","author":"FV Fomin","year":"2015","unstructured":"Fomin, F.V., Todinca, I., Villanger, Y.: Large induced subgraphs via triangulations and CMSO. SIAM J. Comput. 44(1), 54\u201387 (2015)","journal-title":"SIAM J. Comput."},{"key":"745_CR18","doi-asserted-by":"crossref","unstructured":"Grzesik, A., Klimo\u0161ov\u00e1, T., Pilipczuk, M., Pilipczuk, M.: Polynomial-time algorithm for maximum weight independent set on $${P}_6$$-free graphs. In: SODA 2019, pp. 1257\u20131271. SIAM (2019)","DOI":"10.1137\/1.9781611975482.77"},{"key":"745_CR19","volume-title":"String Graphs","author":"M Kratochv\u00edl","year":"1986","unstructured":"Kratochv\u00edl, M., Goljan, P.K.: String Graphs. Academia, Prague (1986)"},{"issue":"9","key":"745_CR20","doi-asserted-by":"publisher","first-page":"3655","DOI":"10.1007\/s00453-019-00592-7","volume":"81","author":"T Kociumaka","year":"2019","unstructured":"Kociumaka, T., Pilipczuk, M.: Deleting vertices to graphs of bounded genus. Algorithmica 81(9), 3655\u20133691 (2019). https:\/\/doi.org\/10.1007\/s00453-019-00592-7","journal-title":"Algorithmica"},{"issue":"2","key":"745_CR21","doi-asserted-by":"publisher","first-page":"6:1","DOI":"10.1145\/3186589","volume":"10","author":"C Komusiewicz","year":"2018","unstructured":"Komusiewicz, C.: Tight running time lower bounds for vertex deletion problems. ACM Trans. Comput. Theory 10(2), 6:1\u20136:18 (2018)","journal-title":"ACM Trans. Comput. Theory"},{"issue":"1","key":"745_CR22","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0095-8956(91)90090-7","volume":"52","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J.: String graphs. i. The number of critical nonstring graphs is infinite. J. Comb. Theory Ser. B 52(1), 53\u201366 (1991). https:\/\/doi.org\/10.1016\/0095-8956(91)90090-7","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"745_CR23","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0095-8956(91)90091-W","volume":"52","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J.: String graphs. II. Recognizing string graphs is NP-hard. J. Comb. Theory Ser. B 52(1), 67\u201378 (1991). https:\/\/doi.org\/10.1016\/0095-8956(91)90091-W","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"745_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0095-8956(91)90050-T","volume":"53","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J., Matousek, J.: String graphs requiring exponential representations. J. Comb. Theory Ser. B 53(1), 1\u20134 (1991). https:\/\/doi.org\/10.1016\/0095-8956(91)90050-T","journal-title":"J. Comb. Theory Ser. B"},{"key":"745_CR25","unstructured":"Lee, J.R.: Separators in region intersection graphs. In: ITCS 2017, LIPIcs, vol.\u00a067, pp. 1:1\u20131:8. Schloss Dagstuhl\u2014Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"issue":"2","key":"745_CR26","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."},{"issue":"4","key":"745_CR27","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.jda.2008.04.001","volume":"6","author":"VV Lozin","year":"2008","unstructured":"Lozin, V.V., Milani\u010d, M.: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. J. Discrete Algorithms 6(4), 595\u2013604 (2008)","journal-title":"J. Discrete Algorithms"},{"key":"745_CR28","doi-asserted-by":"publisher","unstructured":"Novotn\u00e1, J., Okrasa, K., Pilipczuk, M., Rzazewski, P., van Leeuwen, E.J., Walczak, B.: Subexponential-time algorithms for finding large induced sparse subgraphs. In: B.M.P. Jansen, J.A. Telle (eds.) 14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11\u201313, 2019, Munich, Germany, LIPIcs, vol. 148, pp. 23:1\u201323:11. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik. https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2019.23 (2019)","DOI":"10.4230\/LIPIcs.IPEC.2019.23"},{"key":"745_CR29","unstructured":"Paulusma, D.: Personal communication"},{"key":"745_CR30","doi-asserted-by":"crossref","unstructured":"Pilipczuk, M.: Problems parameterized by treewidth tractable in single exponential time: a logical approach. In: MFCS 2011, vol. 6907, pp. 520\u2013531. Springer (2011)","DOI":"10.1007\/978-3-642-22993-0_47"},{"key":"745_CR31","doi-asserted-by":"crossref","unstructured":"Pilipczuk, M., Pilipczuk, M.: Finding a maximum induced degenerate subgraph faster than $$2^n$$. In: IPEC 2012, LNCS, vol. 7535, pp. 3\u201312. Springer (2012)","DOI":"10.1007\/978-3-642-33293-7_3"},{"key":"745_CR32","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02993245","volume":"28","author":"G Ringel","year":"1965","unstructured":"Ringel, G.: Das Geschlecht des vollst\u00e4ndiger Paaren Graphen. Abh. Math. Sem. Univ. Hamburg 28, 139\u2013150 (1965)","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"745_CR33","unstructured":"Speckenmeyer, E.: Untersuchungen zum Feedback Vertex Set Problem in ungerichteten Graphen. Ph.D. thesis, Universit\u00e4t Paderborn (1983) (in German)"},{"issue":"1\u20133","key":"745_CR34","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0012-365X(92)00062-V","volume":"124","author":"C Thomassen","year":"1994","unstructured":"Thomassen, C.: Embeddings of graphs. Discrete Math. 124(1\u20133), 217\u2013228 (1994). https:\/\/doi.org\/10.1016\/0012-365X(92)00062-V","journal-title":"Discrete Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00745-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-020-00745-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00745-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,5]],"date-time":"2022-11-05T08:10:36Z","timestamp":1667635836000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-020-00745-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,31]]},"references-count":34,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["745"],"URL":"https:\/\/doi.org\/10.1007\/s00453-020-00745-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2020,7,31]]},"assertion":[{"value":"2 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}