3 citations · 4 across the 11 of their papers we have counts for
5 papers · 1 filter
Sharp Thresholds for Temporal Motifs and Doubling Time in Random Temporal Graphs
Henry Austin, George B. Mertzios, Paul G. Spirakis
In this paper we study two natural models of random temporal graphs. In the first, the continuous model, each edge is assigned labels, each drawn uniformly at random from…
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…
Computing Maximum Matchings in Temporal Graphs
George B. Mertzios, Hendrik Molter, Rolf Niedermeier +2
Temporal graphs are graphs whose topology is subject to discrete changes over time. Given a static underlying graph , a temporal graph is represented by assigning a set of integ…
Sliding Window Temporal Graph Coloring
George B. Mertzios, Hendrik Molter, Viktor Zamaraev
Graph coloring is one of the most famous computational problems with applications in a wide range of areas such as planning and scheduling, resource allocation, and pattern matchin…
On the Intersection of Tolerance and Cocomparability Graphs
George B. Mertzios, Shmuel Zaks
It has been conjectured by Golumbic and Monma in 1984 that the intersection of tolerance and cocomparability graphs coincides with bounded tolerance graphs. The conjecture has been…