research
∙
02/18/2020
Dynamics of Cycles in Polyhedra I: The Isolation Lemma
A cycle C of a graph G is isolating if every component of G-V(C) is a si...
share
research
∙
10/09/2018
Contraction-Based Sparsification in Near-Linear Time
Recently, Kawarabayashi and Thorup presented the first deterministic edg...
research
∙
06/25/2018
Even Longer Cycles in Essentially 4-Connected Planar Graphs
A planar graph is essentially 4-connected if it is 3-connected and every...
research
∙
10/16/2017
