43 citations · 187 across the 40 of their papers we have counts for
4 papers · 1 filter
NP-Completeness of the Combinatorial Distance Matrix Realisation Problem
David L. Fairbairn, George B. Mertzios, Norbert Peyerimhoff
The -CombDMR problem is that of determining whether an distance matrix can be realised by vertices in some undirected graph with vertices. This problem…
On the existence of -temporal cliques in random simple temporal graphs
George B. Mertzios, Sotiris Nikoletseas, Christoforos Raptopoulos +1
We consider random simple temporal graphs in which every edge of the complete graph appears once within the time interval [0,1] independently and uniformly at random. Our mai…
Realizing temporal transportation trees
George B. Mertzios, Hendrik Molter, Nils Morawietz +1
In this paper, we study the complexity of the periodic temporal graph realization problem with respect to upper bounds on the fastest path durations among its vertices. This constr…
Payment Scheduling in the Interval Debt Model
Tom Friedetzky, David C. Kutner, George B. Mertzios +2
The network-based study of financial systems has received considerable attention in recent years but has seldom explicitly incorporated the dynamic aspects of such systems. We cons…