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

DOI10.1016/J.IPL.2015.07.003zbMath1338.68085DBLPjournals/ipl/BodlaenderK15arXiv1410.3820OpenAlexW1941137907WikidataQ59567441 ScholiaQ59567441MaRDI QIDQ495683

Hans L. Bodlaender, Marc J. van Kreveld

Publication date: 15 September 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.3820

zbMATH Keywords

computational complexityreductionNP-completeness3-partitionGoogle Scholar

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

\(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments

Cites Work

• \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Google Scholar makes it hard -- the complexity of organizing one's publications