The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Joost P. Warners: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.018secs, Finished in 0.019secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002