Hans van Maaren

1.6k total citations
33 papers, 520 citations indexed

About

Hans van Maaren is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Numerical Analysis. According to data from OpenAlex, Hans van Maaren has authored 33 papers receiving a total of 520 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Computational Theory and Mathematics, 10 papers in Computer Networks and Communications and 10 papers in Numerical Analysis. Recurrent topics in Hans van Maaren's work include Constraint Satisfaction and Optimization (10 papers), Advanced Optimization Algorithms Research (10 papers) and Formal Methods in Verification (10 papers). Hans van Maaren is often cited by papers focused on Constraint Satisfaction and Optimization (10 papers), Advanced Optimization Algorithms Research (10 papers) and Formal Methods in Verification (10 papers). Hans van Maaren collaborates with scholars based in Netherlands, Hong Kong and Belgium. Hans van Maaren's co-authors include Toby Walsh, Marijn J. H. Heule, Armin Biere, Joost P. Warners, Ian P. Gent, Thomas Stützle, Holger H. Hoos, Michiel A. Odijk, Etienne de Klerk and Ian Gentles and has published in prestigious journals such as Journal of the Science of Food and Agriculture, Computers & Operations Research and Journal of Computational and Applied Mathematics.

In The Last Decade

Hans van Maaren

32 papers receiving 467 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Hans van Maaren Netherlands 11 294 274 174 79 64 33 520
Robert Nieuwenhuis Spain 12 447 1.5× 508 1.9× 158 0.9× 130 1.6× 35 0.5× 45 700
Marijn J. H. Heule United States 13 325 1.1× 346 1.3× 159 0.9× 119 1.5× 32 0.5× 61 617
Eugène Asarin France 11 631 2.1× 223 0.8× 61 0.4× 158 2.0× 37 0.6× 31 770
В. М. Глушков Ukraine 10 295 1.0× 286 1.0× 90 0.5× 26 0.3× 25 0.4× 68 615
Naijun Zhan China 12 256 0.9× 143 0.5× 43 0.2× 99 1.3× 7 0.1× 75 450
Brigitte Plateau France 12 390 1.3× 76 0.3× 273 1.6× 86 1.1× 29 0.5× 27 712
Funda Ergün United States 14 251 0.9× 281 1.0× 251 1.4× 13 0.2× 30 0.5× 31 565
Man‐Tak Shing United States 13 155 0.5× 164 0.6× 162 0.9× 188 2.4× 17 0.3× 79 504
Joël Ouaknine United Kingdom 16 622 2.1× 401 1.5× 81 0.5× 271 3.4× 15 0.2× 84 787
John Franco United States 12 334 1.1× 305 1.1× 327 1.9× 18 0.2× 27 0.4× 33 557

Countries citing papers authored by Hans van Maaren

Since Specialization
Citations

This map shows the geographic impact of Hans van Maaren'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 Hans van Maaren with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hans van Maaren more than expected).

Fields of papers citing papers by Hans van Maaren

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Hans van Maaren. 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 Hans van Maaren. The network helps show where Hans van Maaren may publish in the future.

Co-authorship network of co-authors of Hans van Maaren

This figure shows the co-authorship network connecting the top 25 collaborators of Hans van Maaren. A scholar is included among the top collaborators of Hans van Maaren 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 Hans van Maaren. Hans van Maaren is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Biere, Armin, Marijn J. H. Heule, Hans van Maaren, & Toby Walsh. (2021). Handbook of Satisfiability. 7 indexed citations
2.
Heule, Marijn J. H. & Hans van Maaren. (2008). Parallel SAT Solving using Bit-level Operations1. 4(2-4). 99–116. 2 indexed citations
3.
Heule, Marijn J. H. & Hans van Maaren. (2008). Whose side are you on?1. 4(2-4). 117–148. 4 indexed citations
4.
Heule, Marijn J. H., et al.. (2007). A New Method to Construct Lower Bounds for Van der Waerden Numbers. The Electronic Journal of Combinatorics. 14(1). 14 indexed citations
5.
Heule, Marijn J. H. & Hans van Maaren. (2006). March_dl: Adding Adaptive Heuristics and a New Branching Strategy. Data Archiving and Networked Services (DANS). 2(1-4). 47–59. 2 indexed citations
6.
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
7.
Maaren, Hans van & Chuangyin Dang. (2002). Simplicial Pivoting Algorithms for a Tractable Class of Integer Programs. Journal of Combinatorial Optimization. 6(2). 133–142. 3 indexed citations
8.
Hoos, Holger H., Thomas Stützle, Ian P. Gent, Hans van Maaren, & Toby Walsh. (2000). Local Search Algorithms for SAT: An Empirical Evaluation. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 43–86. 13 indexed citations
9.
Hoos, Holger H., Thomas Stützle, Ian P. Gent, Hans van Maaren, & Toby Walsh. (2000). SATLIB: An Online Resource for Research on SAT. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 283–292. 159 indexed citations
10.
Gentles, Ian, et al.. (2000). Sat2000: Highlights of Satisfiability Research in the Year 2000. 21 indexed citations
11.
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
12.
Maaren, Hans van. (2000). A Short Note on Some Tractable Cases of the Satisfiability Problem. Information and Computation. 158(2). 125–130. 10 indexed citations
13.
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
14.
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
15.
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
16.
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
17.
Dang, Chuangyin & Hans van Maaren. (1999). An Arbitrary Starting Variable Dimension Algorithm for Computing an Integer Point of a Simplex. Computational Optimization and Applications. 14(1). 133–155. 3 indexed citations
18.
Maaren, Hans van & Tamás Terlaky. (1997). Inverse barriers and CES-functions in linear programming. Operations Research Letters. 20(1). 15–20. 1 indexed citations
19.
Maaren, Hans van. (1981). A degree theorem and decision methods for algebras of affine forms. Indagationes Mathematicae (Proceedings). 84(3). 315–324. 1 indexed citations
20.
Maaren, Hans van, et al.. (1981). Polynomials in algebras of linear forms. Indagationes Mathematicae (Proceedings). 84(2). 195–205. 1 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

Rankless by CCL
2026