{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:37Z","timestamp":1759637617161,"version":"3.40.3"},"publisher-location":"Cham","reference-count":58,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319961507"},{"type":"electronic","value":"9783319961514"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-96151-4_25","type":"book-chapter","created":{"date-parts":[[2018,7,17]],"date-time":"2018-07-17T12:21:49Z","timestamp":1531830109000},"page":"290-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improved Algorithms for k-Domination and Total k-Domination in Proper Interval Graphs"],"prefix":"10.1007","author":[{"given":"Nina","family":"Chiarelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tatiana Romina","family":"Hartinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valeria Alejandra","family":"Leoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria In\u00e9s","family":"Lopez Pujato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Milani\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,18]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","unstructured":"Argiroffo, G., Leoni, V., Torres, P.: Complexity of $$k$$-tuple total and total $$\\{k\\}$$-dominations for some subclasses of bipartite graphs Inform. Process. Lett. (2017). https:\/\/doi.org\/10.1016\/j.ipl.2018.06.007","DOI":"10.1016\/j.ipl.2018.06.007"},{"key":"25_CR2","unstructured":"Bakhshesh, D., Farshi, M., Hasheminezhad, M.: Complexity results for $$k$$-domination and $$\\alpha $$-domination problems and their variants (2017). arXiv:1702.00533 [cs.CC]"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.tcs.2013.01.011","volume":"511","author":"R Belmonte","year":"2013","unstructured":"Belmonte, R., Vatshelle, M.: Graph classes with structured neighborhoods and algorithmic applications. Theoret. Comput. Sci. 511, 54\u201365 (2013)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"25_CR4","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(86)90112-2","volume":"23","author":"AA Bertossi","year":"1986","unstructured":"Bertossi, A.A.: Total domination in interval graphs. Inform. Process. Lett. 23(3), 131\u2013134 (1986)","journal-title":"Inform. Process. Lett."},{"issue":"6\u20138","key":"25_CR5","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.ipl.2015.02.004","volume":"115","author":"A Braga","year":"2015","unstructured":"Braga, A., de Souza, C.C., Lee, O.: The eternal dominating set problem for proper interval graphs. Inform. Process. Lett. 115(6\u20138), 582\u2013587 (2015)","journal-title":"Inform. Process. Lett."},{"issue":"1\u20133","key":"25_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0166-218X(97)00125-X","volume":"82","author":"A Brandst\u00e4dt","year":"1998","unstructured":"Brandst\u00e4dt, A., Chepoi, V.D., Dragan, F.F.: The algorithmic use of hypertree structure and maximum neighbourhood orderings. Discrete Appl. Math. 82(1\u20133), 43\u201377 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"25_CR7","doi-asserted-by":"publisher","first-page":"518","DOI":"10.2298\/AADM161005024B","volume":"10","author":"B Bre\u0161ar","year":"2016","unstructured":"Bre\u0161ar, B., Gologranc, T., Kos, T.: Dominating sequences under atomic changes with applications in sierpi\u0144ski and interval graphs. Appl. Anal. Discrete Math. 10(2), 518\u2013531 (2016)","journal-title":"Appl. Anal. Discrete Math."},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.tcs.2013.01.009","volume":"511","author":"B-M Bui-Xuan","year":"2013","unstructured":"Bui-Xuan, B.-M., Telle, J.A., Vatshelle, M.: Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. Theoret. Comput. Sci. 511, 66\u201376 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-319-06089-7_7","volume-title":"Theory and Applications of Models of Computation","author":"D Cattan\u00e9o","year":"2014","unstructured":"Cattan\u00e9o, D., Perdrix, S.: The parameterized\u00a0complexity of domination-type problems and application\u00a0to\u00a0linear\u00a0codes. In: Gopal, T.V., Agrawal, M., Li, A., Cooper, S.B. (eds.) TAMC 2014. LNCS, vol. 8402, pp. 86\u2013103. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06089-7_7"},{"issue":"1","key":"25_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(88)90120-5","volume":"22","author":"GJ Chang","year":"1989","unstructured":"Chang, G.J.: Labeling algorithms for domination problems in sun-free chordal graphs. Discrete Appl. Math. 22(1), 21\u201334 (1989)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"25_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0166-218X(94)00067-3","volume":"63","author":"GJ Chang","year":"1995","unstructured":"Chang, G.J., Pandu, C.P., Coorg, S.R.: Weighted independent perfect domination on cocomparability graphs. Discrete Appl. Math. 63(3), 215\u2013222 (1995)","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"25_CR12","doi-asserted-by":"publisher","first-page":"1671","DOI":"10.1137\/S0097539792238431","volume":"27","author":"M-S Chang","year":"1998","unstructured":"Chang, M.-S.: Efficient algorithms for the domination problems on interval and circular-arc graphs. SIAM J. Comput. 27(6), 1671\u20131694 (1998)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"25_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-011-1040-3","volume":"28","author":"M Chellali","year":"2012","unstructured":"Chellali, M., Favaron, O., Hansberg, A., Volkmann, L.: $$k$$-domination and $$k$$-independence in graphs: a survey. Graphs Combin. 28(1), 1\u201355 (2012)","journal-title":"Graphs Combin."},{"issue":"2","key":"25_CR14","doi-asserted-by":"publisher","first-page":"263","DOI":"10.7151\/dmgt.1603","volume":"32","author":"M Chellali","year":"2012","unstructured":"Chellali, M., Meddah, N.: Trees with equal 2-domination and 2-independence numbers. Discuss. Math. Graph Theory 32(2), 263\u2013270 (2012)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"16","key":"25_CR15","doi-asserted-by":"publisher","first-page":"2077","DOI":"10.1016\/j.dam.2007.05.011","volume":"155","author":"TCE Cheng","year":"2007","unstructured":"Cheng, T.C.E., Kang, L.Y., Ng, C.T.: Paired domination on interval and circular-arc graphs. Discrete Appl. Math. 155(16), 2077\u20132086 (2007)","journal-title":"Discrete Appl. Math."},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2014.02.027","volume":"535","author":"F Cicalese","year":"2014","unstructured":"Cicalese, F., Cordasco, G., Gargano, L., Milani\u010d, M., Vaccaro, U.: Latency-bounded target set selection in social networks. Theoret. Comput. Sci. 535, 1\u201315 (2014)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"25_CR17","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/j.dam.2012.10.007","volume":"161","author":"F Cicalese","year":"2013","unstructured":"Cicalese, F., Milani\u010d, M., Vaccaro, U.: On the approximability and exact algorithms for vector domination and related problems in graphs. Discrete Appl. Math. 161(6), 750\u2013767 (2013)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"25_CR18","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/j.dam.2003.07.001","volume":"138","author":"DG Corneil","year":"2004","unstructured":"Corneil, D.G.: A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs. Discrete Appl. Math. 138(3), 371\u2013379 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"25_CR19","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"issue":"6","key":"25_CR20","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1016\/j.aml.2011.01.013","volume":"24","author":"E DeLaVi\u00f1a","year":"2011","unstructured":"DeLaVi\u00f1a, E., Goddard, W., Henning, M.A., Pepper, R., Vaughan, E.R.: Bounds on the $$k$$-domination number of a graph. Appl. Math. Lett. 24(6), 996\u2013998 (2011)","journal-title":"Appl. Math. Lett."},{"issue":"4","key":"25_CR21","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/0167-6377(82)90015-3","volume":"1","author":"M Farber","year":"1982","unstructured":"Farber, M.: Independent domination in chordal graphs. Oper. Res. Lett. 1(4), 134\u2013138 (1982)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"25_CR22","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1002\/jgt.20279","volume":"57","author":"O Favaron","year":"2008","unstructured":"Favaron, O., Hansberg, A., Volkmann, L.: On $$k$$-domination and minimum degree in graphs. J. Graph Theory 57(1), 33\u201340 (2008)","journal-title":"J. Graph Theory"},{"key":"25_CR23","unstructured":"Fink, J.F., Jacobson, M.S.: $$n$$-domination in graphs. In: Graph Theory with Applications to Algorithms and Computer Science (Kalamazoo, Mich., 1984), pp. 283\u2013300. Wiley, New York (1985)"},{"issue":"22","key":"25_CR24","doi-asserted-by":"publisher","first-page":"2906","DOI":"10.1016\/j.disc.2006.04.043","volume":"307","author":"F Gardi","year":"2007","unstructured":"Gardi, F.: The roberts characterization of proper and unit interval graphs. Discrete Math. 307(22), 2906\u20132908 (2007)","journal-title":"Discrete Math."},{"issue":"2","key":"25_CR25","doi-asserted-by":"publisher","first-page":"229","DOI":"10.7151\/dmgt.1171","volume":"22","author":"T Gerlach","year":"2002","unstructured":"Gerlach, T., Harant, J.: A note on domination in bipartite graphs. Discuss. Math. Graph Theory 22(2), 229\u2013231 (2002)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"2","key":"25_CR26","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1002\/(SICI)1097-0118(199602)21:2<199::AID-JGT9>3.0.CO;2-M","volume":"21","author":"M Gutierrez","year":"1996","unstructured":"Gutierrez, M., Oubi\u00f1a, L.: Metric characterizations of proper interval graphs and tree-clique graphs. J. Graph Theory 21(2), 199\u2013205 (1996)","journal-title":"J. Graph Theory"},{"issue":"10\u201311","key":"25_CR27","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1016\/j.dam.2013.02.008","volume":"161","author":"A Hansberg","year":"2013","unstructured":"Hansberg, A., Pepper, R.: On $$k$$-domination and $$j$$-independence in graphs. Discrete Appl. Math. 161(10\u201311), 1472\u20131480 (2013)","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"25_CR28","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1017\/S0963548399004034","volume":"8","author":"J Harant","year":"1999","unstructured":"Harant, J., Pruchnewski, A., Voigt, M.: On dominating sets and independent sets of graphs. Combin. Probab. Comput. 8(6), 547\u2013553 (1999)","journal-title":"Combin. Probab. Comput."},{"key":"25_CR29","first-page":"201","volume":"55","author":"F Harary","year":"2000","unstructured":"Harary, F., Haynes, T.W.: Double domination in graphs. Ars Combin. 55, 201\u2013213 (2000)","journal-title":"Ars Combin."},{"key":"25_CR30","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J. (eds.): Domination in Graphs. Advanced Topics, volume 209 of Monographs and Textbooks in Pure and Applied Mathematics. Marcel Dekker Inc., New York (1998)"},{"key":"25_CR31","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of domination in graphs. In: Monographs and Textbooks in Pure and Applied Mathematics, vol. 208. Marcel Dekker Inc., New York (1998)"},{"issue":"9","key":"25_CR32","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1016\/j.dam.2010.01.009","volume":"158","author":"MA Henning","year":"2010","unstructured":"Henning, M.A., Kazemi, A.P.: $$k$$-tuple total domination in graphs. Discrete Appl. Math. 158(9), 1006\u20131011 (2010)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"25_CR33","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0020-0190(91)90165-E","volume":"40","author":"WL Hsu","year":"1991","unstructured":"Hsu, W.L., Tsai, K.-H.: Linear time algorithms on circular-arc graphs. Inform. Process. Lett. 40(3), 123\u2013129 (1991)","journal-title":"Inform. Process. Lett."},{"key":"25_CR34","doi-asserted-by":"crossref","unstructured":"Ishii, T., Ono, H., Uno, Y.: Subexponential fixed-parameter algorithms for partial vector domination. Discrete Optim. 22(part A), 111\u2013121 (2016)","DOI":"10.1016\/j.disopt.2016.01.003"},{"key":"25_CR35","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.dam.2016.03.002","volume":"207","author":"T Ishii","year":"2016","unstructured":"Ishii, T., Ono, H., Uno, Y.: (Total) vector domination for graphs with bounded branchwidth. Discrete Appl. Math. 207, 80\u201389 (2016)","journal-title":"Discrete Appl. Math."},{"issue":"1\u20133","key":"25_CR36","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0012-365X(92)90135-3","volume":"105","author":"Z Jackowski","year":"1992","unstructured":"Jackowski, Z.: A new characterization of proper interval graphs. Discrete Math. 105(1\u20133), 103\u2013109 (1992)","journal-title":"Discrete Math."},{"key":"25_CR37","unstructured":"Jacobson, M.S., Peters, K.: Complexity questions for $$n$$-domination and related parameters. Congr. Numer. 68, 7\u201322 (1989). Eighteenth Manitoba Conference on Numerical Mathematics and Computing (Winnipeg, MB, 1988)"},{"key":"25_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2017.09.006","volume":"704","author":"DY Kang","year":"2017","unstructured":"Kang, D.Y., Kwon, O.-J., Str\u00f8mme, T.J.F., Telle, J.A.: A width parameter useful for chordal and co-comparability graphs. Theoret. Comput. Sci. 704, 1\u201317 (2017)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"25_CR39","doi-asserted-by":"publisher","first-page":"419","DOI":"10.7151\/dmgt.1616","volume":"32","author":"AP Kazemi","year":"2012","unstructured":"Kazemi, A.P.: On the total $$k$$-domination number of graphs. Discuss. Math. Graph Theory 32(3), 419\u2013426 (2012)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"4","key":"25_CR40","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(86)90022-0","volume":"22","author":"JM Keil","year":"1986","unstructured":"Keil, J.M.: Total domination in interval graphs. Inform. Process. Lett. 22(4), 171\u2013174 (1986)","journal-title":"Inform. Process. Lett."},{"key":"25_CR41","series-title":"Combinatorics, Algorithms, and Applications (San Francisco, CA, 1989)","first-page":"319","volume-title":"Graph Theory","author":"VR Kulli","year":"1991","unstructured":"Kulli, V.R.: On $$n$$-total domination number in graphs. Graph Theory. Combinatorics, Algorithms, and Applications (San Francisco, CA, 1989), pp. 319\u2013324. SIAM, Philadelphia (1991)"},{"issue":"10\u201311","key":"25_CR42","doi-asserted-by":"publisher","first-page":"1513","DOI":"10.1016\/j.dam.2013.01.015","volume":"161","author":"JK Lan","year":"2013","unstructured":"Lan, J.K., Chang, G.J.: Algorithmic aspects of the $$k$$-domination problem in graphs. Discrete Appl. Math. 161(10\u201311), 1513\u20131520 (2013)","journal-title":"Discrete Appl. Math."},{"key":"25_CR43","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.dam.2014.04.007","volume":"174","author":"JK Lan","year":"2014","unstructured":"Lan, J.K., Chang, G.J.: On the algorithmic complexity of $$k$$-tuple total domination. Discrete Appl. Math. 174, 81\u201391 (2014)","journal-title":"Discrete Appl. Math."},{"issue":"18","key":"25_CR44","doi-asserted-by":"publisher","first-page":"4185","DOI":"10.1016\/j.disc.2007.08.080","volume":"308","author":"C-M Lee","year":"2008","unstructured":"Lee, C.-M., Chang, M.-S.: Variations of $$Y$$-dominating functions on graphs. Discrete Math. 308(18), 4185\u20134204 (2008)","journal-title":"Discrete Math."},{"issue":"1","key":"25_CR45","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0020-0190(03)00233-3","volume":"87","author":"C-S Liao","year":"2003","unstructured":"Liao, C.-S., Chang, G.J.: $$k$$-tuple domination in graphs. Inform. Process. Lett. 87(1), 45\u201350 (2003)","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"25_CR46","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s00453-011-9599-x","volume":"65","author":"C-S Liao","year":"2013","unstructured":"Liao, C.-S., Lee, D.T.: Power domination in circular-arc graphs. Algorithmica 65(2), 443\u2013466 (2013)","journal-title":"Algorithmica"},{"issue":"18","key":"25_CR47","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. Discrete Appl. Math. 156(18), 3400\u20133415 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"12","key":"25_CR48","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1016\/j.ipl.2015.07.008","volume":"115","author":"C-J Lin","year":"2015","unstructured":"Lin, C.-J., Liu, J.-J., Wang, Y.-L.: Finding outer-connected dominating sets in interval graphs. Inform. Process. Lett. 115(12), 917\u2013922 (2015)","journal-title":"Inform. Process. Lett."},{"issue":"7","key":"25_CR49","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0898-1221(93)90308-I","volume":"25","author":"PJ Looges","year":"1993","unstructured":"Looges, P.J., Olariu, S.: Optimal greedy algorithms for indifference graphs. Comput. Math. Appl. 25(7), 15\u201325 (1993)","journal-title":"Comput. Math. Appl."},{"issue":"4","key":"25_CR50","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S-I Oum","year":"2006","unstructured":"Oum, S.-I., Seymour, P.: Approximating clique-width and branch-width. J. Combin. Theory Ser. B 96(4), 514\u2013528 (2006)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"19\u201321","key":"25_CR51","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1016\/j.ipl.2013.07.012","volume":"113","author":"BS Panda","year":"2013","unstructured":"Panda, B.S., Paul, S.: A linear time algorithm for liar\u2019s domination problem in proper interval graphs. Inform. Process. Lett. 113(19\u201321), 815\u2013822 (2013)","journal-title":"Inform. Process. Lett."},{"key":"25_CR52","doi-asserted-by":"crossref","unstructured":"Panda, B.S., Pradhan, D.: A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs. Discrete Math. Algorithms Appl. 7(2), 1550020 (2015). 21","DOI":"10.1142\/S1793830915500202"},{"issue":"21","key":"25_CR53","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1016\/j.ipl.2012.07.010","volume":"112","author":"D Pradhan","year":"2012","unstructured":"Pradhan, D.: Algorithmic aspects of $$k$$-tuple total domination in graphs. Inform. Process. Lett. 112(21), 816\u2013822 (2012)","journal-title":"Inform. Process. Lett."},{"key":"25_CR54","doi-asserted-by":"crossref","unstructured":"Pramanik, T., Mondal, S., Pal, M.: Minimum $$2$$-tuple dominating set of an interval graph. Int. J. Comb. 14 (2011). Article ID 389369","DOI":"10.1155\/2011\/389369"},{"issue":"1","key":"25_CR55","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0020-0190(88)90076-2","volume":"27","author":"G Ramalingam","year":"1988","unstructured":"Ramalingam, G., Pandu, C.: Total domination in interval graphs revisited. Inform. Process. Lett. 27(1), 17\u201321 (1988)","journal-title":"Inform. Process. Lett."},{"issue":"5","key":"25_CR56","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0020-0190(88)90091-9","volume":"27","author":"G Ramalingam","year":"1988","unstructured":"Ramalingam, G., Rangan, C.P.: A unified approach to domination problems on interval graphs. Inform. Process. Lett. 27(5), 271\u2013274 (1988)","journal-title":"Inform. Process. Lett."},{"key":"25_CR57","unstructured":"Roberts, F.S.: Indifference graphs. In: Proof Techniques in Graph Theory (Proceedings of Second Ann Arbor Graph Theory Conference, Ann Arbor, Michigan, 1968), pp. 139\u2013146. Academic Press, New York (1969)"},{"key":"25_CR58","doi-asserted-by":"crossref","unstructured":"Chiarelli, N., Hartinger, T.R., Leoni, V.A., Lopez Pujato, M.I., Milani\u010d, M.: New algorithms for weighted $$k$$-domination and total $$k$$-domination problems in proper interval graphs. arXiv:1803.04327 [cs.DS] (2018)","DOI":"10.1007\/978-3-319-96151-4_25"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96151-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T19:05:34Z","timestamp":1571598334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96151-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319961507","9783319961514"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96151-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ISCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakesh","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isco2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/isco2018.lip6.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}