The SCEAS System
| |||||||

## Search the dblp DataBase
Miroslav Chlebík:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Miroslav Chlebík, Janka Chlebíková
**Approximation Hardness for Small Occurrence Instances of NP-Hard Problems.**[Citation Graph (0, 0)][DBLP] CIAC, 2003, pp:152-164 [Conf] - Miroslav Chlebík, Janka Chlebíková
**Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations.**[Citation Graph (0, 0)][DBLP] CIAC, 2006, pp:199-210 [Conf] - Miroslav Chlebík, Janka Chlebíková
**Approximation Hardness of Dominating Set Problems.**[Citation Graph (0, 0)][DBLP] ESA, 2004, pp:192-203 [Conf] - Miroslav Chlebík, Janka Chlebíková
**Inapproximability Results for Bounded Variants of Optimization Problems.**[Citation Graph (0, 0)][DBLP] FCT, 2003, pp:27-38 [Conf] - Miroslav Chlebík, Janka Chlebíková
**Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching.**[Citation Graph (0, 0)][DBLP] ISAAC, 2003, pp:415-424 [Conf] - Miroslav Chlebík, Janka Chlebíková
**On Approximation Hardness of the Minimum 2SAT-DELETION Problem.**[Citation Graph (0, 0)][DBLP] MFCS, 2004, pp:263-273 [Conf] - Miroslav Chlebík, Janka Chlebíková
**On Approximability of the Independent Set Problem for Low Degree Graphs.**[Citation Graph (0, 0)][DBLP] SIROCCO, 2004, pp:47-56 [Conf] - Miroslav Chlebík, Janka Chlebíková
**Approximation hardness of optimization problems in intersection graphs of**[Citation Graph (0, 0)][DBLP]*d*-dimensional boxes. SODA, 2005, pp:267-276 [Conf] - Miroslav Chlebík, Janka Chlebíková
**Approximation Hardness of the Steiner Tree Problem on Graphs.**[Citation Graph (0, 0)][DBLP] SWAT, 2002, pp:170-179 [Conf] - Miroslav Chlebík, Janka Chlebíková
**Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity.**[Citation Graph (0, 0)][DBLP] SWAT, 2004, pp:174-186 [Conf] - Miroslav Chlebík, Janka Chlebíková
**Hard coloring problems in low degree planar bipartite graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:14, pp:1960-1965 [Journal] - Miroslav Chlebík, Janka Chlebíková
**Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:172-179 [Journal] - Janka Chlebíková, Miroslav Chlebík
**Approximation Hardness for Small Occurrence Instances of NP-Hard Problem**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:073, pp:- [Journal] - Janka Chlebíková, Miroslav Chlebík
**Inapproximability results for bounded variants of optimization problems**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:026, pp:- [Journal] - Miroslav Chlebík, Janka Chlebíková
**Crown reductions for the Minimum Weighted Vertex Cover problem**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:101, pp:- [Journal] - Janka Chlebíková, Miroslav Chlebík
**Hardness of asymptotic approximation for orthogonal rectangle packing and covering problems**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:019, pp:- [Journal] - Miroslav Chlebík, Janka Chlebíková
**Approximation hardness of edge dominating set problems.**[Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2006, v:11, n:3, pp:279-290 [Journal] - Miroslav Chlebík, Janka Chlebíková
**Complexity of approximating bounded variants of optimization problems.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:354, n:3, pp:320-338 [Journal] **Crown reductions for the Minimum Weighted Vertex Cover problem.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |