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.
H-Index Manipulation by Undoing Merges [link]Preprint  H-Index Manipulation by Undoing Merges [link]Code  H-Index Manipulation by Undoing Merges [link]Poster  doi  abstract   bibtex   
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: 0