A. Prodon

495 total citations
6 papers, 38 citations indexed

About

A. Prodon is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, A. Prodon has authored 6 papers receiving a total of 38 indexed citations (citations by other indexed papers that have themselves been cited), including 5 papers in Computational Theory and Mathematics, 2 papers in Electrical and Electronic Engineering and 2 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in A. Prodon's work include Advanced Graph Theory Research (4 papers), Computational Geometry and Mesh Generation (2 papers) and Complexity and Algorithms in Graphs (1 paper). A. Prodon is often cited by papers focused on Advanced Graph Theory Research (4 papers), Computational Geometry and Mesh Generation (2 papers) and Complexity and Algorithms in Graphs (1 paper). A. Prodon collaborates with scholars based in Switzerland, Japan and United States. A. Prodon's co-authors include Th. M. Liebling, F. Margot, Thomas M. Liebling, Franz Josef Radermacher and Ulrich Rieder and has published in prestigious journals such as Mathematical Programming, Theoretical Computer Science and Operations Research Letters.

In The Last Decade

A. Prodon

6 papers receiving 36 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
A. Prodon Switzerland 3 25 18 9 7 4 6 38
Francisco J. Montoya Spain 4 26 1.0× 15 0.8× 1 0.1× 8 1.1× 2 0.5× 10 59
Thelma D. Mavridou United States 2 9 0.4× 72 4.0× 3 0.3× 9 1.3× 1 0.3× 2 87
Konstantinos Georgiou Canada 4 15 0.6× 3 0.2× 3 0.3× 15 2.1× 15 38
Stephan Seidel Germany 5 16 0.6× 29 1.6× 5 0.6× 1 0.1× 20 75
Kristina Marasović Croatia 3 6 0.2× 44 2.4× 2 0.2× 10 1.4× 4 67
Yasmina Abdeddaïm France 4 29 1.2× 3 0.2× 6 0.7× 25 3.6× 6 59
Khoa Trinh United States 3 12 0.5× 14 0.8× 1 0.1× 10 1.4× 6 41
Alla Kammerdiner United States 4 7 0.3× 3 0.2× 5 0.6× 8 1.1× 15 41
Alex Goldin Slovakia 2 22 0.9× 2 0.1× 2 0.2× 8 1.1× 2 43
Wan-Teh Chang United States 2 13 0.5× 2 0.1× 3 0.3× 11 1.6× 6 43

Countries citing papers authored by A. Prodon

Since Specialization
Citations

This map shows the geographic impact of A. Prodon'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 A. Prodon with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites A. Prodon more than expected).

Fields of papers citing papers by A. Prodon

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by A. Prodon. 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 A. Prodon. The network helps show where A. Prodon may publish in the future.

Co-authorship network of co-authors of A. Prodon

This figure shows the co-authorship network connecting the top 25 collaborators of A. Prodon. A scholar is included among the top collaborators of A. Prodon 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 A. Prodon. A. Prodon is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

6 of 6 papers shown
1.
Prodon, A., et al.. (2010). Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems. Mathematical Programming. 124(1-2). 119–141. 9 indexed citations
2.
Prodon, A., et al.. (2001). Notes on acyclic orientations and the shelling lemma. Theoretical Computer Science. 263(1-2). 9–16. 3 indexed citations
3.
Liebling, Th. M., et al.. (1995). Disjoint Paths in the Plane. INFORMS Journal on Computing. 7(1). 84–88. 1 indexed citations
4.
Margot, F., A. Prodon, & Th. M. Liebling. (1994). Tree polytope on 2-trees. Mathematical Programming. 63(1-3). 183–191. 22 indexed citations
5.
Prodon, A.. (1992). Steiner trees with n terminals among n + 1 nodes. Operations Research Letters. 11(3). 125–133. 2 indexed citations
6.
Liebling, Th. M., et al.. (1989). The poset scheduling problem. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 221–230. 1 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