2004 |
12 | EE | Etienne de Klerk,
Dmitrii V. Pasechnik,
Joost P. Warners:
On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function.
J. Comb. Optim. 8(3): 267-294 (2004) |
2003 |
11 | | Hans van Maaren,
Joost P. Warners:
Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights.
Ann. Math. Artif. Intell. 37(3): 273-283 (2003) |
2000 |
10 | | Hans van Maaren,
Joost P. Warners:
Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT.
Discrete Applied Mathematics 107(1-3): 225-239 (2000) |
9 | | Joost P. Warners,
Hans van Maaren:
Solving satisfiability problems using elliptic approximations - effective branching rules.
Discrete Applied Mathematics 107(1-3): 241-259 (2000) |
8 | EE | Joost P. Warners,
Hans van Maaren:
Recognition of Tractable Satisfiability Problems through Balanced Polynomial Representations.
Discrete Applied Mathematics 99(1-3): 229-244 (2000) |
7 | | Jan Friso Groote,
Joost P. Warners:
The Propositional Formula Checker HeerHugo.
J. Autom. Reasoning 24(1/2): 101-125 (2000) |
6 | | Etienne de Klerk,
Hans van Maaren,
Joost P. Warners:
Relaxations of the Satisfiability Problem Using Semidefinite Programming.
J. Autom. Reasoning 24(1/2): 37-65 (2000) |
1999 |
5 | | Bertrand Cabon,
Simon de Givry,
Lionel Lobjois,
Thomas Schiex,
Joost P. Warners:
Radio Link Frequency Assignment.
Constraints 4(1): 79-89 (1999) |
1998 |
4 | EE | Joost P. Warners:
A Linear-Time Transformation of Linear Inequalities into Conjunctive Normal Form.
Inf. Process. Lett. 68(2): 63-69 (1998) |
3 | EE | Joost P. Warners,
Hans van Maaren:
A two-phase algorithm for solving a class of hard satisfiability problems.
Oper. Res. Lett. 23(3-5): 81-88 (1998) |
1997 |
2 | EE | Joost P. Warners,
Tamás Terlaky,
Cornelis Roos,
Benjamin Jansen:
A Potential Reduction Approach to the Frequency Assignment Problem.
Discrete Applied Mathematics 78(1-3): 251-282 (1997) |
1 | EE | Joost P. Warners,
Tamás Terlaky,
Cornelis Roos,
Benjamin Jansen:
Potential reduction algorithms for structured combinatorial optimization problems.
Oper. Res. Lett. 21(2): 55-64 (1997) |