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

DOI10.1016/j.ipl.2015.07.003zbMath1338.68085arXiv1410.3820WikidataQ59567441 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 complexity; reduction; NP-completeness; 3-partition; Google Scholar

Mathematics Subject Classification ID

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