Network Design is an active research area in the intersection of Combinatorial Optimization
and Theoretical Computer Science that focuses on problems arising in the realm of modern …

In this paper, we investigate the benefit of network coding over routing for multiple
independent unicast transmissions. We compare the maximum achievable throughput with …

In this paper, we give a survey of spanning trees. We mainly deal with spanning trees having
some particular properties concerning a hamiltonian properties, for example, spanning trees …

Connectivity is one of the most basic concepts of graph-theoretical subjects, both in a
combinatorial sense and in an algorithmic sense. As we know, the classical connectivity has …

Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-
flow ratio for general maximum concurrent flow problems (when there are k commodities) is …

This thesis has two parts. In the first part, we study some graph covering problems with a non-
local covering rule that allows a" remote" node to be covered by repeatedly applying the …

The generalized $ k $-connectivity $\kappa_k (G) $ of a graph $ G $ was introduced by
Chartrand et al. in 1984. It is natural to introduce the concept of generalized $ k $-edge …

Quantum networks will allow to implement communication tasks beyond the reach of their
classical counterparts. A pressing and necessary issue for the design of quantum network …

Recent research in network coding shows that, joint consideration of both coding and
routing strategies may lead to higher information transmission rates than routing only. A …

We give an almost-linear time algorithm for the Steiner connectivity augmentation problem:
given an undirected graph, find a smallest (or minimum weight) set of edges whose addition …