| Publication | Date of Publication | Type |
|---|
| A faster implementation of EQ and SE queries for switch-list representations | 2024-10-31 | Paper |
| Recognizing distributed approval voting forms and correspondences | 2024-07-16 | Paper |
| Unique key Horn functions | 2022-06-13 | Paper |
| Approximating Minimum Representations of Key Horn Functions | 2022-03-11 | Paper |
| Generating clause sequences of a CNF formula | 2021-01-19 | Paper |
| Properties of Switch-List Representations of Boolean Functions | 2020-11-03 | Paper |
| Recognizing distributed approval voting forms and correspondences | 2020-10-29 | Paper |
| Separable discrete functions: recognition and sufficient conditions | 2019-03-25 | Paper |
| Recognition of tractable DNFs representable by a constant number of intervals | 2018-05-24 | Paper |
| Strong duality in Horn minimization | 2017-11-22 | Paper |
| Complexity issues related to propagation completeness | 2015-06-26 | Paper |
| On Minimum Representations of Matched Formulas | 2015-01-14 | Paper |
| Book review of: S. Arora and B. Barak, Computational complexity: a modern approach. | 2014-10-24 | Paper |
| Boolean functions with long prime implicants | 2014-04-14 | Paper |
| A decomposition method for CNF minimality proofs | 2014-01-13 | Paper |
| A subclass of Horn CNFs optimally compressible in polynomial time | 2012-12-07 | Paper |
| Properties of SLUR Formulae | 2012-06-15 | Paper |
| Boolean functions with a simple certificate for CNF complexity | 2012-05-04 | Paper |
| Total tightness implies Nash-solvability for three-person game forms | 2012-03-29 | Paper |
| Disjoint essential sets of implicates of a CQ Horn function | 2012-03-23 | Paper |
| Analysing DNA microarray data using Boolean techniques | 2011-11-17 | Paper |
| Discovering implied constraints in precedence graphs with alternatives | 2010-12-22 | Paper |
| Exclusive and essential sets of implicates of Boolean functions | 2010-05-05 | Paper |
| Recognition of interval Boolean functions | 2009-07-13 | Paper |
| A Constraint Model for State Transitions in Disjunctive Resources | 2009-03-05 | Paper |
| Temporal Reasoning in Nested Temporal Networks with Alternatives | 2009-01-13 | Paper |
| Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models | 2008-11-04 | Paper |
| Principles and Practice of Constraint Programming – CP 2004 | 2008-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5294851 | 2007-07-26 | Paper |
| Extension of \(O(n \log n)\) filtering algorithms for the unary resource constraint to optional activities | 2006-11-03 | Paper |
| A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines | 2005-09-02 | Paper |
| Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing | 2005-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3023686 | 2005-07-05 | Paper |
| A simple heuristic for knowledge base compression | 2005-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4652816 | 2005-02-28 | Paper |
| Nonpreemptive flowshop scheduling with machine dominance | 2002-07-03 | Paper |
| A satisfiability formulation of problems on level graphs | 2001-09-24 | Paper |
| Note: On the two-machine no-idle flowshop problem | 2001-06-24 | Paper |
| Horn minimization by iterative decomposition | 1999-02-02 | Paper |
| On perfect \(0,\pm 1\) matrices | 1997-06-10 | Paper |
| Nonpreemptive open shop with restricted processing times | 1995-03-01 | Paper |
| Minimizing the number of grab's changes in a single machine scheduling problem | 1989-01-01 | Paper |
