User talk:Vriendt

Hi Vriendt, welcome to Wikipedia, and thanks for your contributions. I wanted to let you know that I've reverted your edit at List of NP-complete problems. The referenced Masters thesis [https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=4e5e73b9ab844558cbbdfca0e8c76034b58ed78e] definitely contains a proof of the NP-completeness of Fillomino (or perhaps more precisely contains a proof of something that implies the NP-completeness of Fillomino); is it possible that there is confusion arising from the difference between the thesis of Yato and the published paper of the same title by Yato and Seta? --JBL (talk) 17:13, 24 April 2025 (UTC)

:Hi Jay, confusion did indeed arise due to overlapping titles. Vriendt (talk) 11:54, 25 April 2025 (UTC)

::Thanks for your quick response. Terribly confusing to have titled them the same. It's a very nice bachelor's thesis! JBL (talk) 23:56, 30 April 2025 (UTC)