We generalize the graph streaming model to hypergraphs. In this streaming model,
hyperedges are arriving online and any computation has to be done on-the-fly using a small …

Optical networks and the related technologies, network management software and services
have undergone remarkable developments, and such networks are now the ultra-high …

The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the
fewest sets consisting of vertices pairwise at distance greater than two from each other …

Multicommodity flow (MF) problems have a wide variety of applications in areas such as
VLSI circuit design, network design, etc., and are therefore very well studied. The fractional …

The design of WDM optical networks is an issue for telecom operators since the spreading of
this technology will not occur unless enough performance guarantees are provided …

We present the results of tan-h pulse propagation through single mode fiber in dispersion
dominant regime as well as in the simultaneous presence of fiber loss, group velocity …

A stably bounded hypergraph H is a hypergraph together with four color-bound functions s, t,
a and b, each assigning positive integers to the edges. A vertex coloring of H is considered …

With the introduction of optical switching technology in telecommunication networks, all‐
optical connections, so‐called lightpaths, can be established. Lightpaths have to be …

Finding conflict-free wavelength assignments with a minimum number of required
conversions for a routing of the lightpaths is one of the important tasks within the design of …

Motivated by the wavelength assignment problem in WDM optical networks, we study path
coloring problems in graphs. Given a set of paths P on a graph G, the path coloring problem …