| Publication | Date of Publication | Type |
|---|
Improved solutions to the Steiner triple covering problem
Information Processing Letters | 2016-06-09 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2009-07-24 | Paper |
Dynamic Symmetry Breaking by Simulating Zykov Contraction
Lecture Notes in Computer Science | 2009-07-07 | Paper |
Effective Incorporation of Double Look-Ahead Procedures
Theory and Applications of Satisfiability Testing – SAT 2007 | 2009-03-10 | Paper |
From Idempotent Generalized Boolean Assignments to Multi-bit Search
Theory and Applications of Satisfiability Testing – SAT 2007 | 2009-03-10 | Paper |
| scientific article; zbMATH DE number 5510692 (Why is no real title available?) | 2009-02-24 | Paper |
| Whose side are you on? Finding solutions in a biased search-tree | 2009-02-24 | Paper |
Sums of squares based approximation algorithms for MAX-SAT
Discrete Applied Mathematics | 2008-09-10 | Paper |
Finding Guaranteed MUSes Fast
Theory and Applications of Satisfiability Testing – SAT 2008 | 2008-05-27 | Paper |
| March\_dl: adding adaptive heuristics and a new branching strategy | 2007-03-30 | Paper |
A new method to construct lower bounds for van der Waerden numbers
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
A new method to construct lower bounds for van der Waerden numbers
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
Generation of classes of robust periodic railway timetables
Computers & Operations Research | 2006-05-16 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-16 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-16 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances
Annals of Mathematics and Artificial Intelligence | 2005-05-20 | Paper |
On semidefinite programming relaxations of \((2+p)\)-SAT
Annals of Mathematics and Artificial Intelligence | 2003-03-10 | Paper |
Solving satisfiability problems using elliptic approximations. A note on volumes and weights
Annals of Mathematics and Artificial Intelligence | 2003-03-10 | Paper |
A short note on some tractable cases of the satisfiability problem.
Information and Computation | 2003-01-14 | Paper |
Simplicial pivoting algorithms for a tractable class of integer programs
Journal of Combinatorial Optimization | 2002-05-28 | Paper |
A simplicial approach to the determination of an integer point of a simplex
Mathematics of Operations Research | 2001-11-26 | Paper |
| Relaxations of the satisfiability problem using semidefinite programming | 2001-10-21 | Paper |
An arbitrary starting variable dimension algorithm for computing an integer point of a simplex
Computational Optimization and Applications | 2001-10-14 | Paper |
Solving satisfiability problems using elliptic approximations -- effective branching rules
Discrete Applied Mathematics | 2001-07-29 | Paper |
Relaxations of the satisfiability problem using semidefinite programming
Journal of Automated Reasoning | 2001-07-26 | Paper |
A two-phase algorithm for solving a class of hard satisfiability problems
Operations Research Letters | 2001-05-20 | Paper |
Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT
Discrete Applied Mathematics | 2001-02-18 | Paper |
Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm
Journal of Computational and Applied Mathematics | 2001-01-01 | Paper |
Recognition of tractable satisfiability problems through balanced polynomial representations
Discrete Applied Mathematics | 2000-03-20 | Paper |
Elliptic approximations of propositional formulae
Discrete Applied Mathematics | 2000-01-17 | Paper |
| scientific article; zbMATH DE number 1114011 (Why is no real title available?) | 1998-06-02 | Paper |
Pivoting algorithms based on Boolean vector labeling
Acta Mathematica Vietnamica | 1998-04-13 | Paper |
Inverse barriers and CES-functions in linear programming
Operations Research Letters | 1998-01-15 | Paper |
| scientific article; zbMATH DE number 18690 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 4196925 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4149921 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3964820 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3932800 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3722716 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3734008 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3755380 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3457033 (Why is no real title available?) | 1974-01-01 | Paper |
