43 citations · 187 across the 40 of their papers we have counts for
4 papers · 2 filters
Strong Bounds for Evolution in Undirected Graphs
George B. Mertzios, Paul G. Spirakis
This work studies the generalized Moran process, as introduced by Lieberman et al. [Nature, 433:312-316, 2005]. We introduce the parameterized notions of selective amplifiers and s…
The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial
George B. Mertzios
Intersection graphs of geometric objects have been extensively studied, both due to their interesting structure and their numerous applications; prominent examples include interval…
Parameterized Domination in Circle Graphs
Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios +3
A circle graph is the intersection graph of a set of chords in a circle. Keil [Discrete Applied Mathematics, 42(1):51-63, 1993] proved that Dominating Set, Connected Dominating Set…
Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs
George B. Mertzios, Paul G. Spirakis
In spite of the extensive studies of the 3-coloring problem with respect to several basic parameters, the complexity status of the 3-coloring problem on graphs with small diameter,…