Tootfinder

Die ePetition 182160 an den Bundestag aus dem Bereich Besoldungsrecht der Beamten mit dem Titel
Umgehende erneute Einbringung des BBVAngG/Rückwirkende zeit- und wirkungsgleiche Übertragung der TVöD-Erhöhungen
kann bis zum Donnerstag 14. August 2025 01:00 UTC mitgezeichnet werden und lautet
Mit der Petition wird gefo…

Die ePetition 182160 an den Bundestag aus dem Bereich Besoldungsrecht der Beamten mit dem Titel
Umgehende erneute Einbringung des BBVAngG/Rückwirkende zeit- und wirkungsgleiche Übertragung der TVöD-Erhöhungen
kann bis zum Donnerstag 14. August 2025 01:00 UTC mitgezeichnet werden und lautet
Mit der Petition wird gefo…

Results from IceCube Follow-up of Nearby Supernova SN2023ixf
Alicia Mand, Justin Vandenbroucke, Jessie Thwaites, Sam Hori, Aswathi Balagopal V
https://arxiv.org/abs/2507.07097

Results from IceCube Follow-up of Nearby Supernova SN2023ixf
Core-collapse supernovae are of particular interest in multi-messenger astronomy due to their potential to accelerate cosmic rays and produce high-energy neutrinos. One such supernova is the recent SN2023ixf located in M101 (the Pinwheel Galaxy). It is the closest (6.4 Mpc) and brightest (B band magnitude 10.8) core-collapse supernova in nearly a decade. This supernova likely had a progenitor surrounded by dense circumstellar material which, during the supernova, may have produced neutrinos whe…

Structural Parameterizations of $k$-Planarity
Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada
https://arxiv.org/abs/2506.10717 https://ar…

Structural Parameterizations of $k$-Planarity
The concept of $k$-planarity is extensively studied in the context of Beyond Planarity. A graph is $k$-planar if it admits a drawing in the plane in which each edge is crossed at most $k$ times. The local crossing number of a graph is the minimum integer $k$ such that it is $k$-planar. The problem of determining whether an input graph is $1$-planar is known to be NP-complete even for near-planar graphs [Cabello and Mohar, SIAM J. Comput. 2013], that is, the graphs obtained from planar graphs by…