| Publication | Date of Publication | Type |
|---|
| Tight bounds on local search to approximate the maximum satisfiability problems | 2011-08-17 | Paper |
| Complexity and improved heuristic algorithms for binary fingerprints clustering | 2010-02-12 | Paper |
| A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem | 2008-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4675629 | 2005-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4483822 | 2003-11-27 | Paper |
| A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs | 2003-03-17 | Paper |
| Hardness and methods to solve CLIQUE | 2002-10-17 | Paper |
| The capacity expansion problem on directed networks | 2002-01-23 | Paper |
| Efficient mining of association rules by reducing the number of passes over the database | 2001-10-14 | Paper |
| Capacity expansion problem on an undirected network | 2001-06-26 | Paper |
| An algorithm for the job schedule problem on the model of the common resources captured in short time | 2001-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525693 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525697 | 2001-01-24 | Paper |
| A practical algorithm for the minimum rectilinear Steiner tree | 2000-05-28 | Paper |
| An efficient parallel graph edge matching algorithm and its applications | 1999-09-13 | Paper |
| A practical parallel algorithm for propositional knowledge base revision | 1999-08-23 | Paper |
| New bounds on time and number of processors for multiprocessor optimal schedules | 1999-08-23 | Paper |
| A polynomial-time algorithm for reducing the number of variables in MAX SAT problem | 1997-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4300481 | 1995-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4290436 | 1995-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4203007 | 1994-11-03 | Paper |
| An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph | 1994-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4278912 | 1994-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4203043 | 1993-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4696797 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4000686 | 1992-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974827 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3361926 | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3035328 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3203054 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3491618 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4734765 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3835485 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3812268 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3772250 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4726289 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3781123 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3773908 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3771969 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3730028 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3728821 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3944520 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3949057 | 1981-01-01 | Paper |
