9 citations · 25 across the 27 of their papers we have counts for
27 papers
On -Coloring and -Coloring of graphs with high girth
Zahra Ahmadidahr, Manouchehr Zaker
In a proper vertex coloring of a graph , a vertex is called a b-vertex if is adjacent to a vertex in every other color class. A -coloring is a proper…
Improved bounds on the b-chromatic number using the independence and chromatic numbers
Manouchehr Zaker
A b-coloring of a graph is a proper vertex coloring where each color class contains at least one vertex (a b-vertex) adjacent to a vertex in every other color class. The maximu…
Computing welfare and fairness in allocating identical goods with entitlements and general utility functions
Manouchehr Zaker
A number of goods are called identical if they provide the same level of utility to each agent. In various real-world instances of fair division scenarios, identical indivisible it…
On z-coloring and -coloring of graphs as improved variants of the b-coloring
Manouchehr Zaker
Let be a simple graph and a proper vertex coloring of . A vertex is called b-vertex in if all colors except appear in the neighborhood of . By a ${…
time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth
Manouchehr Zaker
The Grundy (or First-Fit) chromatic number of a graph , denoted by (or ), is the maximum number of colors used by a First-Fit (greedy) coloring of…
More algorithmic results for problems of spread of influence in edge-weighted graphs with and without incentives
Siavash Askari, Manouchehr Zaker
Many phenomena in real world social networks are interpreted as spread of influence between activated and non-activated network elements. These phenomena are formulated by combinat…