{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:04:41Z","timestamp":1757311481685,"version":"3.40.3"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031159138"},{"type":"electronic","value":"9783031159145"}],"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-15914-5_9","type":"book-chapter","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:14:22Z","timestamp":1664536462000},"page":"114-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An Algorithmic Framework for\u00a0Locally Constrained Homomorphisms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1645-9345","authenticated-orcid":false,"given":"Laurent","family":"Bulteau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9515-6945","authenticated-orcid":false,"given":"Konrad K.","family":"Dabrowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1023-6530","authenticated-orcid":false,"given":"Noleen","family":"K\u00f6hler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1825-0097","authenticated-orcid":false,"given":"Sebastian","family":"Ordyniak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5945-9287","authenticated-orcid":false,"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,1]]},"reference":[{"key":"9_CR1","first-page":"103","volume":"4","author":"J Abello","year":"1991","unstructured":"Abello, J., Fellows, M.R., Stillwell, J.: On the complexity and combinatorics of covering finite complexes. Australas. J. Comb. 4, 103\u2013112 (1991)","journal-title":"Australas. J. Comb."},{"key":"9_CR2","first-page":"82","volume":"1980","author":"D Angluin","year":"1980","unstructured":"Angluin, D.: Local and global properties in networks of processors (extended abstract). Proc. STOC 1980, 82\u201393 (1980)","journal-title":"Proc. STOC"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/0095-8956(81)90062-9","volume":"30","author":"D Angluin","year":"1981","unstructured":"Angluin, D., Gardiner, A.: Finite common coverings of pairs of regular graphs. J. Comb. Theory Ser. B 30, 184\u2013187 (1981)","journal-title":"J. Comb. Theory Ser. B"},{"key":"9_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608704","volume-title":"Algebraic Graph Theory","author":"NJ Biggs","year":"1974","unstructured":"Biggs, N.J.: Algebraic Graph Theory. Cambridge University Press, Cambridge (1974)"},{"issue":"26","key":"9_CR5","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1112\/jlms\/s2-26.2.193","volume":"II","author":"NJ Biggs","year":"1982","unstructured":"Biggs, N.J.: Constructing $$5$$-arc transitive cubic graphs. J. Lond. Math. Soc. II(26), 193\u2013200 (1982)","journal-title":"J. Lond. Math. Soc."},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-642-20877-5_46","volume-title":"Theory and Applications of Models of Computation","author":"O B\u00edlka","year":"2011","unstructured":"B\u00edlka, O., Lidick\u00fd, B., Tesa\u0159, M.: Locally injective homomorphism to the simple weight graphs. In: Ogihara, M., Tarui, J. (eds.) TAMC 2011. LNCS, vol. 6648, pp. 471\u2013482. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20877-5_46"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/0743-7315(89)90048-8","volume":"6","author":"HL Bodlaender","year":"1989","unstructured":"Bodlaender, H.L.: The classification of coverings of processor networks. J. Parallel Distrib. Comput. 6, 166\u2013182 (1989)","journal-title":"J. Parallel Distrib. Comput."},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jagm.1995.1009","volume":"18","author":"HL Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Gilbert, J.R., Hafsteinsson, H., Kloks, T.: Approximating treewidth, pathwidth, frontsize, and shortest elimination tree. J. Algorithms 18, 238\u2013255 (1995)","journal-title":"J. Algorithms"},{"key":"9_CR9","unstructured":"Bok, J., Fiala, J., Hlinen\u00fd, P., Jedlickov\u00e1, N., Kratochv\u00edl, J.: Computational complexity of covering multigraphs with semi-edges: small cases. In: Proceedings of MFCS 2021. LIPIcs, vol. 202, pp. 21:1\u201321:15 (2021)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-540-30577-4_11","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"J Chalopin","year":"2005","unstructured":"Chalopin, J.: Local computations on closed unlabelled edges: the election problem and the naming problem. In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol. 3381, pp. 82\u201391. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30577-4_11"},{"key":"9_CR11","first-page":"85","volume":"74","author":"J Chalopin","year":"2006","unstructured":"Chalopin, J., M\u00e9tivier, Y., Zielonka, W.: Local computations in graphs: the case of cellular edge local computations. Fund. Inform. 74, 85\u2013114 (2006)","journal-title":"Fund. Inform."},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1002\/net.20432","volume":"58","author":"J Chalopin","year":"2011","unstructured":"Chalopin, J., Paulusma, D.: Graph labelings derived from models in distributed computing: a complete complexity classification. Networks 58, 207\u2013231 (2011)","journal-title":"Networks"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.dam.2012.08.026","volume":"168","author":"J Chalopin","year":"2014","unstructured":"Chalopin, J., Paulusma, D.: Packing bipartite graphs with covers of complete bipartite graphs. Discret. Appl. Math. 168, 40\u201350 (2014)","journal-title":"Discret. Appl. Math."},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Chaplick, S., Fiala, J., van \u2019t Hof, P., Paulusma, D., Tesa\u0159, M.: Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. Theor. Comput. Sci. 590, 86\u201395 (2015)","DOI":"10.1016\/j.tcs.2015.01.028"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(99)00220-0","volume":"239","author":"C Chekuri","year":"2000","unstructured":"Chekuri, C., Rajaraman, A.: Conjunctive query containment revisited. Theoret. Comput. Sci. 239, 211\u2013229 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tcs.2016.05.011","volume":"635","author":"MC Dourado","year":"2016","unstructured":"Dourado, M.C.: Computing role assignments of split graphs. Theoret. Comput. Sci. 635, 74\u201384 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR17","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, 109\u2013131 (1995)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Drange, P.G., Dregi, M.S., van \u2019t Hof, P.: On the computational complexity of vertex integrity and component order connectivity. Algorithmica 76, 1181\u20131202 (2016)","DOI":"10.1007\/s00453-016-0127-x"},{"key":"9_CR19","first-page":"607","volume":"2017","author":"P Dvor\u00e1k","year":"2017","unstructured":"Dvor\u00e1k, P., Eiben, E., Ganian, R., Knop, D., Ordyniak, S.: Solving integer linear programs with a small number of global variables and constraints. Proc. IJCAI 2017, 607\u2013613 (2017)","journal-title":"Proc. IJCAI"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0165-4896(91)90080-B","volume":"21","author":"MG Everett","year":"1991","unstructured":"Everett, M.G., Borgatti, S.P.: Role colouring a graph. Math. Soc. Sci. 21, 183\u2013188 (1991)","journal-title":"Math. Soc. Sci."},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-92182-0_28","volume-title":"Algorithms and Computation","author":"MR Fellows","year":"2008","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Rosamond, F.A., Saurabh, S.: Graph layout problems parameterized by vertex cover. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 294\u2013305. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92182-0_28"},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0166-218X(00)00387-5","volume":"113","author":"J Fiala","year":"2001","unstructured":"Fiala, J., Kloks, T., Kratochv\u00edl, J.: Fixed-parameter complexity of lambda-labelings. Discret. Appl. Math. 113, 59\u201372 (2001)","journal-title":"Discret. Appl. Math."},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"89","DOI":"10.7151\/dmgt.1159","volume":"22","author":"J Fiala","year":"2002","unstructured":"Fiala, J., Kratochv\u00edl, J.: Partial covers of graphs. Discuss. Math. Graph Theory 22, 89\u201399 (2002)","journal-title":"Discuss. Math. Graph Theory"},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.cosrev.2008.06.001","volume":"2","author":"J Fiala","year":"2008","unstructured":"Fiala, J., Kratochv\u00edl, J.: Locally constrained graph homomorphisms - structure, complexity, and applications. Comput. Sci. Rev. 2, 97\u2013111 (2008)","journal-title":"Comput. Sci. Rev."},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1016\/j.dam.2007.05.051","volume":"156","author":"J Fiala","year":"2008","unstructured":"Fiala, J., Kratochv\u00edl, J., P\u00f3r, A.: On the computational complexity of partial covers of theta graphs. Discret. Appl. Math. 156, 1143\u20131149 (2008)","journal-title":"Discret. Appl. Math."},{"key":"9_CR26","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2005.09.029","volume":"349","author":"J Fiala","year":"2005","unstructured":"Fiala, J., Paulusma, D.: A complete complexity classification of the role assignment problem. Theoret. Comput. Sci. 349, 67\u201381 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR27","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/s00224-009-9200-z","volume":"46","author":"J Fiala","year":"2010","unstructured":"Fiala, J., Paulusma, D.: Comparing universal covers in polynomial time. Theory Comput. Syst. 46, 620\u2013635 (2010)","journal-title":"Theory Comput. Syst."},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-642-38536-0_27","volume-title":"Computer Science \u2013 Theory and Applications","author":"J Fiala","year":"2013","unstructured":"Fiala, J., Tesa\u0159, M.: Dichotomy of the H-quasi-cover problem. In: Bulatov, A.A., Shur, A.M. (eds.) CSR 2013. LNCS, vol. 7913, pp. 310\u2013321. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38536-0_27"},{"issue":"1","key":"9_CR29","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A Frank","year":"1987","unstructured":"Frank, A., Tardos, \u00c9.: An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica 7(1), 49\u201365 (1987)","journal-title":"Combinatorica"},{"key":"9_CR30","first-page":"4","volume":"1990","author":"EC Freuder","year":"1990","unstructured":"Freuder, E.C.: Complexity of $$k$$-tree structured constraint satisfaction problems. Proc. AAAI 1990, 4\u20139 (1990)","journal-title":"Proc. AAAI"},{"key":"9_CR31","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1145\/1206035.1206036","volume":"54","author":"M Grohe","year":"2007","unstructured":"Grohe, M.: The complexity of homomorphism and constraint satisfaction problems seen from the other side. J. ACM 54, 1:1-1:24 (2007)","journal-title":"J. ACM"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Heggernes, P., van \u2019t Hof, P., Paulusma, D.: Computing role assignments of proper interval graphs in polynomial time. J. Discret. Algorithms 14, 173\u2013188 (2012)","DOI":"10.1016\/j.jda.2011.12.004"},{"key":"9_CR33","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. Theory Ser. B 48, 92\u2013110 (1990)","journal-title":"J. Comb. Theory Ser. B"},{"key":"9_CR34","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001","volume-title":"Graphs and Homomorphisms","author":"P Hell","year":"2004","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: Graphs and Homomorphisms. Oxford University Press, Oxford (2004)"},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"van \u2019t Hof, P., Paulusma, D., van Rooij, J.M.M.: Computing role assignments of chordal graphs. Theoret. Comput. Sci. 411, 3601\u20133613 (2010)","DOI":"10.1016\/j.tcs.2010.05.041"},{"issue":"3","key":"9_CR36","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12(3), 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"key":"9_CR37","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0012-365X(94)90026-4","volume":"133","author":"J Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J.: Regular codes in regular graphs are difficult. Discret. Math. 133, 191\u2013205 (1994)","journal-title":"Discret. Math."},{"key":"9_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jctb.1996.1743","volume":"71","author":"J Kratochv\u00edl","year":"1997","unstructured":"Kratochv\u00edl, J., Proskurowski, A., Telle, J.A.: Covering regular graphs. J. Comb. Theory Ser. B 71, 1\u201316 (1997)","journal-title":"J. Comb. Theory Ser. B"},{"key":"9_CR39","first-page":"173","volume":"5","author":"J Kratochv\u00edl","year":"1998","unstructured":"Kratochv\u00edl, J., Proskurowski, A., Telle, J.A.: On the complexity of graph covering problems. Nordic J. Comput. 5, 173\u2013195 (1998)","journal-title":"Nordic J. Comput."},{"key":"9_CR40","doi-asserted-by":"crossref","unstructured":"Kratochv\u00edl, J., Telle, J.A., Tesa\u0159, M.: Computational complexity of covering three-vertex multigraphs. Theoret. Comput. Sci. 609, 104\u2013117 (2016)","DOI":"10.1016\/j.tcs.2015.09.013"},{"key":"9_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/3-540-40996-3_39","volume-title":"Algorithms and Computation","author":"P Kristiansen","year":"2000","unstructured":"Kristiansen, P., Telle, J.A.: Generalized H-coloring of graphs. In: Goos, G., Hartmanis, J., van Leeuwen, J., Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 456\u2013466. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-40996-3_39"},{"key":"9_CR42","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.artint.2018.10.002","volume":"269","author":"M Kronegger","year":"2019","unstructured":"Kronegger, M., Ordyniak, S., Pfandler, A.: Backdoors to planning. Artif. Intell. 269, 49\u201375 (2019)","journal-title":"Artif. Intell."},{"issue":"4","key":"9_CR43","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra, H.W., Jr.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"9_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-19222-7_33","volume-title":"Combinatorial Algorithms","author":"B Lidick\u00fd","year":"2011","unstructured":"Lidick\u00fd, B., Tesa\u0159, M.: Complexity of locally injective homomorphism to the theta graphs. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2010. LNCS, vol. 6460, pp. 326\u2013336. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19222-7_33"},{"key":"9_CR45","unstructured":"Massey, W.S.: Algebraic Topology: An Introduction. Harcourt, Brace and World (1967)"},{"key":"9_CR46","doi-asserted-by":"crossref","unstructured":"Ne\u0161et\u0159il, J.: Homomorphisms of derivative graphs. Discret. Math. 1, 257\u2013268 (1971)","DOI":"10.1016\/0012-365X(71)90014-8"},{"key":"9_CR47","doi-asserted-by":"publisher","unstructured":"Ne\u0161et\u0159il, J., Ossona de Mendez, P.: Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol.\u00a028. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27875-4","DOI":"10.1007\/978-3-642-27875-4"},{"key":"9_CR48","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.jcss.2019.12.004","volume":"109","author":"K Okrasa","year":"2020","unstructured":"Okrasa, K., Rz\u0105\u017cewski, P.: Subexponential algorithms for variants of the homomorphism problem in string graphs. J. Comput. Syst. Sci. 109, 126\u2013144 (2020)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR49","unstructured":"Pandey, S., Sahlot, V.: Role coloring bipartite graphs. CoRR abs\/2102.01124 (2021)"},{"key":"9_CR50","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0165-4896(00)00064-0","volume":"41","author":"A Peke\u010d","year":"2001","unstructured":"Peke\u010d, A., Roberts, F.S.: The role assignment model nearly fits most social networks. Math. Soc. Sci. 41, 275\u2013293 (2001)","journal-title":"Math. Soc. Sci."},{"key":"9_CR51","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jda.2015.08.001","volume":"35","author":"C Purcell","year":"2015","unstructured":"Purcell, C., Rombach, M.P.: On the complexity of role colouring planar graphs, trees and cographs. J. Discret. Algorithms 35, 1\u20138 (2015)","journal-title":"J. Discret. Algorithms"},{"key":"9_CR52","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tcs.2021.05.010","volume":"876","author":"C Purcell","year":"2021","unstructured":"Purcell, C., Rombach, M.P.: Role colouring graphs in hereditary classes. Theoret. Comput. Sci. 876, 12\u201324 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR53","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1002\/1097-0037(200103)37:2<67::AID-NET1>3.0.CO;2-9","volume":"37","author":"FS Roberts","year":"2001","unstructured":"Roberts, F.S., Sheng, L.: How hard is it to determine if a graph has a $$2$$-role assignment? Networks 37, 67\u201373 (2001)","journal-title":"Networks"},{"key":"9_CR54","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0378-8733(83)90025-4","volume":"5","author":"DR White","year":"1983","unstructured":"White, D.R., Reitz, K.P.: Graph and semigroup homomorphisms on networks of relations. Soc. Netw. 5, 193\u2013235 (1983)","journal-title":"Soc. Netw."}],"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-031-15914-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:16:48Z","timestamp":1664536608000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15914-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159138","9783031159145"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15914-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 October 2022","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":"T\u00fcbingen","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":"22 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.inf.uni-tuebingen.de\/wg2022\/","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":"96","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":"33% - 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":"12","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)"}}]}}