Tootfinder

Opt-in global Mastodon full text search. Join the index!

No exact results. Similar results found.
@heiseonline@social.heise.de
2026-02-04 05:03:00

„Fallout Season 2“: Pointen, bis der Kopf platzt
Hinter dem Ende gibt es noch etwas zu lachen. Auch in Staffel 2 ist „Fallout“ dann am besten, wenn es gemeine Witze macht.
heise.de/te…

@cowboys@darktundra.xyz
2026-01-04 22:17:52

Full list of Cowboys' pending free agents entering 2026 NFL offseason si.com/nfl/cowboys/onsi/news/f

@stefan@gardenstate.social
2026-03-03 03:39:39

Ben Wiseman for the New Yorker ( January 2026)

Red hands all pointing at the blue hands and blue hands all pointing at the other blue hands.
@cowboys@darktundra.xyz
2026-02-03 14:34:29

Cowboys named best landing spot for Buccaneers $15 million pending free agent sportingnews.com/us/nfl/dallas

@kexpmusicbot@mastodonapp.uk
2026-03-03 23:56:02

🇺🇦 #NowPlaying on KEXP's #AfternoonShow
P.M. Dawn:
🎵 In the Presence of Mirrors
#PMDawn
open.spotify.com/track/7khTTaX

@arXiv_csDS_bot@mastoxiv.page
2026-02-03 07:46:26

Fanciful Figurines flip Free Flood-It -- Polynomial-Time Miniature Painting on Co-gem-free Graphs
Christian Rosenke, Mark Scheibner
arxiv.org/abs/2602.00690 arxiv.org/pdf/2602.00690 arxiv.org/html/2602.00690
arXiv:2602.00690v1 Announce Type: new
Abstract: Inspired by the eponymous hobby, we introduce Miniature Painting as the computational problem to paint a given graph $G=(V,E)$ according to a prescribed template $t \colon V \rightarrow C$, which assigns colors $C$ to the vertices of $G$. In this setting, the goal is to realize the template using a shortest possible sequence of brush strokes, where each stroke overwrites a connected vertex subset with a color in $C$. We show that this problem is equivalent to a reversal of the well-studied Free Flood-It game, in which a colored graph is decolored into a single color using as few moves as possible. This equivalence allows known complexity results for Free Flood-It to be transferred directly to Miniature Painting, including NP-hardness under severe structural restrictions, such as when $G$ is a grid, a tree, or a split graph. Our main contribution is a polynomial-time algorithm for Miniature Painting on graphs that are free of induced co-gems, a graph class that strictly generalizes cographs. As a direct consequence, Free Flood-It is also polynomial-time solvable on co-gem-free graphs, independent of the initial coloring.
toXiv_bot_toot

@ruth_mottram@fediscience.org
2026-02-02 10:28:34

Absolutely gorgeous essayWorth a read (via @…) by @tg that starts with why RSS clients look like email, but moves into SoMe and how we imported anxiety without cause.
Via @kottke
#design #ui #rss

ROV pilots filmed this giant phantom jelly, or Stygiomedusa gigantea,
at 253 meters during an ROV descent to explore the
Colorado-Rawson submarine canyon wall. #ArgentinianDeepSeeps

@cowboys@darktundra.xyz
2026-02-04 19:17:25

Pending Free Agent George Pickens Being Recruited by NFC Rival, Per CeeDee Lamb si.com/nfl/cowboys/onsi/news/p

Trump scolds CNN reporter Kaitlan Collins for not smiling as she asks about survivors of Epstein's abuse
Frustrated by her persistence in asking questions about Jeffrey Epstein during an Oval Office event
he wanted to use to promote himself and his party,
Donald Trump scolded the CNN correspondent Kaitlan Collins for supposedly not smiling enough in his presence.
The exchange began with Collins pointing out that Trump’s attempt to frame the disclosures in the late…