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

Artificial Intelligence

Volumn 240, Issue , 2016, Pages 19-35

  van Bevern, René ^a,b,d   Komusiewicz, Christian ^c,d   Niedermeier, Rolf ^d   Sorge, Manuel ^d   Walsh, Toby ^d,e,f  

^a NOVOSIBIRSK STATE UNIVERSITY   (Russian Federation)

^b SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^c FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^d TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^e UNIVERSITY OF NEW SOUTH WALES   (Australia)

^f CSIRO   (Australia)

Author keywords

AI's 10 to watch; Citation index; Exact algorithms; Hirsch index; Parameterized complexity

Indexed keywords

POLYNOMIALS;

CITATION INDEX; COMPATIBILITY GRAPH; CONNECTED COMPONENT; CONSTANT SIZES; EXACT ALGORITHMS; GOOGLE SCHOLAR; HIRSCH INDEX; PARAMETERIZED COMPLEXITY;

INDEXING (OF INFORMATION);

EID: 84983429819     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2016.08.001     Document Type: Article

References (33)

1. [1] AI's 10 to watch. IEEE Intell. Syst. 26:1 (2011), 5–15, 10.1109/MIS.2011.7.
2. [2] Assmann, S., Johnson, D., Kleitman, D., Leung, J.-T., On a dual version of the one-dimensional bin packing problem. J. Algorithms 5:4 (1984), 502–525, 10.1016/0196-6774(84)90004-X.
3. [3] Bartneck, C., Kokkelmans, S., Detecting h-index manipulation through self-citation analysis. Scientometrics 87:1 (2011), 85–98, 10.1007/s11192-010-0306-5.
4. [4] van Bevern, R., Komusiewicz, C., Niedermeier, R., Sorge, M., Walsh, T., H-index manipulation by merging articles: models, theory, and experiments. Proceedings of the 24th Conference on Artificial Intelligence, IJCAI'15, 2015, AAAI Press, 808–814.
5. [5] van Bevern, R., Komusiewicz, C., Molter, H., Niedermeier, R., Sorge, M., Walsh, T., H-index manipulation by undoing merges. Proceedings of the 22nd European Conference on Artificial Intelligence, ECAI'16 Frontiers in Artificial Intelligence and Applications, 2016, IOS Press in press.
6. [6] Bodlaender, H.L., van Kreveld, M., Google scholar makes it hard—the complexity of organizing one's publications. Inf. Process. Lett. 115:12 (2015), 965–968, 10.1016/j.ipl.2015.07.003.
7. [7] Coffman, E.G. Jr., Csirik, J., Galambos, G., Martello, S., Vigo, D., Bin packing approximation algorithms: survey and classification. Handbook of Combinatorial Optimization, 2013, Springer, New York, 455–531, 10.1007/978-1-4419-7997-1_35.
8. [8] Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S., Parameterized Algorithms. 2015, Springer.
9. [9] de Keijzer, B., Apt, K.R., The H-index can be easily manipulated. Bull. EATCS 110 (2013), 79–85.
10. [10] Delgado López-Cózar, E., Robinson-García, N., Torres-Salinas, D., The Google Scholar experiment: how to index false papers and manipulate bibliometric indicators. J. Assoc. Inf. Sci. Technol. 65:3 (2014), 446–454, 10.1002/asi.23056.
11. [11] Denman, R., Foster, S., Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SAT. Discrete Appl. Math. 157:7 (2009), 1655–1659, 10.1016/j.dam.2008.09.011.
12. [12] Downey, R.G., Fellows, M.R., Fundamentals of Parameterized Complexity. 2013, Springer.
13. [13] Dutta, B., Jackson, M.O., Breton, M.L., Strategic candidacy and voting procedures. Econometrica 69:4 (2001), 1013–1037, 10.1111/1468-0262.00228.
14. [14] Egghe, L., Theory and practise of the g-index. Scientometrics 69:1 (2006), 131–152, 10.1007/s11192-006-0144-7.
15. [15] Faliszewski, P., Procaccia, A.D., AI's war on manipulation: are we winning?. AI Mag. 31:4 (2010), 53–64.
16. [16] Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A., Using complexity to protect elections. Commun. ACM 53:11 (2010), 74–82, 10.1145/1839676.1839696.
17. [17] Fellows, M.R., Hermelin, D., Rosamond, F., Vialette, S., On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410:1 (2009), 53–61, 10.1016/j.tcs.2008.09.065.
18. [18] Fellows, M.R., Jansen, B.M.P., Rosamond, F.A., Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity. Eur. J. Comb. 34:3 (2013), 541–566, 10.1016/j.ejc.2012.04.008.
19. [19] Flum, J., Grohe, M., Parameterized Complexity Theory. 2006, Springer.
20. [20] Friesen, D.K., Deuermeyer, B.L., Analysis of greedy solutions for a replacement part sequencing problem. Math. Oper. Res. 6:1 (1981), 74–87, 10.1287/moor.6.1.74.
21. [21] Guo, J., Niedermeier, R., Invitation to data reduction and problem kernelization. ACM SIGACT News 38:1 (2007), 31–45, 10.1145/1233481.1233493.
22. [22] Hirsch, J.E., An index to quantify an individual's scientific research output. Proc. Natl. Acad. Sci. USA 102:46 (2005), 16569–16572, 10.1073/pnas.0507655102.
23. [23] Komusiewicz, C., Niedermeier, R., New races in parameterized algorithmics. Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science, MFCS '12 Lecture Notes in Computer Science, vol. 7464, 2012, Springer, 19–30, 10.1007/978-3-642-32589-2_2.
24. [24] Kratsch, S., Recent developments in kernelization: a survey. Bull. EATCS 113 (2014), 58–97.
25. [25] Niedermeier, R., Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications, vol. 31, 2006, Oxford University Press.
26. [26] Niedermeier, R., Reflections on multivariate algorithmics and problem parameterization. Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, STACS '10 LIPIcs, vol. 5, 2010, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 17–32, 10.4230/LIPIcs.STACS.2010.2495.
27. [27] Pavlou, C., Elkind, E., Manipulating citation indices in a social context. Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, AAMAS'16, 2016, International Foundation for Autonomous Agents and Multiagent Systems, 32–40.
28. [28] Vinkler, P., Would it be possible to increase the Hirsch-index, π-index or CDS-index by increasing the number of publications or citations only by unity?. J. Informetr. 7:1 (2013), 72–83, 10.1016/j.joi.2012.08.001.
29. [29] Walter, R., Wirth, M., Lawrinenko, A., Improved approaches to the exact solution of the machine covering problem. J. Sched., 2016, 10.1007/s10951-016-0477-x in press.
30. [30] Woeginger, G.J., An axiomatic characterization of the Hirsch-index. Math. Soc. Sci. 56:2 (2008), 224–232, 10.1016/j.mathsocsci.2008.03.001.
31. [31] Woeginger, G.J., An axiomatic analysis of Egghe's g-index. J. Informetr. 2:4 (2008), 364–368, 10.1016/j.joi.2008.05.002.
32. [32] Yong, A., Critique of Hirsch's citation index: a combinatorial Fermi problem. Not. AMS 61:9 (2014), 1040–1050, 10.1090/noti1164.
33. [33] Zeng, D., AI's 10 to watch. IEEE Intell. Syst. 28:3 (2013), 86–96, 10.1109/MIS.2013.57.