| Publication | Date of Publication | Type |
|---|
| Weighted amplifiers and inapproximability results for travelling salesman problem | 2022-07-18 | Paper |
| Approximation hardness of Travelling Salesman via weighted amplifiers | 2020-02-24 | Paper |
| Going beyond variation of sets | 2017-03-17 | Paper |
| On the Erd\"os similarity problem | 2015-12-17 | Paper |
| Approximation hardness of optimization problems in intersection graphs of \(d\)-dimensional boxes | 2014-10-13 | Paper |
| Connection between conjunctive capacity and structural properties of graphs | 2014-10-06 | Paper |
| On the Conjunctive Capacity of Graphs | 2013-06-11 | Paper |
| Blow-up Rate Estimates for Parabolic Equations | 2012-11-27 | Paper |
| The Blow-up Rate Estimates for a System of Heat Equations with Nonlinear Boundary Conditions | 2012-11-27 | Paper |
| On Blow-up of a Seimilinear Heat Equation with Nonlinear Boundary Conditions | 2012-11-27 | Paper |
| On Blow-up of A Reaction Diffusion System Coupled in Both Equations and Boundary Conditions | 2012-11-27 | Paper |
| The Blow up Rate Estimates for a Reaction Diffusion System with Gradient Terms | 2012-11-27 | Paper |
| Blow-up Rate Estimates for a Semilinear Heat Equation with a Gradient Term | 2012-11-27 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Hardness of approximation for orthogonal rectangle packing and covering problems | 2009-06-24 | Paper |
| Approximation hardness of dominating set problems in bounded degree graphs | 2008-12-03 | Paper |
| The Steiner tree problem on graphs: inapproximability results | 2008-11-12 | Paper |
| The Complexity of Combinatorial Optimization Problems on d‐Dimensional Boxes | 2008-03-28 | Paper |
| Crown reductions for the minimum weighted vertex cover problem | 2008-02-26 | Paper |
| Approximation hardness of edge dominating set problems | 2007-06-21 | Paper |
| Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations | 2007-05-02 | Paper |
| Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover | 2007-02-19 | Paper |
| Hard coloring problems in low degree planar bipartite graphs | 2006-09-28 | Paper |
| Complexity of approximating bounded variants of optimization problems | 2006-04-28 | Paper |
| The perimeter inequality under Steiner symmetrization: cases of equality | 2006-03-10 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046489 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407083 | 2004-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437505 | 2003-12-02 | Paper |
| Positive solutions of linear elliptic equations with critical growth in the Neumann boundary condition | 2003-09-16 | Paper |
| Rigidity for the four gradient problem | 2002-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4514521 | 2002-03-04 | Paper |
| On the blow-up rate for the heat equation with a nonlinear boundary condition | 2002-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788823 | 2002-01-01 | Paper |
| Finite sets of gradients and rank-one connections | 2001-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4502719 | 2000-09-12 | Paper |
| Existence of positive solutions of a semilinear elliptic equation in \(\mathbb{R}_+^n\) with a nonlinear boundary condition | 1998-11-29 | Paper |
| There are 2 c Symmetrically Continuous Functions | 1992-06-26 | Paper |
