43 citations · 187 across the 40 of their papers we have counts for
3 papers · 1 filter
Linear Programming Complementation
Maximilien Gadouleau, George B. Mertzios, Viktor Zamaraev
In this paper we introduce a new operation for Linear Programming (LP), called LP complementation, which resembles many properties of LP duality. Given a maximisation (resp.~minimi…
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…
How fast can we reach a target vertex in stochastic temporal graphs?
Eleni C. Akrida, George B. Mertzios, Sotiris Nikoletseas +3
Temporal graphs are used to abstractly model real-life networks that are inherently dynamic in nature. Given a static underlying graph , a temporal graph on is a seque…