The following pages link to Miroslav Chlebík (Q178353):
Displayed 43 items.
- Going beyond variation of sets (Q515930) (← links)
- Connection between conjunctive capacity and structural properties of graphs (Q744094) (← links)
- The perimeter inequality under Steiner symmetrization: cases of equality (Q816332) (← links)
- Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover (Q867859) (← links)
- The Steiner tree problem on graphs: inapproximability results (Q952442) (← links)
- Approximation hardness of dominating set problems in bounded degree graphs (Q958303) (← links)
- Hardness of approximation for orthogonal rectangle packing and covering problems (Q1026242) (← links)
- Item:Q178353 (redirect page) (← links)
- Existence of positive solutions of a semilinear elliptic equation in \(\mathbb{R}_+^n\) with a nonlinear boundary condition (Q1269552) (← links)
- Positive solutions of linear elliptic equations with critical growth in the Neumann boundary condition (Q1407641) (← links)
- Weighted amplifiers and inapproximability results for travelling salesman problem (Q2156301) (← links)
- Approximation hardness of Travelling Salesman via weighted amplifiers (Q2300033) (← links)
- Complexity of approximating bounded variants of optimization problems (Q2368970) (← links)
- Approximation hardness of edge dominating set problems (Q2369972) (← links)
- Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← links)
- Hard coloring problems in low degree planar bipartite graphs (Q2506359) (← links)
- (Q2921679) (← links)
- (Q3046489) (← links)
- Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations (Q3434557) (← links)
- There are 2 c Symmetrically Continuous Functions (Q3982126) (← links)
- (Q4407083) (← links)
- (Q4437505) (← links)
- (Q4502719) (← links)
- (Q4514521) (← links)
- (Q4522558) (← links)
- Rigidity for the four gradient problem (Q4779982) (← links)
- (Q4788823) (← links)
- On the Conjunctive Capacity of Graphs (Q4925245) (← links)
- Algorithms and Computation (Q5191669) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311102) (← links)
- Structural Information and Communication Complexity (Q5315241) (← links)
- Algorithm Theory - SWAT 2004 (Q5315369) (← links)
- The Complexity of Combinatorial Optimization Problems on <i>d</i>‐Dimensional Boxes (Q5454268) (← links)
- Algorithms – ESA 2004 (Q5464578) (← links)
- Fundamentals of Computation Theory (Q5900783) (← links)
- Finite sets of gradients and rank-one connections (Q5932587) (← links)
- Blow-up Rate Estimates for Parabolic Equations (Q6237532) (← links)
- The Blow-up Rate Estimates for a System of Heat Equations with Nonlinear Boundary Conditions (Q6237536) (← links)
- On Blow-up of a Seimilinear Heat Equation with Nonlinear Boundary Conditions (Q6237537) (← links)
- On Blow-up of A Reaction Diffusion System Coupled in Both Equations and Boundary Conditions (Q6237538) (← links)
- The Blow up Rate Estimates for a Reaction Diffusion System with Gradient Terms (Q6237539) (← links)
- Blow-up Rate Estimates for a Semilinear Heat Equation with a Gradient Term (Q6237540) (← links)
- On the Erd\"os similarity problem (Q6268501) (← links)