| Approximation hardness of dominating set problems in bounded degree graphs M Chlebík, J Chlebíková Information and Computation 206 (11), 1264-1275, 2008 | 192 | 2008 |
| The Steiner tree problem on graphs: Inapproximability results M Chlebík, J Chlebíková Theoretical Computer Science 406 (3), 207-214, 2008 | 178 | 2008 |
| Complexity of approximating bounded variants of optimization problems M Chlebík, J Chlebíková Theoretical Computer Science 354 (3), 320-338, 2006 | 138 | 2006 |
| Crown reductions for the minimum weighted vertex cover problem M Chlebík, J Chlebíková Discrete Applied Mathematics 156 (3), 292-312, 2008 | 106 | 2008 |
| Approximation hardness of the Steiner tree problem on graphs M Chlebík, J Chlebíková Scandinavian Workshop on Algorithm Theory, 170-179, 2002 | 105 | 2002 |
| From critical exponents to blow-up rates for parabolic problems M Chlebik, M Fila Rendiconti di Matematica e delle Sue Applicazioni, Vol. 19, No. 4 (1999 …, 1999 | 101 | 1999 |
| Existence of positive solutions of a semilinear elliptic equation in Rn+ with a nonlinear boundary condition M Chipot, M Chlebık, M Fila, I Shafrir Journal of mathematical analysis and applications 223 (2), 429-471, 1998 | 100 | 1998 |
| The perimeter inequality under Steiner symmetrization: cases of equality M Chlebík, A Cianchi, N Fusco Annals of mathematics, 525-555, 2005 | 92 | 2005 |
| Approximation hardness of edge dominating set problems M Chlebík, J Chlebíková Journal of Combinatorial Optimization 11 (3), 279-290, 2006 | 60 | 2006 |
| Approximation hardness for small occurrence instances of NP-hard problems M Chlebík, J Chlebíková Italian Conference on Algorithms and Complexity, 152-164, 2003 | 56 | 2003 |
| Rigidity for the four gradient problem M Chlebík, B Kirchheim Walter de Gruyter GmbH & Co. KG 2002 (551), 1-9, 2002 | 56 | 2002 |
| Approximation hardness of dominating set problems M Chlebík, J Chlebíková Algorithms–ESA 2004: 12th Annual European Symposium, Bergen, Norway …, 2004 | 52 | 2004 |
| Inapproximability results for bounded variants of optimization problems M Chlebík, J Chlebíková International Symposium on Fundamentals of Computation Theory, 27-38, 2003 | 52 | 2003 |
| Blow-up of positive solutions of a semilinear parabolic equation with a gradient term M Chlebık, M Fila, P Quittner Dyn. Contin. Discrete Impuls. Syst. Ser. A Math. Anal 10 (4), 525-537, 2003 | 46 | 2003 |
| On the blow‐up rate for the heat equation with a nonlinear boundary condition M Chlebík, M Fila Mathematical methods in the applied sciences 23 (15), 1323-1330, 2000 | 40 | 2000 |
| The Complexity of Combinatorial Optimization Problems on d‐Dimensional Boxes M Chlebík, J Chlebíková SIAM Journal on Discrete Mathematics 21 (1), 158-169, 2007 | 36 | 2007 |
| Some recent results on blow-up on the boundary for the heat equation M Chlebík, M Fila Banach Center Publications 52 (1), 61-71, 2000 | 30 | 2000 |
| Inapproximability results for orthogonal rectangle packing problems with rotations M Chlebík, J Chlebíková Italian Conference on Algorithms and Complexity, 199-210, 2006 | 25 | 2006 |
| Hardness of approximation for orthogonal rectangle packing and covering problems M Chlebík, J Chlebíková Journal of Discrete Algorithms 7 (3), 291-305, 2009 | 24 | 2009 |
| Hard coloring problems in low degree planar bipartite graphs M Chlebík, J Chlebíková Discrete Applied Mathematics 154 (14), 1960-1965, 2006 | 24 | 2006 |
Janka ChlebikovaSenior Lecturer, University of PortsmouthVerified email at port.ac.uk
