2 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.DS2012★ 2 cited
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…
cs.DM2010
A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs
George B. Mertzios, Derek G. Corneil
Given a graph , the longest path problem asks to compute a simple path of with the largest number of vertices. This problem is the most natural optimization version of the w…
cs.CC2010
The Recognition of Tolerance and Bounded Tolerance Graphs
George B. Mertzios, Ignasi Sau, Shmuel Zaks
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This subclass of perfect graphs has been…