8 citations · 9 across the 2 of their papers we have counts for
2 papers
cs.DS2008★ 1 cited
Parameterized Algorithms for Partial Cover Problems
Omid Amini, Fedor V. Fomin, Saket Saurabh
Covering problems are fundamental classical problems in optimization, computer science and complexity theory. Typically an input to these problems is a family of sets over a finite…
cs.DM2007★ 8 cited
Frugal Colouring of Graphs
Omid Amini, Louis Esperet, Jan Van Den Heuvel
A -frugal colouring of a graph is a proper colouring of the vertices of such that no colour appears more than times in the neighbourhood of a vertex. This type of co…