16 citations · 94 across the 30 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
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…
cs.CC2015★ 2 cited
Crossing Number is Hard for Kernelization
Petr Hliněný, Marek Derňár
The graph crossing number problem, cr(G)<=k, asks for a drawing of a graph G in the plane with at most k edge crossings. Although this problem is in general notoriously difficult,…
cs.CC2015
Parameterized Extension Complexity of Independent Set and Related Problems
Jakub Gajarský, Petr Hliněný, Hans Raj Tiwary
Let be a graph on vertices and be the convex hull of characteristic vectors of its independent sets of size at most . We study extension complexity…