This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswa...
Let G be a minimally k-connected graph with n nodes and m edges. Mader proved that if n 3k - 2 then m k(n - k), and for n 3k - 1 an equality is possible if, and only if, G is t...
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...