Miroslav Chlebík

27 papers A* 1A 1B 4C 2Misc 2Journal 15Unranked 2
YearRankTypeTitle / Venue / Authors
2022 J jnl
Weighted amplifiers and inapproximability results for Travelling Salesman problem.
J. Comb. Optim.
Miroslav Chlebík, Janka Chlebíková
2019 Misc conf
Approximation Hardness of Travelling Salesman via Weighted Amplifiers.
COCOON
Miroslav Chlebík, Janka Chlebíková
2014 J jnl
Connection between conjunctive capacity and structural properties of graphs.
Theor. Comput. Sci.
Miroslav Chlebík, Janka Chlebíková
2013 Misc conf
On the Conjunctive Capacity of Graphs.
COCOON
Miroslav Chlebík, Janka Chlebíková
2009 J jnl
Hardness of approximation for orthogonal rectangle packing and covering problems.
J. Discrete Algorithms
Miroslav Chlebík, Janka Chlebíková
2008 J jnl
Approximation hardness of dominating set problems in bounded degree graphs.
Inf. Comput.
Miroslav Chlebík, Janka Chlebíková
2008 J jnl
Crown reductions for the Minimum Weighted Vertex Cover problem.
Discret. Appl. Math.
Miroslav Chlebík, Janka Chlebíková
2008 J jnl
The Steiner tree problem on graphs: Inapproximability results.
Theor. Comput. Sci.
Miroslav Chlebík, Janka Chlebíková
2007 J jnl
Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover.
Discret. Appl. Math.
Miroslav Chlebík, Janka Chlebíková
2007 J jnl
The Complexity of Combinatorial Optimization Problems on d-Dimensional Boxes.
SIAM J. Discret. Math.
Miroslav Chlebík, Janka Chlebíková
2006 J jnl
Approximation hardness of edge dominating set problems.
J. Comb. Optim.
Miroslav Chlebík, Janka Chlebíková
2006 J jnl
Complexity of approximating bounded variants of optimization problems.
Theor. Comput. Sci.
Miroslav Chlebík, Janka Chlebíková
2006 J jnl
Hard coloring problems in low degree planar bipartite graphs.
Discret. Appl. Math.
Miroslav Chlebík, Janka Chlebíková
2006 J jnl
Hardness of asymptotic approximation for orthogonal rectangle packing and covering problems
Electron. Colloquium Comput. Complex.
Janka Chlebíková, Miroslav Chlebík
2006 C conf
Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations.
CIAC
Miroslav Chlebík, Janka Chlebíková
2005 A* conf
Approximation hardness of optimization problems in intersection graphs of
SODA
Miroslav Chlebík, Janka Chlebíková
2004 A conf
Approximation Hardness of Dominating Set Problems.
ESA
Miroslav Chlebík, Janka Chlebíková
2004 J jnl
Crown reductions for the Minimum Weighted Vertex Cover problem
Electron. Colloquium Comput. Complex.
Miroslav Chlebík, Janka Chlebíková
2004 — conf
Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity.
SWAT
Miroslav Chlebík, Janka Chlebíková
2004 B conf
On Approximability of the Independent Set Problem for Low Degree Graphs.
SIROCCO
Miroslav Chlebík, Janka Chlebíková
2004 B conf
On Approximation Hardness of the Minimum 2SAT-DELETION Problem.
MFCS
Miroslav Chlebík, Janka Chlebíková
2003 C conf
Approximation Hardness for Small Occurrence Instances of NP-Hard Problems.
CIAC
Miroslav Chlebík, Janka Chlebíková
2003 B conf
Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching.
ISAAC
Miroslav Chlebík, Janka Chlebíková
2003 B conf
Inapproximability Results for Bounded Variants of Optimization Problems.
FCT
Miroslav Chlebík, Janka Chlebíková
2003 J jnl
Inapproximability results for bounded variants of optimization problems
Electron. Colloquium Comput. Complex.
Janka Chlebíková, Miroslav Chlebík
2002 J jnl
Approximation Hardness for Small Occurrence Instances of NP-Hard Problem
Electron. Colloquium Comput. Complex.
Janka Chlebíková, Miroslav Chlebík
2002 — conf
Approximation Hardness of the Steiner Tree Problem on Graphs.
SWAT
Miroslav Chlebík, Janka Chlebíková