Miroslav Chlebík

Publication Activity (10 Years)

Years Active: 2002-2022
Publications (10 Years): 2

Top Topics

Approximation Algorithms

Rewriting Rules

Optimal Capacity

Top Venues

J. Comb. Optim.

Theor. Comput. Sci.

Publications

Miroslav Chlebík, Janka Chlebíková
Weighted amplifiers and inapproximability results for Travelling Salesman problem. J. Comb. Optim. 43 (5) (2022)
Miroslav Chlebík, Janka Chlebíková
Approximation Hardness of Travelling Salesman via Weighted Amplifiers. COCOON (2019)
Miroslav Chlebík, Janka Chlebíková
Connection between conjunctive capacity and structural properties of graphs. Theor. Comput. Sci. 554 (2014)
Miroslav Chlebík, Janka Chlebíková
On the Conjunctive Capacity of Graphs. COCOON (2013)
Miroslav Chlebík, Janka Chlebíková
Hardness of approximation for orthogonal rectangle packing and covering problems. J. Discrete Algorithms 7 (3) (2009)
Miroslav Chlebík, Janka Chlebíková
The Steiner tree problem on graphs: Inapproximability results. Theor. Comput. Sci. 406 (3) (2008)
Miroslav Chlebík, Janka Chlebíková
Approximation hardness of dominating set problems in bounded degree graphs. Inf. Comput. 206 (11) (2008)
Miroslav Chlebík, Janka Chlebíková
Crown reductions for the Minimum Weighted Vertex Cover problem. Discret. Appl. Math. 156 (3) (2008)
Miroslav Chlebík, Janka Chlebíková
The Complexity of Combinatorial Optimization Problems on d-Dimensional Boxes. SIAM J. Discret. Math. 21 (1) (2007)
Miroslav Chlebík, Janka Chlebíková
Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover. Discret. Appl. Math. 155 (2) (2007)
Miroslav Chlebík, Janka Chlebíková
Complexity of approximating bounded variants of optimization problems. Theor. Comput. Sci. 354 (3) (2006)
Miroslav Chlebík, Janka Chlebíková
Hard coloring problems in low degree planar bipartite graphs. Discret. Appl. Math. 154 (14) (2006)
Janka Chlebíková, Miroslav Chlebík
Hardness of asymptotic approximation for orthogonal rectangle packing and covering problems Electron. Colloquium Comput. Complex. (019) (2006)
Miroslav Chlebík, Janka Chlebíková
Approximation hardness of edge dominating set problems. J. Comb. Optim. 11 (3) (2006)
Miroslav Chlebík, Janka Chlebíková
Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations. CIAC (2006)
Miroslav Chlebík, Janka Chlebíková
-dimensional boxes. SODA (2005)
Miroslav Chlebík, Janka Chlebíková
Approximation Hardness of Dominating Set Problems. ESA (2004)
Miroslav Chlebík, Janka Chlebíková
On Approximability of the Independent Set Problem for Low Degree Graphs. SIROCCO (2004)
Miroslav Chlebík, Janka Chlebíková
Crown reductions for the Minimum Weighted Vertex Cover problem Electron. Colloquium Comput. Complex. (101) (2004)
Miroslav Chlebík, Janka Chlebíková
Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity. SWAT (2004)
Miroslav Chlebík, Janka Chlebíková
On Approximation Hardness of the Minimum 2SAT-DELETION Problem. MFCS (2004)
Miroslav Chlebík, Janka Chlebíková
Inapproximability Results for Bounded Variants of Optimization Problems. FCT (2003)
Miroslav Chlebík, Janka Chlebíková
Approximation Hardness for Small Occurrence Instances of NP-Hard Problems. CIAC (2003)
Miroslav Chlebík, Janka Chlebíková
Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching. ISAAC (2003)
Janka Chlebíková, Miroslav Chlebík
Inapproximability results for bounded variants of optimization problems Electron. Colloquium Comput. Complex. 10 (026) (2003)
Miroslav Chlebík, Janka Chlebíková
Approximation Hardness of the Steiner Tree Problem on Graphs. SWAT (2002)
Janka Chlebíková, Miroslav Chlebík
Approximation Hardness for Small Occurrence Instances of NP-Hard Problem Electron. Colloquium Comput. Complex. (073) (2002)