Tootfinder

🇺🇦 Auf radioeins läuft...
Piero Imiliani:
🎵 Mah-nš-mah-nš (Short Version)
#NowPlaying #PieroImiliani
https://righttempo.bandcamp.com/album/mah-n-mah-n-remixes-vol-1
https://open.spotify.com/track/3Mz27X48Ey7MbfLOmSzkBK

Für das #Drittmittelprojekt „#Desinformation im multilingualen Kontext verstehen und vorbeugen“ sucht das Frankfurter #Leibniz-Institut

from my link log —
Deterministic primality testing for limited bit width.
https://www.jeremykun.com/2026/04/07/deterministic-miller-rabin/
saved 2026-04-10

Can This Chaotic Brooklyn Plaza Be Car-Free? Mamdani Says Yes. (Stefanos Chen/New York Times)
https://www.nytimes.com/2026/04/13/nyregion/grand-army-plaza-prospect-park-brooklyn.html?unlocked_article_code=1.alA.HtiZ.SKi48s7mAG0i&smid=nytcore-ios-share
http://www.memeorandum.com/260413/p41#a260413p41

L'arrêt n'est pas desservi Š Concorde en raison de mesures de sécurité.
🤖 12/03 15:49

It looks like Hungary has a long road ahead: Orbšn will almost certainly fight the results and try to throw things into chaos, his party’s tentacles still run wide and deep throughout Hungarian institutions, getting Putinism out of the dark corners of power there will be like ending a bedbug infestation, and Orbšn’s likely replacement…um, well, he doesn’t seem like the greatest guy on earth.
EDIT: My first prediction above was wrong! I hope my others are too.
1/

Ach ... De hele geschiedenis van de landbouw door de ogen van Louise Fresco is nog in zn geheel terug te kijken.
Een serie in zes delen van zo'n 40 minuten.
Fresco’s paradise, part 1: The Source - YouTube
#LouiseFresco #FrescosParadise #Human

« Vous n’avez pas de regrets de devoir tuer ? » : dans le Transsibérien, chroniques de soldats russes de retour d’Ukraine
https://www.lemonde.fr…

« Vous n’avez pas de regrets de devoir tuer ? » : dans le Transsibérien, chroniques de soldats russes de retour d’Ukraine
« A bord du Transsibérien » (2/2). Dans le train qui file vers l’Extrême-Orient, entre Novossibirsk et Vladivostok, début janvier, la violence de la guerre en Ukraine est au cœur des conversations entre soldats en permission et passagers « ordinaires ».

POSTDOCTORAL POSITION> University of Toronto, Department for the Study of Religion & The Robert H.N. Ho Family Foundation Centre for Buddhist Studies
https://ift.tt/NWaGujy
Slave subjectivities in the Iberian Worlds (15th- 20th centuries) Date: October 31,…
via Input 4 RELCFP

Space Complexity Dichotomies for Subgraph Finding Problems in the Streaming Model
Yu-Sheng Shih, Meng-Tsung Tsai, Yen-Chu Tsai, Ying-Sian Wu
https://arxiv.org/abs/2602.08002 https://arxiv.org/pdf/2602.08002 https://arxiv.org/html/2602.08002
arXiv:2602.08002v1 Announce Type: new
Abstract: We study the space complexity of four variants of the standard subgraph finding problem in the streaming model. Specifically, given an $n$-vertex input graph and a fixed-size pattern graph, we consider two settings: undirected simple graphs, denoted by $G$ and $H$, and oriented graphs, denoted by $\vec{G}$ and $\vec{H}$. Depending on the setting, the task is to decide whether $G$ contains $H$ as a subgraph or as an induced subgraph, or whether $\vec{G}$ contains $\vec{H}$ as a subgraph or as an induced subgraph. Let Sub$(H)$, IndSub$(H)$, Sub$(\vec{H})$, and IndSub$(\vec{H})$ denote these four variants, respectively.
An oriented graph is well-oriented if it admits a bipartition in which every arc is oriented from one part to the other, and a vertex is non-well-oriented if both its in-degree and out-degree are non-zero. For each variant, we obtain a complete dichotomy theorem, briefly summarized as follows.
(1) Sub$(H)$ can be solved by an $\tilde{O}(1)$-pass $n^{2-\Omega(1)}$-space algorithm if and only if $H$ is bipartite.
(2) IndSub$(H)$ can be solved by an $\tilde{O}(1)$-pass $n^{2-\Omega(1)}$-space algorithm if and only if $H \in \{P_3, P_4, co\mbox{-}P_3\}$.
(3) Sub$(\vec{H})$ can be solved by a single-pass $n^{2-\Omega(1)}$-space algorithm if and only if every connected component of $\vec H$ is either a well-oriented bipartite graph or a tree containing at most one non-well-oriented vertex.
(4) IndSub$(\vec{H})$ can be solved by an $\tilde{O}(1)$-pass $n^{2-\Omega(1)}$-space algorithm if and only if the underlying undirected simple graph $H$ is a $co\mbox{-}P_3$.
toXiv_bot_toot

RE: https://machteburch.social/@tomkalei/116350882561601727
Der Freischaltbrief kam (war normalgroß und grau übrigens) und ich konnte jetzt den ersten Antrag stellen.
Das Prinzip ist sehr "kundenfreundlich": Man sammelt Fotos von seinen Rechnungen in der App und irgendwann klickt man Antrag einreichen und fertig.
Zu den Fotos kann man noch Metadaten speichern wie "für welches Familienmitglied", "Typ der Rechnung", "Betrag", aber das ist alles optional.
Das trägt dem Prinzip Rechnung, dass sowieso ALLES von der Beihilfe stelle nochmal ... 1/n

NFL Insider Rips Cowboys' Optimistic Message After Day 1 of NFL Free Agency https://www.si.com/nfl/cowboys/onsi/news/nfl-insider-rips-dallas-cowboys-optimistic-message-day-1-nfl-free-agency

"How Viktor Orbšn laid traps to stop his successor from running #Hungary"
"The country’s current leader has put loyalists in key public institutions who will be able to thwart the budgets and legislation of any new prime minister. "
Let's cross fingers
https://www.politico.eu/article/viktor-orban-laid-traps-stop-successor-running-hungary/

“In Trump’s war on global justice, court staff and U.N. face terrorist‑grade sanctions … Trump’s sanctions on U.N. expert Francesca Albanese and the International Criminal Court froze assets and disrupted war crimes investigations.”
https://www.reut…

La valse annuelle des bonnes surprises des comptes publics commence: Une nouvelle fois, les comptes de l’Etat de Genève seront meilleurs que prévu. Le Temps a appris qu’au lieu d’un déficit de 255,7 millions de francs, c’est un excédent d’environ 50 millions de francs que le canton a enregistré en 2025. https://www.letemps.ch/suisse/geneve/une-nouvelle-fois-les-comptes-de-l-etat-de-geneve-seront-meilleurs-que-prevus

Raiders firman al Receptor Jalen Nailor https://www.raiders.com/news/raiders-firman-al-receptor-jalen-nailor

RE: https://social.heise.de/@heiseonline/116390268805582702
We mogen in NL toch wel blij zijn dat we in zo'n klein dichtbevolkt kikkerlandje leven met een grond onder onze voeten waar je zo een schep in zet om een kabeltje meer of minder te trekken ...
Ondertussen in Duitsland: (ook in 🇬🇧 )

"10% of the ocean is protected. Now just 20% more to go"
#Oceans #Environment
https://

10% of the ocean is protected. Now just 20% more to go
More than 10% of the world’s ocean is now protected to some degree, marking significant progress in global ocean conservation efforts, according to an Apr. 1. annoucement from the U.N. Environment Programme’s World Conservation Monitoring Centre (UNEP-WCMC). However, this accomplishment comes six years behind schedule, and experts warn that efforts must pick up speed to […]

aktuelles #Wetter #Behrendorf #Wische 13-02-2026 12:55
Temperatur: (min: 0,3C) 1,1C (max: 1,2C)
Feuchte: 99%
Luftdruck: 992,7 hPa (langsam steigend)
Windrichtung: N/A Grad
W…

So the new #Kreutz #comet #MAPS is *still* following the constant rapid rise in brightness it has shown since discovery: a dumb extrapolation - https://cobs.si/analysis/?comet=2688&from_date=2026-01-15 00:00&to_date=2026-04-30 00:00&observation_type=V&observation_type=C&plot_x_value=1&plot_y_value=1&fit_option=1&exclude_faint=on&exclude_issue=on&observer=&association=&country=&compare_values=compare - has it get 10,000-times brighter than the Sun at its extremely close perihelion which makes so sense at all, of course, physically.
"It must therefore be assumed that this increase in activity will level off significantly in the near future," writes https://fg-kometen.vdsastro.de/koj_2026/c2026a1/26a1eaus.htm: "More likely are parameters m m0=12.0 mag / n=4 (or even lower), which would still result in a (very short-term) maximum brightness of about –9 mag (but this would probably still be significantly too bright) – always assuming that the comet survives its perihelion passage unscathed."
For other views see http://www.cbat.eps.harvard.edu/iau/cbet/005600/CBET005663.txt and https://arxiv.org/abs/2602.17626 and https://www.facebook.com/photo?fbid=10236580364221799 and https://cometografia.es/cometa-kreutz-2026-a1-maps-analisis/ - and the actual brightness is tracked at https://cobs.si/obs_list?id=2688 where it has reached ~11.5 mag. now.

Batteries fully charged. Flashlights are ready. UPS for router and mesh system ready, only thing connected to it is the router. UPS behind TV is ready, but, that is only for the TV. Third UPS is beside me here, fully charged and ready to go. Last UPS is connected to the upstairs mesh device. Turned up the thermostat so when (not if) we lose power the house will stay warm enough for a few hours.
Still checking out the battery backup systems, but have to save enough to buy one (acc…

Something about being German very consciously, after all those years living in Switzerland, and science history
I'm currently in Mannheim, hotel prices are triple the usual, almost all hotels fully booked. I learned that’s because of “der Kongress ist bis Samstag!”
1/n

Fancy some #DungeonCrawlClassics, face-to-face? Hungering for wild sorcery and Appendix N-inspired heroism? Ticketing for Walter's Burly Griffins' March meetup is live!
We're running three adventures concurrently this month:
• When Tolls the Bell of Ruin (level 1)
• The Emerald Enchanter (level 2)
• The Sea Queen Escapes! (level 3)
Saturday, March 2…

Walter’s Burly Griffins March 2026 - Dungeon Crawl Classics
Walter’s Burly Griffins invites you to their monthly open table to meet and play Dungeon Crawl Classics TTRPG with fellow adventurers.

Die gute Nachricht aus Spiegel Online:
"Orbšn gratuliert Oppositionsführer Magyar zum Sieg – mehr als 50 Prozent der Stimmen ausgezählt"

Die meisten meiner Belege sind für die Kinder und bei "Patient" kann man in der App nur sich selbst auswählen. Irgendwo in den Menüs kann man Kinder anlegen, aber da steht, dass das keinen Effekt hat. Das habe ich jetzt mal unter "Beihilfestelle prüft eh alles" verbucht und einfach wild durcheinander alle Belege eingereicht. Auf dem Papierantrag stand immer: Bitte Belege nach Berechtigtem sortieren. Das ist in der App nicht möglich. 4/n

Starting April 1, 2026, the Indian government will effectively ban Chinese video surveillance giants, including Hikvision, Dahua, and TP-Link, from selling internet-connected CCTV cameras in the country.
https://cybersecuritynews.com/india-ban-cctv-products/?mid=1#cid…

India Set to Ban Sale of Hikvision, TP-Link, CCTV Products From April
Starting April 1, 2026, the Indian government will effectively ban Chinese video surveillance giants, including Hikvision, Dahua, and TP-Link, from selling internet-connected CCTV cameras in the country.

Nick Shook 2026 NFL mock draft 1.0: Jets, Bills load up at WR; Cardinals jump on RB https://www.nfl.com/news/nick-shook-2026-nfl-mock-draft-1-0-jets-bills-load-up-at-wr-cardinals-jump-on-rb

Local Computation Algorithms for (Minimum) Spanning Trees on Expander Graphs
Pan Peng, Yuyang Wang
https://arxiv.org/abs/2602.07394 https://arxiv.org/pdf/2602.07394 https://arxiv.org/html/2602.07394
arXiv:2602.07394v1 Announce Type: new
Abstract: We study \emph{local computation algorithms (LCAs)} for constructing spanning trees. In this setting, the goal is to locally determine, for each edge $ e \in E $, whether it belongs to a spanning tree $ T $ of the input graph $ G $, where $ T $ is defined implicitly by $ G $ and the randomness of the algorithm. It is known that LCAs for spanning trees do not exist in general graphs, even for simple graph families. We identify a natural and well-studied class of graphs -- \emph{expander graphs} -- that do admit \emph{sublinear-time} LCAs for spanning trees. This is perhaps surprising, as previous work on expanders only succeeded in designing LCAs for \emph{sparse spanning subgraphs}, rather than full spanning trees. We design an LCA with probe complexity $ O\left(\sqrt{n}\left(\frac{\log^2 n}{\phi^2} d\right)\right)$ for graphs with conductance at least $ \phi $ and maximum degree at most $ d $ (not necessarily constant), which is nearly optimal when $\phi$ and $d$ are constants, since $\Omega(\sqrt{n})$ probes are necessary even for expanders. Next, we show that for the natural class of \emph{\ER graphs} $ G(n, p) $ with $ np = n^{\delta} $ for any constant $ \delta > 0 $ (which are expanders with high probability), the $ \sqrt{n} $ lower bound can be bypassed. Specifically, we give an \emph{average-case} LCA for such graphs with probe complexity $ \tilde{O}(\sqrt{n^{1 - \delta}})$.
Finally, we extend our techniques to design LCAs for the \emph{minimum spanning tree (MST)} problem on weighted expander graphs. Specifically, given a $d$-regular unweighted graph $\bar{G}$ with sufficiently strong expansion, we consider the weighted graph $G$ obtained by assigning to each edge an independent and uniform random weight from $\{1,\ldots,W\}$, where $W = O(d)$. We show that there exists an LCA that is consistent with an exact MST of $G$, with probe complexity $\tilde{O}(\sqrt{n}d^2)$.
toXiv_bot_toot

We have no clear understanding of what leverage Putin may have gained over senior levels of the U.S. government,
whether to extract state secrets or to shape decision-making
and be used for leverage on the global stage
https://mstdn.social/@NTOY/116010660849818682

aktuelles #Wetter #Behrendorf #Wische 13-02-2026 10:55
Temperatur: (min: 0,3C) 1,0C (max: 1,2C)
Feuchte: 99%
Luftdruck: 991,5 hPa (langsam steigend)
Windrichtung: N/A Grad
W…

🇺🇦 #NowPlaying on #KEXP's #PacificNotions
ToŠn:
🎵 DEL 1
#Toàn
🎶 show playlist 👇
https://open.spotify.com/playlist/6iDfAS4fe0RJYA6CWTyzvq
🎶 KEXP playlist 👇
https://open.spotify.com/playlist/6VNALrOa3gWbk794YuIrwg

Replaced article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- Compatibility of trapped ions and dielectrics at cryogenic temperatures
M. Bruff, L. Sonderhouse, K. N. David, J. Stuart, D. H. Slichter, D. Leibfried

Alexander Brothers Found Guilty on All Counts in Sex-Trafficking Trial (New York Times)
https://www.nytimes.com/2026/03/09/nyregion/verdict-alexander-brothers-sex-trafficking.html?unlocked_article_code=1.R1A.H4ak.mcLfw3sEs_sl&smid=nytcore-ios-share
http://www.memeorandum.com/260309/p150#a260309p150

POSTDOCTORAL POSITION> University of Toronto, Department for the Study of Religion & The Robert H.N. Ho Family Foundation Centre for Buddhist Studies https://networks.h-net.org/group/announcements/20140643/postdoct…

Ohne jede Häme: die Zufriedenheit mit der Arbeit des Bundeskanzlers ist bei 24%. Das ist nicht viel. Dreiviertel der Befragten sind unzufrieden.
Jetzt wird er meinen, das liegt daran, dass der (nächste) Herbst der Entscheidungen noch kommt. Aber aktuell sieht es für mich so aus, dass mit jeder Entscheidung, die Unzufriedenheit wächst, auch mit seinem Personal.
Manche denken es #Reiche …

Exceptional rains in Spain, roads, railways cut.
MAPA | Qué carreteras estšn afectadas por la borrasca Leonardo: consulta el mapa de la DGT en directo

MAPA | Qué carreteras están afectadas por la borrasca Leonardo: consulta el mapa de la DGT en directo
Hay más de un centenar de carreteras cortadas por inundaciones y desprendimientos, la mayoría localizadas en Andalucía

gestellt, wo man das Foto dann manuell auslösen und danach die Eckenerkennung manuell bestätigen muss.
Die App funktioniert überhaupt nicht mit Passwortmanagern wie 1Password zusammen. Der Login ist geprägt von mehreren widersprüchlichen Dialogen die gleichzeitig das Passwort aus dem Passwortmanager ziehen wollen und einen neuen Eintrag im PW-Manager anlegen wollen und das sowohl für 1Password als auch für den iOS PW-Manager. 3/n

"10% of the ocean is protected. Now just 20% more to go"
#Oceans #Environment
https://

10% of the ocean is protected. Now just 20% more to go
More than 10% of the world’s ocean is now protected to some degree, marking significant progress in global ocean conservation efforts, according to an Apr. 1. annoucement from the U.N. Environment Programme’s World Conservation Monitoring Centre (UNEP-WCMC). However, this accomplishment comes six years behind schedule, and experts warn that efforts must pick up speed to […]

aktuelles #Wetter #Behrendorf #Wische 13-01-2026 09:05
Temperatur: (min: 0,2C) 1,9C (max: 1,9C)
Feuchte: 99%
Luftdruck: 1012,2 hPa (langsam steigend)
Windrichtung: N/A Grad
…

The #Kreutz #comet #MAPS "has become more than 1 mag brighter between March 6 and 9" and stands at 10.5 mag. right now: https://groups.io/g/comets-ml/message/35019 and https://www.facebook.com/photo/?fbid=2374472359736249 with the latest picture by Jäger & Rhemann here - less than 4 weeks til perihelion, and the brightness continues to rise with a strong n~8 ...

Neighborhood-Aware Graph Labeling Problem
Mohammad Shahverdikondori, Sepehr Elahi, Patrick Thiran, Negar Kiyavash
https://arxiv.org/abs/2602.08098 https://arxiv.org/pdf/2602.08098 https://arxiv.org/html/2602.08098
arXiv:2602.08098v1 Announce Type: new
Abstract: Motivated by optimization oracles in bandits with network interference, we study the Neighborhood-Aware Graph Labeling (NAGL) problem. Given a graph $G = (V,E)$, a label set of size $L$, and local reward functions $f_v$ accessed via evaluation oracles, the objective is to assign labels to maximize $\sum_{v \in V} f_v(x_{N[v]})$, where each term depends on the closed neighborhood of $v$. Two vertices co-occur in some neighborhood term exactly when their distance in $G$ is at most $2$, so the dependency graph is the squared graph $G^2$ and $\mathrm{tw}(G^2)$ governs exact algorithms and matching fine-grained lower bounds. Accordingly, we show that this dependence is inherent: NAGL is NP-hard even on star graphs with binary labels and, assuming SETH, admits no $(L-\varepsilon)^{\mathrm{tw}(G^2)}\cdot n^{O(1)}$-time algorithm for any $\varepsilon>0$. We match this with an exact dynamic program on a tree decomposition of $G^2$ running in $O\!\left(n\cdot \mathrm{tw}(G^2)\cdot L^{\mathrm{tw}(G^2) 1}\right)$ time. For approximation, unless $\mathsf{P}=\mathsf{NP}$, for every $\varepsilon>0$ there is no polynomial-time $n^{1-\varepsilon}$-approximation on general graphs even under the promise $\mathrm{OPT}>0$; without the promise $\mathrm{OPT}>0$, no finite multiplicative approximation ratio is possible. In the nonnegative-reward regime, we give polynomial-time approximation algorithms for NAGL in two settings: (i) given a proper $q$-coloring of $G^2$, we obtain a $1/q$-approximation; and (ii) on planar graphs of bounded maximum degree, we develop a Baker-type polynomial-time approximation scheme (PTAS), which becomes an efficient PTAS (EPTAS) when $L$ is constant.
toXiv_bot_toot

Le fisc, en voulant cacher aux tribunaux qu’il n’appliquait pas correctement le bouclier voté par le peuple, s’est donc retrouvé avec des grosses fortunes taxées Š… zéro.
Que savait Broulis? Il se comprenait comme expert en fisc, donc il serait incompréhensible s'il n'avait pas une compréhension profonde de la mécanique du système
https://www.letemps.ch/suisse/vaud/scandale-du-bouclier-fiscal-pascal-broulis-pouvait-il-vraiment-ignorer-les-irregularites-avant-2019

... geprüft werden muss. Das war schon immer komisch konzipiert beim Papierantrag. Eine große vorgedruckte Tabelle wo man alles eintragen "sollte" und dann irgendwo klein der Hinweis: "Das Ausfüllen der Tabelle steht ihnen frei." oder so.
That said, die App hat noch viele Kinderkrankheiten. Unter anderem:
- Der Foto-Modus hat eine "Automatisch"-Funktion, bei der ein A4 Blatt wie bei einer Scan App automatisch erkannt und dann gerade gerückt wird. Diese ist bei jedem Beleg wieder auf manuell 2/n

aktuelles #Wetter #Behrendorf #Wische 13-01-2026 08:45
Temperatur: (min: 0,2C) 1,7C (max: 1,7C)
Feuchte: 99%
Luftdruck: 1011,9 hPa (langsam steigend)
Windrichtung: N/A Grad
…

Now that the Super Bowl is over, here's what to know about the 2026 NFL Draft

https://www.cbssports.com/nfl/draft/news/nfl-draft-2026-where-to-watch-date-tim…

POSTDOCTORAL POSITION> University of Toronto, Department for the Study of Religion & The Robert H.N. Ho Family Foundation Centre for Buddhist Studies
https://ift.tt/0GzPZnT
Slave subjectivities in the Iberian Worlds (15th- 20th centuries) Date: October 31,…
via Input 4 RELCFP

aktuelles #Wetter #Behrendorf #Wische 13-01-2026 07:45
Temperatur: (min: 0,2C) 1,5C (max: 1,6C)
Feuchte: 99%
Luftdruck: 1011,7 hPa (langsam steigend)
Windrichtung: N/A Grad
…

🇺🇦 #NowPlaying on KEXP's #SonicReducer
D.O.A.:
🎵 World War 3
#DOA
https://bromtollargesse.bandcamp.com/track/fr1k-h-rh1z-m-1k-w-r-m-ch1n-3-n-m-d-gy-02-u-n-1-3-d

"No vamos a ser cómplices de algo que es malo para el mundo simplemente por el miedo a las represalias de algunos.”
''We won't be complicit with something that is bad for the world simply for fear of reprisals from some quarters."
Pedro Sšnchez le aguanta el pulso a Donald Trump con la guerra de Iršn

Sánchez le aguanta el pulso a Donald Trump con la guerra de Irán
El presidente advierte de que su política exterior no la marcará "el miedo a las represalias" y se erige en portavoz del 'no a la guerra' frente a las amenazas de Estados Unidos; la Casa Blanca aseguró este miércoles que España cedía a la presión para "cooperar militarmente" pero el Gobierno lo ...

🇺🇦 Auf radioeins läuft...
Piero Imiliani:
🎵 Mah-nš-mah-nš (Short Version)
#NowPlaying #PieroImiliani
https://righttempo.bandcamp.com/album/mah-n-mah-n-remixes-vol-1
https://open.spotify.com/track/3Mz27X48Ey7MbfLOmSzkBK

A polynomial-time algorithm for recognizing high-bandwidth graphs
Luis M. B. Varona
https://arxiv.org/abs/2602.01755 https://arxiv.org/pdf/2602.01755 https://arxiv.org/html/2602.01755
arXiv:2602.01755v1 Announce Type: new
Abstract: An unweighted, undirected graph $G$ on $n$ nodes is said to have \emph{bandwidth} at most $k$ if its nodes can be labelled from $0$ to $n - 1$ such that no two adjacent nodes have labels that differ by more than $k$. It is known that one can decide whether the bandwidth of $G$ is at most $k$ in $O(n^k)$ time and $O(n^k)$ space using dynamic programming techniques. For small $k$ close to $0$, this approach is effectively polynomial, but as $k$ scales with $n$, it becomes superexponential, requiring up to $O(n^{n - 1})$ time (where $n - 1$ is the maximum possible bandwidth). In this paper, we reformulate the problem in terms of bipartite matching for sufficiently large $k \ge \lfloor (n - 1)/2 \rfloor$, allowing us to use Hall's marriage theorem to develop an algorithm that runs in $O(n^{n - k 1})$ time and $O(n)$ auxiliary space (beyond storage of the input graph). This yields polynomial complexity for large $k$ close to $n - 1$, demonstrating that the bandwidth recognition problem is solvable in polynomial time whenever either $k$ or $n - k$ remains small.
toXiv_bot_toot

aktuelles #Wetter #Behrendorf #Wische 13-01-2026 06:45
Temperatur: (min: 0,2C) 1,0C (max: 1,0C)
Feuchte: 99%
Luftdruck: 1011,2 hPa (langsam steigend)
Windrichtung: N/A Grad
…

POSTDOCTORAL POSITION> University of Toronto, Department for the Study of Religion & The Robert H.N. Ho Family Foundation Centre for Buddhist Studies https://networks.h-net.org/group/announcements/20140643/postdoct…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 21:35
Temperatur: (min: 1,7C) 3,2C (max: 6,3C)
Feuchte: 99%
Luftdruck: 983,1 hPa (gleichbleibend)
Windrichtung: N/A Grad
Win…

OK, der Zahnarzt hat sich von seiner Frau getrennt und da musste der Name der Praxis geändert werden. Zeit also, die sogenannte professionelle Zahnreinigung um 25% teuerer zu machen, aber außerdem muss ich alle Einwilligungen nochmal unterschreiben und werde begrüßt mit „Ich bräuchte dann nochmal ein paar Unterschriften“.
🧵über individuelle vs. globale “Problemlösung” 1/n

aktuelles #Wetter #Behrendorf #Wische 13-02-2026 04:55
Temperatur: (min: 0,3C) 0,3C (max: 1,2C)
Feuchte: 99%
Luftdruck: 988,1 hPa (stark steigend)
Windrichtung: N/A Grad
Win…

Approximate Cartesian Tree Matching with Substitutions
Panagiotis Charalampopoulos, Jonas Ellert, Manal Mohamed
https://arxiv.org/abs/2602.08570 https://arxiv.org/pdf/2602.08570 https://arxiv.org/html/2602.08570
arXiv:2602.08570v1 Announce Type: new
Abstract: The Cartesian tree of a sequence captures the relative order of the sequence's elements. In recent years, Cartesian tree matching has attracted considerable attention, particularly due to its applications in time series analysis. Consider a text $T$ of length $n$ and a pattern $P$ of length $m$. In the exact Cartesian tree matching problem, the task is to find all length-$m$ fragments of $T$ whose Cartesian tree coincides with the Cartesian tree $CT(P)$ of the pattern. Although the exact version of the problem can be solved in linear time [Park et al., TCS 2020], it remains rather restrictive; for example, it is not robust to outliers in the pattern.
To overcome this limitation, we consider the approximate setting, where the goal is to identify all fragments of $T$ that are close to some string whose Cartesian tree matches $CT(P)$. In this work, we quantify closeness via the widely used Hamming distance metric. For a given integer parameter $k>0$, we present an algorithm that computes all fragments of $T$ that are at Hamming distance at most $k$ from a string whose Cartesian tree matches $CT(P)$. Our algorithm runs in time $\mathcal O(n \sqrt{m} \cdot k^{2.5})$ for $k \leq m^{1/5}$ and in time $\mathcal O(nk^5)$ for $k \geq m^{1/5}$, thereby improving upon the state-of-the-art $\mathcal O(nmk)$-time algorithm of Kim and Han [TCS 2025] in the regime $k = o(m^{1/4})$.
On the way to our solution, we develop a toolbox of independent interest. First, we introduce a new notion of periodicity in Cartesian trees. Then, we lift multiple well-known combinatorial and algorithmic results for string matching and periodicity in strings to Cartesian tree matching and periodicity in Cartesian trees.
toXiv_bot_toot

aktuelles #Wetter #Behrendorf #Wische 13-02-2026 13:55
Temperatur: (min: 0,3C) 0,5C (max: 1,2C)
Feuchte: 99%
Luftdruck: 993,1 hPa (langsam steigend)
Windrichtung: N/A Grad
W…

aktuelles #Wetter #Behrendorf #Wische 13-02-2026 06:55
Temperatur: (min: 0,3C) 0,3C (max: 1,2C)
Feuchte: 99%
Luftdruck: 989,1 hPa (langsam steigend)
Windrichtung: N/A Grad
W…

aktuelles #Wetter #Behrendorf #Wische 13-02-2026 15:55
Temperatur: (min: 0,3C) 0,3C (max: 1,2C)
Feuchte: 99%
Luftdruck: 994,1 hPa (langsam steigend)
Windrichtung: N/A Grad
W…

Replaced article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- Language Generation in the Limit: Noise, Loss, and Feedback
Yannan Bai, Debmalya Panigrahi, Ian Zhang
https://arxiv.org/abs/2507.15319 https://mastoxiv.page/@arXiv_csDS_bot/114896208560390692
- Online Firefighting on Cactus Graphs
Max Hugen, Bob Krekelberg, Alison Hsiang-Hsuan Liu
https://arxiv.org/abs/2509.22277 https://mastoxiv.page/@arXiv_csDS_bot/115286656155128312
- Improved Extended Regular Expression Matching
Philip Bille, Inge Li G{\o}rtz, Rikke Schjeldrup Jessen
https://arxiv.org/abs/2510.09311 https://mastoxiv.page/@arXiv_csDS_bot/115365884736976741
- Robust Algorithms for Finding Cliques in Random Intersection Graphs via Sum-of-Squares
Andreas G\"obel, Janosch Ruff, Leon Schiller
https://arxiv.org/abs/2511.20376 https://mastoxiv.page/@arXiv_csDS_bot/115614988823215273
- Analysis of Shuffling Beyond Pure Local Differential Privacy
Shun Takagi, Seng Pei Liew
https://arxiv.org/abs/2601.19154 https://mastoxiv.page/@arXiv_csDS_bot/115971701218309765
- Exact (n 2) Comparison Complexity for the N-Repeated Element Problem
Andrew Au
https://arxiv.org/abs/2601.21202 https://mastoxiv.page/@arXiv_csDS_bot/115982906572495225
- A Multi-Token Coordinate Descent Method for Semi-Decentralized Vertical Federated Learning
Pedro Valdeira, Yuejie Chi, Cl\'audia Soares, Jo\~ao Xavier
https://arxiv.org/abs/2309.09977
- Optimal Sequential Flows
Hugo Gimbert, Corto Mascle, Patrick Totzke
https://arxiv.org/abs/2511.13806 https://mastoxiv.page/@arXiv_mathOC_bot/115575399809016779
toXiv_bot_toot

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 16:35
Temperatur: (min: 1,7C) 4,5C (max: 6,3C)
Feuchte: 99%
Luftdruck: 983,9 hPa (gleichbleibend)
Windrichtung: N/A Grad
Win…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 22:05
Temperatur: (min: 1,7C) 3,2C (max: 6,3C)
Feuchte: 99%
Luftdruck: 983,2 hPa (gleichbleibend)
Windrichtung: N/A Grad
Win…

Fast Makespan Minimization via Short ILPs
Danny Hermelin, Dvir Shabtay
https://arxiv.org/abs/2602.06514 https://arxiv.org/pdf/2602.06514 https://arxiv.org/html/2602.06514
arXiv:2602.06514v1 Announce Type: new
Abstract: Short integer linear programs are programs with a relatively small number of constraints. We show how recent improvements on the running-times of solvers for such programs can be used to obtain fast pseudo-polynomial time algorithms for makespan minimization on a fixed number of parallel machines, and other related variants. The running times of our algorithms are all of the form $\widetilde{O}(p^{O(1)}_{\max} n)$ or $\widetilde{O}(p^{O(1)}_{\max} \cdot n)$, where $p_{\max}$ is the maximum processing time in the input. These improve upon the time complexity of previously known algorithms for moderate values of $p_{\max}$.
toXiv_bot_toot

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 20:35
Temperatur: (min: 1,7C) 3,4C (max: 6,3C)
Feuchte: 99%
Luftdruck: 983,2 hPa (gleichbleibend)
Windrichtung: N/A Grad
Win…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 19:35
Temperatur: (min: 1,7C) 3,7C (max: 6,3C)
Feuchte: 99%
Luftdruck: 983,7 hPa (gleichbleibend)
Windrichtung: N/A Grad
Win…

Robust Multiagent Collaboration Through Weighted Max-Min T-Joins
Sharareh Alipour
https://arxiv.org/abs/2602.07720 https://arxiv.org/pdf/2602.07720 https://arxiv.org/html/2602.07720
arXiv:2602.07720v1 Announce Type: new
Abstract: Many multiagent tasks -- such as reviewer assignment, coalition formation, or fair resource allocation -- require selecting a group of agents such that collaboration remains effective even in the worst case. The \emph{weighted max-min $T$-join problem} formalizes this challenge by seeking a subset of vertices whose minimum-weight matching is maximized, thereby ensuring robust outcomes against unfavorable pairings.
We advance the study of this problem in several directions. First, we design an algorithm that computes an upper bound for the \emph{weighted max-min $2k$-matching problem}, where the chosen set must contain exactly $2k$ vertices. Building on this bound, we develop a general algorithm with a \emph{$2 \ln n$-approximation guarantee} that runs in $O(n^4)$ time. Second, using ear decompositions, we propose another upper bound for the weighted max-min $T$-join cost. We also show that the problem can be solved exactly when edge weights belong to $\{1,2\}$.
Finally, we evaluate our methods on real collaboration datasets. Experiments show that the lower bounds from our approximation algorithm and the upper bounds from the ear decomposition method are consistently close, yielding empirically small constant-factor approximations. Overall, our results highlight both the theoretical significance and practical value of weighted max-min $T$-joins as a framework for fair and robust group formation in multiagent systems.
toXiv_bot_toot

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 18:35
Temperatur: (min: 1,7C) 3,6C (max: 6,3C)
Feuchte: 99%
Luftdruck: 983,8 hPa (gleichbleibend)
Windrichtung: N/A Grad
Win…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 17:35
Temperatur: (min: 1,7C) 4,1C (max: 6,3C)
Feuchte: 99%
Luftdruck: 983,8 hPa (gleichbleibend)
Windrichtung: N/A Grad
Win…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 22:55
Temperatur: (min: 1,7C) 3,0C (max: 6,3C)
Feuchte: 99%
Luftdruck: 983,0 hPa (gleichbleibend)
Windrichtung: N/A Grad
Win…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 23:25
Temperatur: (min: 1,7C) 2,9C (max: 6,3C)
Feuchte: 99%
Luftdruck: 982,5 hPa (langsam fallend)
Windrichtung: N/A Grad
Wi…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 22:35
Temperatur: (min: 1,7C) 3,0C (max: 6,3C)
Feuchte: 99%
Luftdruck: 982,9 hPa (langsam fallend)
Windrichtung: N/A Grad
Wi…

aktuelles #Wetter #Behrendorf #Wische 13-02-2026 05:55
Temperatur: (min: 0,3C) 0,3C (max: 1,2C)
Feuchte: 99%
Luftdruck: 988,9 hPa (stark steigend)
Windrichtung: N/A Grad
Win…

aktuelles #Wetter #Behrendorf #Wische 13-02-2026 11:55
Temperatur: (min: 0,3C) 0,9C (max: 1,2C)
Feuchte: 99%
Luftdruck: 992,3 hPa (langsam steigend)
Windrichtung: N/A Grad
W…

aktuelles #Wetter #Behrendorf #Wische 13-02-2026 09:55
Temperatur: (min: 0,3C) 0,7C (max: 1,2C)
Feuchte: 99%
Luftdruck: 991,0 hPa (langsam steigend)
Windrichtung: N/A Grad
W…

aktuelles #Wetter #Behrendorf #Wische 13-02-2026 08:55
Temperatur: (min: 0,3C) 0,4C (max: 1,2C)
Feuchte: 99%
Luftdruck: 990,6 hPa (langsam steigend)
Windrichtung: N/A Grad
W…

aktuelles #Wetter #Behrendorf #Wische 13-02-2026 07:55
Temperatur: (min: 0,3C) 0,3C (max: 1,2C)
Feuchte: 99%
Luftdruck: 989,7 hPa (langsam steigend)
Windrichtung: N/A Grad
W…

aktuelles #Wetter #Behrendorf #Wische 13-02-2026 14:55
Temperatur: (min: 0,3C) 0,5C (max: 1,2C)
Feuchte: 99%
Luftdruck: 993,3 hPa (langsam steigend)
Windrichtung: N/A Grad
W…

aktuelles #Wetter #Behrendorf #Wische 13-04-2026 08:50
Temperatur: (min: 7,2C) 7,9C (max: 7,9C)
Feuchte: 94%
Luftdruck: 1015,1 hPa ()
Windrichtung: N/A Grad
Windgeschwindigk…

aktuelles #Wetter #Behrendorf #Wische 12-04-2026 05:30
Temperatur: (min: 7,3C) 7,4C (max: 8,6C)
Feuchte: 64%
Luftdruck: 1013,1 hPa (gleichbleibend)
Windrichtung: N/A Grad
Wi…

aktuelles #Wetter #Behrendorf #Wische 12-04-2026 14:25
Temperatur: (min: 5,6C) 7,7C (max: 8,6C)
Feuchte: 98%
Luftdruck: 1016,1 hPa (gleichbleibend)
Windrichtung: N/A Grad
Wi…

aktuelles #Wetter #Behrendorf #Wische 13-03-2026 00:05
Temperatur: (min: 6,7C) 6,8C (max: 6,8C)
Feuchte: 76%
Luftdruck: 1015,1 hPa (langsam fallend)
Windrichtung: N/A Grad
W…

aktuelles #Wetter #Behrendorf #Wische 11-03-2026 18:20
Temperatur: (min: 6,9C) 12,9C (max: 16,3C)
Feuchte: 80%
Luftdruck: 1010,1 hPa (gleichbleibend)
Windrichtung: N/A Grad
…

aktuelles #Wetter #Behrendorf #Wische 11-04-2026 21:30
Temperatur: (min: -0,8C) 8,2C (max: 15,3C)
Feuchte: 58%
Luftdruck: 1014,1 hPa (gleichbleibend)
Windrichtung: N/A Grad
…

aktuelles #Wetter #Behrendorf #Wische 11-04-2026 02:20
Temperatur: (min: 1,7C) 1,8C (max: 5,0C)
Feuchte: 95%
Luftdruck: 1018,9 hPa (gleichbleibend)
Windrichtung: N/A Grad
Wi…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 09:25
Temperatur: (min: 1,7C) 2,9C (max: 3,0C)
Feuchte: 99%
Luftdruck: 985,1 hPa (gleichbleibend)
Windrichtung: N/A Grad
Win…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 08:10
Temperatur: (min: 1,7C) 2,1C (max: 2,2C)
Feuchte: 99%
Luftdruck: 985,1 hPa (langsam fallend)
Windrichtung: N/A Grad
Wi…

aktuelles #Wetter #Behrendorf #Wische 10-03-2026 03:05
Temperatur: (min: 1,5C) 1,8C (max: 3,1C)
Feuchte: 98%
Luftdruck: 1016,6 hPa (gleichbleibend)
Windrichtung: N/A Grad
Wi…

aktuelles #Wetter #Behrendorf #Wische 10-03-2026 02:40
Temperatur: (min: 1,5C) 1,6C (max: 3,1C)
Feuchte: 97%
Luftdruck: 1016,8 hPa (gleichbleibend)
Windrichtung: N/A Grad
Wi…

aktuelles #Wetter #Behrendorf #Wische 10-03-2026 03:30
Temperatur: (min: 1,0C) 1,1C (max: 3,1C)
Feuchte: 98%
Luftdruck: 1016,5 hPa (langsam fallend)
Windrichtung: N/A Grad
W…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 15:35
Temperatur: (min: 1,7C) 5,1C (max: 6,3C)
Feuchte: 99%
Luftdruck: 983,9 hPa (gleichbleibend)
Windrichtung: N/A Grad
Win…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 14:35
Temperatur: (min: 1,7C) 5,8C (max: 6,3C)
Feuchte: 97%
Luftdruck: 983,8 hPa (langsam fallend)
Windrichtung: N/A Grad
Wi…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 10:35
Temperatur: (min: 1,7C) 4,3C (max: 4,4C)
Feuchte: 99%
Luftdruck: 984,8 hPa (langsam fallend)
Windrichtung: N/A Grad
Wi…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 08:30
Temperatur: (min: 1,7C) 2,2C (max: 2,2C)
Feuchte: 99%
Luftdruck: 985,3 hPa (langsam fallend)
Windrichtung: N/A Grad
Wi…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 08:00
Temperatur: (min: 1,7C) 2,1C (max: 2,2C)
Feuchte: 99%
Luftdruck: 985,2 hPa (langsam fallend)
Windrichtung: N/A Grad
Wi…

aktuelles #Wetter #Behrendorf #Wische 10-03-2026 01:40
Temperatur: (min: 1,7C) 2,3C (max: 3,1C)
Feuchte: 96%
Luftdruck: 1017,1 hPa (gleichbleibend)
Windrichtung: N/A Grad
Wi…

aktuelles #Wetter #Behrendorf #Wische 09-03-2026 20:40
Temperatur: (min: 1,1C) 5,8C (max: 15,7C)
Feuchte: 82%
Luftdruck: 1018,1 hPa (gleichbleibend)
Windrichtung: N/A Grad
W…

aktuelles #Wetter #Behrendorf #Wische 09-04-2026 19:40
Temperatur: (min: 1,0C) 9,3C (max: 13,7C)
Feuchte: 43%
Luftdruck: 1020,1 hPa (langsam fallend)
Windrichtung: N/A Grad
…

aktuelles #Wetter #Behrendorf #Wische 11-04-2026 01:20
Temperatur: (min: 3,2C) 3,2C (max: 5,0C)
Feuchte: 91%
Luftdruck: 1019,1 hPa (gleichbleibend)
Windrichtung: N/A Grad
Wi…

aktuelles #Wetter #Behrendorf #Wische 10-04-2026 18:50
Temperatur: (min: 3,2C) 9,8C (max: 10,8C)
Feuchte: 71%
Luftdruck: 1017,1 hPa (gleichbleibend)
Windrichtung: N/A Grad
W…