{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:01Z","timestamp":1759639081788},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319539249"},{"type":"electronic","value":"9783319539256"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53925-6_26","type":"book-chapter","created":{"date-parts":[[2017,2,20]],"date-time":"2017-02-20T01:12:36Z","timestamp":1487553156000},"page":"335-346","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest"],"prefix":"10.1007","author":[{"given":"Yang","family":"Jiao","sequence":"first","affiliation":[]},{"given":"R.","family":"Ravi","sequence":"additional","affiliation":[]},{"given":"Wolfgang","family":"Gatterbauer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,21]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/978-1-4613-8369-7_2","volume-title":"Graph Theory and Sparse Matrix Computation","author":"A Agrawal","year":"1993","unstructured":"Agrawal, A., Klein, P., Ravi, R.: Cutting down on fill using nested dissection: provably good elimination orderings. In: George, A., Gilbert, J.R., Liu, J.W.H. (eds.) Graph Theory and Sparse Matrix Computation, pp. 31\u201355. Springer, Heidelberg (1993)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, R., Borgs, C., Chayes, J., Feige, U., Flaxman, A., Kalai, A., Mirrokni, V., Tennenholtz, M.: Trust-based recommendation systems: an axiomatic approach. In: WWW, pp. 199\u2013208. ACM (2008)","DOI":"10.1145\/1367497.1367525"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Aydin, B., Yilmaz, Y., Li, Y., Li, Q., Gao, J., Demirbas, M.: Crowdsourcing for multiple-choice question answering. In: IAAI, pp. 2946\u20132953 (2014)","DOI":"10.1609\/aaai.v28i2.19016"},{"issue":"1","key":"26_CR4","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1287\/ijoc.13.1.56.9748","volume":"13","author":"E Balas","year":"2000","unstructured":"Balas, E., Simonetti, N.: Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study. INFORMS J. Comput. 13(1), 56\u201375 (2000)","journal-title":"INFORMS J. Comput."},{"key":"26_CR5","volume-title":"Non-linear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Non-linear Programming. Athena Scientific, Belmont (1999)"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Bliznets, I., Cygan, M., Komosa, P., Mach, L., Pilipczuk, M.: Lower bounds for the parameterized complexity of minimum fill-in and other completion problems. In: SODA, pp. 1132\u20131151 (2016)","DOI":"10.1137\/1.9781611974331.ch79"},{"issue":"1","key":"26_CR7","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/s00453-015-0014-x","volume":"75","author":"Y Cao","year":"2016","unstructured":"Cao, Y., Marx, D.: Chordal editing is fixed-parameter tractable. Algorithmica 75(1), 118\u2013137 (2016)","journal-title":"Algorithmica"},{"key":"26_CR8","unstructured":"Cao, Y., Sandeep, R.B.: Minimum fill-in: inapproximability and almost tight lower bounds. CoRR abs\/1606.08141 (2016). http:\/\/arxiv.org\/abs\/1606.08141"},{"issue":"1","key":"26_CR9","first-page":"550","volume":"2","author":"XL Dong","year":"2009","unstructured":"Dong, X.L., Berti-Equille, L., Srivastava, D.: Integrating conflicting data: the role of source dependence. PVLDB 2(1), 550\u2013561 (2009)","journal-title":"PVLDB"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Drange, P.G., Dregi, M.S., Lokshtanov, D., Sullivan, B.D.: On the threshold of intractability. In: ESA, pp. 411\u2013423 (2015)","DOI":"10.1007\/978-3-662-48350-3_35"},{"issue":"17","key":"26_CR11","doi-asserted-by":"crossref","first-page":"980","DOI":"10.1016\/j.ipl.2009.05.006","volume":"109","author":"T Feder","year":"2009","unstructured":"Feder, T., Mannila, H., Terzi, E.: Approximating the minimum chain completion problem. Inf. Process. Lett. 109(17), 980\u2013985 (2009)","journal-title":"Inf. Process. Lett."},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Villanger, Y.: Subexponential parameterized algorithm for minimum fill-in. In: SODA, pp. 1737\u20131746 (2012)","DOI":"10.1137\/1.9781611973099.138"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Galland, A., Abiteboul, S., Marian, A., Senellart, P.: Corroborating information from disagreeing views. In: WSDM, pp. 131\u2013140. ACM (2010)","DOI":"10.1145\/1718487.1718504"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Gatterbauer, W., Suciu, D.: Data conflict resolution using trust mappings. In: SIGMOD, pp. 219\u2013230 (2010)","DOI":"10.1145\/1807167.1807193"},{"issue":"1","key":"26_CR15","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1145\/2031331.2031341","volume":"13","author":"M Gupta","year":"2011","unstructured":"Gupta, M., Han, J.: Heterogeneous network-based trust analysis: a survey. ACM SIGKDD Explor. Newsl. 13(1), 54\u201371 (2011)","journal-title":"ACM SIGKDD Explor. Newsl."},{"key":"26_CR16","unstructured":"Jiao, Y., Ravi, R., Gatterbauer, W.: Algorithms for automatic ranking of participants and tasks in an anonymized contest. CoRR abs\/1612.04794 (2016). http:\/\/arxiv.org\/abs\/1612.04794"},{"issue":"5","key":"26_CR17","doi-asserted-by":"crossref","first-page":"1906","DOI":"10.1137\/S0097539796303044","volume":"28","author":"H Kaplan","year":"1999","unstructured":"Kaplan, H., Shamir, R., Tarjan, R.E.: Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs. SIAM J. Comput. 28(5), 1906\u20131922 (1999)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"26_CR18","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. JACM 46(5), 604\u2013632 (1999)","journal-title":"JACM"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Li, Q., Li, Y., Gao, J., Zhao, B., Fan, W., Han, J.: Resolving conflicts in heterogeneous data by truth discovery and source reliability estimation. In: SIGMOD, pp. 1187\u20131198 (2014)","DOI":"10.1145\/2588555.2610509"},{"issue":"2","key":"26_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2897350.2897352","volume":"17","author":"Y Li","year":"2015","unstructured":"Li, Y., Gao, J., Meng, C., Li, Q., Su, L., Zhao, B., Fan, W., Han, J.: A survey on truth discovery. ACM SIGKDD Explor. Newsl. 17(2), 1\u201316 (2015)","journal-title":"ACM SIGKDD Explor. Newsl."},{"issue":"4","key":"26_CR21","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1137\/S0097539798336073","volume":"30","author":"A Natanzon","year":"2000","unstructured":"Natanzon, A., Shamir, R., Sharan, R.: A polynomial approximation algorithm for the minimum fill-in problem. SIAM J. Comput. 30(4), 1067\u20131079 (2000)","journal-title":"SIAM J. Comput."},{"key":"26_CR22","unstructured":"Pasternack, J., Roth, D.: Knowing what to believe (when you already know something). In: COLING, pp. 877\u2013885 (2010)"},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"Pasternack, J., Roth, D.: Latent credibility analysis. In: WWW, pp. 1009\u20131021 (2013)","DOI":"10.1145\/2488388.2488476"},{"key":"26_CR24","unstructured":"Pasternack, J., Roth, D., Vydiswaran, V.V.: Information trustworthiness. AAAI Tutorial (2013)"},{"issue":"1","key":"26_CR25","first-page":"569","volume":"49","author":"YL Wu","year":"2014","unstructured":"Wu, Y.L., Austrin, P., Pitassi, T., Liu, D.: Inapproximability of treewidth, one-shot pebbling, and related layout problems. J. Artif. Int. Res. 49(1), 569\u2013600 (2014)","journal-title":"J. Artif. Int. Res."},{"issue":"1","key":"26_CR26","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Computing the minimum fill-in is NP-complete. SIAM J. Algebr. Discret. Methods 2(1), 77\u201379 (1981)","journal-title":"SIAM J. Algebr. Discret. Methods"},{"issue":"6","key":"26_CR27","first-page":"796","volume":"20","author":"X Yin","year":"2008","unstructured":"Yin, X., Han, J., Yu, P.S.: Truth discovery with multiple conflicting information providers on the web. TKDE 20(6), 796\u2013808 (2008)","journal-title":"TKDE"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53925-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,24]],"date-time":"2022-07-24T12:11:32Z","timestamp":1658664692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53925-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319539249","9783319539256"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53925-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}