Items for Chlebik, Miroslav

Up a level
Export as [feed] RSS
Group by: Item Type | No Grouping
Number of items: 38.

Article

Chlebík, Miroslav (2017) Going beyond variation of sets. Nonlinear Analysis: Theory, Methods and Applications, 153. pp. 230-242. ISSN 0362-546X

Chlebík, Miroslav and Chlebíková, Janka (2014) Connection between conjunctive capacity and structural properties of graphs. Theoretical Computer Science, 544. pp. 109-118. ISSN 0304-3975

Chlebík, Miroslav and Chlebíková, Janka (2009) Hardness of approximation for orthogonal rectagle packing and covering problems. Journal of Discrete Algorithms, 7 (3). pp. 291-305. ISSN 1570-8667

Chlebík, M and Chlebíková, J (2008) Approximation hardness of dominating set problems in bounded degree graphs. Information and Computation, 206 (11). pp. 1264-1275. ISSN 0890-5401

Chlebík, Miroslav and Chlebíková, Janka (2008) The Steiner tree problem on graphs: Inapproximability results. Theoretical Computer Science, 406 (3). pp. 207-214. ISSN 0304-3975

Chlebík, Miroslav and Chlebíková, Janka (2008) Crown reductions for the minimum weighted vertex cover problem. Discrete Applied Mathematics, 156 (3). pp. 292-312. ISSN 0166-218X

Chlebík, Miroslav and Chlebíková, Janka (2007) Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover. Discrete Applied Mathematics, 155 (2). pp. 172-179. ISSN 0166-218X

Chlebík, Miroslav and Chlebíková, Janka (2007) The complexity of combinatorial optimization problems on d-dimensional boxes. SIAM Journal on Discrete Mathematics, 21 (1). pp. 158-169. ISSN 0895-4801

Chlebík, Miroslav and Chlebíková, Janka (2006) Hard coloring problems in low degree planar bipartite graphs. Discrete Applied Mathematics, 154 (14). pp. 1960-1965. ISSN 0166-218X

Chlebík, Miroslav and Chlebíková, Janka (2006) Approximation hardness of edge dominating set problems. Journal of Combinatorial Optimization, 11 (3). pp. 279-290. ISSN 1382-6905

Chlebík, Miroslav and Chlebíková, Janka (2006) Complexity of approximating bounded variants of optimization problems. Theoretical Computer Science, 354 (3). pp. 320-338. ISSN 0304-3975

Chlebíková, Janka and Chlebík, Miroslav (2006) Hardness of asymptotic approximation for orthogonal rectangle packing and covering problems. Electronic Colloquium on Computational Complexity, 13 (19). pp. 1-23. ISSN 1433-8092

Chlebík, Miroslav, Cianchi, Andrea and Fusco, Nicola (2005) The perimeter inequality under Steiner symmetrization: Cases of equality. Annals of Mathematics, 162 (1). pp. 525-555. ISSN 0003-486X

Chlebík, Miroslav and Chlebíková, Janka (2004) Crown reductions for the Minimum Weighted Vertex Cover problem. Electronic Colloquium on Computational Complexity, 11 (101). pp. 1-25. ISSN 1433-8092

Chlebik, Miroslav, Fila, Marek and Quittner, Pavol (2003) Blow-up of positive solutions of a semilinear parabolic equation with a gradient term. Dynamics of Continuous Discrete and Impulsive Systems, 10 (4). pp. 525-537. ISSN 1201-3390

Chlebík, Miroslav, Fila, Marek and Reichel, Wolfgang (2003) Positive solutions of linear elliptic equations with critical growth in the Neumann boundary condition. Nonlinear Differential Equations and Applications, 10 (3). pp. 329-346. ISSN 1021-9722

Chlebík, Miroslav and Chlebíková, Janka (2003) Inapproximability results for bounded variants of optimization problems. Electronic Colloquium on Computational Complexity, 10 (26). pp. 1-26. ISSN 1433-8092

Chlebíková, Janka and Chlebík, Miroslav (2002) Approximation Hardness for Small Occurrence Instances of NP-Hard Problems. Electronic Colloquium on Computational Complexity, 9 (73). pp. 1-23. ISSN 1433-8092

Chlebík, Miroslav and Kirchheim, Bernd (2002) Rigidity for the four gradient problem. Journal fuer die reine und angewandte Mathematik, 2002 (551). pp. 1-9. ISSN 0075-4102

Chlebík, Miroslav and Fila, Marek (2000) On the blow-up rate for the heat equation with a nonlinear boundary condition. Mathematical Methods in the Applied Sciences, 23 (15). pp. 1323-1330. ISSN 0170-4214

Chlebik, M and Fila, M (2000) From critical exponents to blow-up rates for parabolic problems. Rendiconti di Matematica, 19 (4). pp. 449-470. ISSN 1120-7183

Chlebík, M and Fila, M (2000) Some recent results on blow-up on the boundary for the heat equation. Banach Center Publications, 52. pp. 61-71. ISSN 0137-6934

Chipot, M, Chlebík, M, Fila, M and Shafrir, I (1998) Existence of positive solutions of a semilinear elliptic equation in R^n_+ with a nonlinear boundary condition. Journal of Mathematical Analysis and Applications, 223 (2). pp. 429-471. ISSN 0022-247X

Chlebík, Miroslav and Kral, Josef (1994) Removability of the wave singularities in the plane. Aequationes Mathematicae, 47 (2-3). pp. 123-142. ISSN 0001-9054

Chlebik, Miroslav (1991) There are 2^c symmetrically continuous functions. Proceedings of the American Mathematical Society, 113 (3). pp. 683-688. ISSN 0002-9939

Chlebík, M and Kral, J (1989) Removable singularities of the functional wave equation. Zeitschrift fur Analysis und ihre Anwendungen, 8 (6). pp. 495-500. ISSN 0232-2064

Book Section

Chlebík, Miroslav and Chlebíková, Janka (2013) On the conjunctive capacity of graphs. In: Du, Ding-Zhu and Zhang, Guochuan (eds.) Computing and combinatorics: 19th annual international conference, COCOON 2013, Hangzhou, China, June 21-23, 2013 : proceedings. Lecture notes in computer science (7936). Springer-Verlag, Berlin, pp. 280-291. ISBN 9783642387678

Chlebik, Miroslav (2002) Geometric measure theory: selected concepts, results and problems. In: Pap, E (ed.) Handbook of measure theory. North-Holland, pp. 1011-1036. ISBN 9780444502636

Conference or Workshop Item

Chlebík, Miroslav and Chlebíková, Janka (2006) Inapproximability results for orthogonal rectangle packing problems with rotations. In: 6th Italian Conference on Algorithms and Complexity (CIAC 2006), Rome, ITALY.

Chlebík, Miroslav and Chlebíková, Janka (2005) Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes. In: Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada.

Chlebík, Miroslav and Chlebíková, Janka (2004) Approximation hardness of dominating set problems. In: 12th Annual European Symposium on Algorithms (ESA 2004), Bergen, NORWAY.

Chlebík, Miroslav and Chlebíková, Janka (2004) Improvement of Nemhauser-Trotter theorem and its applications in parametrized complexity. In: 9th Scandinavian Workshop on Algorithm Theory, Louisiana Museum Modern Art, Humlebaek, DENMARK.

Chlebik, Miroslav and Chlebíková, Janka (2004) On approximability of the independent set problem for low degree graphs. In: 11th International Colloquium on Structural Information and Communication Complexity, Smolenice, SLOVAKIA.

Chlebík, Miroslav and Chlebíková, Janka (2004) On approximation hardness of the minimum 2SAT-deletion problem. In: 29th International Symposium on Mathematical Foundations of Computer Science, Prague, CZECH REPUBLIC.

Chlebík, Miroslav and Chlebíková, Janka (2003) Approximation hardness for small occurrence instances of NP-hard problems. In: 5th Italian Conference on Algorithms and Complexity, Rome, 28-30 May 2003.

Chlebík, Miroslav and Chlebíková, Janka (2003) Approximation hardness of minimum edge dominating set and minimum maximal matching. In: 14th Annual International Symposium on Algorithms and Computation, Algorithms and Computation, KYOTO, JAPAN.

Chlebik, Miroslav and Chlebíková, Janka (2003) Inapproximability results for bounded variants of optimization problems. In: 14th International Symposium on Fundamentals of Computation Theory, MALMO, SWEDEN.

Chlebík, Miroslav and Chlebíková, Janka (2002) Approximation hardness of the Steiner tree problem on graphs. In: 8th Scandinavian Workshop on Algorithm Theory, TURKU, FINLAND.

This list was generated on Tue Nov 21 22:43:11 2017 GMT.