Miroslav Chlebík

From MaRDI portal
Revision as of 15:17, 8 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Miroslav Chlebík to Miroslav Chlebík: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:178353

Available identifiers

zbMath Open chlebik.miroslavMaRDI QIDQ178353

List of research outcomes





PublicationDate of PublicationType
Weighted amplifiers and inapproximability results for travelling salesman problem2022-07-18Paper
Approximation hardness of Travelling Salesman via weighted amplifiers2020-02-24Paper
Going beyond variation of sets2017-03-17Paper
On the Erd\"os similarity problem2015-12-17Paper
https://portal.mardi4nfdi.de/entity/Q29216792014-10-13Paper
Connection between conjunctive capacity and structural properties of graphs2014-10-06Paper
On the Conjunctive Capacity of Graphs2013-06-11Paper
Blow-up Rate Estimates for Parabolic Equations2012-11-27Paper
The Blow-up Rate Estimates for a System of Heat Equations with Nonlinear Boundary Conditions2012-11-27Paper
On Blow-up of a Seimilinear Heat Equation with Nonlinear Boundary Conditions2012-11-27Paper
On Blow-up of A Reaction Diffusion System Coupled in Both Equations and Boundary Conditions2012-11-27Paper
The Blow up Rate Estimates for a Reaction Diffusion System with Gradient Terms2012-11-27Paper
Blow-up Rate Estimates for a Semilinear Heat Equation with a Gradient Term2012-11-27Paper
Fundamentals of Computation Theory2010-04-20Paper
Algorithms and Computation2009-08-07Paper
Hardness of approximation for orthogonal rectangle packing and covering problems2009-06-24Paper
Approximation hardness of dominating set problems in bounded degree graphs2008-12-03Paper
The Steiner tree problem on graphs: inapproximability results2008-11-12Paper
The Complexity of Combinatorial Optimization Problems on d‐Dimensional Boxes2008-03-28Paper
Crown reductions for the minimum weighted vertex cover problem2008-02-26Paper
Approximation hardness of edge dominating set problems2007-06-21Paper
Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations2007-05-02Paper
Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover2007-02-19Paper
Hard coloring problems in low degree planar bipartite graphs2006-09-28Paper
Complexity of approximating bounded variants of optimization problems2006-04-28Paper
The perimeter inequality under Steiner symmetrization: cases of equality2006-03-10Paper
Structural Information and Communication Complexity2005-09-07Paper
Algorithm Theory - SWAT 20042005-09-07Paper
Mathematical Foundations of Computer Science 20042005-08-22Paper
Algorithms – ESA 20042005-08-18Paper
https://portal.mardi4nfdi.de/entity/Q30464892004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q44070832004-01-26Paper
https://portal.mardi4nfdi.de/entity/Q44375052003-12-02Paper
Positive solutions of linear elliptic equations with critical growth in the Neumann boundary condition2003-09-16Paper
Rigidity for the four gradient problem2002-10-30Paper
https://portal.mardi4nfdi.de/entity/Q45145212002-03-04Paper
On the blow-up rate for the heat equation with a nonlinear boundary condition2002-03-04Paper
https://portal.mardi4nfdi.de/entity/Q47888232002-01-01Paper
Finite sets of gradients and rank-one connections2001-06-10Paper
https://portal.mardi4nfdi.de/entity/Q45027192000-09-12Paper
Existence of positive solutions of a semilinear elliptic equation in \(\mathbb{R}_+^n\) with a nonlinear boundary condition1998-11-29Paper
There are 2 c Symmetrically Continuous Functions1992-06-26Paper

Research outcomes over time

This page was built for person: Miroslav Chlebík