{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T23:10:15Z","timestamp":1746573015791,"version":"3.40.3"},"publisher-location":"Cham","reference-count":52,"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_1","type":"book-chapter","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:14:22Z","timestamp":1664536462000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Minimal Roman Dominating Functions: Extensions and\u00a0Enumeration"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5221-8421","authenticated-orcid":false,"given":"Faisal N.","family":"Abu-Khzam","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4444-3220","authenticated-orcid":false,"given":"Henning","family":"Fernau","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0880-2513","authenticated-orcid":false,"given":"Kevin","family":"Mann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,1]]},"reference":[{"issue":"3","key":"1_CR1","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.jcss.2015.11.010","volume":"82","author":"FN Abu-Khzam","year":"2016","unstructured":"Abu-Khzam, F.N., Bazgan, C., Chopin, M., Fernau, H.: Data reductions and combinatorial bounds for improved approximation algorithms. J. Comput. Syst. Sci. 82(3), 503\u2013520 (2016)","journal-title":"J. Comput. Syst. Sci."},{"issue":"12","key":"1_CR2","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1016\/j.ipl.2016.07.002","volume":"116","author":"FN Abu-Khzam","year":"2016","unstructured":"Abu-Khzam, F.N., Heggernes, P.: Enumerating minimal dominating sets in chordal graphs. Inf. Process. Lett. 116(12), 739\u2013743 (2016)","journal-title":"Inf. Process. Lett."},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2017.05.042","volume":"717","author":"C Bazgan","year":"2018","unstructured":"Bazgan, C., et al.: The many facets of upper domination. Theoret. Comput. Sci. 717, 2\u201325 (2018)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR4","unstructured":"Benecke, S.: Higher order domination of graphs. Master\u2019s thesis, Department of Applied Mathematics of the University of Stellebosch, South Africa (2004). http:\/\/dip.sun.ac.za\/~vuuren\/Theses\/Benecke.pdf"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.dam.2012.11.013","volume":"165","author":"S Bermudo","year":"2014","unstructured":"Bermudo, S., Fernau, H.: Computing the differential of a graph: hardness, approximability and exact algorithms. Discret. Appl. Math. 165, 69\u201382 (2014)","journal-title":"Discret. Appl. Math."},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.tcs.2014.10.007","volume":"562","author":"S Bermudo","year":"2015","unstructured":"Bermudo, S., Fernau, H.: Combinatorics for smaller kernels: the differential of a graph. Theoret. Comput. Sci. 562, 330\u2013345 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"155","DOI":"10.2298\/AADM140210003B","volume":"8","author":"S Bermudo","year":"2014","unstructured":"Bermudo, S., Fernau, H., Sigarreta, J.M.: The differential and the Roman domination number of a graph. Appl. Anal. Discret. Math. 8, 155\u2013171 (2014)","journal-title":"Appl. Anal. Discret. Math."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Bl\u00e4sius, T., Friedrich, T., Lischeid, J., Meeks, K., Schirneck, M.: Efficiently enumerating hitting sets of hypergraphs arising in data profiling. In: Algorithm Engineering and Experiments (ALENEX), pp. 130\u2013143. SIAM (2019)","DOI":"10.1137\/1.9781611975499.11"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Bonamy, M., Defrain, O., Heinrich, M., Raymond, J.F.: Enumerating minimal dominating sets in triangle-free graphs. In: Niedermeier, R., Paul, C. (eds.) 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). LIPIcs, vol. 126, pp. 16:1\u201316:12. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)","DOI":"10.1145\/3386686"},{"issue":"2","key":"1_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1080\/10556789808805708","volume":"10","author":"E Boros","year":"1998","unstructured":"Boros, E., Gurvich, V., Hammer, P.L.: Dual subimplicants of positive Boolean functions. Optim. Methods Softw. 10(2), 147\u2013156 (1998)","journal-title":"Optim. Methods Softw."},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-030-25027-0_13","volume-title":"Fundamentals of Computation Theory","author":"K Casel","year":"2019","unstructured":"Casel, K., Fernau, H., Khosravian Ghadikolaei, M., Monnot, J., Sikora, F.: Extension of some edge graph problems: standard and parameterized complexity. In: G\u0105sieniec, L.A., Jansson, J., Levcopoulos, C. (eds.) FCT 2019. LNCS, vol. 11651, pp. 185\u2013200. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25027-0_13"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-75242-2_1","volume-title":"Algorithms and Complexity","author":"H Fernau","year":"2021","unstructured":"Fernau, H., Huber, K.T., Naor, J.S.: Invited talks. In: Calamoneri, T., Cor\u00f2, F. (eds.) CIAC 2021. LNCS, vol. 12701, pp. 3\u201319. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75242-2_1"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.tcs.2021.10.017","volume":"904","author":"K Casel","year":"2022","unstructured":"Casel, K., Fernau, H., Ghadikolaei, M.K., Monnot, J., Sikora, F.: On the complexity of solution extension of optimization problems. Theoret. Comput. Sci. 904, 48\u201365 (2022). https:\/\/doi.org\/10.1016\/j.tcs.2021.10.017","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.1137\/070699688","volume":"23","author":"EW Chambers","year":"2009","unstructured":"Chambers, E.W., Kinnersley, B., Prince, N., West, D.B.: Extremal problems for Roman domination. SIAM J. Discret. Math. 23, 1575\u20131586 (2009)","journal-title":"SIAM J. Discret. Math."},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-45278-9_8","volume-title":"Combinatorial Algorithms","author":"M Chapelle","year":"2013","unstructured":"Chapelle, M., Cochefert, M., Couturier, J.-F., Kratsch, D., Liedloff, M., Perez, A.: Exact algorithms for weak Roman domination. In: Lecroq, T., Mouchard, L. (eds.) IWOCA 2013. LNCS, vol. 8288, pp. 81\u201393. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45278-9_8"},{"issue":"1","key":"1_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00373-015-1566-x","volume":"32","author":"M Chellali","year":"2016","unstructured":"Chellali, M., Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T., McRae, A.A.: A Roman domination chain. Graphs Comb. 32(1), 79\u201392 (2016)","journal-title":"Graphs Comb."},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.disc.2003.06.004","volume":"278","author":"EJ Cockayne","year":"2004","unstructured":"Cockayne, E.J., Dreyer, P., Jr., Hedetniemi, S.M., Hedetniemi, S.T.: Roman domination in graphs. Discret. Math. 278, 11\u201322 (2004)","journal-title":"Discret. Math."},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Couturier, J., Heggernes, P., van \u2019t Hof, P., Kratsch, D.: Minimal dominating sets in graph classes: combinatorial bounds and enumeration. Theoret. Comput. Sci. 487, 82\u201394 (2013)","DOI":"10.1016\/j.tcs.2013.03.026"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1016\/j.tcs.2014.11.006","volume":"562","author":"J Couturier","year":"2015","unstructured":"Couturier, J., Letourneur, R., Liedloff, M.: On the number of minimal dominating sets on some graph classes. Theoret. Comput. Sci. 562, 634\u2013642 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.dam.2019.02.025","volume":"268","author":"N Creignou","year":"2019","unstructured":"Creignou, N., Kr\u00f6ll, M., Pichler, R., Skritek, S., Vollmer, H.: A complexity theory for hard enumeration problems. Discret. Appl. Math. 268, 191\u2013209 (2019)","journal-title":"Discret. Appl. Math."},{"key":"1_CR21","unstructured":"Dreyer, P.A.: Applications and variations of domination in graphs. Ph.D. thesis, Rutgers University, New Jersey, USA (2000)"},{"issue":"6","key":"1_CR22","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1137\/S0097539793250299","volume":"24","author":"T Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM J. Comput. 24(6), 1278\u20131304 (1995)","journal-title":"SIAM J. Comput."},{"issue":"10","key":"1_CR23","doi-asserted-by":"publisher","first-page":"3447","DOI":"10.1016\/j.disc.2008.09.043","volume":"309","author":"O Favaron","year":"2009","unstructured":"Favaron, O., Karami, H., Khoeilar, R., Sheikholeslami, S.M.: On the Roman domination number of a graph. Discret. Math. 309(10), 3447\u20133451 (2009)","journal-title":"Discret. Math."},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1080\/00207160701374376","volume":"85","author":"H Fernau","year":"2008","unstructured":"Fernau, H.: Roman domination: a parameterized perspective. Int. J. Comput. Math. 85, 25\u201338 (2008)","journal-title":"Int. J. Comput. Math."},{"issue":"1","key":"1_CR25","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1137\/15M1055024","volume":"31","author":"A Gainer-Dewar","year":"2017","unstructured":"Gainer-Dewar, A., Vera-Licona, P.: The minimal hitting set generation problem: algorithms and computation. SIAM J. Discret. Math. 31(1), 63\u2013100 (2017)","journal-title":"SIAM J. Discret. Math."},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.dam.2014.12.010","volume":"199","author":"PA Golovach","year":"2016","unstructured":"Golovach, P.A., Heggernes, P., Kant\u00e9, M.M., Kratsch, D., Villanger, Y.: Enumerating minimal dominating sets in chordal bipartite graphs. Discret. Appl. Math. 199, 30\u201336 (2016)","journal-title":"Discret. Appl. Math."},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.tcs.2016.03.026","volume":"630","author":"PA Golovach","year":"2016","unstructured":"Golovach, P.A., Heggernes, P., Kratsch, D.: Enumerating minimal connected dominating sets in graphs of bounded chordality. Theoret. Comput. Sci. 630, 63\u201375 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR28","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Monographs and Textbooks in Pure and Applied Mathematics, vol. 208. Marcel Dekker (1998)"},{"key":"1_CR29","series-title":"Developments in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51117-3","volume-title":"Topics in Domination in Graphs","year":"2020","unstructured":"Haynes, T.W., Hedetniemi, S.T., Henning, M.A. (eds.): Topics in Domination in Graphs. Developments in Mathematics, vol. 64. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51117-3"},{"key":"1_CR30","first-page":"129","volume":"217","author":"ST Hedetniemi","year":"2013","unstructured":"Hedetniemi, S.T., Rubalcaba, R.R., Slater, P.J., Walsh, M.: Few compare to the great Roman empire. Congr. Numer. 217, 129\u2013136 (2013)","journal-title":"Congr. Numer."},{"issue":"4","key":"1_CR31","doi-asserted-by":"publisher","first-page":"1916","DOI":"10.1137\/120862612","volume":"28","author":"MM Kant\u00e9","year":"2014","unstructured":"Kant\u00e9, M.M., Limouzy, V., Mary, A., Nourine, L.: On the enumeration of minimal dominating sets and related notions. SIAM J. Discret. Math. 28(4), 1916\u20131929 (2014)","journal-title":"SIAM J. Discret. Math."},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-319-21840-3_37","volume-title":"Algorithms and Data Structures","author":"MM Kant\u00e9","year":"2015","unstructured":"Kant\u00e9, M.M., Limouzy, V., Mary, A., Nourine, L., Uno, T.: Polynomial delay algorithm for listing minimal edge dominating sets in graphs. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 446\u2013457. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21840-3_37"},{"key":"1_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-662-53174-7_11","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"MM Kant\u00e9","year":"2016","unstructured":"Kant\u00e9, M.M., Limouzy, V., Mary, A., Nourine, L., Uno, T.: A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs. In: Mayr, E.W. (ed.) WG 2015. LNCS, vol. 9224, pp. 138\u2013153. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53174-7_11"},{"issue":"13\u201314","key":"1_CR34","doi-asserted-by":"publisher","first-page":"2030","DOI":"10.1016\/j.dam.2012.04.008","volume":"160","author":"T Kraner \u0160umenjak","year":"2012","unstructured":"Kraner \u0160umenjak, T., Pavli\u0107, P., Tepeh, A.: On the Roman domination in the lexicographic product of graphs. Discret. Appl. Math. 160(13\u201314), 2030\u20132036 (2012)","journal-title":"Discret. Appl. Math."},{"key":"1_CR35","unstructured":"Liedloff, M.: Algorithmes exacts et exponentiels pour les probl\u00e8mes NP-difficiles: domination, variantes et g\u00e9n\u00e9ralisations. Ph.D. thesis, Universit\u00e9 Paul Verlaine - Metz, France (2007)"},{"issue":"18","key":"1_CR36","doi-asserted-by":"publisher","first-page":"3400","DOI":"10.1016\/j.dam.2008.01.011","volume":"156","author":"M Liedloff","year":"2008","unstructured":"Liedloff, M., Kloks, T., Liu, J., Peng, S.L.: Efficient algorithms for Roman domination on some classes of graphs. Discret. Appl. Math. 156(18), 3400\u20133415 (2008)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"1_CR37","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/080733085","volume":"26","author":"CH Liu","year":"2012","unstructured":"Liu, C.H., Chang, G.J.: Roman domination on 2-connected graphs. SIAM J. Discret. Math. 26(1), 193\u2013205 (2012)","journal-title":"SIAM J. Discret. Math."},{"issue":"7","key":"1_CR38","doi-asserted-by":"publisher","first-page":"1386","DOI":"10.1016\/j.disc.2011.12.021","volume":"312","author":"CH Liu","year":"2012","unstructured":"Liu, C.H., Chang, G.J.: Upper bounds on Roman domination numbers of graphs. Discret. Math. 312(7), 1386\u20131391 (2012)","journal-title":"Discret. Math."},{"issue":"3","key":"1_CR39","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/s10878-012-9482-y","volume":"26","author":"CH Liu","year":"2013","unstructured":"Liu, C.H., Chang, G.J.: Roman domination on strongly chordal graphs. J. Comb. Optim. 26(3), 608\u2013619 (2013)","journal-title":"J. Comb. Optim."},{"key":"1_CR40","unstructured":"Mary, A.: \u00c9num\u00e9ration des dominants minimaux d\u2019un graphe. Ph.D. thesis, LIMOS, Universit\u00e9 Blaise Pascal, Clermont-Ferrand, France, November 2013"},{"key":"1_CR41","first-page":"43","volume":"69","author":"JL Mashburn","year":"2006","unstructured":"Mashburn, J.L., Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T., Slater, P.J.: Differentials in graphs. Utilitas Math. 69, 43\u201354 (2006)","journal-title":"Utilitas Math."},{"key":"1_CR42","first-page":"247","volume":"60","author":"BP Mobaraky","year":"2008","unstructured":"Mobaraky, B.P., Sheikholeslami, S.M.: Bounds on Roman domination numbers of graphs. Matematitchki Vesnik 60, 247\u2013253 (2008)","journal-title":"Matematitchki Vesnik"},{"key":"1_CR43","doi-asserted-by":"crossref","unstructured":"Pagourtzis, A., Penna, P., Schlude, K., Steinh\u00f6fel, K., Taylor, D.S., Widmayer, P.: Server placements, Roman domination and other dominating set variants. In: Baeza-Yates, R.A., Montanari, U., Santoro, N. (eds.) Foundations of Information Technology in the Era of Networking and Mobile Computing, IFIP 17th World Computer Congress \u2013 TC1 Stream\/2nd IFIP International Conference on Theoretical Computer Science IFIP TCS, pp. 280\u2013291. Kluwer (2002). Also available as Technical report 365, ETH Z\u00fcrich, Institute of Theoretical Computer Science, 10\/2001","DOI":"10.1007\/978-0-387-35608-2_24"},{"key":"1_CR44","unstructured":"Peng, S.L., Tsai, Y.H.: Roman domination on graphs of bounded treewidth. In: The 24th Workshop on Combinatorial Mathematics and Computation Theory, pp. 128\u2013131 (2007)"},{"key":"1_CR45","doi-asserted-by":"crossref","unstructured":"ReVelle, C.S., Rosing, K.E.: Defendens imperium Romanum: a classical problem in military strategy. Am. Math. Monthly 107, 585\u2013594 (2000). http:\/\/www.jhu.edu\/~jhumag\/0497web\/locate3.html","DOI":"10.1080\/00029890.2000.12005243"},{"key":"1_CR46","doi-asserted-by":"crossref","unstructured":"van Rooij, J.M.M.: Exact exponential-time algorithms for domination problems in graphs. Ph.D. thesis, Universiteit Utrecht, The Netherlands (2011)","DOI":"10.1007\/s00453-011-9546-x"},{"issue":"1","key":"1_CR47","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1142\/S1793830910000504","volume":"2","author":"W Shang","year":"2010","unstructured":"Shang, W., Wang, X., Hu, X.: Roman domination and its variants in unit disk graphs. Discret. Math. Algorithms Appl. 2(1), 99\u2013106 (2010)","journal-title":"Discret. Math. Algorithms Appl."},{"key":"1_CR48","unstructured":"Shi, Z., Koh, K.M.: Counting the number of minimum Roman dominating functions of a graph. Technical report, arXiv\/CoRR, abs\/1403.1019 (2014)"},{"issue":"6","key":"1_CR49","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1038\/scientificamerican1299-136","volume":"281","author":"I Stewart","year":"1999","unstructured":"Stewart, I.: Defend the Roman empire. Sci. Am. 281(6), 136\u2013138 (1999)","journal-title":"Sci. Am."},{"issue":"24","key":"1_CR50","doi-asserted-by":"publisher","first-page":"3338","DOI":"10.1016\/j.disc.2006.06.018","volume":"306","author":"HM Xing","year":"2006","unstructured":"Xing, H.M., Chen, X., Chen, X.G.: A note on Roman domination in graphs. Discret. Math. 306(24), 3338\u20133340 (2006)","journal-title":"Discret. Math."},{"issue":"6","key":"1_CR51","doi-asserted-by":"publisher","first-page":"1528","DOI":"10.1016\/j.disc.2008.03.006","volume":"309","author":"F Xueliang","year":"2009","unstructured":"Xueliang, F., Yuansheng, Y., Baoqi, J.: Roman domination in regular graphs. Discret. Math. 309(6), 1528\u20131537 (2009)","journal-title":"Discret. Math."},{"key":"1_CR52","doi-asserted-by":"publisher","first-page":"262","DOI":"10.2298\/AADM130813017G","volume":"7","author":"IG Yero","year":"2013","unstructured":"Yero, I.G., Rodr\u00edguez-Vel\u00e1zquez, J.A.: Roman domination in Cartesian product graphs and strong product graphs. Appl. Anal. Discret. Math. 7, 262\u2013274 (2013)","journal-title":"Appl. Anal. Discret. Math."}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T17:04:59Z","timestamp":1664557499000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15914-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159138","9783031159145"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15914-5_1","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)"}}]}}