This map shows the geographic impact of Pierre Flener'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 Pierre Flener with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pierre Flener more than expected).
This network shows the impact of papers produced by Pierre Flener. 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 Pierre Flener. The network helps show where Pierre Flener may publish in the future.
Co-authorship network of co-authors of Pierre Flener
This figure shows the co-authorship network connecting the top 25 collaborators of Pierre Flener.
A scholar is included among the top collaborators of Pierre Flener 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 Pierre Flener. Pierre Flener is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Flener, Pierre, et al.. (2010). Contingency Plans for Air Traffic Flow and Capacity Management. 9(1). 119–126.4 indexed citations
7.
Ågren, Magnus S., Pierre Flener, & Justin Pearson. (2008). Revisiting constraint-directed search. Information and Computation. 207(3). 438–457.3 indexed citations
Flener, Pierre, et al.. (2007). Air-traffic complexity resolution in multi-sector planning using constraint programming.11 indexed citations
10.
Flener, Pierre, et al.. (2006). Static and Dynamic Structural Symmetry Breaking. Sabanci University.1 indexed citations
11.
Hentenryck, Pascal Van, Pierre Flener, Justin Pearson, & Magnus S. Ågren. (2003). Tractable symmetry breaking for CSPs with interchangeable values. International Joint Conference on Artificial Intelligence. 277–282.19 indexed citations
12.
Flener, Pierre, Alan M. Frisch, Brahim Hnich, et al.. (2002). Breaking Row and Column Symmetries in Matrix Models. White Rose Research Online (University of Leeds, The University of Sheffield, University of York).1 indexed citations
13.
Hnich, Brahim & Pierre Flener. (2001). High-Level Reformulation of Constraint Programs.. 75–90.2 indexed citations
14.
Flener, Pierre, Kung-Kiu Lau, & Wolfgang Bibel. (2000). Special Issue on Schemas. Journal of Symbolic Computation. 30(1).2 indexed citations
Flener, Pierre, Kung-Kiu Lau, & Wolfgang Bibel. (2000). Foreword to the Special Issue on Schemas. Journal of Symbolic Computation. 30(1). 1–3.3 indexed citations
17.
Flener, Pierre, et al.. (1997). On Correct Program Schemas. Bilkent University Institutional Repository (Bilkent University).1 indexed citations
18.
Charlier, Baudouin Le & Pierre Flener. (1997). On the desirable link between theory and practice in abstract interpretation. Lecture notes in computer science. 379–387.1 indexed citations
19.
Flener, Pierre. (1995). Logic Program Synthesis from Incomplete Information: By Pierre Flener. Kluwer Academic Publishers eBooks.5 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.