| Publication | Date of Publication | Type |
|---|
A faster implementation of EQ and SE queries for switch-list representations
Annals of Mathematics and Artificial Intelligence | 2024-10-31 | Paper |
Recognizing distributed approval voting forms and correspondences
Annals of Operations Research | 2024-07-16 | Paper |
Unique key Horn functions
Theoretical Computer Science | 2022-06-13 | Paper |
Approximating minimum representations of key Horn functions
SIAM Journal on Computing | 2022-03-11 | Paper |
Generating clause sequences of a CNF formula
Theoretical Computer Science | 2021-01-19 | Paper |
Properties of Switch-List Representations of Boolean Functions
Journal of Artificial Intelligence Research | 2020-11-03 | Paper |
Recognizing distributed approval voting forms and correspondences
| 2020-10-29 | Paper |
Separable discrete functions: recognition and sufficient conditions
Discrete Mathematics | 2019-03-25 | Paper |
Recognition of tractable DNFs representable by a constant number of intervals
Discrete Optimization | 2018-05-24 | Paper |
Strong duality in Horn minimization
| 2017-11-22 | Paper |
Complexity issues related to propagation completeness
Artificial Intelligence | 2015-06-26 | Paper |
On minimum representations of matched formulas
Journal of Artificial Intelligence Research | 2015-01-14 | Paper |
Book review of: S. Arora and B. Barak, Computational complexity: a modern approach.
Computer Science Review | 2014-10-24 | Paper |
Boolean functions with long prime implicants
Information Processing Letters | 2014-04-14 | Paper |
A decomposition method for CNF minimality proofs
Theoretical Computer Science | 2014-01-13 | Paper |
A subclass of Horn CNFs optimally compressible in polynomial time
Annals of Mathematics and Artificial Intelligence | 2012-12-07 | Paper |
Properties of SLUR Formulae
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
Boolean functions with a simple certificate for CNF complexity
Discrete Applied Mathematics | 2012-05-04 | Paper |
Total tightness implies Nash-solvability for three-person game forms
Discrete Mathematics | 2012-03-29 | Paper |
Disjoint essential sets of implicates of a CQ Horn function
Annals of Mathematics and Artificial Intelligence | 2012-03-23 | Paper |
Analysing DNA microarray data using Boolean techniques
Annals of Operations Research | 2011-11-17 | Paper |
Discovering implied constraints in precedence graphs with alternatives
Annals of Operations Research | 2010-12-22 | Paper |
Exclusive and essential sets of implicates of Boolean functions
Discrete Applied Mathematics | 2010-05-05 | Paper |
Recognition of interval Boolean functions
Annals of Mathematics and Artificial Intelligence | 2009-07-13 | Paper |
A Constraint Model for State Transitions in Disjunctive Resources
Lecture Notes in Computer Science | 2009-03-05 | Paper |
Temporal Reasoning in Nested Temporal Networks with Alternatives
Lecture Notes in Computer Science | 2009-01-13 | Paper |
Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models
Artificial Intelligence: Methodology, Systems, and Applications | 2008-11-04 | Paper |
Principles and Practice of Constraint Programming – CP 2004
Lecture Notes in Computer Science | 2008-09-09 | Paper |
scientific article; zbMATH DE number 5174795 (Why is no real title available?)
| 2007-07-26 | Paper |
Extension of \(O(n \log n)\) filtering algorithms for the unary resource constraint to optional activities
Constraints | 2006-11-03 | Paper |
A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
Computers & Operations Research | 2005-09-02 | Paper |
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
Discrete Applied Mathematics | 2005-09-02 | Paper |
scientific article; zbMATH DE number 2186529 (Why is no real title available?)
| 2005-07-05 | Paper |
A simple heuristic for knowledge base compression
CEJOR. Central European Journal of Operations Research | 2005-03-18 | Paper |
scientific article; zbMATH DE number 2139462 (Why is no real title available?)
| 2005-02-28 | Paper |
Nonpreemptive flowshop scheduling with machine dominance
European Journal of Operational Research | 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
Annals of Mathematics and Artificial Intelligence | 1999-02-02 | Paper |
On perfect \(0,\pm 1\) matrices
Discrete Mathematics | 1997-06-10 | Paper |
Nonpreemptive open shop with restricted processing times
ZOR Zeitschrift fü Operations Research Methods and Models of Operations Research | 1995-03-01 | Paper |
Minimizing the number of grab's changes in a single machine scheduling problem
Optimization | 1989-01-01 | Paper |
