| Publication | Date of Publication | Type |
|---|
| A characterization of Seymour graphs | 2022-08-30 | Paper |
| Complexity of the weighted max-cut in Euclidean space | 2015-07-27 | Paper |
| NP-hardness of the Euclidean Max-Cut problem | 2014-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115183 | 2012-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115190 | 2012-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115649 | 2012-02-10 | Paper |
| Computational complexity of the graph approximation problem | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115591 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115640 | 2012-02-10 | Paper |
| An Excluded Minor Characterization of Seymour Graphs | 2011-06-24 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| Approximation Algorithms for Scheduling Problems with Exact Delays | 2008-02-21 | Paper |
| A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays | 2008-02-20 | Paper |
| A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem | 2008-02-20 | Paper |
| Approximation algorithms for UET scheduling problems with exact delays | 2007-10-30 | Paper |
| Open block scheduling in optical communication networks | 2006-09-14 | Paper |
| Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem | 2005-02-28 | Paper |
| Pipage rounding: a new method of constructing algorithms with proven performance guarantee | 2004-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817473 | 2004-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449171 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411273 | 2003-07-07 | Paper |
| Improved approximation algorithms for multilevel facility location problems | 2003-04-02 | Paper |
| Vertex set partitions preserving conservativeness | 2002-12-10 | Paper |
| Complexity of finding a join of maximum weight | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753724 | 2002-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753920 | 2001-12-18 | Paper |
| A 0. 5-approximation algorithm for MAX DICUT with given sizes of parts | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263699 | 2000-11-27 | Paper |
| Every circle graph of girth at least 5 is 3-colourable | 2000-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938789 | 2000-02-23 | Paper |
| An 0. 828-approximation algorithm for the uncapacitated facility location problem | 1999-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4369618 | 1998-01-05 | Paper |
| A characterization of Seymour graphs | 1997-08-31 | Paper |
| A triangle-free circle graph with chromatic number 5 | 1997-01-13 | Paper |
| Dominating sets and Hamiltonicity in \(K_{1,3}\)-free graphs | 1996-11-25 | Paper |
| Complexity of the network median problem on planar grids | 1996-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318264 | 1995-06-12 | Paper |
| Sierpinski's Theorem is Deducible from Euler and Dirichlet | 1995-03-02 | Paper |
| On Finding Critical Independent and Vertex Sets | 1994-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5202029 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3478263 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3690584 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3335526 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3316960 | 1981-01-01 | Paper |
