Countries citing papers authored by Laurent Van Begin
Since
Specialization
Citations
This map shows the geographic impact of Laurent Van Begin'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 Laurent Van Begin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Laurent Van Begin more than expected).
Fields of papers citing papers by Laurent Van Begin
This network shows the impact of papers produced by Laurent Van Begin. 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 Laurent Van Begin. The network helps show where Laurent Van Begin may publish in the future.
Co-authorship network of co-authors of Laurent Van Begin
This figure shows the co-authorship network connecting the top 25 collaborators of Laurent Van Begin.
A scholar is included among the top collaborators of Laurent Van Begin 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 Laurent Van Begin. Laurent Van Begin is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Delzanno, Giorgio & Laurent Van Begin. (2007). On the dynamics of PB systems with volatile membranes. Lecture notes in computer science. 240–256.2 indexed citations
Ganty, Pierre, et al.. (2007). Symbolic Data Structure for Sets of k-uples of Integers. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles).4 indexed citations
Finkel, Alain, et al.. (2005). About Fast and TReX Accelerations. Electronic Notes in Theoretical Computer Science. 128(6). 87–103.2 indexed citations
12.
Finkel, Alain, Gilles Geeraerts, Jean-François Raskin, & Laurent Van Begin. (2005). A counter-example to the minimal coverability tree algorithm. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles).6 indexed citations
13.
Raskin, Jean-François, Manuel Samuelides, & Laurent Van Begin. (2005). Games for Counting Abstractions. Electronic Notes in Theoretical Computer Science. 128(6). 69–85.5 indexed citations
Begin, Laurent Van & Jean-François Raskin. (2004). Efficient verification of counting abstractions for parametric systems. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles).9 indexed citations
Begin, Laurent Van, et al.. (2003). Petri Games are Monotonic but Dicult to Decide. 36(3). 222–6.1 indexed citations
18.
Finkel, Alain, et al.. (2002). Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited.5 indexed citations
19.
Delzanno, Giorgio, et al.. (2002). Babylon: An integrated Toolkit for the Specification and Verification of Parameterized Systems. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles).1 indexed citations
20.
Massart, Thierry, et al.. (1999). Design of timed systems using a real-time process algebra. Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles). 5.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.