Wim Pijls

519 total citations
26 papers, 199 citations indexed

About

Wim Pijls is a scholar working on Artificial Intelligence, Signal Processing and Computer Networks and Communications. According to data from OpenAlex, Wim Pijls has authored 26 papers receiving a total of 199 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Artificial Intelligence, 8 papers in Signal Processing and 6 papers in Computer Networks and Communications. Recurrent topics in Wim Pijls's work include Data Management and Algorithms (8 papers), Artificial Intelligence in Games (8 papers) and Sports Analytics and Performance (6 papers). Wim Pijls is often cited by papers focused on Data Management and Algorithms (8 papers), Artificial Intelligence in Games (8 papers) and Sports Analytics and Performance (6 papers). Wim Pijls collaborates with scholars based in Netherlands, Canada and United States. Wim Pijls's co-authors include Arie de Bruin, Aske Plaat, Jonathan Schaeffer, Walter A. Kosters, Rob Potharst, Jan C. Bioch, Antoon Kolen and Michiel van Wezel and has published in prestigious journals such as European Journal of Operational Research, Artificial Intelligence and American Mathematical Monthly.

In The Last Decade

Wim Pijls

23 papers receiving 171 citations

Peers

Wim Pijls

AI

EE

CNC

IS

SP

Kieran Greer United Kingdom

Julien Pérez France

Viorel Negru Romania

Stephen J. Smith United States

Chien-I Lee Taiwan

Kevin Regan Canada

Nika Haghtalab United States

D. Ezhilmaran India

Hongsheng Hu Australia

Xuelian Li China

Kieran Greer United Kingdom

Wim Pijls

134 ×1.1

AI

9 ×0.2

EE

41 ×1.1

CNC

53 ×1.6

IS

36 ×1.1

SP

Citations per year, relative to Wim Pijls Wim Pijls (= 1×) peers Kieran Greer

Countries citing papers authored by Wim Pijls

Since Specialization

Citations

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

Fields of papers citing papers by Wim Pijls

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Wim Pijls

This figure shows the co-authorship network connecting the top 25 collaborators of Wim Pijls. A scholar is included among the top collaborators of Wim Pijls 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 Wim Pijls. Wim Pijls 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:

20 of 20 papers shown

1.

Pijls, Wim & Rob Potharst. (2014). Repairing non-monotone ordinal data sets by changing class labels. RePEc: Research Papers in Economics. 2 indexed citations

2.

Pijls, Wim & Rob Potharst. (2013). Another Note on Dilworth's Decomposition Theorem. 2013. 1–4. 4 indexed citations

3.

Pijls, Wim, et al.. (2010). Note on “A new bidirectional algorithm for shortest paths”. European Journal of Operational Research. 207(2). 1140–1141. 7 indexed citations

4.

Pijls, Wim, et al.. (2009). Yet another bidirectional algorithm for shortest paths. RePub (Erasmus University Rotterdam). 1–9. 6 indexed citations

5.

Pijls, Wim, et al.. (2008). A new bidirectional algorithm for shortest paths. Data Archiving and Networked Services (DANS). 1–6. 2 indexed citations

6.

Pijls, Wim. (2007). Heuristic estimates in shortest path algorithms. Statistica Neerlandica. 61(1). 61–74. 4 indexed citations

7.

Pijls, Wim, et al.. (2005). How to find frequent patterns. RePub (Erasmus University Rotterdam). 1 indexed citations

8.

Wezel, Michiel van, et al.. (2005). Visualizing Clickstream Data with Multidimensional Scaling. RePub (Erasmus University Rotterdam).

9.

Kosters, Walter A. & Wim Pijls. (2003). Apriori, A Depth First Implementation.. Data Archiving and Networked Services (DANS). 16 indexed citations

10.

Pijls, Wim. (2001). Some Properties Related to Mercator Projection. American Mathematical Monthly. 108(6). 537–537. 1 indexed citations

11.

Pijls, Wim. (2001). Some Properties Related to Mercator Projection. American Mathematical Monthly. 108(6). 537–543. 7 indexed citations

12.

Pijls, Wim & Jan C. Bioch. (2000). Mining Frequent Intemsets in Memory-Resident Databases. RePub (Erasmus University Rotterdam). 6 indexed citations

13.

Pijls, Wim & Rob Potharst. (2000). CLASSIFICATION AND TARGET GROUP SELECTION BASED UPON FREQUENT PATTERNS. RePub (Erasmus University Rotterdam). 4 indexed citations

14.

Pijls, Wim. (2000). LR and LL parsing. ACM SIGCSE Bulletin. 32(4). 24–27.

15.

Plaat, Aske, Jonathan Schaeffer, Wim Pijls, & Arie de Bruin. (1996). Exploiting graph properties of game trees. National Conference on Artificial Intelligence. 234–239. 22 indexed citations

16.

Plaat, Aske, Jonathan Schaeffer, Wim Pijls, & Arie de Bruin. (1996). Best-first fixed-depth minimax algorithms. Artificial Intelligence. 87(1-2). 255–293. 62 indexed citations

17.

Plaat, Aske, Jonathan Schaeffer, Wim Pijls, & Arie de Bruin. (1996). Best-First Fixed-Depth Minimax Algorithms. ICGA Journal. 19(4). 247–247. 4 indexed citations

18.

Plaat, Aske, Jonathan Schaeffer, Wim Pijls, & Arie de Bruin. (1995). Best-first fixed-depth game-tree search in practice. Data Archiving and Networked Services (DANS). 273–279. 9 indexed citations

19.

Bruin, Arie de, Wim Pijls, & Aske Plaat. (1994). Solution Trees as a Basis for Game-Tree Search. ICGA Journal. 17(4). 207–219. 9 indexed citations

20.

Schaeffer, Jonathan, Wim Pijls, Aske Plaat, & Arie de Bruin. (1994). SSS* = α-β + TT. University of Alberta Library. 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