A. Prodon
Impact in
-
- Vehicle Routing Optimization Methods
- Optimization and Packing Problems
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Advanced Multi-Objective Optimization Algorithms
Papers in
-
- Advanced Graph Theory Research 4
- Co-authors
- Th. M. Liebling (3 shared papers)F. Margot (3 shared papers)Thomas M. Liebling (1 shared paper)Ulrich Rieder (1 shared paper)Franz Josef Radermacher (1 shared paper)
- Journals
- Mathematical Programming (2 papers)Theoretical Computer Science (1 paper)Operations Research Letters (1 paper)Infoscience (Ecole Polytechnique Fédérale de Lausanne) (1 paper)INFORMS Journal on Computing (1 paper)
- Partner nations
- SwitzerlandJapanUnited States
In The Last Decade
A. Prodon
6 papers receiving 36 citations
Peers
Comparison fields: 5 of 22
- Industrial and Manufacturing Engineering 18
- Computational Theory and Mathematics 25
- Computer Graphics and Computer-Aided Design 4
- Numerical Analysis 2
- Computer Networks and Communications 7
Countries citing papers authored by A. Prodon
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
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-authors
The 5 scholars most cited alongside A. Prodon, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 1994 | 22 | |
| 2 | 2010 | 9 | |
| 3 | 2001 | 3 | |
| 4 | 1992 | 2 | |
| 5 | 1995 | 1 | |
| 6 | The poset scheduling problem | 1989 | 1 |
About A. Prodon
A. Prodon is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering, Computer Graphics and Computer-Aided Design, Computer Networks and Communications and Discrete Mathematics and Combinatorics, having authored 6 papers that have together received 38 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (4 papers), Computational Geometry and Mesh Generation (2 papers), Advanced Combinatorial Mathematics (1 paper), Interconnection Networks and Systems (1 paper), Optimization and Packing Problems (1 paper), Mathematics and Applications (1 paper), Commutative Algebra and Its Applications (1 paper) and Water Systems and Optimization (1 paper). The work is most often cited by research in Industrial and Manufacturing Engineering (18 citations), Computational Theory and Mathematics (25 citations), Computer Graphics and Computer-Aided Design (4 citations), Numerical Analysis (2 citations) and Computer Networks and Communications (7 citations). A. Prodon has collaborated with scholars based in Switzerland, Japan and United States. Frequent co-authors include Th. M. Liebling, F. Margot, Thomas M. Liebling, Ulrich Rieder and Franz Josef Radermacher. Their work appears in journals such as Mathematical Programming, Theoretical Computer Science, Operations Research Letters, Infoscience (Ecole Polytechnique Fédérale de Lausanne) and INFORMS Journal on Computing.
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.