Interest in hybrid collaboration and meetings (HCM), where several co-located participants
engage in coordinated work with remote participants, is gaining unprecedented momentum …

We introduce a communication model for hybrid networks, where nodes have access to two
different communication modes: a local mode where (like in traditional networks) …

The HYBRID model, introduced in [Augustine et al., SODA'20], provides a theoretical
foundation for networks that allow multiple communication modes. The model follows the …

We consider the problem of computing shortest paths in hybrid networks, in which nodes
can make use of different communication modes. For example, mobile phones may use ad …

The celebrated palette sparsification result of [Assadi, Chen, and Khanna SODA'19] shows
that to compute a Δ+ 1 coloring of the graph, where Δ denotes the maximum degree, it …

We show how to construct an overlay network of constant degree and diameter O (log n) in
time O (log n) starting from an arbitrary weakly connected graph. We assume a synchronous …

The $\hybrid $ model was recently introduced by Augustine et al.\cite {DBLP: conf/soda/
AugustineHKSS20} in order to characterize from an algorithmic standpoint the capabilities of …

The Hybrid network model was introduced in [Augustine et al., SODA'20] for laying down a
theoretical foundation for networks which combine two possible modes of communication …

We study graph realization problems for the first time from a distributed perspective. Graph
realization problems are encountered in distributed construction of overlay networks that …

In most modern networks, nodes have access to various modes of communication each with
different characteristics. In this work we consider the Hybrid model of distributed computing …