#Lauerbach
Venezia-Inter, annullato dal Var il gol di Lauerbach. Cosa è successo
https://vivere.me/hfy1-k
Venezia-Inter, annullato dal Var il gol di Lauerbach. Cosa è successo
vivere.me
October 28, 2026 at 7:19 PM
Grzegorz Gutowski, Dominik Jilg, Antonio Lauerbach, Miko{\l}aj Rams: Decomposing Directed Graphs into Partial Orders is Hard https://arxiv.org/abs/2610.37379 https://arxiv.org/pdf/2610.37379 https://arxiv.org/html/2610.37379
October 28, 2026 at 6:39 AM
Decomposing Directed Graphs into Partial Orders is Hard
**Authors:** Grzegorz Gutowski, Dominik Jilg, Antonio Lauerbach, Mikołaj Rams Comparability graphs represent partial orders and provide natural building blocks for representing a graph as a union of simpler graphs. The analogous task in the directed setting is to represent a digraph as a union of partial orders. Aboulker et al. [arXiv, 2026] recently introduced the partial order decomposition number as a useful structural parameter in their study of tournaments. Formally, a partial order decomposition of a digraph $D$ is a cover of its arc set by transitive acyclic subdigraphs, each representing a strict partial order on the vertex set of $D$. The partial order decomposition number is the minimum number of such subdigraphs needed. We also consider the partitioning variant, in which every arc belongs to exactly one of the partial orders in the decomposition. We prove that, for every fixed $k\geq 2$, deciding whether a digraph admits a decomposition into at most $k$ partial orders is NP-complete, even for directed acyclic graphs (DAGs). For $k=2$, we reduce from NAE-3-SAT. For $k\geq 3$, we reduce from $k$-Coloring, and the reduction yields DAGs with triangle-free underlying graphs. Both reductions establish hardness for both variants. We further show that the minimum cover size and the minimum partition size can differ even on DAGs.
arxiv.org
October 28, 2026 at 9:42 AM
Es wäre ja zumindest möglich gewesen, zu sagen, dass man Kommentare wie unter dem von Hape erwähnten Bild mit Karl Lauerbach ("Auch wieder 2, die ins KZ gehören") aufs schärfste verurteilt. Nicht einmal das war möglich, wie es scheint.
October 22, 2026 at 5:48 AM
Ich hatte heute Jahreswechsel- Tagung und der Dozent hat ständig über Lauerbach und die Ampel geschimpft und dann gesagt, nächster Gesundheitsminister würde dann vielleicht Amthor werden.
December 13, 2024 at 5:16 PM
Antonio Lauerbach, Sven Mallach, Kendra Reiter, Marie Schmidt, Michael Stiglmayr
Solving the Line-Based Dial-a-Ride Problem by Generating Stopping Patterns
https://arxiv.org/abs/2603.06295
March 9, 2026 at 1:40 PM
Was auch immer die FDP nicht macht … wenn sie in den Bundestag gewählt wird.
Wenn nur das Wörtchen 'wenn' nicht wäre.

Der (noch) Bundesgesundheitsminister Karl Lauerbach hat da richtig reagiert 🤣
February 12, 2025 at 11:54 AM


Klar! Pandemie habt ihr prima bewältigt, es hängt auch sonst an allen Ecken, aber bereitet mal miltär.Konflikte vor.
#noSPD #Kasperland #Lauerbach
April 3, 2025 at 12:06 PM
Lauterbach nicht Lauerbach heißt der Bächlein. Wie der Gesundheitsminister.
May 17, 2024 at 1:16 PM
Im Saarland ist Land unter. Die kleine Lauerbach ist mächtig gewachsen. Gegenüber die Gärten sind voll gelaufen. Noch 5 Meter und meine Garage steht unter Wasser.
May 17, 2024 at 1:12 PM
Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Antonio Lauerbach, Alexander Wolff: Modelling Network Resilience: The Complexity of Some Graph Division Games https://arxiv.org/abs/2605.17572 https://arxiv.org/pdf/2605.17572 https://arxiv.org/html/2605.17572
May 19, 2026 at 6:40 AM
Antonio Lauerbach, Konstanty Junosza-Szaniawski, Marie Diana Sieper, Alexander Wolff: The Parameterized Complexity of Coloring Mixed Graphs https://arxiv.org/abs/2604.15274 https://arxiv.org/pdf/2604.15274 https://arxiv.org/html/2604.15274
April 17, 2026 at 6:39 AM
Foivos Fioravantes, Abhiruk Lahiri, Antonio Lauerbach, Llu\'is Sabater, Marie Diana Sieper, Samuel Wolf: Eliminating Majority Illusions https://arxiv.org/abs/2502.14353 https://arxiv.org/pdf/2502.14353 https://arxiv.org/html/2502.14353
February 21, 2025 at 5:54 AM