{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:50:51Z","timestamp":1740181851460,"version":"3.37.3"},"reference-count":22,"publisher":"MIT Press","issue":"4","funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["670077, 714704"],"award-info":[{"award-number":["670077, 714704"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["551145\/14"],"award-info":[{"award-number":["551145\/14"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011264","name":"FP7 People: Marie-Curie Actions","doi-asserted-by":"publisher","award":["FP7\/2007-2013"],"award-info":[{"award-number":["FP7\/2007-2013"]}],"id":[{"id":"10.13039\/100011264","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["NI 369\/12, NI 369\/17"],"award-info":[{"award-number":["NI 369\/12, NI 369\/17"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.mitpressjournals.org"],"crossmark-restriction":true},"short-container-title":["Quantitative Science Studies"],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:p> The h-index is an important bibliographic measure used to assess the performance of researchers. Dutiful researchers merge different versions of their articles in their Google Scholar profile even though this can decrease their h-index. In this article, we study the manipulation of the h-index by undoing such merges. In contrast to manipulation by merging articles, such manipulation is harder to detect. We present numerous results on computational complexity (from linear-time algorithms to parameterized computational hardness results) and empirically indicate that at least small improvements of the h-index by splitting merged articles are unfortunately easily achievable. <\/jats:p>","DOI":"10.1162\/qss_a_00093","type":"journal-article","created":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T15:23:26Z","timestamp":1607354606000},"page":"1529-1552","update-policy":"https:\/\/doi.org\/10.1162\/mitpressjournals.corrections.policy","source":"Crossref","is-referenced-by-count":3,"title":["<i>h<\/i>-Index manipulation by undoing merges"],"prefix":"10.1162","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4805-218X","authenticated-orcid":true,"given":"Ren\u00e9","family":"van Bevern","sequence":"first","affiliation":[{"name":"Department of Mechanics and Mathematics, Novosibirsk State University, Novosibirsk, Russian Federation"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0829-7032","authenticated-orcid":true,"given":"Christian","family":"Komusiewicz","sequence":"additional","affiliation":[{"name":"Fachbereich Mathematik und Informatik, Philipps-Universit\u00e4t Marburg, Marburg, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4590-798X","authenticated-orcid":true,"given":"Hendrik","family":"Molter","sequence":"additional","affiliation":[{"name":"Algorithmics and Computational Complexity, Fakult\u00e4t IV, TU Berlin, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1703-1236","authenticated-orcid":true,"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[{"name":"Algorithmics and Computational Complexity, Fakult\u00e4t IV, TU Berlin, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7394-3147","authenticated-orcid":true,"given":"Manuel","family":"Sorge","sequence":"additional","affiliation":[{"name":"Institute of Informatics, University of Warsaw, Poland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2998-8668","authenticated-orcid":true,"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[{"name":"Algorithmics and Computational Complexity, Fakult\u00e4t IV, TU Berlin, Germany"}]}],"member":"281","reference":[{"issue":"1","key":"bib1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s11192-010-0306-5","volume":"87","author":"Bartneck C.","year":"2011","journal-title":"Scientometrics"},{"issue":"12","key":"bib4","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1016\/j.ipl.2015.07.003","volume":"115","author":"Bodlaender H. L.","year":"2015","journal-title":"Information Processing Letters"},{"issue":"2","key":"bib5","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BF01994876","volume":"32","author":"Boppana R.","year":"1992","journal-title":"BIT Numerical Mathematics"},{"key":"bib6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"Cygan M.","year":"2015"},{"key":"bib16","first-page":"79","volume":"110","author":"de Keijzer B.","year":"2013","journal-title":"Bulletin of the EATCS"},{"issue":"3","key":"bib7","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1002\/asi.23056","volume":"65","author":"Delgado L\u00f3pez-C\u00f3zar E.","year":"2014","journal-title":"Journal of the Association for Information Science and Technology"},{"key":"bib8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"Downey R. G.","year":"2013"},{"issue":"1","key":"bib9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s11192-006-0144-7","volume":"69","author":"Egghe L.","year":"2006","journal-title":"Scientometrics"},{"issue":"4","key":"bib10","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1609\/aimag.v31i4.2314","volume":"31","author":"Faliszewski P.","year":"2010","journal-title":"AI Magazine"},{"issue":"11","key":"bib11","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/1839676.1839696","volume":"53","author":"Faliszewski P.","year":"2010","journal-title":"Communications of the ACM"},{"volume-title":"Parameterized Complexity Theory","year":"2006","author":"Flum J.","key":"bib12"},{"issue":"46","key":"bib13","doi-asserted-by":"crossref","first-page":"16569","DOI":"10.1073\/pnas.0507655102","volume":"102","author":"Hirsch J. E.","year":"2005","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"issue":"1","key":"bib14","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.jcss.2012.04.004","volume":"79","author":"Jansen K.","year":"2013","journal-title":"Journal of Computer and System Sciences"},{"key":"bib15","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04650-0","volume-title":"Extremal Combinatorics \u2013 with Applications in Computer Science","author":"Jukna S.","year":"2001"},{"issue":"1","key":"bib17","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1073\/pnas.1422282112","volume":"112","author":"Lesk M.","year":"2015","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"bib18","series-title":"Oxford Lecture Series in Mathematics and Its Applications","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"Niedermeier R.","year":"2006"},{"issue":"4","key":"bib19","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1080\/13562517.2017.1301909","volume":"22","author":"Oravec J. A.","year":"2017","journal-title":"Teaching in Higher Education"},{"key":"bib20","first-page":"32","volume-title":"Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (AAMAS \u201916)","author":"Pavlou C.","year":"2016"},{"key":"bib2","series-title":"Frontiers in Artificial Intelligence and Applications","first-page":"895","volume-title":"Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI \u201916)","author":"van Bevern R.","year":"2016"},{"key":"bib3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.artint.2016.08.001","volume":"240","author":"van Bevern R.","year":"2016","journal-title":"Artificial Intelligence"},{"issue":"1","key":"bib21","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.joi.2012.08.001","volume":"7","author":"Vinkler P.","year":"2013","journal-title":"Journal of Informetrics"},{"issue":"4","key":"bib22","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/j.joi.2008.05.002","volume":"2","author":"Woeginger G. J.","year":"2008","journal-title":"Journal of Informetrics"}],"container-title":["Quantitative Science Studies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mitpressjournals.org\/doi\/pdf\/10.1162\/qss_a_00093","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T21:30:40Z","timestamp":1615584640000},"score":1,"resource":{"primary":{"URL":"https:\/\/direct.mit.edu\/qss\/article\/1\/4\/1529-1552\/96129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["10.1162\/qss_a_00093"],"URL":"https:\/\/doi.org\/10.1162\/qss_a_00093","relation":{},"ISSN":["2641-3337"],"issn-type":[{"type":"electronic","value":"2641-3337"}],"subject":[],"published":{"date-parts":[[2020,12]]},"assertion":[{"value":"2019-11-11","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-10-11","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-12-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}