{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T17:56:46Z","timestamp":1765994206778},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319066851"},{"type":"electronic","value":"9783319066868"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06686-8_12","type":"book-chapter","created":{"date-parts":[[2014,6,2]],"date-time":"2014-06-02T05:30:40Z","timestamp":1401687040000},"page":"153-166","source":"Crossref","is-referenced-by-count":11,"title":["Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results"],"prefix":"10.1007","author":[{"given":"Henning","family":"Fernau","sequence":"first","affiliation":[]},{"given":"Juan Alberto","family":"Rodr\u00edguez-Vel\u00e1zquez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","first-page":"97","volume":"13","author":"R.F. Bailey","year":"2011","unstructured":"Bailey, R.F., Meagher, K.: On the metric dimension of Grassmann graphs. Discrete Mathematics & Theoretical Computer Science\u00a013, 97\u2013104 (2011)","journal-title":"Discrete Mathematics & Theoretical Computer Science"},{"issue":"1","key":"12_CR2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.21136\/MB.2003.133935","volume":"128","author":"R.C. Brigham","year":"2003","unstructured":"Brigham, R.C., Chartrand, G., Dutton, R.D., Zhang, P.: Resolving domination in graphs. Mathematica Bohemica\u00a0128(1), 25\u201336 (2003)","journal-title":"Mathematica Bohemica"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/A:1025745406160","volume":"46","author":"P.S. Buczkowski","year":"2003","unstructured":"Buczkowski, P.S., Chartrand, G., Poisson, C., Zhang, P.: On k-dimensional graphs and their bases. Periodica Mathematica Hungarica\u00a046(1), 9\u201315 (2003)","journal-title":"Periodica Mathematica Hungarica"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-11269-0_6","volume-title":"Parameterized and Exact Computation","author":"C. Calabro","year":"2009","unstructured":"Calabro, C., Impagliazzo, R., Paturi, R.: The complexity of satisfiability of small depth circuits. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol.\u00a05917, pp. 75\u201385. Springer, Heidelberg (2009)"},{"issue":"3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1016\/S0304-3975(02)00536-4","volume":"290","author":"I. Charon","year":"2003","unstructured":"Charon, I., Hudry, O., Lobstein, A.: Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. Theoretical Computer Science\u00a0290(3), 2109\u20132120 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"12_CR6","doi-asserted-by":"crossref","first-page":"379","DOI":"10.21136\/MB.2003.134003","volume":"128","author":"G. Chartrand","year":"2003","unstructured":"Chartrand, G., Saenpholphat, V., Zhang, P.: The independent resolving number of a graph. Mathematica Bohemica\u00a0128(4), 379\u2013393 (2003)","journal-title":"Mathematica Bohemica"},{"key":"12_CR7","first-page":"135","volume":"56","author":"C.J. Colbourn","year":"1987","unstructured":"Colbourn, C.J., Slater, P.J., Stewart, L.K.: Locating dominating sets in series parallel networks. Congressus Numerantium\u00a056, 135\u2013162 (1987)","journal-title":"Congressus Numerantium"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-642-32589-2_27","volume-title":"Mathematical Foundations of Computer Science 2012","author":"R. Crowston","year":"2012","unstructured":"Crowston, R., Gutin, G., Jones, M., Saurabh, S., Yeo, A.: Parameterized study of the test cover problem. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol.\u00a07464, pp. 283\u2013295. Springer, Heidelberg (2012)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-33090-2_37","volume-title":"Algorithms \u2013 ESA 2012","author":"J. D\u00edaz","year":"2012","unstructured":"D\u00edaz, J., Pottonen, O., Serna, M.J., van Leeuwen, E.J.: On the complexity of metric dimension. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol.\u00a07501, pp. 419\u2013430. Springer, Heidelberg (2012)"},{"issue":"6","key":"12_CR10","doi-asserted-by":"publisher","first-page":"1266","DOI":"10.1016\/j.disc.2011.11.020","volume":"312","author":"M. Feng","year":"2012","unstructured":"Feng, M., Wang, K.: On the metric dimension of bilinear forms graphs. Discrete Mathematics\u00a0312(6), 1266\u20131268 (2012)","journal-title":"Discrete Mathematics"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/BF01844162","volume":"4","author":"R. Frucht","year":"1970","unstructured":"Frucht, R., Harary, F.: On the corona of two graphs. Aequationes Mathematicae\u00a04, 322\u2013325 (1970)","journal-title":"Aequationes Mathematicae"},{"key":"12_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Guo, J., Wang, K., Li, F.: Metric dimension of some distance-regular graphs. Journal of Combinatorial Optimization, 1\u20138 (2012)","DOI":"10.1007\/s10878-012-9459-x"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Gutin, G., Muciaccia, G., Yeo, A.: (non-)existence of polynomial kernels for the test cover problem. Information Processing Letters\u00a0113(4), 123\u2013126 (2013)","DOI":"10.1016\/j.ipl.2012.12.008"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Hammack, R., Imrich, W., Klav\u017ear, S.: Handbook of product graphs. Discrete Mathematics and its Applications, 2nd edn. CRC Press (2011)","DOI":"10.1201\/b10959"},{"key":"12_CR16","first-page":"191","volume":"2","author":"F. Harary","year":"1976","unstructured":"Harary, F., Melter, R.A.: On the metric dimension of a graph. Ars Combinatoria\u00a02, 191\u2013195 (1976)","journal-title":"Ars Combinatoria"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Hartung, S., Nichterlein, A.: On the parameterized and approximation hardness of metric dimension. In: Proceedings of the 28th IEEE Conference on Computational Complexity (CCC 2013), pp. 266\u2013276. IEEE (2013)","DOI":"10.1109\/CCC.2013.36"},{"issue":"8","key":"12_CR18","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1016\/j.dam.2006.01.002","volume":"154","author":"T.W. Haynes","year":"2006","unstructured":"Haynes, T.W., Henning, M.A., Howard, J.: Locating and total dominating sets in trees. Discrete Applied Mathematics\u00a0154(8), 1293\u20131300 (2006)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"12_CR19","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? Journal of Computer and System Sciences\u00a063(4), 512\u2013530 (2001)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"12_CR20","first-page":"155","volume":"52","author":"H. Iswadi","year":"2011","unstructured":"Iswadi, H., Baskoro, E.T., Simanjuntak, R.: On the metric dimension of corona product of graphs. Far East Journal of Mathematical Sciences\u00a052(2), 155\u2013170 (2011)","journal-title":"Far East Journal of Mathematical Sciences"},{"issue":"22","key":"12_CR21","doi-asserted-by":"publisher","first-page":"3349","DOI":"10.1016\/j.disc.2012.07.025","volume":"312","author":"M. Jannesari","year":"2012","unstructured":"Jannesari, M., Omoomi, B.: The metric dimension of the lexicographic product of graphs. Discrete Mathematics\u00a0312(22), 3349\u20133356 (2012)","journal-title":"Discrete Mathematics"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Johnson, M.: Structure-activity maps for visualizing the graph variables arising in drug design. Journal of Biopharmaceutical Statistics\u00a03(2), 203\u2013236 (1993), pMID: 8220404","DOI":"10.1080\/10543409308835060"},{"key":"12_CR23","first-page":"153","volume-title":"Advances in Molecular Similarity","author":"M.A. Johnson","year":"1998","unstructured":"Johnson, M.A.: Browsable structure-activity datasets. In: Carb\u00f3-Dorca, R., Mezey, P. (eds.) Advances in Molecular Similarity, pp. 153\u2013170. JAI Press Inc., Stamford (1998)"},{"issue":"2","key":"12_CR24","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.661507","volume":"44","author":"M.G. Karpovsky","year":"1998","unstructured":"Karpovsky, M.G., Chakrabarty, K., Levitin, L.B.: On a new class of codes for identifying vertices in graphs. IEEE Transactions on Information Theory\u00a044(2), 599\u2013611 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"key":"12_CR25","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0166-218X(95)00106-2","volume":"70","author":"S. Khuller","year":"1996","unstructured":"Khuller, S., Raghavachari, B., Rosenfeld, A.: Landmarks in graphs. Discrete Applied Mathematics\u00a070, 217\u2013229 (1996)","journal-title":"Discrete Applied Mathematics"},{"issue":"9","key":"12_CR26","doi-asserted-by":"publisher","first-page":"3929","DOI":"10.1109\/TIT.2008.928263","volume":"54","author":"M. Laifenfeld","year":"2008","unstructured":"Laifenfeld, M., Trachtenberg, A.: Identifying codes and covering problems. IEEE Transactions on Information Theory\u00a054(9), 3929\u20133950 (2008)","journal-title":"IEEE Transactions on Information Theory"},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM Journal on Computing\u00a011, 329\u2013343 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR28","first-page":"41","volume":"105","author":"D. Lokshtanov","year":"2011","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Lower bounds based on the Exponential Time Hypothesis. EATCS Bulletin\u00a0105, 41\u201372 (2011)","journal-title":"EATCS Bulletin"},{"issue":"3","key":"12_CR29","doi-asserted-by":"crossref","first-page":"239","DOI":"10.21136\/MB.2010.140702","volume":"135","author":"F. Okamoto","year":"2010","unstructured":"Okamoto, F., Phinezy, B., Zhang, P.: The local metric dimension of a graph. Mathematica Bohemica\u00a0135(3), 239\u2013255 (2010)","journal-title":"Mathematica Bohemica"},{"key":"12_CR30","unstructured":"Rodr\u00edguez-Vel\u00e1zquez, J.A., Fernau, H.: On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results. Tech. Rep. arXiv:1309.2275 [math.CO], ArXiv.org, Cornell University (2013)"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez-Vel\u00e1zquez, J.A., Barrag\u00e1n-Ram\u00edrez, G.A., G\u00f3mez, C.G.: On the local metric dimension of corona product graph (2013) (submitted)","DOI":"10.1016\/j.endm.2014.08.005"},{"issue":"9","key":"12_CR32","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1016\/j.disc.2013.01.021","volume":"313","author":"S. Saputro","year":"2013","unstructured":"Saputro, S., Simanjuntak, R., Uttunggadewa, S., Assiyatun, H., Baskoro, E., Salman, A., Ba\u010da, M.: The metric dimension of the lexicographic product of graphs. Discrete Mathematics\u00a0313(9), 1045\u20131051 (2013)","journal-title":"Discrete Mathematics"},{"key":"12_CR33","first-page":"549","volume":"14","author":"P.J. Slater","year":"1975","unstructured":"Slater, P.J.: Leaves of trees. Congressus Numerantium\u00a014, 549\u2013559 (1975)","journal-title":"Congressus Numerantium"},{"issue":"1","key":"12_CR34","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.ipl.2007.02.001","volume":"103","author":"J. Suomela","year":"2007","unstructured":"Suomela, J.: Approximability of identifying codes and locating-dominating codes. Information Processing Letters\u00a0103(1), 28\u201333 (2007)","journal-title":"Information Processing Letters"},{"issue":"9","key":"12_CR35","doi-asserted-by":"publisher","first-page":"2793","DOI":"10.1016\/j.camwa.2011.03.046","volume":"61","author":"I.G. Yero","year":"2011","unstructured":"Yero, I.G., Kuziak, D., Rodr\u00edquez-Vel\u00e1zquez, J.A.: On the metric dimension of corona product graphs. Computers & Mathematics with Applications\u00a061(9), 2793\u20132798 (2011)","journal-title":"Computers & Mathematics with Applications"}],"container-title":["Lecture Notes in Computer Science","Computer Science - Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06686-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T11:48:47Z","timestamp":1597924127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06686-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319066851","9783319066868"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06686-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}