Joost P. Warners

According to our database1, Joost P. Warners authored at least 12 papers between 1997 and 2004.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2004
On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function.
J. Comb. Optim., 2004

2003
Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights.
Ann. Math. Artif. Intell., 2003

2000
Relaxations of the Satisfiability Problem Using Semidefinite Programming.
J. Autom. Reason., 2000

The Propositional Formula Checker HeerHugo.
J. Autom. Reason., 2000

Recognition of Tractable Satisfiability Problems through Balanced Polynomial Representations.
Discret. Appl. Math., 2000

Solving satisfiability problems using elliptic approximations - effective branching rules.
Discret. Appl. Math., 2000

Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT.
Discret. Appl. Math., 2000

1999
Radio Link Frequency Assignment.
Constraints An Int. J., 1999

1998
A two-phase algorithm for solving a class of hard satisfiability problems.
Oper. Res. Lett., 1998

A Linear-Time Transformation of Linear Inequalities into Conjunctive Normal Form.
Inf. Process. Lett., 1998

1997
Potential reduction algorithms for structured combinatorial optimization problems.
Oper. Res. Lett., 1997

A Potential Reduction Approach to the Frequency Assignment Problem.
Discret. Appl. Math., 1997


  Loading...