96 citations · 376 across the 69 of their papers we have counts for
4 papers · 2 filters
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth
Tobias Friedrich, Davis Issac, Nikhil Kumar +2
We prove an approximate max-multiflow min-multicut theorem for bounded treewidth graphs. In particular, we show the following: Given a treewidth- graph, there exists a (fraction…
Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs
Katrin Casel, Tobias Friedrich, Davis Issac +2
In the 1970s, Győri and Lovász showed that for a -connected -vertex graph, a given set of terminal vertices and natural numbers satisfying…
Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances
Davide Bilò, Keerti Choudhary, Sarel Cohen +2
We construct data structures for extremal and pairwise distances in directed graphs in the presence of transient edge failures. Henzinger et al. [ITCS 2017] initiated the study of…
Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials
Tobias Friedrich, Andreas Göbel, Maximilian Katzmann +2
We study computational aspects of repulsive Gibbs point processes, which are probabilistic models of interacting particles in a finite-volume region of space. We introduce an appro…