dblp.uni-trier.dewww.uni-trier.de

Miroslav Chlebík

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
22EEMiroslav Chlebík, Janka Chlebíková: Crown reductions for the Minimum Weighted Vertex Cover problem. Discrete Applied Mathematics 156(3): 292-312 (2008)
21EEMiroslav Chlebík, Janka Chlebíková: Approximation hardness of dominating set problems in bounded degree graphs. Inf. Comput. 206(11): 1264-1275 (2008)
20EEMiroslav Chlebík, Janka Chlebíková: The Steiner tree problem on graphs: Inapproximability results. Theor. Comput. Sci. 406(3): 207-214 (2008)
2007
19EEMiroslav Chlebík, Janka Chlebíková: Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover. Discrete Applied Mathematics 155(2): 172-179 (2007)
18EEMiroslav 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
17EEMiroslav Chlebík, Janka Chlebíková: Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations. CIAC 2006: 199-210
16EEMiroslav Chlebík, Janka Chlebíková: Hard coloring problems in low degree planar bipartite graphs. Discrete Applied Mathematics 154(14): 1960-1965 (2006)
15EEJanka Chlebíková, Miroslav Chlebík: Hardness of asymptotic approximation for orthogonal rectangle packing and covering problems Electronic Colloquium on Computational Complexity (ECCC)(019): (2006)
14EEMiroslav Chlebík, Janka Chlebíková: Approximation hardness of edge dominating set problems. J. Comb. Optim. 11(3): 279-290 (2006)
13EEMiroslav Chlebík, Janka Chlebíková: Complexity of approximating bounded variants of optimization problems. Theor. Comput. Sci. 354(3): 320-338 (2006)
2005
12EEMiroslav Chlebík, Janka Chlebíková: Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes. SODA 2005: 267-276
2004
11EEMiroslav Chlebík, Janka Chlebíková: Approximation Hardness of Dominating Set Problems. ESA 2004: 192-203
10EEMiroslav Chlebík, Janka Chlebíková: On Approximation Hardness of the Minimum 2SAT-DELETION Problem. MFCS 2004: 263-273
9EEMiroslav Chlebík, Janka Chlebíková: On Approximability of the Independent Set Problem for Low Degree Graphs. SIROCCO 2004: 47-56
8EEMiroslav Chlebík, Janka Chlebíková: Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity. SWAT 2004: 174-186
7EEMiroslav Chlebík, Janka Chlebíková: Crown reductions for the Minimum Weighted Vertex Cover problem Electronic Colloquium on Computational Complexity (ECCC)(101): (2004)
2003
6EEMiroslav Chlebík, Janka Chlebíková: Approximation Hardness for Small Occurrence Instances of NP-Hard Problems. CIAC 2003: 152-164
5EEMiroslav Chlebík, Janka Chlebíková: Inapproximability Results for Bounded Variants of Optimization Problems. FCT 2003: 27-38
4EEMiroslav Chlebík, Janka Chlebíková: Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching. ISAAC 2003: 415-424
3EEJanka Chlebíková, Miroslav Chlebík: Inapproximability results for bounded variants of optimization problems Electronic Colloquium on Computational Complexity (ECCC) 10(026): (2003)
2002
2EEMiroslav Chlebík, Janka Chlebíková: Approximation Hardness of the Steiner Tree Problem on Graphs. SWAT 2002: 170-179
1EEJanka Chlebíková, Miroslav Chlebík: Approximation Hardness for Small Occurrence Instances of NP-Hard Problem Electronic Colloquium on Computational Complexity (ECCC)(073): (2002)

Coauthor Index

1Janka Chlebíková [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)