H-index manipulation by merging articles: Models, theory, and experiments

IJCAI International Joint Conference on Artificial Intelligence

Volumn 2015-January, Issue , 2015, Pages 808-814

  Van Bevern, René ^a,c   Komusiewicz, Christian ^a   Niedermeier, Rolf ^a   Sorge, Manuel ^a   Walsh, Toby ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

^c NOVOSIBIRSK STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; MERGING; POLYNOMIALS;

COMPATABILITY; COMPATIBILITY GRAPH; CONNECTED COMPONENT; CONSTANT SIZES; GOOGLE SCHOLAR; H INDICES; LINEAR TIME; PARAMETERIZED COMPLEXITY;

INDEXING (OF INFORMATION);

EID: 84949792641     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. AI's 10 to Watch. IEEE Intelligent Systems, 26(1):5-15, 2011.
2. Christoph Bartneck and Servaas Kokkelmans. Detecting h-index manipulation through self-citation analysis. Scientometrics, 87(1):85-98, 2011.
3. Hans L. Bodlaender and Marc van Kreveld. Google Scholar makes it hard - the complexity of organizing one's publications. CoRR, abs/1410.3820, 2014.
4. Emilio Delgado López-Cózar, Nicolás Robinson-García, and Daniel Torres-Salinas. The Google Scholar experiment: How to index false papers and manipulate bibliometric indicators. Journal of the Association for Information Science and Technology, 65(3):446-454, 2014.
5. Richard Denman and Stephen Foster. Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SAT. Discrete Applied Mathematics, 157(7):1655-1659, 2009.
6. Rod G. Downey and Michael R. Fellows. Fundamentals of Parameterized Complexity. Springer, 2013.
7. Bhaskar Dutta, Matthew O. Jackson, and Michel Le Breton. Strategic candidacy and voting procedures. Econometrica, 69(4):1013-1037, 2001.
8. Leo Egghe. Theory and practise of the g-index. Scientometrics, 69(1):131-152, 2006.
9. Piotr Faliszewski and Ariel D. Procaccia. AI's war on manipulation: Are we winning? AI Magazine, 31(4):53-64, 2010.
10. Piotr Faliszewski, Edith Hemaspaandra, and Lane A. Hemaspaandra. Using complexity to protect elections. Communications of the ACM, 53(11):74-82, 2010.
11. Jörg Flum and Martin Grohe. Parameterized Complexity Theory. Springer, 2006.
12. Jiong Guo and Rolf Niedermeier. Invitation to data reduction and problem kernelization. ACM SIGACTNews, 38(1):31-45, 2007.
13. J. E. Hirsch. An index to quantify an individual's scientific research output. Proceedings of the National Academy of Sciences of the United States of America, 102(46):16569-16572, 2005.
14. Bart de Keijzer and Krzysztof R. Apt. The H-index can be easily manipulated. Bulletin of the EATCS, 110:79-85, 2013.
15. Stefan Kratsch. Recent developments in kernelization: A survey. Bulletin of the EATCS, 113:58-97, 2014.
16. Rolf Niedermeier. Invitation to Fixed-Parameter Algorithms. Number 31 in Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, 2006.
17. Péter Vinkler. Would it be possible to increase the Hirsch-index, π-index or CDS-index by increasing the number of publications or citations only by unity? Journal of Informetrics, 7(1):72-83, 2013.
18. Gerhard J. Woeginger. An axiomatic analysis of Egghe's g-index. Journal of Informetrics, 2(4):364-368, 2008.
19. Gerhard J. Woeginger. An axiomatic characterization of the Hirsch-index. Mathematical Social Sciences, 56(2):224-232, 2008.
20. Daniel Zeng. AI's 10 to watch. IEEE Intelligent Systems, 28(3):86-96, 2013.