15 citations · 87 across the 33 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015★ 15 cited
The Graph Motif problem parameterized by the structure of the input graph
Édouard Bonnet, Florian Sikora
The Graph Motif problem was introduced in 2006 in the context of biological networks. It consists of deciding whether or not a multiset of colors occurs in a connected subgraph of…
cs.DS2015
Time-Approximation Trade-offs for Inapproximable Problems
Édouard Bonnet, Michael Lampis, Vangelis Th. Paschos
In this paper we focus on problems which do not admit a constant-factor approximation in polynomial time and explore how quickly their approximability improves as the allowed runni…