Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-11463
For citation please use:
Main Title: h-Index manipulation by undoing merges
Author(s): Bevern, René van
Komusiewicz, Christian
Molter, Hendrik
Niedermeier, Rolf
Type: Article
URI: https://depositonce.tu-berlin.de/handle/11303/12655
http://dx.doi.org/10.14279/depositonce-11463
License: https://creativecommons.org/licenses/by/4.0/
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.
Subject(s): article splitting
citation graph
experimental algorithmics
Google Scholar profiles
NP-hard problems
parameterized complexity
Issue Date: 30-Dec-2020
Date Available: 22-Feb-2021
Language Code: en
DDC Class: 510 Mathematik
Sponsor/Funder: DFG, 210010251, Datengetriebene parametrisierte Algorithmik von Graphmodifikationsproblemen (DAPA)
DFG, 382063982, Multivariate Algorithmik temporaler Graphprobleme (MATE)
EC/FP7/631163/EU/New Directions in Meta-Kernelization/MetaKer
EC/H2020/714704/EU/Cuts and decompositions: algorithms and combinatorial properties/CUTACOMBS
EC/H2020/670077/EU/Allocation Made PracticaL/AMPLify
DFG, 414044773, Open Access Publizieren 2021 - 2022 / Technische Universität Berlin
Journal Title: Quantitative Science Studies
Publisher: MIT Press
Volume: 1
Issue: 4
Publisher DOI: 10.1162/qss_a_00093
Page Start: 1529
Page End: 1552
EISSN: 2641-3337
TU Affiliation(s): Fak. 4 Elektrotechnik und Informatik » Inst. Softwaretechnik und Theoretische Informatik » FG Algorithmik und Komplexitätstheorie
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Bevern_etal_h-Index_2020.pdf
Format: Adobe PDF | Size: 631.83 kB
DownloadShow Preview
Thumbnail

Item Export Bar

This item is licensed under a Creative Commons License Creative Commons