{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:49:02Z","timestamp":1750308542094,"version":"3.41.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319596044"},{"type":"electronic","value":"9783319596051"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-59605-1_3","type":"book-chapter","created":{"date-parts":[[2017,5,22]],"date-time":"2017-05-22T15:06:26Z","timestamp":1495465586000},"page":"22-33","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments"],"prefix":"10.1007","author":[{"given":"Arindam","family":"Biswas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Varunkumar","family":"Jayapaul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivasa Rao","family":"Satti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,23]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Abboud, A., Williams, V.V., Wang, J.R.: Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, 10\u201312 January 2016, pp. 377\u2013391 (2016)","DOI":"10.1137\/1.9781611974331.ch28"},{"key":"3_CR2","unstructured":"Acharya, J., Falahatgar, M., Jafarpour, A., Orlitksy, A., Suresh, A.T.: Maximum selection and sorting with adversarial comparators and an application to density estimation. Comput. Res. Repos. abs\/1606.02786, 1\u201324 (2016)"},{"issue":"2","key":"3_CR3","doi-asserted-by":"crossref","first-page":"19:1","DOI":"10.1145\/2701427","volume":"12","author":"M Ajtai","year":"2016","unstructured":"Ajtai, M., Feldman, V., Hassidim, A., Nelson, J.: Sorting and selection with imprecise comparisons. ACM Trans. Algorithms 12(2), 19:1\u201319:19 (2016)","journal-title":"ACM Trans. Algorithms"},{"key":"3_CR4","volume-title":"The Probabilistic Method","author":"N Alon","year":"1992","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method. Wiley, Hoboken (1992)"},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1006\/jagm.1997.0865","volume":"24","author":"R Balasubramanian","year":"1997","unstructured":"Balasubramanian, R., Raman, V., Srinivasaragavan, G.: Finding scores in tournaments. J. Algorithms 24(2), 380\u2013394 (1997)","journal-title":"J. Algorithms"},{"key":"3_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Garg, S., Philip, G.: Raising the bar for vertex cover: fixed-parameter tractability above a higher guarantee. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, 10\u201312 January 2016, pp. 1152\u20131166 (2016)","DOI":"10.1137\/1.9781611974331.ch80"},{"key":"3_CR8","unstructured":"Giannopoulou, A.C., Mertzios, G.B., Niedermeier, R.: Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs. In: Husfeldt, T., Kanj, I. (eds.) 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), Leibniz International Proceedings in Informatics (LIPIcs), vol. 43, pp. 102\u2013113. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2015)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.4153\/CMB-1971-007-1","volume":"14","author":"RL Graham","year":"1971","unstructured":"Graham, R.L., Spencer, J.H.: A constructive solution to a tournament problem. Canad. Math. Bull. 14, 45\u201348 (1971)","journal-title":"Canad. Math. Bull."},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-30891-8_14","volume-title":"The Multivariate Algorithmic Revolution and Beyond","author":"G Gutin","year":"2012","unstructured":"Gutin, G., Yeo, A.: Constraint satisfaction problems parameterized above or below tight bounds: a survey. In: Bodlaender, H.L., Downey, R., Fomin, F.V., Marx, D. (eds.) The Multivariate Algorithmic Revolution and Beyond. LNCS, vol. 7370, pp. 257\u2013286. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-30891-8_14"},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"15:1","DOI":"10.1145\/2566616","volume":"11","author":"D Lokshtanov","year":"2014","unstructured":"Lokshtanov, D., Narayanaswamy, N.S., Raman, V., Ramanujan, M.S., Saurabh, S.: Faster parameterized algorithms using linear programming. ACM Trans. Algorithms 11(2), 15:1\u201315:31 (2014)","journal-title":"ACM Trans. Algorithms"},{"issue":"1\u20133","key":"3_CR12","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0012-365X(00)00029-7","volume":"220","author":"X Lu","year":"2000","unstructured":"Lu, X., Wang, D., Wong, C.K.: On the bounded domination number of tournaments. Discret. Math. 220(1\u20133), 257\u2013261 (2000)","journal-title":"Discret. Math."},{"issue":"2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1006\/jagm.1998.0996","volume":"31","author":"M Mahajan","year":"1999","unstructured":"Mahajan, M., Raman, V.: Parameterizing above guaranteed values: MaxSat and MaxCut. J. Algorithms 31(2), 335\u2013354 (1999)","journal-title":"J. Algorithms"},{"issue":"2","key":"3_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.jcss.2008.08.004","volume":"75","author":"M Mahajan","year":"2009","unstructured":"Mahajan, M., Raman, V., Sikdar, S.: Parameterizing above or below guaranteed values. J. Comput. Syst. Sci. 75(2), 137\u2013153 (2009)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"3_CR15","doi-asserted-by":"publisher","first-page":"67","DOI":"10.2307\/2689952","volume":"53","author":"SB Maurer","year":"1980","unstructured":"Maurer, S.B.: The king chicken theorems. Math. Mag. 53(2), 67\u201380 (1980)","journal-title":"Math. Mag."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0304-3975(88)90131-4","volume":"61","author":"N Megiddo","year":"1988","unstructured":"Megiddo, N., Vishkin, U.: On finding a minimum dominating set in a tournament. Theor. Comput. Sci. 61, 307\u2013316 (1988)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR17","unstructured":"Moon, J.: Topics on tournaments. In: Selected Topics in Mathematics. Athena series. Holt, Rinehart and Winston (1968)"},{"issue":"2","key":"3_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1006\/jcss.1996.0058","volume":"53","author":"CH Papadimitriou","year":"1996","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On limited nondeterminism and the complexity of the V-C dimension. J. Comput. Syst. Sci. 53(2), 161\u2013170 (1996). http:\/\/dx.doi.org\/10.1006\/jcss.1996.0058","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"3_CR19","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1137\/S0097539702410053","volume":"32","author":"J Shen","year":"2003","unstructured":"Shen, J., Sheng, L., Wu, J.: Searching for sorted sequences of kings in tournaments. SIAM J. Comput. 32(5), 1201\u20131209 (2003)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59605-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T18:56:19Z","timestamp":1750272979000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-59605-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319596044","9783319596051"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59605-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"23 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2017","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":"faw2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/faw2017.uestc.edu.cn","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}