http://sro.sussex.ac.uk/ http://sro.sussex.ac.uk/images/sitelogo.png http://sro.sussex.ac.uk/ Mon, 20 Nov 2023 15:32:23 +0000 Mon, 20 Nov 2023 15:32:23 +0000 en Thu, 22 Oct 2020 07:16:18 +0100 http://sro.sussex.ac.uk/id/eprint/94514/ http://sro.sussex.ac.uk/id/eprint/94514/ Chlebik, Miroslav and Chlebikova, Janka (2020) Weighted amplifiers and inapproximability results for Travelling Salesman problem. Journal of Combinatorial Optimization. pp. 1-25. ISSN 1382-6905 Mon, 03 Feb 2020 09:10:01 +0000 http://sro.sussex.ac.uk/id/eprint/89692/ http://sro.sussex.ac.uk/id/eprint/89692/ Rasheed, Maan A and Chlebik, Miroslav (2020) Blow-up rate estimates and blow-up set for a system of two heat equations with coupled nonlinear neumann boundary conditions. Iraqi Journal of Science, 61 (1). pp. 147-152. ISSN 0067-2904 Mon, 23 Sep 2019 11:22:09 +0100 http://sro.sussex.ac.uk/id/eprint/86319/ http://sro.sussex.ac.uk/id/eprint/86319/ Chlebík, Miroslav and Chlebíková, Janka (2019) Approximation hardness of Travelling Salesman via weighted amplifiers. International Computing and Combinatorics Conference (COCOON 2019), China, 2019. Published in: Du, D Z, Duan, Z and Tian, C, (eds.) Computing and Combinatorics. 11653 115-127. Springer, Cham, Switzerland. ISBN 978-3-030-26175-7 Fri, 18 Nov 2016 09:17:45 +0000 http://sro.sussex.ac.uk/id/eprint/65519/ http://sro.sussex.ac.uk/id/eprint/65519/ Chlebík, Miroslav (2017) Going beyond variation of sets. Nonlinear Analysis: Theory, Methods and Applications, 153. pp. 230-242. ISSN 0362-546X Fri, 16 May 2014 06:27:14 +0100 http://sro.sussex.ac.uk/id/eprint/48709/ http://sro.sussex.ac.uk/id/eprint/48709/ 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 Fri, 16 May 2014 06:21:17 +0100 http://sro.sussex.ac.uk/id/eprint/48710/ http://sro.sussex.ac.uk/id/eprint/48710/ 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 Mon, 06 Feb 2012 21:20:22 +0000 http://sro.sussex.ac.uk/id/eprint/30820/ http://sro.sussex.ac.uk/id/eprint/30820/ 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 Mon, 06 Feb 2012 21:01:14 +0000 http://sro.sussex.ac.uk/id/eprint/29125/ http://sro.sussex.ac.uk/id/eprint/29125/ 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. Mon, 06 Feb 2012 20:33:09 +0000 http://sro.sussex.ac.uk/id/eprint/26551/ http://sro.sussex.ac.uk/id/eprint/26551/ 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 Mon, 06 Feb 2012 20:32:11 +0000 http://sro.sussex.ac.uk/id/eprint/26448/ http://sro.sussex.ac.uk/id/eprint/26448/ 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. Mon, 06 Feb 2012 20:28:31 +0000 http://sro.sussex.ac.uk/id/eprint/26053/ http://sro.sussex.ac.uk/id/eprint/26053/ 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 Mon, 06 Feb 2012 20:25:25 +0000 http://sro.sussex.ac.uk/id/eprint/25845/ http://sro.sussex.ac.uk/id/eprint/25845/ 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 Mon, 06 Feb 2012 20:23:15 +0000 http://sro.sussex.ac.uk/id/eprint/25691/ http://sro.sussex.ac.uk/id/eprint/25691/ 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 Mon, 06 Feb 2012 20:19:40 +0000 http://sro.sussex.ac.uk/id/eprint/25454/ http://sro.sussex.ac.uk/id/eprint/25454/ 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 Mon, 06 Feb 2012 20:19:13 +0000 http://sro.sussex.ac.uk/id/eprint/25391/ http://sro.sussex.ac.uk/id/eprint/25391/ 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 Mon, 06 Feb 2012 20:17:10 +0000 http://sro.sussex.ac.uk/id/eprint/25162/ http://sro.sussex.ac.uk/id/eprint/25162/ 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 Mon, 06 Feb 2012 20:15:41 +0000 http://sro.sussex.ac.uk/id/eprint/25009/ http://sro.sussex.ac.uk/id/eprint/25009/ 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 Mon, 06 Feb 2012 20:12:15 +0000 http://sro.sussex.ac.uk/id/eprint/24660/ http://sro.sussex.ac.uk/id/eprint/24660/ 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. Mon, 06 Feb 2012 20:11:02 +0000 http://sro.sussex.ac.uk/id/eprint/24514/ http://sro.sussex.ac.uk/id/eprint/24514/ 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. Mon, 06 Feb 2012 20:01:17 +0000 http://sro.sussex.ac.uk/id/eprint/23557/ http://sro.sussex.ac.uk/id/eprint/23557/ 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. Mon, 06 Feb 2012 19:55:46 +0000 http://sro.sussex.ac.uk/id/eprint/23034/ http://sro.sussex.ac.uk/id/eprint/23034/ 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 Mon, 06 Feb 2012 19:51:06 +0000 http://sro.sussex.ac.uk/id/eprint/22527/ http://sro.sussex.ac.uk/id/eprint/22527/ 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 Mon, 06 Feb 2012 19:49:34 +0000 http://sro.sussex.ac.uk/id/eprint/22356/ http://sro.sussex.ac.uk/id/eprint/22356/ 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 Mon, 06 Feb 2012 19:44:59 +0000 http://sro.sussex.ac.uk/id/eprint/22022/ http://sro.sussex.ac.uk/id/eprint/22022/ 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 Mon, 06 Feb 2012 19:43:57 +0000 http://sro.sussex.ac.uk/id/eprint/21947/ http://sro.sussex.ac.uk/id/eprint/21947/ Chlebik, Miroslav (1991) There are 2^c symmetrically continuous functions. Proceedings of the American Mathematical Society, 113 (3). pp. 683-688. ISSN 0002-9939 Mon, 06 Feb 2012 19:40:02 +0000 http://sro.sussex.ac.uk/id/eprint/21701/ http://sro.sussex.ac.uk/id/eprint/21701/ 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 Mon, 06 Feb 2012 19:37:03 +0000 http://sro.sussex.ac.uk/id/eprint/21503/ http://sro.sussex.ac.uk/id/eprint/21503/ 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 Mon, 06 Feb 2012 19:33:51 +0000 http://sro.sussex.ac.uk/id/eprint/21283/ http://sro.sussex.ac.uk/id/eprint/21283/ 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 Mon, 06 Feb 2012 19:30:53 +0000 http://sro.sussex.ac.uk/id/eprint/20961/ http://sro.sussex.ac.uk/id/eprint/20961/ 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 Mon, 06 Feb 2012 19:26:52 +0000 http://sro.sussex.ac.uk/id/eprint/20610/ http://sro.sussex.ac.uk/id/eprint/20610/ 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 Mon, 06 Feb 2012 19:16:52 +0000 http://sro.sussex.ac.uk/id/eprint/19881/ http://sro.sussex.ac.uk/id/eprint/19881/ 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. Mon, 06 Feb 2012 19:14:15 +0000 http://sro.sussex.ac.uk/id/eprint/19674/ http://sro.sussex.ac.uk/id/eprint/19674/ 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. Mon, 06 Feb 2012 19:14:05 +0000 http://sro.sussex.ac.uk/id/eprint/19663/ http://sro.sussex.ac.uk/id/eprint/19663/ 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. Mon, 06 Feb 2012 19:09:43 +0000 http://sro.sussex.ac.uk/id/eprint/19442/ http://sro.sussex.ac.uk/id/eprint/19442/ 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 Mon, 06 Feb 2012 19:08:33 +0000 http://sro.sussex.ac.uk/id/eprint/19378/ http://sro.sussex.ac.uk/id/eprint/19378/ 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. Mon, 06 Feb 2012 18:55:02 +0000 http://sro.sussex.ac.uk/id/eprint/18909/ http://sro.sussex.ac.uk/id/eprint/18909/ 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 Mon, 06 Feb 2012 18:44:05 +0000 http://sro.sussex.ac.uk/id/eprint/18008/ http://sro.sussex.ac.uk/id/eprint/18008/ 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 Mon, 06 Feb 2012 18:39:52 +0000 http://sro.sussex.ac.uk/id/eprint/17644/ http://sro.sussex.ac.uk/id/eprint/17644/ 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 Mon, 06 Feb 2012 18:36:07 +0000 http://sro.sussex.ac.uk/id/eprint/17330/ http://sro.sussex.ac.uk/id/eprint/17330/ 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 Mon, 06 Feb 2012 18:27:34 +0000 http://sro.sussex.ac.uk/id/eprint/16474/ http://sro.sussex.ac.uk/id/eprint/16474/ 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 Mon, 06 Feb 2012 18:24:27 +0000 http://sro.sussex.ac.uk/id/eprint/16143/ http://sro.sussex.ac.uk/id/eprint/16143/ 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.