A Potential Reduction Approach to the Frequency Assignment Problem. - Joost P. Warners; Tamás Terlaky; Cornelis Roos; Benjamin Jansen (Discret. Appl. Math., 1997)

Potential reduction algorithms for structured combinatorial optimization problems. - Joost P. Warners; Tamás Terlaky; Cornelis Roos; Benjamin Jansen (Oper. Res. Lett., 1997)

A Linear-Time Transformation of Linear Inequalities into Conjunctive Normal Form. - Joost P. Warners (Inf. Process. Lett., 1998)

A two-phase algorithm for solving a class of hard satisfiability problems. - Joost P. Warners; Hans van Maaren (Oper. Res. Lett., 1998)

Radio Link Frequency Assignment. - Bertrand Cabon; Simon de Givry; Lionel Lobjois; Thomas Schiex; Joost P. Warners (Constraints An Int. J., 1999)

Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT. - Hans van Maaren; Joost P. Warners (Discret. Appl. Math., 2000)

Solving satisfiability problems using elliptic approximations - effective branching rules. - Joost P. Warners; Hans van Maaren (Discret. Appl. Math., 2000)

Recognition of Tractable Satisfiability Problems through Balanced Polynomial Representations. - Joost P. Warners; Hans van Maaren (Discret. Appl. Math., 2000)

The Propositional Formula Checker HeerHugo. - Jan Friso Groote; Joost P. Warners (J. Autom. Reason., 2000)

Relaxations of the Satisfiability Problem Using Semidefinite Programming. - Etienne de Klerk; Hans van Maaren; Joost P. Warners (J. Autom. Reason., 2000)

Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights. - Hans van Maaren; Joost P. Warners (Ann. Math. Artif. Intell., 2003)

On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function. - Etienne de Klerk; Dmitrii V. Pasechnik; Joost P. Warners (J. Comb. Optim., 2004)