12 citations · 47 across the 20 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2015
Polynomial Fixed-Parameter Algorithms: A Case Study for Longest Path on Interval Graphs
Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier
We study the design of fixed-parameter algorithms for problems already known to be solvable in polynomial time. The main motivation is to get more efficient algorithms for problems…
cs.CC2014
New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs
Archontia C. Giannopoulou, George B. Mertzios
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain amount of overlap without being in conflict. In one of the most natural generalization…