Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Nopol: Automatic Repair of Conditional Statement Bugs in Java Programs
Countries citing papers authored by Daniel Le Berre
Since
Specialization
Citations
This map shows the geographic impact of Daniel Le Berre'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 Daniel Le Berre with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniel Le Berre more than expected).
This network shows the impact of papers produced by Daniel Le Berre. 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 Daniel Le Berre. The network helps show where Daniel Le Berre may publish in the future.
Co-authorship network of co-authors of Daniel Le Berre
This figure shows the co-authorship network connecting the top 25 collaborators of Daniel Le Berre.
A scholar is included among the top collaborators of Daniel Le Berre 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 Daniel Le Berre. Daniel Le Berre is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Creignou, Nadia & Daniel Le Berre. (2016). Theory and applications of satisfiability testing - SAT 2016 : 19th International Conference, Bordeaux, France, July 5-8, 2016 : proceedings. Springer eBooks.2 indexed citations
Segura, Sergio, et al.. (2013). Automated Metamorphic Testing on the Analysis of Software Variability.2 indexed citations
10.
Järvisalo, Matti, Daniel Le Berre, Olivier Roussel, & Laurent Simon. (2012). The International SAT Solver Competitions. AI Magazine. 33(1). 89–94.70 indexed citations
11.
Berre, Daniel Le & Anne Parrain. (2010). The Sat4j library, release 2.2. HAL (Le Centre pour la Communication Scientifique Directe). 7(2-3). 59–64.229 indexed citations
Berre, Daniel Le & Anne Parrain. (2007). À propos de l'extension d'un solveur SAT pour traiter des contraintes pseudo-booléennes. HAL (Le Centre pour la Communication Scientifique Directe).
Brewka, Gerhard, Salem Benferhat, & Daniel Le Berre. (2004). Qualitative choice logic. Artificial Intelligence. 157(1-2). 203–237.49 indexed citations
17.
Purdom, Paul W., Daniel Le Berre, & Laurent Simon. (2004). A Parsimony Tree for the SAT2002 Competition. Annals of Mathematics and Artificial Intelligence. 43(1-4). 343–365.1 indexed citations
Brewka, Gerhard, Salem Benferhat, & Daniel Le Berre. (2002). Qualitative Choice Logic.. Principles of Knowledge Representation and Reasoning. 158–169.10 indexed citations
20.
Berre, Daniel Le, et al.. (1996). Using the Davis and Putnam Procedure for an Efficient Computation of Preferred Models.. European Conference on Artificial Intelligence. 350–354.11 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.