| Publication | Date of Publication | Type |
|---|
| Improved solutions to the Steiner triple covering problem | 2016-06-09 | Paper |
| Theory and Applications of Satisfiability Testing | 2009-07-24 | Paper |
| Dynamic Symmetry Breaking by Simulating Zykov Contraction | 2009-07-07 | Paper |
| From Idempotent Generalized Boolean Assignments to Multi-bit Search | 2009-03-10 | Paper |
| Effective Incorporation of Double Look-Ahead Procedures | 2009-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3604001 | 2009-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3604002 | 2009-02-24 | Paper |
| Sums of squares based approximation algorithms for MAX-SAT | 2008-09-10 | Paper |
| Finding Guaranteed MUSes Fast | 2008-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3429156 | 2007-03-30 | Paper |
| A new method to construct lower bounds for van der Waerden numbers | 2007-03-12 | Paper |
| Generation of classes of robust periodic railway timetables | 2006-05-16 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-16 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-16 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-15 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-15 | Paper |
| Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances | 2005-05-20 | Paper |
| Solving satisfiability problems using elliptic approximations. A note on volumes and weights | 2003-03-10 | Paper |
| On semidefinite programming relaxations of \((2+p)\)-SAT | 2003-03-10 | Paper |
| A short note on some tractable cases of the satisfiability problem. | 2003-01-14 | Paper |
| Simplicial pivoting algorithms for a tractable class of integer programs | 2002-05-28 | Paper |
| A Simplicial Approach to the Determination of an Integer Point of a Simplex | 2001-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2749859 | 2001-10-21 | Paper |
| An arbitrary starting variable dimension algorithm for computing an integer point of a simplex | 2001-10-14 | Paper |
| Solving satisfiability problems using elliptic approximations -- effective branching rules | 2001-07-29 | Paper |
| Relaxations of the satisfiability problem using semidefinite programming | 2001-07-26 | Paper |
| A two-phase algorithm for solving a class of hard satisfiability problems | 2001-05-20 | Paper |
| Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT | 2001-02-18 | Paper |
| Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm | 2001-01-01 | Paper |
| Recognition of tractable satisfiability problems through balanced polynomial representations | 2000-03-20 | Paper |
| Elliptic approximations of propositional formulae | 2000-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375779 | 1998-06-02 | Paper |
| Pivoting algorithms based on Boolean vector labeling | 1998-04-13 | Paper |
| Inverse barriers and CES-functions in linear programming | 1998-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976099 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5201909 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3479836 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3707767 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3732429 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912850 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3921287 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3937947 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4043171 | 1974-01-01 | Paper |
