H-Index Manipulation by Undoing Merges. van Bevern, R., Komusiewicz, C., Molter, H., Niedermeier, R., Sorge, M., & Walsh, T. Quantitative Science Studies, 1(4):1529–1552, 2020.
Preprint
Code
Poster doi abstract bibtex 4 downloads 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 (van Bevern et al. [Artif. Intel. 240:19-35, 2016]) 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.
@article{BKM+20,
title = {H-Index Manipulation by Undoing Merges},
author = {René van Bevern and Christian Komusiewicz and
Hendrik Molter and Rolf Niedermeier and Manuel Sorge
and Toby Walsh},
doi = {10.1162/qss_a_00093},
url_Preprint = {http://arxiv.org/abs/1604.04827},
url_Code = {https://gitlab.com/rvb/split-index},
url_Poster =
{https://figshare.com/articles/poster/H-index_manipulation_by_undoing_merges/13521758},
journal = {Quantitative Science Studies},
volume = 1,
number = 4,
pages = {1529--1552},
abstract = {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 (van Bevern et
al. [Artif. Intel. 240:19-35, 2016]) 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.},
year = 2020,
date = {2020-10-13},
}
Downloads: 4
{"_id":"xTFQcEGKTXxZedCgr","bibbaseid":"vanbevern-komusiewicz-molter-niedermeier-sorge-walsh-hindexmanipulationbyundoingmerges-2020","authorIDs":["2fwXJtKDCNhaSNr5s"],"author_short":["van Bevern, R.","Komusiewicz, C.","Molter, H.","Niedermeier, R.","Sorge, M.","Walsh, T."],"bibdata":{"bibtype":"article","type":"article","title":"H-Index Manipulation by Undoing Merges","author":[{"firstnames":["René"],"propositions":["van"],"lastnames":["Bevern"],"suffixes":[]},{"firstnames":["Christian"],"propositions":[],"lastnames":["Komusiewicz"],"suffixes":[]},{"firstnames":["Hendrik"],"propositions":[],"lastnames":["Molter"],"suffixes":[]},{"firstnames":["Rolf"],"propositions":[],"lastnames":["Niedermeier"],"suffixes":[]},{"firstnames":["Manuel"],"propositions":[],"lastnames":["Sorge"],"suffixes":[]},{"firstnames":["Toby"],"propositions":[],"lastnames":["Walsh"],"suffixes":[]}],"doi":"10.1162/qss_a_00093","url_preprint":"http://arxiv.org/abs/1604.04827","url_code":"https://gitlab.com/rvb/split-index","url_poster":"https://figshare.com/articles/poster/H-index_manipulation_by_undoing_merges/13521758","journal":"Quantitative Science Studies","volume":"1","number":"4","pages":"1529–1552","abstract":"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 (van Bevern et al. [Artif. Intel. 240:19-35, 2016]) 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.","year":"2020","date":"2020-10-13","bibtex":"@article{BKM+20,\n title =\t {H-Index Manipulation by Undoing Merges},\n author =\t {René van Bevern and Christian Komusiewicz and\n Hendrik Molter and Rolf Niedermeier and Manuel Sorge\n and Toby Walsh},\n doi =\t\t {10.1162/qss_a_00093},\n url_Preprint = {http://arxiv.org/abs/1604.04827},\n url_Code =\t {https://gitlab.com/rvb/split-index},\n url_Poster =\n {https://figshare.com/articles/poster/H-index_manipulation_by_undoing_merges/13521758},\n journal =\t {Quantitative Science Studies},\n volume =\t 1,\n number =\t 4,\n pages =\t {1529--1552},\n abstract =\t {The h-index is an important bibliographic measure\n used to assess the performance of\n researchers. Dutiful researchers merge different\n versions of their articles in their Google Scholar\n profile even though this can decrease their\n h-index. In this article, we study the manipulation\n of the h-index by undoing such merges. In contrast\n to manipulation by merging articles (van Bevern et\n al. [Artif. Intel. 240:19-35, 2016]) such\n manipulation is harder to detect. We present\n numerous results on computational complexity (from\n linear-time algorithms to parameterized\n computational hardness results) and empirically\n indicate that at least small improvements of the\n h-index by splitting merged articles are\n unfortunately easily achievable.},\n year =\t 2020,\n date =\t {2020-10-13},\n}\n\n\n\n\n\n","author_short":["van Bevern, R.","Komusiewicz, C.","Molter, H.","Niedermeier, R.","Sorge, M.","Walsh, T."],"key":"BKM+20","id":"BKM+20","bibbaseid":"vanbevern-komusiewicz-molter-niedermeier-sorge-walsh-hindexmanipulationbyundoingmerges-2020","role":"author","urls":{" preprint":"http://arxiv.org/abs/1604.04827"," code":"https://gitlab.com/rvb/split-index"," poster":"https://figshare.com/articles/poster/H-index_manipulation_by_undoing_merges/13521758"},"metadata":{"authorlinks":{"van bevern, r":"https://rvb.su/"}},"downloads":4,"html":""},"bibtype":"article","biburl":"http://rvb.su/rvb.bib","creationDate":"2021-01-06T14:16:51.458Z","downloads":4,"keywords":[],"search_terms":["index","manipulation","undoing","merges","van bevern","komusiewicz","molter","niedermeier","sorge","walsh"],"title":"H-Index Manipulation by Undoing Merges","year":2020,"dataSources":["SMwzc9Bzq5Np5ikev","G5GefJqqu2DtnCZXz"]}