Countries citing papers authored by Nicolas Beldiceanu
Since
Specialization
Citations
This map shows the geographic impact of Nicolas Beldiceanu'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 Nicolas Beldiceanu with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nicolas Beldiceanu more than expected).
Fields of papers citing papers by Nicolas Beldiceanu
This network shows the impact of papers produced by Nicolas Beldiceanu. 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 Nicolas Beldiceanu. The network helps show where Nicolas Beldiceanu may publish in the future.
Co-authorship network of co-authors of Nicolas Beldiceanu
This figure shows the co-authorship network connecting the top 25 collaborators of Nicolas Beldiceanu.
A scholar is included among the top collaborators of Nicolas Beldiceanu 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 Nicolas Beldiceanu. Nicolas Beldiceanu is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Beldiceanu, Nicolas, Narendra Jussien, & Éric Pinson. (2012). Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems.1 indexed citations
Beldiceanu, Nicolas, Pierre Flener, & Xavier Lorca. (2006). Combining Tree Partitioning, Precedence, Incomparability, and Degree Constraints, with an Application to Phylogenetic and Ordered-Path Problems. KTH Publication Database DiVA (KTH Royal Institute of Technology).3 indexed citations
Carlsson, Mats & Nicolas Beldiceanu. (2004). Dispensation Order Generation for Pyrosequencing. ERCIM news/ERCIM news online edition. 29. 327–332.2 indexed citations
13.
Ågren, Magnus S., et al.. (2002). Tracing and explaining execution of CLP(FD) programs. KTH Publication Database DiVA (KTH Royal Institute of Technology). 1–16.
14.
Carlsson, Mats & Nicolas Beldiceanu. (2002). Revisiting the Lexicographic Ordering Constraint. KTH Publication Database DiVA (KTH Royal Institute of Technology).12 indexed citations
15.
Carlsson, Mats & Nicolas Beldiceanu. (2002). Arc-Consistency for a Chain of Lexicographic Ordering Constraints. KTH Publication Database DiVA (KTH Royal Institute of Technology).15 indexed citations
16.
Beldiceanu, Nicolas, et al.. (2002). Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values Constraint. KTH Publication Database DiVA (KTH Royal Institute of Technology).5 indexed citations
17.
Beldiceanu, Nicolas. (2000). Sweep as a generic pruning technique. KTH Publication Database DiVA (KTH Royal Institute of Technology).2 indexed citations
18.
Beldiceanu, Nicolas, et al.. (1996). Solving resource-constrained project scheduling problems with CHIP.5 indexed citations
19.
Aggoun, Abderrahmane & Nicolas Beldiceanu. (1991). Overview of the CHIP Compiler System.. International Conference on Lightning Protection. 421–435.11 indexed citations
20.
Aggoun, Abderrahmane & Nicolas Beldiceanu. (1990). Time Stamps Techniques for the Trailed Data in Constraint Logic Programming Systems.. 487–510.8 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.