This map shows the geographic impact of Bart Demoen'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 Bart Demoen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bart Demoen more than expected).
This network shows the impact of papers produced by Bart Demoen. 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 Bart Demoen. The network helps show where Bart Demoen may publish in the future.
Co-authorship network of co-authors of Bart Demoen
This figure shows the co-authorship network connecting the top 25 collaborators of Bart Demoen.
A scholar is included among the top collaborators of Bart Demoen 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 Bart Demoen. Bart Demoen is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Schrijvers, Tom, Bart Demoen, Gregory J. Duck, Peter J. Stuckey, & Thom Frühwirth. (2005). Automatic implication checking for CHR constraints. 93–111.2 indexed citations
3.
Schrijvers, Tom, Alexander Serebrenik, & Bart Demoen. (2004). Refactoring Prolog code. Lirias (KU Leuven). 115–126.
4.
Struyf, Jan, et al.. (2003). Query optimization: Combining query packs and the once-tranformation. Lirias (KU Leuven). 105–115.2 indexed citations
5.
Demoen, Bart & Konstantinos Sagonas. (2001). Heap Memory Management in Prolog with Tabling: Principles and Practice.. Lirias (KU Leuven). 2001(9). 1–56.32 indexed citations
6.
Blockeel, Hendrik, et al.. (2000). Two advanced transformations for improving the efficiency of an ILP system. Lirias (KU Leuven). 43–59.6 indexed citations
7.
Demoen, Bart, et al.. (2000). Compiling large disjunctions. Lirias (KU Leuven). 103–121.5 indexed citations
8.
Schreye, Danny De, Maurice Bruynooghe, Bart Demoen, et al.. (2000). Project report on LP + : a second generation logic programming language. AI Communications. 13(1). 13–18.1 indexed citations
Demoen, Bart, et al.. (1994). A Comparison of Some Schemes for Translating Logic to C.. International Conference on Lightning Protection. 79–91.4 indexed citations
11.
Demoen, Bart, et al.. (1993). Optimization Techniques for Nondeterministic Promotion in the Andorra Kernel Language.. International Conference on Lightning Protection.3 indexed citations
12.
Demoen, Bart, et al.. (1993). Findall without findall/3. International Conference on Logic Programming. 408–423.3 indexed citations
13.
Codish, Michael & Bart Demoen. (1993). Analysing logic programs using “prop”-ositional logic programs and a magic wand. International Conference on Logic Programming. 114–129.22 indexed citations
14.
Demoen, Bart, et al.. (1992). Can Prolog Execute as Fast as Aquarius. Lirias (KU Leuven).1 indexed citations
15.
Demoen, Bart, et al.. (1991). A new scheme for unification in WAM. International Conference on Logic Programming. 12. 257–271.3 indexed citations
16.
Demoen, Bart, et al.. (1990). Memory compaction for shared memory multiprocessors: design and specification. 306–320.1 indexed citations
17.
Demoen, Bart, et al.. (1990). A la recherche de la me´moire perdu: Memory compaction for shared memory multiprocessors. 306–320.1 indexed citations
18.
Demoen, Bart, et al.. (1989). Indexing in Prolog. 1001–1012.2 indexed citations
19.
Janssens, Gerda, et al.. (1988). Improving the Register Allocation of WAM by Recording Unification.. International Conference on Lightning Protection. 1388–1402.
20.
Bruynooghe, Maurice, et al.. (1987). Abstract Interpretation: Towards the Global Optimization of Prolog Programs.. 192–204.45 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.