8 citations · 9 across the 2 of their papers we have counts for
3 papers
cs.GT2021★ 8 cited
Tractable Fragments of the Maximum Nash Welfare Problem
Jugal Garg, Edin Husić, Aniket Murhekar +1
We study the problem of maximizing Nash welfare (MNW) while allocating indivisible goods to asymmetric agents. The Nash welfare of an allocation is the weighted geometric mean of a…
math.CO2021★ 1 cited
On complete classes of valuated matroids
Edin Husić, Georg Loho, Ben Smith +1
We characterize a rich class of valuated matroids, called R-minor valuated matroids that includes the indicator functions of matroids, and is closed under operations such as taking…
math.CO2020
FPT Algorithms for Finding Near-Cliques in -Closed Graphs
Balaram Behera, Edin Husić, Shweta Jain +2
Finding large cliques or cliques missing a few edges is a fundamental algorithmic task in the study of real-world graphs, with applications in community detection, pattern recognit…