Miroslav Chlebík

According to our database, Miroslav Chlebík authored at least 25 papers between 2002 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2022

Weighted amplifiers and inapproximability results for Travelling Salesman problem.

Miroslav Chlebík, Janka Chlebíková

J. Comb. Optim., 2022

2019

Approximation Hardness of Travelling Salesman via Weighted Amplifiers.

Miroslav Chlebík, Janka Chlebíková

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2014

Connection between conjunctive capacity and structural properties of graphs.

Miroslav Chlebík, Janka Chlebíková

Theor. Comput. Sci., 2014

2013

On the Conjunctive Capacity of Graphs.

Miroslav Chlebík, Janka Chlebíková

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2009

Hardness of approximation for orthogonal rectangle packing and covering problems.

Miroslav Chlebík, Janka Chlebíková

J. Discrete Algorithms, 2009

2008

The Steiner tree problem on graphs: Inapproximability results.

Miroslav Chlebík, Janka Chlebíková

Theor. Comput. Sci., 2008

Approximation hardness of dominating set problems in bounded degree graphs.

Miroslav Chlebík, Janka Chlebíková

Inf. Comput., 2008

2007

The Complexity of Combinatorial Optimization Problems on d-Dimensional Boxes.

Miroslav Chlebík, Janka Chlebíková

SIAM J. Discret. Math., 2007

Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover.

Miroslav Chlebík, Janka Chlebíková

Discret. Appl. Math., 2007

2006

Complexity of approximating bounded variants of optimization problems.

Miroslav Chlebík, Janka Chlebíková

Theor. Comput. Sci., 2006

Approximation hardness of edge dominating set problems.

Miroslav Chlebík, Janka Chlebíková

J. Comb. Optim., 2006

Hardness of asymptotic approximation for orthogonal rectangle packing and covering problems

Janka Chlebíková, Miroslav Chlebík

Electron. Colloquium Comput. Complex., 2006

Hard coloring problems in low degree planar bipartite graphs.

Miroslav Chlebík, Janka Chlebíková

Discret. Appl. Math., 2006

Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations.

Miroslav Chlebík, Janka Chlebíková

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005

Approximation hardness of optimization problems in intersection graphs of <i>d</i>-dimensional boxes.

Miroslav Chlebík, Janka Chlebíková

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

Crown reductions for the Minimum Weighted Vertex Cover problem

Miroslav Chlebík, Janka Chlebíková

Electron. Colloquium Comput. Complex., 2004

Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity.

Miroslav Chlebík, Janka Chlebíková

Proceedings of the Algorithm Theory, 2004

On Approximability of the Independent Set Problem for Low Degree Graphs.

Miroslav Chlebík, Janka Chlebíková

Proceedings of the Structural Information and Communication Complexity, 2004

On Approximation Hardness of the Minimum 2SAT-DELETION Problem.

Miroslav Chlebík, Janka Chlebíková

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Approximation Hardness of Dominating Set Problems.

Miroslav Chlebík, Janka Chlebíková

Proceedings of the Algorithms, 2004

2003

Inapproximability results for bounded variants of optimization problems

Janka Chlebíková, Miroslav Chlebík

Electron. Colloquium Comput. Complex., 2003

Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching.

Miroslav Chlebík, Janka Chlebíková

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Approximation Hardness for Small Occurrence Instances of NP-Hard Problems.

Miroslav Chlebík, Janka Chlebíková

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002

Approximation Hardness for Small Occurrence Instances of NP-Hard Problem

Janka Chlebíková, Miroslav Chlebík

Electron. Colloquium Comput. Complex., 2002

Approximation Hardness of the Steiner Tree Problem on Graphs.

Miroslav Chlebík, Janka Chlebíková

Proceedings of the Algorithm Theory, 2002