H-index manipulation by undoing merges

René van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Toby Walsh

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

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, 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.

Original languageEnglish
Pages (from-to)1529-1552
Number of pages24
JournalQuantitative Science Studies
Volume1
Issue number4
DOIs
Publication statusPublished - 1 Dec 2020

Keywords

  • Article splitting
  • Citation graph
  • Experimental algorithmics
  • Google Scholar profiles
  • NP-hard problems
  • Parameterized complexity

OECD FOS+WOS

  • 1.02 COMPUTER AND INFORMATION SCIENCES
  • 1.01 MATHEMATICS
  • 5.08.NU INFORMATION SCIENCE & LIBRARY SCIENCE

Fingerprint

Dive into the research topics of 'H-index manipulation by undoing merges'. Together they form a unique fingerprint.

Cite this