Lars Jaffke, Taming graphs with no large creatures and skinny ladders
Zoom ID: 869 4632 6610 (ibsdimag)We confirm a conjecture of Gartland and Lokshtanov : if for a hereditary graph class
We confirm a conjecture of Gartland and Lokshtanov : if for a hereditary graph class
We show a flow-augmentation algorithm in directed graphs: There exists a polynomial-time algorithm that, given a directed graph G, two integers
Random walks and spectral methods have had a strong influence on modern graph algorithms as evidenced by the extensive literature on the subject. In this talk, I will present how …
Property testers are probabilistic algorithms aiming to solve a decision problem efficiently in the context of big-data. A property tester for a property P has to decide (with high probability …
A temporal graph is a graph whose edges are available only at specific times. In this scenario, the only valid walks are the ones traversing adjacent edges respecting their availability, …
A conjecture of Milena Mihail and Umesh Vazirani states that the edge expansion of the graph of every
We prove that for
I will present the short proof from that for every digraph F and every assignment of pairs of integers
Katona's intersection theorem states that every intersecting family
We introduce a novel definition of orientation on the triples of a family of pairwise intersecting planar convex sets and study its properties. In particular, we compare it to other …