@incollection{BKM+16,
  title =	 {H-Index Manipulation by Undoing Merges},
  author =	 {René van Bevern and Christian Komusiewicz and
                  Hendrik Molter and Rolf Niedermeier and Manuel Sorge
                  and Toby Walsh},
  doi =		 {10.3233/978-1-61499-672-9-895},
  year =	 {2016},
  date =	 {2016-08-29},
  booktitle =	 {ECAI 2016},
  editor =	 {Gal A. Kaminka and Maria Fox and Paolo Bouquet and
                  Eyke Hüllermeier and Virginia Dignum and Frank
                  Dignum and Frank van Harmelen},
  publisher =	 {IOS Press},
  abstract =	 {The h-index is one of the most important
                  bibliographic measures used to assess the
                  performance of researchers. Van Bevern et
                  al. [Artif. Intel., in press] showed that, despite
                  computational worst-case hardness results,
                  substantial manipulation of the h-index of Google
                  Scholar author profiles is possible by merging
                  articles. Complementing previous work, we study the
                  opposite operation, the splitting of articles, which
                  is arguably the more natural operation for
                  manipulation and which is also allowed within Google
                  Scholar. We present numerous results on
                  computational complexity (from linear-time
                  algorithms to parameterized hardness results) and
                  empirically indicate that at least small
                  improvements of the h-index by splitting merged
                  articles are easily achievable.},
  volume =	 {285},
  pages =	 {895--903},
  series =	 {Frontiers in Artificial Intelligence and
                  Applications},
  keywords =	 {graph modification, NP-hard, parameterized
                  complexity}
}

{"_id":"qaGooxxYJg4Gq7LwY","bibbaseid":"vanbevern-komusiewicz-molter-niedermeier-sorge-walsh-hindexmanipulationbyundoingmerges-2016","downloads":0,"creationDate":"2016-06-06T06:47:31.412Z","title":"H-Index Manipulation by Undoing Merges","author_short":["van Bevern, R.","Komusiewicz, C.","Molter, H.","Niedermeier, R.","Sorge, M.","Walsh, T."],"year":2016,"bibtype":"incollection","biburl":"http://rvb.su/rvb.bib","bibdata":{"bibtype":"incollection","type":"incollection","title":"H-Index Manipulation by Undoing Merges","author":[{"firstnames":["René"],"propositions":["van"],"lastnames":["Bevern"],"suffixes":[]},{"firstnames":["Christian"],"propositions":[],"lastnames":["Komusiewicz"],"suffixes":[]},{"firstnames":["Hendrik"],"propositions":[],"lastnames":["Molter"],"suffixes":[]},{"firstnames":["Rolf"],"propositions":[],"lastnames":["Niedermeier"],"suffixes":[]},{"firstnames":["Manuel"],"propositions":[],"lastnames":["Sorge"],"suffixes":[]},{"firstnames":["Toby"],"propositions":[],"lastnames":["Walsh"],"suffixes":[]}],"doi":"10.3233/978-1-61499-672-9-895","year":"2016","date":"2016-08-29","booktitle":"ECAI 2016","editor":[{"firstnames":["Gal","A."],"propositions":[],"lastnames":["Kaminka"],"suffixes":[]},{"firstnames":["Maria"],"propositions":[],"lastnames":["Fox"],"suffixes":[]},{"firstnames":["Paolo"],"propositions":[],"lastnames":["Bouquet"],"suffixes":[]},{"firstnames":["Eyke"],"propositions":[],"lastnames":["Hüllermeier"],"suffixes":[]},{"firstnames":["Virginia"],"propositions":[],"lastnames":["Dignum"],"suffixes":[]},{"firstnames":["Frank"],"propositions":[],"lastnames":["Dignum"],"suffixes":[]},{"firstnames":["Frank"],"propositions":["van"],"lastnames":["Harmelen"],"suffixes":[]}],"publisher":"IOS Press","abstract":"The h-index is one of the most important bibliographic measures used to assess the performance of researchers. Van Bevern et al. [Artif. Intel., in press] showed that, despite computational worst-case hardness results, substantial manipulation of the h-index of Google Scholar author profiles is possible by merging articles. Complementing previous work, we study the opposite operation, the splitting of articles, which is arguably the more natural operation for manipulation and which is also allowed within Google Scholar. We present numerous results on computational complexity (from linear-time algorithms to parameterized hardness results) and empirically indicate that at least small improvements of the h-index by splitting merged articles are easily achievable.","volume":"285","pages":"895–903","series":"Frontiers in Artificial Intelligence and Applications","keywords":"graph modification, NP-hard, parameterized complexity","bibtex":"@incollection{BKM+16,\n title =\t {H-Index Manipulation by Undoing Merges},\n author =\t {René van Bevern and Christian Komusiewicz and\n Hendrik Molter and Rolf Niedermeier and Manuel Sorge\n and Toby Walsh},\n doi =\t\t {10.3233/978-1-61499-672-9-895},\n year =\t {2016},\n date =\t {2016-08-29},\n booktitle =\t {ECAI 2016},\n editor =\t {Gal A. Kaminka and Maria Fox and Paolo Bouquet and\n Eyke Hüllermeier and Virginia Dignum and Frank\n Dignum and Frank van Harmelen},\n publisher =\t {IOS Press},\n abstract =\t {The h-index is one of the most important\n bibliographic measures used to assess the\n performance of researchers. Van Bevern et\n al. [Artif. Intel., in press] showed that, despite\n computational worst-case hardness results,\n substantial manipulation of the h-index of Google\n Scholar author profiles is possible by merging\n articles. Complementing previous work, we study the\n opposite operation, the splitting of articles, which\n is arguably the more natural operation for\n manipulation and which is also allowed within Google\n Scholar. We present numerous results on\n computational complexity (from linear-time\n algorithms to parameterized hardness results) and\n empirically indicate that at least small\n improvements of the h-index by splitting merged\n articles are easily achievable.},\n volume =\t {285},\n pages =\t {895--903},\n series =\t {Frontiers in Artificial Intelligence and\n Applications},\n keywords =\t {graph modification, NP-hard, parameterized\n complexity}\n}\n\n\n","author_short":["van Bevern, R.","Komusiewicz, C.","Molter, H.","Niedermeier, R.","Sorge, M.","Walsh, T."],"editor_short":["Kaminka, G. A.","Fox, M.","Bouquet, P.","Hüllermeier, E.","Dignum, V.","Dignum, F.","van Harmelen, F."],"key":"BKM+16","id":"BKM+16","bibbaseid":"vanbevern-komusiewicz-molter-niedermeier-sorge-walsh-hindexmanipulationbyundoingmerges-2016","role":"author","urls":{},"keyword":["graph modification","NP-hard","parameterized complexity"],"metadata":{"authorlinks":{"van bevern, r":"https://rvb.su/"}},"downloads":0,"html":""},"search_terms":["index","manipulation","undoing","merges","van bevern","komusiewicz","molter","niedermeier","sorge","walsh"],"keywords":["graph modification","np-hard","parameterized complexity"],"authorIDs":["2fwXJtKDCNhaSNr5s","5460adb6cff45d9c64000123","56dd6a97e8d527c5470000fa"],"dataSources":["SMwzc9Bzq5Np5ikev","G5GefJqqu2DtnCZXz"]}