Graph coloring is one of the oldest and best-known problems of graph theory. Statistics
show that graph coloring is one of the central issues in the collection of several hundred …

This paper introduces a new simple linear time algorithm to recognize cographs (graphs
without an induced P 4). Unlike other cograph recognition algorithms, the new algorithm …

There exists a wide variety of network problems where several connection requests occur
simultaneously. In general, each request is attended by finding a route in the network, where …

In the maximum edge-disjoint paths problem (MEDP) the input consists of a graph and a set
of requests (pairs of vertices), and the goal is to connect as many requests as possible along …

We study routing problems in networks that require guaranteed reliability against multiple
correlated link failures. We consider two different routing objectives: The first ensures …

The maximum edge-disjoint paths problem (MEDP) is one of the most classical NP-hard
problems. We study the approximation ratio of a simple and practical approximation …

In this paper, we consider the undirected version of the well known maximum edge-disjoint
paths problem, restricted to complete graphs. We propose an off-line 3.75-approximation …

In this thesis, we study algorithmic problems that arise during the design and operation of
optical networks that use wavelength-division multiplex¬ ing and employ wavelength …

A systematic, language-independent method of finding a minimal set of paths covering the
code of a sequential program is proposed for application in White Box testing. Execution of …

We study routing problems in networks that require guaranteed reliability against multiple
correlated link failures. We consider two different routing objectives: The first ensures “local …