
The Complexity of Growing a Graph
Motivated by biological processes, we introduce here the model of growin...
read it

Interferencefree Walks in Time: Temporally Disjoint Paths
We investigate the computational complexity of finding temporally disjoi...
read it

The Complexity of Transitively Orienting Temporal Graphs
In a temporal network with discrete timelabels on its edges, entities a...
read it

Equitable Scheduling on a Single Machine
We introduce a natural but seemingly yet unstudied generalization of the...
read it

Matching in Stochastically Evolving Graphs
This paper studies the maximum cardinality matching problem in stochasti...
read it

Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle
In this paper we consider the following total functional problem: Given ...
read it

Linear Programming complementation and its application to fractional graph theory
In this paper, we introduce a new kind of duality for Linear Programming...
read it

Computing Maximum Matchings in Temporal Graphs
We study the computational complexity of finding maximumcardinality tem...
read it

How fast can we reach a target vertex in stochastic temporal graphs?
Temporal graphs are used to abstractly model reallife networks that are...
read it

Sliding Window Temporal Graph Coloring
Graph coloring is one of the most famous computational problems with app...
read it

Deleting edges to restrict the size of an epidemic in temporal networks
A variety of potentially diseasespreading contact networks can be natur...
read it

The temporal explorer who returns to the base
In this paper we study the problem of exploring a temporal graph (i.e. a...
read it

Lower and Upper Bound for Computing the Size of All Second Neighbourhoods
We consider the problem of computing the size of each rneighbourhood fo...
read it

Temporal Vertex Cover with a Sliding Time Window
Modern, inherently dynamic systems are usually characterized by a networ...
read it

Searching for Maximum OutDegree Vertices in Tournaments
A vertex x in a tournament T is called a king if for every vertex y of T...
read it

Kernelization Lower Bounds for Finding Constant Size Subgraphs
Kernelization is an important tool in parameterized algorithmics. The go...
read it
George B. Mertzios
is this you? claim profile