H-index manipulation by undoing merges

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

doi:10.1162/qss_a_00093

H-index manipulation by undoing merges

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

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

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 language	English
Pages (from-to)	1529-1552
Number of pages	24
Journal	Quantitative Science Studies
Volume	1
Issue number	4
DOIs	https://doi.org/10.1162/qss_a_00093
State	Published - 1 Dec 2020
Externally published	Yes

Keywords

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

ASJC Scopus subject areas

Library and Information Sciences
Analysis
Numerical Analysis
Cultural Studies

Access to Document

10.1162/qss_a_00093

Cite this

@article{f40f77c8706d4ef1a618962ebec4d686,

title = "H-index manipulation by undoing merges",

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

keywords = "Article splitting, Citation graph, Experimental algorithmics, Google Scholar profiles, NP-hard problems, Parameterized complexity",

author = "{van Bevern}, Ren{\'e} and Christian Komusiewicz and Hendrik Molter and Rolf Niedermeier and Manuel Sorge and Toby Walsh",

note = "Publisher Copyright: {\textcopyright} 2020 Ren{\'e} van Bevern, Christian Komusiewicz, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, and Toby Walsh.",

year = "2020",

month = dec,

day = "1",

doi = "10.1162/qss_a_00093",

language = "English",

volume = "1",

pages = "1529--1552",

journal = "Quantitative Science Studies",

issn = "2641-3337",

publisher = "Massachusetts Institute of Technology Press",

number = "4",

}

TY - JOUR

T1 - H-index manipulation by undoing merges

AU - van Bevern, René

AU - Komusiewicz, Christian

AU - Molter, Hendrik

AU - Niedermeier, Rolf

AU - Sorge, Manuel

AU - Walsh, Toby

PY - 2020/12/1

Y1 - 2020/12/1

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

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

KW - Article splitting

KW - Citation graph

KW - Experimental algorithmics

KW - Google Scholar profiles

KW - NP-hard problems

KW - Parameterized complexity

UR - http://www.scopus.com/inward/record.url?scp=85114834538&partnerID=8YFLogxK

U2 - 10.1162/qss_a_00093

DO - 10.1162/qss_a_00093

M3 - Article

AN - SCOPUS:85114834538

SN - 2641-3337

VL - 1

SP - 1529

EP - 1552

JO - Quantitative Science Studies

JF - Quantitative Science Studies

IS - 4

ER -

H-index manipulation by undoing merges

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this