default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoost P. Warners
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2004
[j12]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
- [j11]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
- [j10]Joost P. Warners, Hans van Maaren:
Recognition of Tractable Satisfiability Problems through Balanced Polynomial Representations. Discret. Appl. Math. 99(1-3): 229-244 (2000) - [j9]Hans van Maaren, Joost P. Warners:
Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT. Discret. Appl. Math. 107(1-3): 225-239 (2000) - [j8]Joost P. Warners, Hans van Maaren:
Solving satisfiability problems using elliptic approximations - effective branching rules. Discret. Appl. Math. 107(1-3): 241-259 (2000) - [j7]Etienne de Klerk, Hans van Maaren, Joost P. Warners:
Relaxations of the Satisfiability Problem Using Semidefinite Programming. J. Autom. Reason. 24(1/2): 37-65 (2000) - [j6]Jan Friso Groote, Joost P. Warners:
The Propositional Formula Checker HeerHugo. J. Autom. Reason. 24(1/2): 101-125 (2000) - 1999
- [j5]Bertrand Cabon, Simon de Givry, Lionel Lobjois, Thomas Schiex, Joost P. Warners:
Radio Link Frequency Assignment. Constraints An Int. J. 4(1): 79-89 (1999) - 1998
- [j4]Joost P. Warners:
A Linear-Time Transformation of Linear Inequalities into Conjunctive Normal Form. Inf. Process. Lett. 68(2): 63-69 (1998) - [j3]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
- [j2]Joost P. Warners, Tamás Terlaky, Cornelis Roos, Benjamin Jansen:
A Potential Reduction Approach to the Frequency Assignment Problem. Discret. Appl. Math. 78(1-3): 251-282 (1997) - [j1]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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
