{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:07:52Z","timestamp":1743095272374,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319411675"},{"type":"electronic","value":"9783319411682"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-41168-2_10","type":"book-chapter","created":{"date-parts":[[2016,7,3]],"date-time":"2016-07-03T21:26:28Z","timestamp":1467581188000},"page":"113-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Algorithmic Aspects of Upper Domination: A Parameterised Perspective"],"prefix":"10.1007","author":[{"given":"Cristina","family":"Bazgan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ljiljana","family":"Brankovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katrin","family":"Casel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henning","family":"Fernau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Jansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim-Manuel","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Lampis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathieu","family":"Liedloff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"issue":"3","key":"10_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."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.jda.2011.03.002","volume":"9","author":"D Binkele-Raible","year":"2011","unstructured":"Binkele-Raible, D., Brankovic, L., Cygan, M., Fernau, H., Kneis, J., Kratsch, D., Langer, A., Liedloff, M., Pilipczuk, M., Rossmanith, P., Wojtaszczyk, J.O.: Breaking the \n                    \n                      \n                    \n                    $$2^n$$\n                    \n                      \n                        \n                          2\n                          n\n                        \n                      \n                    \n                  -barrier for irredundance: two lines of attack. J. Discrete Algorithms 9, 214\u2013230 (2011)","journal-title":"J. Discrete Algorithms"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2012.12.003","volume":"511","author":"L Brankovic","year":"2013","unstructured":"Brankovic, L., Fernau, H.: A novel parameterised approximation algorithm for minimum vertex cover. Theor. Comput. Sci. 511, 85\u2013108 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/S0022-0000(03)00073-4","volume":"67","author":"M Cesati","year":"2003","unstructured":"Cesati, M.: The turing way to parameterized complexity. J. Comput. Syst. Sci. 67, 654\u2013685 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1137\/050646354","volume":"37","author":"J Chen","year":"2007","unstructured":"Chen, J., Fernau, H., Kanj, I.A., Xia, G.: Parametric duality and kernelization: lower bounds and upper bounds on kernel size. SIAM J. Comput. 37, 1077\u20131108 (2007)","journal-title":"SIAM J. Comput."},{"issue":"40\u201342","key":"10_CR6","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1016\/j.tcs.2010.06.026","volume":"411","author":"J Chen","year":"2010","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40\u201342), 3736\u20133756 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0166-218X(90)90065-K","volume":"27","author":"GA Cheston","year":"1990","unstructured":"Cheston, G.A., Fricke, G., Hedetniemi, S.T., Jacobs, D.P.: On the computational complexity of upper fractional domination. Discrete Appl. Math. 27(3), 195\u2013207 (1990)","journal-title":"Discrete Appl. Math."},{"key":"10_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F., Kowalik, \u0141., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Switzerland (2015)"},{"key":"10_CR9","first-page":"161","volume":"87","author":"RG Downey","year":"1992","unstructured":"Downey, R.G., Fellows, M.R.: Fixed parameter tractability and completeness. Congressus Numerantium 87, 161\u2013187 (1992)","journal-title":"Congressus Numerantium"},{"key":"10_CR10","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, London (2013)"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(99)00185-7","volume":"100","author":"RG Downey","year":"2000","unstructured":"Downey, R.G., Fellows, M.R., Raman, V.: The complexity of irredundant set parameterized by size. Discrete Appl. Math. 100, 155\u2013167 (2000)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0166-218X(03)00195-1","volume":"136","author":"Q Fang","year":"2004","unstructured":"Fang, Q.: On the computational complexity of upper total domination. Discrete Appl. Math. 136(1), 13\u201322 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"MR Fellows","year":"2009","unstructured":"Fellows, M.R., Hermelin, D., Rosamond, F., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410(1), 53\u201361 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1435375.1435384","volume":"5","author":"FV Fomin","year":"2008","unstructured":"Fomin, F.V., Grandoni, F., Pyatkin, A.V., Stepanov, A.A.: Combinatorial bounds via measure and conquer: bounding minimal dominating sets and applications. ACM Trans. Algorithms 5(1), 1\u201317 (2008)","journal-title":"ACM Trans. Algorithms"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.ipl.2005.10.012","volume":"97","author":"FV Fomin","year":"2006","unstructured":"Fomin, F.V., H\u00f8ie, K.: Pathwidth of cubic graphs and exact algorithms. Inf. Process. Lett. 97, 191\u2013196 (2006)","journal-title":"Inf. Process. Lett."},{"key":"10_CR16","series-title":"Monographs and Textbooks in Pure and Applied Mathematics","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","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, New York (1998)"},{"key":"10_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6525-6","volume-title":"Total Domination in Graphs","author":"M Hennings","year":"2013","unstructured":"Hennings, M., Yeo, A.: Total Domination in Graphs. Springer, New York (2013)"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-28050-4_4","volume-title":"Parameterized and Exact Computation","author":"Y Iwata","year":"2012","unstructured":"Iwata, Y.: A faster algorithm for dominating set analyzed by the potential method. In: Marx, D., Rossmanith, P. (eds.) IPEC 2011. LNCS, vol. 7112, pp. 41\u201354. Springer, Heidelberg (2012)"},{"key":"10_CR19","unstructured":"Kneis, J., Langer, A., Rossmanith, P.: A fine-grained analysis of a simple independent set algorithm. In: Kannan, R., Narayan Kumar, K. (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. LIPIcs, FSTTCS 2009, vol. 4, pp. 287\u2013298. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2009)"},{"issue":"4","key":"10_CR20","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/S0022-0000(03)00078-3","volume":"67","author":"K Pietrzak","year":"2003","unstructured":"Pietrzak, K.: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. J. Comput. Syst. Sci. 67(4), 757\u2013771 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"17","key":"10_CR21","doi-asserted-by":"publisher","first-page":"2147","DOI":"10.1016\/j.dam.2011.07.001","volume":"159","author":"JMM Rooij van","year":"2011","unstructured":"van Rooij, J.M.M., Bodlaender, H.L.: Exact algorithms for dominating set. Discrete Appl. Math. 159(17), 2147\u20132164 (2011)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41168-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:49:39Z","timestamp":1558313379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41168-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319411675","9783319411682"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41168-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"5 July 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bergamo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 July 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}