most citedPolynomial-time Algorithms for Weighted Efficient Domination Problems in AT-free Graphs and Dually Chordal Graphs

31 citations · 35 across the 3 of their papers we have counts for

collaborators
Showing 2023Show all

Nothing from them under that filter.

Their other years and fields are still on the left.