13 citations · 42 across the 7 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DM2017
Recovering sparse graphs
Jakub Gajarsky, Daniel Kral
We construct a fixed parameter algorithm parameterized by d and k that takes as an input a graph G' obtained from a d-degenerate graph G by complementing on at most k arbitrary sub…
cs.CC2017★ 6 cited
Parameterized Shifted Combinatorial Optimization
Jakub Gajarský, Petr Hliněný, Martin Koutecký +1
Shifted combinatorial optimization is a new nonlinear optimization framework which is a broad extension of standard combinatorial optimization, involving the choice of several feas…