Google Scholar makes it hard - The complexity of organizing one's publications

Information Processing Letters

Volumn 115, Issue 12, 2015, Pages 965-968

  Bodlaender, Hans L ^a   Van Kreveld, Marc ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

3 partition; Computational complexity; Google Scholar; NP completeness; Reduction

Indexed keywords

COMPUTATIONAL COMPLEXITY; MERGERS AND ACQUISITIONS; PAPER; REDUCTION; WEBSITES;

3-PARTITION; DECISION PROBLEMS; GOOGLE SCHOLAR; NP COMPLETE; NP-COMPLETENESS; PERSONAL PROFILE;

PUBLISHING;

EID: 84937128817     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2015.07.003     Document Type: Article

References (4)

1. René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, and Tony Walsh Manipulation by merging: models, theory, and experiments Proceedings of the 24th International Joint Conference on Artificial Intelligence 2015 AAAI Press
2. Michael R. Garey, and David S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 Freeman
3. Robert A. Hearn, and Erik D. Demaine Games, Puzzles, and Computation 2009 A K Peters
4. Bart de Keijzer, and Krzysztof R. Apt The H-index can be easily manipulated Bull. Eur. Assoc. Theor. Comput. Sci. 110 2013 79 85