\(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments
DOI10.1016/j.artint.2016.08.001zbMath1386.68076arXiv1412.5498OpenAlexW2294587950MaRDI QIDQ329039
Rolf Niedermeier, Manuel Sorge, Christian Komusiewicz, René van Bevern, Toby Walsh
Publication date: 21 October 2016
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.5498
Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Bibliographic studies (01A90)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An index to quantify an individual's scientific research output
- Fundamentals of parameterized complexity
- Google Scholar makes it hard -- the complexity of organizing one's publications
- An axiomatic characterization of the Hirsch-index
- On the parameterized complexity of multiple-interval graph problems
- Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT
- Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
- Parametrized complexity theory.
- A Critique of Hirsch's Citation Index: A Combinatorial Fermi Problem
- New Races in Parameterized Algorithmics
- Reflections on Multivariate Algorithmics and Problem Parameterization
- On a dual version of the one-dimensional bin packing problem
- Analysis of Greedy Solutions for a Replacement Part Sequencing Problem
- Strategic Candidacy and Voting Procedures
- h-Index Manipulation by Undoing Merges
- Parameterized Algorithms
This page was built for publication: \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments
