Approximation Hardness of the Steiner Tree Problem on Graphs. - Miroslav Chlebík; Janka Chlebíková (SWAT, 2002)

Approximation Hardness for Small Occurrence Instances of NP-Hard Problem - Janka Chlebíková; Miroslav Chlebík (Electron. Colloquium Comput. Complex., 2002)

Approximation Hardness for Small Occurrence Instances of NP-Hard Problems. - Miroslav Chlebík; Janka Chlebíková (CIAC, 2003)

Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching. - Miroslav Chlebík; Janka Chlebíková (ISAAC, 2003)

Inapproximability results for bounded variants of optimization problems - Janka Chlebíková; Miroslav Chlebík (Electron. Colloquium Comput. Complex., 2003)

Approximation Hardness of Dominating Set Problems. - Miroslav Chlebík; Janka Chlebíková (ESA, 2004)

On Approximation Hardness of the Minimum 2SAT-DELETION Problem. - Miroslav Chlebík; Janka Chlebíková (MFCS, 2004)

On Approximability of the Independent Set Problem for Low Degree Graphs. - Miroslav Chlebík; Janka Chlebíková (SIROCCO, 2004)

Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity. - Miroslav Chlebík; Janka Chlebíková (SWAT, 2004)

Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes. - Miroslav Chlebík; Janka Chlebíková (SODA, 2005)

Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations. - Miroslav Chlebík; Janka Chlebíková (CIAC, 2006)

Hard coloring problems in low degree planar bipartite graphs. - Miroslav Chlebík; Janka Chlebíková (Discret. Appl. Math., 2006)

Hardness of asymptotic approximation for orthogonal rectangle packing and covering problems - Janka Chlebíková; Miroslav Chlebík (Electron. Colloquium Comput. Complex., 2006)

Approximation hardness of edge dominating set problems. - Miroslav Chlebík; Janka Chlebíková (J. Comb. Optim., 2006)

Complexity of approximating bounded variants of optimization problems. - Miroslav Chlebík; Janka Chlebíková (Theor. Comput. Sci., 2006)

Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover. - Miroslav Chlebík; Janka Chlebíková (Discret. Appl. Math., 2007)

The Complexity of Combinatorial Optimization Problems on d-Dimensional Boxes. - Miroslav Chlebík; Janka Chlebíková (SIAM J. Discret. Math., 2007)

Crown reductions for the Minimum Weighted Vertex Cover problem. - Miroslav Chlebík; Janka Chlebíková (Discret. Appl. Math., 2008)

Approximation hardness of dominating set problems in bounded degree graphs. - Miroslav Chlebík; Janka Chlebíková (Inf. Comput., 2008)

The Steiner tree problem on graphs: Inapproximability results. - Miroslav Chlebík; Janka Chlebíková (Theor. Comput. Sci., 2008)

Hardness of approximation for orthogonal rectangle packing and covering problems. - Miroslav Chlebík; Janka Chlebíková (J. Discrete Algorithms, 2009)

On the Conjunctive Capacity of Graphs. - Miroslav Chlebík; Janka Chlebíková (COCOON, 2013)

Connection between conjunctive capacity and structural properties of graphs. - Miroslav Chlebík; Janka Chlebíková (Theor. Comput. Sci., 2014)

Approximation Hardness of Travelling Salesman via Weighted Amplifiers. - Miroslav Chlebík; Janka Chlebíková (COCOON, 2019)

Weighted amplifiers and inapproximability results for Travelling Salesman problem. - Miroslav Chlebík; Janka Chlebíková (J. Comb. Optim., 2022)