//-->
Pseudo-polynomial algorithms for solving the Knapsack Problem with dependencies between items
Lalou, Mohammed, (2023)
Computing optimal shortcuts for networks
Garijo, Delia, (2019)
The density maximization problem in graphs
Kao, Mong-jen, (2013)
Dual parameterization and parameterized approximability of subset graph problems
Bonnet, Édouard, (2017)
When polynomial approximation meets exact computation
Paschos, Vangelis Th., (2018)
Combinatorial approximation of maximum k-VERTEX cover in bipartite graphs within ration 0.7