{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T13:10:02Z","timestamp":1748783402193,"version":"3.41.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319301389"},{"type":"electronic","value":"9783319301396"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-30139-6_2","type":"book-chapter","created":{"date-parts":[[2016,2,19]],"date-time":"2016-02-19T13:35:02Z","timestamp":1455888902000},"page":"17-27","source":"Crossref","is-referenced-by-count":3,"title":["Tropical Dominating Sets in Vertex-Coloured Graphs"],"prefix":"10.1007","author":[{"given":"Jean-Alexandre","family":"Angl\u00e8s d\u2019Auriac","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csilia","family":"Bujt\u00e1s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hakim","family":"El Maftouhi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis","family":"Manoussakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leandro","family":"Montero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Narayanan","family":"Narayanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Rosaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan","family":"Thapper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"P17","DOI":"10.37236\/504","volume":"18","author":"S Akbari","year":"2011","unstructured":"Akbari, S., Liaghat, V., Nikzad, A.: Colorful paths in vertex-colorings of graphs. Electron. J. Comb. 18, P17 (2011)","journal-title":"Electron. J. Comb."},{"issue":"1\u20132","key":"2_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theor. Comput. Sci. 237(1\u20132), 123\u2013134 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation","author":"G Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V.: Complexity and Approximation. Springer, Heidelberg (1999)"},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B Baker","year":"1994","unstructured":"Baker, B.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153\u2013180 (1994)","journal-title":"J. ACM"},{"issue":"1\u20133","key":"2_CR5","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0012-365X(90)90355-L","volume":"86","author":"RC Brigham","year":"1990","unstructured":"Brigham, R.C., Dutton, R.D.: Factor domination in graphs. Discrete Math. 86(1\u20133), 127\u2013136 (1990)","journal-title":"Discrete Math."},{"issue":"6","key":"2_CR6","doi-asserted-by":"publisher","first-page":"1399","DOI":"10.1007\/s00373-013-1353-5","volume":"30","author":"Y Caro","year":"2014","unstructured":"Caro, Y., Henning, M.A.: Simultaneous domination in graphs. Graphs Combin. 30(6), 1399\u20131416 (2014)","journal-title":"Graphs Combin."},{"issue":"11","key":"2_CR7","doi-asserted-by":"publisher","first-page":"1264","DOI":"10.1016\/j.ic.2008.07.003","volume":"206","author":"M Chleb\u00edk","year":"2008","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Approximation hardness of dominating set problems in bounded degree graphs. Inf. Comput. 206(11), 1264\u20131275 (2008)","journal-title":"Inf. Comput."},{"doi-asserted-by":"crossref","unstructured":"Crescenzi, P.: A short guide to approximation preserving reductions. In: Proceedings of the IEEE Conference on Computational Complexity, pp. 262\u2013273 (1997)","key":"2_CR8","DOI":"10.1109\/CCC.1997.612321"},{"doi-asserted-by":"crossref","unstructured":"Dinur, I., Steurer, D.: Analytical approach to parallel repetition. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC 2014), pp. 624\u2013633 (2014)","key":"2_CR9","DOI":"10.1145\/2591796.2591884"},{"doi-asserted-by":"crossref","unstructured":"Duh, R., F\u00fcrer, M.: Approximation of k-set cover by semi-local optimization. In: Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC 1997), pp. 256\u2013264 (1997)","key":"2_CR10","DOI":"10.1145\/258533.258599"},{"issue":"4","key":"2_CR11","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1016\/j.jcss.2010.07.003","volume":"77","author":"M Fellows","year":"2011","unstructured":"Fellows, M., Fertin, G., Hermelin, D., Vialette, S.: Upper and lower bounds for finding connected motifs in vertex-colored graphs. J. Comput. Syst. Sci. 77(4), 799\u2013811 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"key":"2_CR13","volume-title":"Fundamentals of Domination in Graphs","author":"T Haynes","year":"1998","unstructured":"Haynes, T., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)"},{"unstructured":"Kann, V.: On the Approximability of NP-complete Optimization Problems. Ph.D. thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm (1992)","key":"2_CR14"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/PL00007256","volume":"17","author":"A Li","year":"2001","unstructured":"Li, A.: A generalization of the gallai-roy theorem. Graphs Comb. 17, 681\u2013685 (2001)","journal-title":"Graphs Comb."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s00373-007-0694-3","volume":"23","author":"C Lin","year":"2007","unstructured":"Lin, C.: Simple proofs of results on paths representing all colors in proper vertex-colorings. Graphs Comb. 23, 201\u2013203 (2007)","journal-title":"Graphs Comb."},{"issue":"5","key":"2_CR17","first-page":"377","volume":"23","author":"E Sampathkumar","year":"1989","unstructured":"Sampathkumar, E.: The global domination number of a graph. J. Math. Phys. Sci. 23(5), 377\u2013385 (1989)","journal-title":"J. Math. Phys. Sci."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30139-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T12:47:13Z","timestamp":1748782033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30139-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319301389","9783319301396"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30139-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}