Countries citing papers authored by François Glineur
Since
Specialization
Citations
This map shows the geographic impact of François Glineur'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 François Glineur with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites François Glineur more than expected).
Fields of papers citing papers by François Glineur
This network shows the impact of papers produced by François Glineur. 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 François Glineur. The network helps show where François Glineur may publish in the future.
Co-authorship network of co-authors of François Glineur
This figure shows the co-authorship network connecting the top 25 collaborators of François Glineur.
A scholar is included among the top collaborators of François Glineur 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 François Glineur. François Glineur is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Glineur, François, et al.. (2023). Snacks: a fast large-scale kernel SVM solver. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 1–6.
Glineur, François, et al.. (2019). Predictive Maintenance of a Rotating Condenser Inside a Synchrocyclotron.. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 2491. 1.1 indexed citations
8.
Glineur, François, et al.. (2019). Near-field calibration of SKA-Low stations using unmanned aerial vehicles. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)).3 indexed citations
9.
Glineur, François, et al.. (2019). Nonnegative matrix factorization with polynomial signals via hierarchical alternating least squares.. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)).1 indexed citations
Gillis, Nicolas, et al.. (2013). ONP-MF: An Orthogonal Nonnegative Matrix Factorization Algorithm with Application to Clustering. ORBi UMONS.4 indexed citations
Glineur, François, et al.. (2012). Extended Lanczos Bidiagonalization for Dimension Reduction in Information Retrieval. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)).3 indexed citations
16.
Dehez, Bruno, et al.. (2009). Two complementary methods to face with convexity issues in topology optimization problems. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)).2 indexed citations
Glineur, François. (2000). An extended conic formulation for geometric optimization. Foundations of Computing and Decision Sciences. 25(3). 161–174.5 indexed citations
20.
Glineur, François. (1998). Interior-point methods for linear programming: a guided tour. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 38(1). 3–30.
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.