{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T20:43:39Z","timestamp":1762807419905,"version":"3.40.3"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030604394"},{"type":"electronic","value":"9783030604400"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-60440-0_8","type":"book-chapter","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T09:03:18Z","timestamp":1602752598000},"page":"92-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure"],"prefix":"10.1007","author":[{"given":"Cl\u00e9ment","family":"Dallard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Milani\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenny","family":"\u0160torgel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,9]]},"reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s00453-016-0234-8","volume":"80","author":"R Belmonte","year":"2016","unstructured":"Belmonte, R., Otachi, Y., Schweitzer, P.: Induced minor free graphs: isomorphism and clique-width. Algorithmica 80(1), 29\u201347 (2016). https:\/\/doi.org\/10.1007\/s00453-016-0234-8","journal-title":"Algorithmica"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.jctb.2018.05.005","volume":"134","author":"J B\u0142asiok","year":"2019","unstructured":"B\u0142asiok, J., Kami\u0144ski, M., Raymond, J.F., Trunck, T.: Induced minors and well-quasi-ordering. J. Comb. Theor. Ser. B 134, 110\u2013142 (2019). https:\/\/doi.org\/10.1016\/j.jctb.2018.05.005","journal-title":"J. Comb. Theor. Ser. B"},{"key":"8_CR3","unstructured":"Bodlaender, H., Gustedt, J., Telle, J.A.: Linear-time register allocation for a fixed number of registers. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, pp. 574\u2013583. ACM, New York (1998)"},{"issue":"6","key":"8_CR4","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996). https:\/\/doi.org\/10.1137\/S0097539793251219","journal-title":"SIAM J. Comput."},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Bodlaender, H.L., Ono, H., Otachi, Y.: Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity. In: 27th International Symposium on Algorithms and Computation, LIPIcs. LeibnizInt. Proc. Inform., vol. 64, pp. Art. No. 20, 12. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern (2016). https:\/\/doi.org\/10.1007\/s00453-017-0399-9","DOI":"10.1007\/s00453-017-0399-9"},{"issue":"5\u20136","key":"8_CR6","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/BF01758777","volume":"7","author":"RB Borie","year":"1992","unstructured":"Borie, R.B., Parker, R.G., Tovey, C.A.: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica 7(5\u20136), 555\u2013581 (1992). https:\/\/doi.org\/10.1007\/BF01758777","journal-title":"Algorithmica"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.dam.2017.09.017","volume":"248","author":"B Bre\u0161ar","year":"2018","unstructured":"Bre\u0161ar, B., Hartinger, T.R., Kos, T., Milani\u010d, M.: 1-perfectly orientable $$K_4$$-minor-free and outerplanar graphs. Discret. Appl. Math. 248, 33\u201345 (2018). https:\/\/doi.org\/10.1016\/j.dam.2017.09.017","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1002\/jgt.22146","volume":"87","author":"K Cameron","year":"2018","unstructured":"Cameron, K., Chaplick, S., Ho\u00e0ng, C.T.: On the structure of (pan, even hole)-free graphs. J. Graph Theor. 87(1), 108\u2013129 (2018). https:\/\/doi.org\/10.1002\/jgt.22146","journal-title":"J. Graph Theor."},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.endm.2017.06.042","volume":"61","author":"S Chaplick","year":"2017","unstructured":"Chaplick, S., Zeman, P.: Combinatorial problems on $$H$$-graphs. Electron. Notes Discret. Math. 61, 223\u2013229 (2017). https:\/\/doi.org\/10.1016\/j.endm.2017.06.042","journal-title":"Electron. Notes Discret. Math."},{"issue":"5","key":"8_CR10","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/2820609","volume":"63","author":"C Chekuri","year":"2016","unstructured":"Chekuri, C., Chuzhoy, J.: Polynomial bounds for the grid-minor theorem. J. ACM 63(5), 65 (2016). https:\/\/doi.org\/10.1145\/2820609. Art. 40","journal-title":"J. ACM"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Chuzhoy, J.: Improved bounds for the flat wall theorem. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, PA, pp. 256\u2013275 (2015). https:\/\/doi.org\/10.1137\/1.9781611973730.20","DOI":"10.1137\/1.9781611973730.20"},{"issue":"1","key":"8_CR12","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":"8_CR13","doi-asserted-by":"publisher","unstructured":"Dabrowski, K.K., Johnson, M., Paulusma, D.: Clique-width for hereditary graph classes. In: Surveys in Combinatorics 2019, London Math. Soc. Lecture Note Series, vol. 456, pp. 1\u201356. Cambridge University Press, Cambridge (2019). https:\/\/doi.org\/10.1017\/9781108649094","DOI":"10.1017\/9781108649094"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.jcss.2019.09.001","volume":"108","author":"KK Dabrowski","year":"2020","unstructured":"Dabrowski, K.K., Lozin, V.V., Paulusma, D.: Clique-width and well-quasi-ordering of triangle-free graph classes. J. Comput. Syst. Sci. 108, 64\u201391 (2020). https:\/\/doi.org\/10.1016\/j.jcss.2019.09.001","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"8_CR15","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1002\/jgt.3190160509","volume":"16","author":"G Ding","year":"1992","unstructured":"Ding, G.: Subgraphs and well-quasi-ordering. J. Graph Theor. 16(5), 489\u2013502 (1992). https:\/\/doi.org\/10.1002\/jgt.3190160509","journal-title":"J. Graph Theor."},{"issue":"1\u20132","key":"8_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"RG Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness. II. On completeness for $$W[1]$$. Theoret. Comput. Sci. 141(1\u20132), 109\u2013131 (1995). https:\/\/doi.org\/10.1016\/0304-3975(94)00097-3","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"8_CR17","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1137\/05064299X","volume":"38","author":"U Feige","year":"2008","unstructured":"Feige, U., Hajiaghayi, M., Lee, J.R.: Improved approximation algorithms for minimum weight vertex separators. SIAM J. Comput. 38(2), 629\u2013657 (2008). https:\/\/doi.org\/10.1137\/05064299X","journal-title":"SIAM J. Comput."},{"issue":"5","key":"8_CR18","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.jctb.2011.02.008","volume":"101","author":"FV Fomin","year":"2011","unstructured":"Fomin, F.V., Golovach, P., Thilikos, D.M.: Contraction obstructions for treewidth. J. Comb. Theor. Ser. B 101(5), 302\u2013314 (2011). https:\/\/doi.org\/10.1016\/j.jctb.2011.02.008","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"4","key":"8_CR19","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1007\/s00453-018-0495-5","volume":"81","author":"V Garnero","year":"2018","unstructured":"Garnero, V., Paul, C., Sau, I., Thilikos, D.M.: Explicit linear kernels for packing problems. Algorithmica 81(4), 1615\u20131656 (2018). https:\/\/doi.org\/10.1007\/s00453-018-0495-5","journal-title":"Algorithmica"},{"issue":"4","key":"8_CR20","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1002\/jgt.22028","volume":"84","author":"PA Golovach","year":"2017","unstructured":"Golovach, P.A., Johnson, M., Paulusma, D., Song, J.: A survey on the computational complexity of coloring graphs with forbidden subgraphs. J. Graph Theor. 84(4), 331\u2013363 (2017). https:\/\/doi.org\/10.1002\/jgt.22028","journal-title":"J. Graph Theor."},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.dam.2014.08.008","volume":"180","author":"PA Golovach","year":"2015","unstructured":"Golovach, P.A., Paulusma, D., Ries, B.: Coloring graphs characterized by a forbidden subgraph. Discret. Appl. Math. 180, 101\u2013110 (2015). https:\/\/doi.org\/10.1016\/j.dam.2014.08.008","journal-title":"Discret. Appl. Math."},{"key":"8_CR22","volume-title":"Algorithmic Graph Theory and Perfect Graphs, Annals of Discrete Mathematics","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, Annals of Discrete Mathematics, vol. 57, 2nd edn. Elsevier, Amsterdam (2004)","edition":"2"},{"issue":"3\u20134","key":"8_CR23","first-page":"413","volume":"19","author":"A Gy\u00e1rf\u00e1s","year":"1987","unstructured":"Gy\u00e1rf\u00e1s, A.: Problems from the world surrounding perfect graphs. Zastos. Mat. 19(3\u20134), 413\u2013441 (1987)","journal-title":"Zastos. Mat."},{"issue":"1","key":"8_CR24","doi-asserted-by":"publisher","first-page":"108","DOI":"10.37236\/595","volume":"18","author":"A Gy\u00e1rf\u00e1s","year":"2011","unstructured":"Gy\u00e1rf\u00e1s, A., Zaker, M.: On $$(\\delta,\\chi )$$-bounded families of graphs. Electron. J. Comb. 18(1), 108 (2011). https:\/\/doi.org\/10.37236\/595","journal-title":"Electron. J. Comb."},{"key":"8_CR25","unstructured":"Hartinger, T.R.: New Characterizations in Structural Graph Theory: $$1$$-Perfectly Orientable Graphs, Graph Products, and the Price of Connectivity. Ph.D. Thesis. University of Primorska (2017)"},{"issue":"2","key":"8_CR26","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1002\/jgt.22067","volume":"85","author":"TR Hartinger","year":"2017","unstructured":"Hartinger, T.R., Milani\u010d, M.: Partial characterizations of 1-perfectly orientable graphs. J. Graph Theor. 85(2), 378\u2013394 (2017). https:\/\/doi.org\/10.1002\/jgt.22067","journal-title":"J. Graph Theor."},{"issue":"1","key":"8_CR27","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","volume":"48","author":"P Hell","year":"1990","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: On the complexity of $$H$$-coloring. J. Comb. Theor. Ser. B 48(1), 92\u2013110 (1990). https:\/\/doi.org\/10.1016\/0095-8956(90)90132-J","journal-title":"J. Comb. Theor. Ser. B"},{"key":"8_CR28","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.dam.2014.04.014","volume":"174","author":"D Hermelin","year":"2014","unstructured":"Hermelin, D., Mestre, J., Rawitz, D.: Optimization problems in dotted interval graphs. Discret. Appl. Math. 174, 66\u201372 (2014). https:\/\/doi.org\/10.1016\/j.dam.2014.04.014","journal-title":"Discret. Appl. Math."},{"key":"8_CR29","doi-asserted-by":"publisher","unstructured":"van\u2019t Hof, P., Kami\u0144ski, M., Paulusma, D., Szeider, S., Thilikos, D.M.: On graph contractions and induced minors. Discret. Appl. Math. 160(6), 799\u2013809 (2012). https:\/\/doi.org\/10.1016\/j.dam.2010.05.005","DOI":"10.1016\/j.dam.2010.05.005"},{"key":"8_CR30","volume-title":"Graph Coloring Problems","author":"TR Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Graph Coloring Problems. Wiley, New York (1995). Wiley-Interscience Series in Discrete Mathematics and Optimization"},{"key":"8_CR31","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.dam.2017.02.018","volume":"248","author":"M Kami\u0144ski","year":"2018","unstructured":"Kami\u0144ski, M., Raymond, J.F., Trunck, T.: Well-quasi-ordering $$H$$-contraction-free graphs. Discret. Appl. Math. 248, 18\u201327 (2018). https:\/\/doi.org\/10.1016\/j.dam.2017.02.018","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"8_CR32","doi-asserted-by":"publisher","first-page":"1447","DOI":"10.1007\/s00373-015-1651-1","volume":"32","author":"T Karthick","year":"2015","unstructured":"Karthick, T., Maffray, F.: Vizing bound for the chromatic number on some graph classes. Graphs Comb. 32(4), 1447\u20131460 (2015). https:\/\/doi.org\/10.1007\/s00373-015-1651-1","journal-title":"Graphs Comb."},{"issue":"4","key":"8_CR33","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02579141","volume":"4","author":"AV Kostochka","year":"1984","unstructured":"Kostochka, A.V.: Lower bound of the Hadwiger number of graphs by their average degree. Combinatorica 4(4), 307\u2013316 (1984). https:\/\/doi.org\/10.1007\/BF02579141","journal-title":"Combinatorica"},{"issue":"1","key":"8_CR34","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1090\/S0273-0979-05-01088-8","volume":"43","author":"L Lov\u00e1sz","year":"2006","unstructured":"Lov\u00e1sz, L.: Graph minor theory. Bull. Am. Math. Soc. (N.S.) 43(1), 75\u201386 (2006). https:\/\/doi.org\/10.1090\/S0273-0979-05-01088-8","journal-title":"Bull. Am. Math. Soc. (N.S.)"},{"issue":"1","key":"8_CR35","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/s10878-015-9872-z","volume":"32","author":"DS Malyshev","year":"2016","unstructured":"Malyshev, D.S.: A complexity dichotomy and a new boundary class for the dominating set problem. J. Comb. Optim. 32(1), 226\u2013243 (2016). https:\/\/doi.org\/10.1007\/s10878-015-9872-z","journal-title":"J. Comb. Optim."},{"issue":"1","key":"8_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jctb.1996.0030","volume":"67","author":"SE Markossian","year":"1996","unstructured":"Markossian, S.E., Gasparian, G.S., Reed, B.A.: $$\\beta $$-perfect graphs. J. Comb. Theor. Ser. B 67(1), 1\u201311 (1996). https:\/\/doi.org\/10.1006\/jctb.1996.0030","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"1","key":"8_CR37","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/S0196-6774(03)00048-8","volume":"48","author":"V Raghavan","year":"2003","unstructured":"Raghavan, V., Spinrad, J.: Robust algorithms for restricted domains. J. Algorithms 48(1), 160\u2013172 (2003). https:\/\/doi.org\/10.1016\/S0196-6774(03)00048-8","journal-title":"J. Algorithms"},{"issue":"4","key":"8_CR38","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1112\/plms\/s2-30.1.264","volume":"30","author":"FP Ramsey","year":"1929","unstructured":"Ramsey, F.P.: On a problem of formal logic. Proc. London Math. Soc. (2) 30(4), 264\u2013286 (1929). https:\/\/doi.org\/10.1112\/plms\/s2-30.1.264","journal-title":"Proc. London Math. Soc. (2)"},{"issue":"1","key":"8_CR39","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","volume":"41","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. V. Excluding a planar graph. J. Comb. Theor. Ser. B 41(1), 92\u2013114 (1986). https:\/\/doi.org\/10.1016\/0095-8956(86)90030-4","journal-title":"J. Comb. Theor. Ser. B"},{"key":"8_CR40","unstructured":"Scheffler, P.: What graphs have bounded tree-width? In: Proceedings of the 7th Fischland Colloquium, III (Wustrow, 1988), pp. 31\u201338, no. 41 (1990)"},{"issue":"4","key":"8_CR41","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1007\/s00224-017-9775-8","volume":"61","author":"P Schweitzer","year":"2017","unstructured":"Schweitzer, P.: Towards an isomorphism dichotomy for hereditary graph classes. Theo. Comput. Syst. 61(4), 1084\u20131127 (2017). https:\/\/doi.org\/10.1007\/s00224-017-9775-8","journal-title":"Theo. Comput. Syst."},{"key":"8_CR42","unstructured":"Scott, A., Seymour, P.: A survey of $$\\chi $$-boundedness. arXiv:1812.07500 [math.CO] (2018)"},{"issue":"12","key":"8_CR43","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1016\/j.dam.2009.07.010","volume":"158","author":"A Silva","year":"2010","unstructured":"Silva, A., da Silva, A.A., Sales, C.L.: A bound on the treewidth of planar even-hole-free graphs. Discret. Appl. Math. 158(12), 1229\u20131239 (2010). https:\/\/doi.org\/10.1016\/j.dam.2009.07.010","journal-title":"Discret. Appl. Math."},{"key":"8_CR44","unstructured":"Sintiari, N.L.D., Trotignon, N.: (Theta, triangle)-free and (even hole, $$K_4$$)-free graphs. Part 1 : Layered wheels. arXiv:1906.10998 [cs.DM] (2019)"},{"key":"8_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-46784-X_16","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"K Skodinis","year":"1999","unstructured":"Skodinis, K.: Efficient analysis of graphs with small minimal separators. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol. 1665, pp. 155\u2013166. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46784-X_16"},{"key":"8_CR46","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.jctb.2019.04.004","volume":"139","author":"D Wei\u00dfauer","year":"2019","unstructured":"Wei\u00dfauer, D.: In absence of long chordless cycles, large tree-width becomes a local phenomenon. J. Comb. Theor. Ser. B 139, 342\u2013352 (2019). https:\/\/doi.org\/10.1016\/j.jctb.2019.04.004","journal-title":"J. Comb. Theor. Ser. B"},{"key":"8_CR47","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1613\/jair.4030","volume":"49","author":"Y Wu","year":"2014","unstructured":"Wu, Y., Austrin, P., Pitassi, T., Liu, D.: Inapproximability of treewidth and related problems. J. Artif. Intell. Res. 49, 569\u2013600 (2014). https:\/\/doi.org\/10.1613\/jair.4030","journal-title":"J. Artif. Intell. Res."},{"issue":"14","key":"8_CR48","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1016\/j.disc.2011.03.025","volume":"311","author":"M Zaker","year":"2011","unstructured":"Zaker, M.: On lower bounds for the chromatic number in terms of vertex degree. Discret. Math. 311(14), 1365\u20131370 (2011). https:\/\/doi.org\/10.1016\/j.disc.2011.03.025","journal-title":"Discret. Math."},{"key":"8_CR49","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D Zuckerman","year":"2007","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theor. Comput. 3, 103\u2013128 (2007). https:\/\/doi.org\/10.4086\/toc.2007.v003a006","journal-title":"Theor. Comput."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60440-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:00:29Z","timestamp":1710266429000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60440-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030604394","9783030604400"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60440-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leeds","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algorithms.leeds.ac.uk\/wg2020\/","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":"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":"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":"34% - 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.7","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":"2.1","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.","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)"}}]}}