Tootfinder

Ransomware Group Anubis has leaked what they extracted from Disneyland Paris
#ransomware

Ransomware.live 👀
Ransomware.live tracks ransomware groups and their activity. It was created by Julien Mousqueton, a security researcher. The website provides information on the groups' infrastructure, victims, and payment demands. It also includes a live map that shows the latest ransomware attacks.

The stability of independence polynomials of complete bipartite graphs
Guo Chen, Bo Ning, Jianhua Tu
https://arxiv.org/abs/2505.24381 https://

The stability of independence polynomials of complete bipartite graphs
The independence polynomial of a graph is termed {\it stable} if all its roots are located in the left half-plane $\{z \in \mathbb{C} : \mathrm{Re}(z) \leq 0\}$, and the graph itself is also referred to as stable. Brown and Cameron (Electron. J. Combin. 25(1) (2018) \#P1.46) proved that the complete bipartite graph $K_{1,n}$ is stable and posed the question: \textbf{Are all complete bipartite graphs stable?} We answer this question by establishing the following results: \begin{itemize} \i…

We in Game Workers Unite Ireland stand in solidarity with Animation Workers of Ireland, and the international trade union coalition happening to organise against the threat of AI in the animation industry, and we support their call to acton.
Join them Thursday 12 June at 14:00 at the Pâquier in Annecy!!
#Animation

Cardinalities of the total number of independent sets
Benedek Kov\'acs, Zolt\'an L\'or\'ant Nagy
https://arxiv.org/abs/2505.24794 https://

Cardinalities of the total number of independent sets
We study the set of numbers the total number of independent sets can admit in $n$-vertex graphs. In this paper, we prove that the cardinality of this set $\mathcal{N}i(n)$ is very close to $2^n$ in the following sense: $\mathcal{N}i(n)/2^n = O(n^{-1/5})$ while for infinitely many $n$, we have $\log_2(\mathcal{N}i(n)/2^n)\ge -2^{(1+o(1)\sqrt{\log_2 n}}$. This set is also precisely the set of possible values of the independence polynomial $I_G(x)$ at $x=1$ for $n$-vertex graphs $G$. As an applica…

Escher Tile Deformation via Closed-Form Solution
Crane He Chen, Vladimir G. Kim
https://arxiv.org/abs/2506.23388 https://arxiv.org/pd…

Escher Tile Deformation via Closed-Form Solution
We present a real-time deformation method for Escher tiles -- interlocking organic forms that seamlessly tessellate the plane following symmetry rules. We formulate the problem as determining a periodic displacement field. The goal is to deform Escher tiles without introducing gaps or overlaps. The resulting displacement field is obtained in closed form by an analytical solution. Our method processes tiles of 17 wallpaper groups across various representations such as images and meshes. Rather t…

#ZenBrowser is considering to change the behaviour of windows in the following way:
- Two windows of the same workspace show the exact same tabs.
- Tabs are not lost when closing a window.
- In order to create a new, empty window, you first need to create a new workspace.
Any opinions? I find that quite weird and don't understand the purpose. 🤔

»One of Mr. Reagan's advisers, David Stockman, later wrote that the real aim of fiscal policy was to create a ›strategic deficit‹ that would slam the door and reduce the size of the federal government.« https://www.nytimes.com/2004/06/07/opinion/ronald-reagan.html

Me (to myself): Get in to work early this morning, with no messing about on the way in. Just 'a to b', fast and efficient!
Also me: [Leaves very late, grabs a unicycle and proceeds to cycling in via the following route]
🤷
https://www.strava.com/activities/14824892

Graphics4Science: Computer Graphics for Scientific Impacts
Peter Yichen Chen, Minghao Guo, Hanspeter Pfister, Ming Lin, William Freeman, Qixing Huang, Han-Wei Shen, Wojciech Matusik
https://arxiv.org/abs/2506.15786

Graphics4Science: Computer Graphics for Scientific Impacts
Computer graphics, often associated with films, games, and visual effects, has long been a powerful tool for addressing scientific challenges--from its origins in 3D visualization for medical imaging to its role in modern computational modeling and simulation. This course explores the deep and evolving relationship between computer graphics and science, highlighting past achievements, ongoing contributions, and open questions that remain. We show how core methods, such as geometric reasoning an…

Edge-colouring and orientations: applications to degree-boundedness and $\chi$-boundedness
Arnab Char, Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta
https://arxiv.org/abs/2506.23054

Edge-colouring and orientations: applications to degree-boundedness and $χ$-boundedness
We prove that every $2$-edge-coloured graph with sufficiently large minimum degree contains a monochromatic induced subgraph whose minimum degree remains large. As a consequence, we deduce that some classes of graphs are degree-bounded. A class $\mathcal{G}$ is {\it degree-bounded} if, for every integer $s$, there exists $d=d(s)$ such that every graph $G\in \mathcal{G}$ either contains $K_{s,s}$ or has minimum degree at most $d$. We obtain that the following classes are degree-bounded: (i) fo…