- CSB - MetaPress - Google - Bing - Yahoo
 | 2009 | |
|---|---|---|
| j16 |      | Miroslav Chlebík, Janka Chlebíková: Hardness of approximation for orthogonal rectangle packing and covering problems. J. Discrete Algorithms 7(3): 291-305 (2009) |
| 2008 | ||
| j15 | | Miroslav Chlebík, Janka Chlebíková: Crown reductions for the Minimum Weighted Vertex Cover problem. Discrete Applied Mathematics 156(3): 292-312 (2008) |
| j14 | | Miroslav Chlebík, Janka Chlebíková: Approximation hardness of dominating set problems in bounded degree graphs. Inf. Comput. 206(11): 1264-1275 (2008) |
| j13 | | Miroslav Chlebík, Janka Chlebíková: The Steiner tree problem on graphs: Inapproximability results. Theor. Comput. Sci. 406(3): 207-214 (2008) |
| 2007 | ||
| j12 | | Miroslav Chlebík, Janka Chlebíková: Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover. Discrete Applied Mathematics 155(2): 172-179 (2007) |
| j11 | | Janka Chlebíková, Klaus Jansen: The d-precoloring problem for k-degenerate graphs. Discrete Mathematics 307(16): 2042-2052 (2007) |
| j10 | | Janka Chlebíková: A characterization of some graph classes using excluded minors. Periodica Mathematica Hungarica 55(1): 1-9 (2007) |
| j9 | | Miroslav Chlebík, Janka Chlebíková: The Complexity of Combinatorial Optimization Problems on d-Dimensional Boxes. SIAM J. Discrete Math. 21(1): 158-169 (2007) |
| 2006 | ||
| j8 | | Miroslav Chlebík, Janka Chlebíková: Hard coloring problems in low degree planar bipartite graphs. Discrete Applied Mathematics 154(14): 1960-1965 (2006) |
| j7 | | Miroslav Chlebík, Janka Chlebíková: Approximation hardness of edge dominating set problems. J. Comb. Optim. 11(3): 279-290 (2006) |
| j6 | | Janka Chlebíková, Deshi Ye, Hu Zhang: Assign ranges in general ad-hoc networks. J. Parallel Distrib. Comput. 66(4): 489-498 (2006) |
| j5 | | Miroslav Chlebík, Janka Chlebíková: Complexity of approximating bounded variants of optimization problems. Theor. Comput. Sci. 354(3): 320-338 (2006) |
| c11 | | Miroslav Chlebík, Janka Chlebíková: Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations. CIAC 2006: 199-210 |
| i4 | | Janka Chlebíková, Miroslav Chlebík: Hardness of asymptotic approximation for orthogonal rectangle packing and covering problems. Electronic Colloquium on Computational Complexity (ECCC)(019) (2006) |
| 2005 | ||
| c10 | | |
| c9 | | Miroslav Chlebík, Janka Chlebíková: Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes. SODA 2005: 267-276 |
| 2004 | ||
| c8 | | Miroslav Chlebík, Janka Chlebíková: Approximation Hardness of Dominating Set Problems. ESA 2004: 192-203 |
| c7 | | Miroslav Chlebík, Janka Chlebíková: On Approximation Hardness of the Minimum 2SAT-DELETION Problem. MFCS 2004: 263-273 |
| c6 | | Miroslav Chlebík, Janka Chlebíková: On Approximability of the Independent Set Problem for Low Degree Graphs. SIROCCO 2004: 47-56 |
| c5 | | Miroslav Chlebík, Janka Chlebíková: Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity. SWAT 2004: 174-186 |
| i3 | | Miroslav Chlebík, Janka Chlebíková: Crown reductions for the Minimum Weighted Vertex Cover problem. Electronic Colloquium on Computational Complexity (ECCC)(101) (2004) |
| 2003 | ||
| c4 | | Miroslav Chlebík, Janka Chlebíková: Approximation Hardness for Small Occurrence Instances of NP-Hard Problems. CIAC 2003: 152-164 |
| c3 | | Miroslav Chlebík, Janka Chlebíková: Inapproximability Results for Bounded Variants of Optimization Problems. FCT 2003: 27-38 |
| c2 | | Miroslav Chlebík, Janka Chlebíková: Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching. ISAAC 2003: 415-424 |
| i2 | | Janka Chlebíková, Miroslav Chlebík: Inapproximability results for bounded variants of optimization problems. Electronic Colloquium on Computational Complexity (ECCC) 10(026) (2003) |
| 2002 | ||
| j4 | | Janka Chlebíková: The structure of obstructions to treewidth and pathwidth. Discrete Applied Mathematics 120(1-3): 61-71 (2002) |
| j3 | | Janka Chlebíková: Partial k-trees with maximum chromatic number. Discrete Mathematics 259(1-3): 269-276 (2002) |
| c1 | | Miroslav Chlebík, Janka Chlebíková: Approximation Hardness of the Steiner Tree Problem on Graphs. SWAT 2002: 170-179 |
| i1 | | Janka Chlebíková, Miroslav Chlebík: Approximation Hardness for Small Occurrence Instances of NP-Hard Problem. Electronic Colloquium on Computational Complexity (ECCC)(073) (2002) |
| 1999 | ||
| j2 | | Janka Chlebíková: The structure of obstructions to treewidth and pathwidth. Electronic Notes in Discrete Mathematics 3: 33-38 (1999) |
| 1996 | ||
| j1 |  | Janka Chlebíková: Approximating the Maximally Balanced Connected Partition Problem in Graphs. Inf. Process. Lett. 60(5): 223-230 (1996) |
| 1 | Miroslav Chlebík | |
| 2 | Klaus Jansen | |
| 3 | Deshi Ye | |
| 4 | Hu Zhang |
Data released under the ODC-BY 1.0 license — See also our legal information page