
WEIGHT: 66 kg
Bust: SUPER
1 HOUR:250$
Overnight: +60$
Services: Facials, Blow ride, BDSM (receiving), Humiliation (giving), French Kissing
Email george dot mertzios at durham. Publications Chapter in book Fluschnik, T. Manea, R. Nowotka Eds. Proceedings Springer Verlag. Kao Ed. Multitolerance Graphs. Esparza, P. Fraigniaud, T. Koutsoupias Eds. Proceedings, part II Italiano Eds. Fomin, R. Freivalds, M. Peleg Eds. Boas, F. Groen, G. Italiano, J. Sack Eds. Strong Bounds for Evolution in Networks. Sgall Eds. Temporal Graph Realization from Fastest Paths. Payment scheduling in the Interval Debt Model.
The complexity of growing a graph. The complexity of temporal vertex cover in small-degree graphs. The complexity of computing optimum labelings for temporal connectivity. The complexity of transitively orienting temporal graphs. Equitable scheduling on a single machine. Interference-free walks in time: temporally disjoint paths. Computing maximum matchings in temporal graphs. Exact and approximate algorithms for computing a second Hamiltonian cycle.
Deleting edges to restrict the size of an epidemic in temporal networks. How fast can we reach a target vertex in stochastic temporal graphs?. Sliding Window Temporal Graph Coloring. The temporal explorer who returns to the base. Temporal vertex cover with a sliding time window. Binary search in graphs revisited.
When can graph hyperbolicity be computed in linear time?. The computational complexity of weighted greedy matching. Finding secluded places of special interest in graphs. Stably computing order statistics with arithmetic population protocols. Algorithms and complexity for metric dimension and location-domination on interval and permutation graphs. Graph editing to a given degree sequence. Petersburg, Russia Akrida, E. On temporally connected graphs of small cost.
Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs. New geometric representations and domination problems on tolerance and multitolerance graphs. Ephemeral networks with random availability of links: diameter and connectivity. Parameterized Domination in Circle Graphs. Optimizing busy time on parallel machines.