Nicolas Beldiceanu

997 total citations
15 papers, 301 citations indexed

About

Nicolas Beldiceanu is a scholar working on Computer Networks and Communications, Industrial and Manufacturing Engineering and Management Science and Operations Research. According to data from OpenAlex, Nicolas Beldiceanu has authored 15 papers receiving a total of 301 indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Computer Networks and Communications, 10 papers in Industrial and Manufacturing Engineering and 3 papers in Management Science and Operations Research. Recurrent topics in Nicolas Beldiceanu's work include Constraint Satisfaction and Optimization (9 papers), Scheduling and Optimization Algorithms (5 papers) and Advanced Database Systems and Queries (3 papers). Nicolas Beldiceanu is often cited by papers focused on Constraint Satisfaction and Optimization (9 papers), Scheduling and Optimization Algorithms (5 papers) and Advanced Database Systems and Queries (3 papers). Nicolas Beldiceanu collaborates with scholars based in France, Sweden and Ireland. Nicolas Beldiceanu's co-authors include Abderrahmane Aggoun, Évelyne Contejean, Mats Carlsson, Helmut Simonis, Rémi Douence, Sophie Demassey, Niki Kousi, Per-Olov Östberg, M. Carlsson and Bart Meyers and has published in prestigious journals such as European Journal of Operational Research, Computers & Operations Research and Annals of Operations Research.

In The Last Decade

Nicolas Beldiceanu

12 papers receiving 250 citations

Peers

Nicolas Beldiceanu
Nicolas Beldiceanu
Citations per year, relative to Nicolas Beldiceanu Nicolas Beldiceanu (= 1×) peers Narendra Jussien

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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.

All Works

15 of 15 papers shown
1.
Beldiceanu, Nicolas, Alexandre Dolgui, Niki Kousi, et al.. (2021). ASSISTANT: Learning and Robust Decision Support System for Agile Manufacturing Environments. IFAC-PapersOnLine. 54(1). 641–646. 12 indexed citations
2.
Beldiceanu, Nicolas, et al.. (2021). GAC for a Linear Inequality and an Atleast Constraint with an Application to Learning Simple Polynomials. Proceedings of the International Symposium on Combinatorial Search. 4(1). 149–157.
3.
Beldiceanu, Nicolas, et al.. (2017). Deriving generic bounds for time-series constraints based on regular expressions characteristics. Constraints. 23(1). 44–86.
4.
Beldiceanu, Nicolas, Mats Carlsson, Rémi Douence, & Helmut Simonis. (2015). Using finite transducers for describing and synthesising structural time-series constraints. Constraints. 21(1). 22–40. 6 indexed citations
5.
Carlsson, Mats, et al.. (2014). Synchronized sweep algorithms for scalable scheduling constraints. Constraints. 20(2). 183–234. 5 indexed citations
6.
Beldiceanu, Nicolas, Narendra Jussien, & Éric Pinson. (2012). Integration of AI and OR techniques in contraint programming for combinatorial optimzation problems : 9th International Conference, CPAIOR 2012, Nantes, France, May 28 - June 1 2012 : proceedings. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 1 indexed citations
7.
Beldiceanu, Nicolas, et al.. (2010). New filtering for the cumulative constraint in the context of non-overlapping rectangles. Annals of Operations Research. 184(1). 27–50. 8 indexed citations
8.
Beldiceanu, Nicolas, et al.. (2008). New Filtering for the cumulative Constraint in the Context of Non-Overlapping Rectangles. HAL (Le Centre pour la Communication Scientifique Directe). 2 indexed citations
9.
Beldiceanu, Nicolas, et al.. (2005). Sweep synchronization as a global propagation mechanism. Computers & Operations Research. 33(10). 2835–2851. 5 indexed citations
10.
Beldiceanu, Nicolas, et al.. (2004). Filtering algorithms for the Same and UsedBy constraints. Max Planck Institute for Plasma Physics. 16(2). 191–220. 2 indexed citations
11.
Beldiceanu, Nicolas, et al.. (2003). Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption. European Journal of Operational Research. 153(1). 239–254. 1 indexed citations
12.
Beldiceanu, Nicolas. (2000). Pruning for the cardinality-path Constraint Family. KTH Publication Database DiVA (KTH Royal Institute of Technology).
13.
Beldiceanu, Nicolas & Évelyne Contejean. (1994). Introducing global constraints in CHIP. Mathematical and Computer Modelling. 20(12). 97–123. 117 indexed citations
14.
Aggoun, Abderrahmane & Nicolas Beldiceanu. (1993). Extending chip in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling. 17(7). 57–73. 139 indexed citations
15.
Aggoun, Abderrahmane & Nicolas Beldiceanu. (1992). Extending CHIP in order to solve complex scheduling and placement problems.. HAL (Le Centre pour la Communication Scientifique Directe). 51. 3 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