Joost P. Warners

616 total citations
16 papers, 307 citations indexed

About

Joost P. Warners is a scholar working on Computational Theory and Mathematics, Numerical Analysis and Computer Networks and Communications. According to data from OpenAlex, Joost P. Warners has authored 16 papers receiving a total of 307 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Computational Theory and Mathematics, 7 papers in Numerical Analysis and 3 papers in Computer Networks and Communications. Recurrent topics in Joost P. Warners's work include Advanced Graph Theory Research (9 papers), Advanced Optimization Algorithms Research (7 papers) and Formal Methods in Verification (7 papers). Joost P. Warners is often cited by papers focused on Advanced Graph Theory Research (9 papers), Advanced Optimization Algorithms Research (7 papers) and Formal Methods in Verification (7 papers). Joost P. Warners collaborates with scholars based in Netherlands, France and Canada. Joost P. Warners's co-authors include Hans van Maaren, Etienne de Klerk, Thomas Schiex, B. Cabon, Simon de Givry, Dmitrii V. Ṗasechnik, Benjamin Jansen, Tamás Terlaky, C. Roos and Jan Friso Groote and has published in prestigious journals such as Discrete Applied Mathematics, Operations Research Letters and Information Processing Letters.

In The Last Decade

Joost P. Warners

16 papers receiving 269 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Joost P. Warners Netherlands	9	177	165	114	45	40	16	307
Évelyne Contejean France	8	148 0.8×	113 0.7×	134 1.2×	33 0.7×	36 0.9×	15	286
Anil Kamath United States	10	142 0.8×	204 1.2×	99 0.9×	19 0.4×	29 0.7×	13	333
Hideya Iwasaki Japan	11	91 0.5×	176 1.1×	195 1.7×	12 0.3×	24 0.6×	40	397
Christine T. Cheng United States	9	82 0.5×	55 0.3×	36 0.3×	43 1.0×	7 0.2×	28	207
Christophe Lecoutre France	10	98 0.6×	363 2.2×	166 1.5×	188 4.2×	60 1.5×	29	431
Fred Chow United States	11	135 0.8×	298 1.8×	278 2.4×	20 0.4×	33 0.8×	27	665
Sebastian Ordyniak Austria	11	208 1.2×	96 0.6×	190 1.7×	21 0.5×	17 0.4×	73	364
Saïd Jabbour France	8	140 0.8×	144 0.9×	160 1.4×	31 0.7×	13 0.3×	41	293
Mark H. Liffiton United States	10	234 1.3×	148 0.9×	264 2.3×	15 0.3×	27 0.7×	12	468
Yi-Chin Wu United States	8	326 1.8×	208 1.3×	211 1.9×	19 0.4×	24 0.6×	11	452

Countries citing papers authored by Joost P. Warners

Since Specialization

Citations

This map shows the geographic impact of Joost P. Warners's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Joost P. Warners with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Joost P. Warners more than expected).

Fields of papers citing papers by Joost P. Warners

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Joost P. Warners. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Joost P. Warners. The network helps show where Joost P. Warners may publish in the future.

Co-authorship network of co-authors of Joost P. Warners

This figure shows the co-authorship network connecting the top 25 collaborators of Joost P. Warners. A scholar is included among the top collaborators of Joost P. Warners based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Joost P. Warners. Joost P. Warners is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

16 of 16 papers shown

Klerk, Etienne de, Dmitrii V. Ṗasechnik, & Joost P. Warners. (2004). On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-Function. Journal of Combinatorial Optimization. 8(3). 267–294. 42 indexed citations

Maaren, Hans van & Joost P. Warners. (2003). Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights. Annals of Mathematics and Artificial Intelligence. 37(3). 273–283. 1 indexed citations

Warners, Joost P. & Hans van Maaren. (2000). Recognition of tractable satisfiability problems through balanced polynomial representations. Discrete Applied Mathematics. 99(1-3). 229–244. 11 indexed citations

Maaren, Hans van & Joost P. Warners. (2000). Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT. Discrete Applied Mathematics. 107(1-3). 225–239. 3 indexed citations

Groote, Jan Friso & Joost P. Warners. (2000). The Propositional Formula Checker HeerHugo. Journal of Automated Reasoning. 24(1-2). 101–125. 6 indexed citations

Warners, Joost P. & Hans van Maaren. (2000). Solving satisfiability problems using elliptic approximations – effective branching rules. Discrete Applied Mathematics. 107(1-3). 241–259. 12 indexed citations

Klerk, Etienne de, Hans van Maaren, & Joost P. Warners. (2000). Relaxations of the Satisfiability Problem Using Semidefinite Programming. Journal of Automated Reasoning. 24(1-2). 37–65. 11 indexed citations

Warners, Joost P.. (1999). Nonlinear approaches to satisfiability problems. Data Archiving and Networked Services (DANS). 15 indexed citations

Klerk, Etienne de, Hans van Maaren, & Joost P. Warners. (1999). Relaxations of the satisfiability problem using semidefinite programming. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–21. 6 indexed citations

10.

Cabon, B., et al.. (1999). Radio Link Frequency Assignment. Constraints. 4(1). 79–89. 86 indexed citations

11.

Warners, Joost P., et al.. (1998). A two phase algorithm for solving a class of hard satissfiability problems. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–10. 1 indexed citations

12.

Warners, Joost P.. (1998). A linear-time transformation of linear inequalities into conjunctive normal form. Information Processing Letters. 68(2). 63–69. 61 indexed citations

13.

Warners, Joost P.. (1998). A nonlinear approach to a class of combinatorial optimization problems. Statistica Neerlandica. 52(2). 162–184. 4 indexed citations

14.

Warners, Joost P. & Hans van Maaren. (1998). A two-phase algorithm for solving a class of hard satisfiability problems. Operations Research Letters. 23(3-5). 81–88. 33 indexed citations

15.

Warners, Joost P., Tamás Terlaky, C. Roos, & Benjamin Jansen. (1997). A potential reduction approach to the frequency assignment problem. Discrete Applied Mathematics. 78(1-3). 251–282. 9 indexed citations

16.

Warners, Joost P., Tamás Terlaky, C. Roos, & Benjamin Jansen. (1997). Potential reduction algorithms for structured combinatorial optimization problems. Operations Research Letters. 21(2). 55–64. 6 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact