Tootfinder

🐛 Using nanotechnology to target crop-munching pests and spare beneficial bugs
https://phys.org/news/2025-09-nanotechnology-crop-munching-pests-beneficial.html

Using nanotechnology to target crop-munching pests and spare beneficial bugs
A bane of farmers' existence, it's estimated that plant-eating pests are responsible for the loss of up to 40% of pre-harvest yields globally. But a new generation of crop treatments that target only "bad" bugs could mean big gains for the Canadian agriculture sector, improving pest management tools in an industry that in 2024 generated over $142 billion.

Zimmer called in a bomb threat
https://www.latimes.com/entertainment-arts/music/story/2025-10-03/future-ruins-nine-inch-nails-film-music-festival-is-called-off

Future Ruins, Nine Inch Nails' film-music festival, is canceled
The hotly-anticipated event from the band's Trent Reznor and Atticus Ross had been scheduled for Nov. 8.

Op BS brengt Micheal Persson even z'n column van 25 januari '25 in herinnering.
Grote vraag is wat we in de tussentijd gedaan hebben.
T meest springt wel in t ook de NLse kroonjuwelen van de overheid (data) in de Amerikaanse cloud gestald. 🙈
Maar vooral dat project 2025 en de gevolgen vooral compleet genegeerd zijn.
commentaar 25-1-25:
We zullen de VS moeten wantrouwen, is de les van een week Trump-II
https://www.volkskrant.nl/columns-opinie/we-zullen-de-vs-moeten-wantrouwen-is-de-les-van-een-week-trump-ii~bb8f275d/
(Via @mickpersson.bsky.social — Bluesky
https://bsky.app/profile/mickpersson.bsky.social/post/3m7bbbng3yc22 )

Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
Anton Herrmann, Christian Komusiewicz, Nils Morawietz, Frank Sommer
https://arxiv.org/abs/2510.08124 https:…

Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
A temporal graph is a finite sequence of graphs, called snapshots, over the same vertex set. Many temporal graph problems turn out to be much more difficult than their static counterparts. One such problem is \textsc{Timeline Vertex Cover} (also known as \textsc{MinTimeline$_\infty$}), a temporal analogue to the classical \textsc{Vertex Cover} problem. In this problem, one is given a temporal graph $\mathcal{G}$ and two integers $k$ and $\ell$, and the goal is to cover each edge of each snapsho…