András Frank
Impact in
- Computational Theory and Mathematics top 0.2%
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
-
- Computational Geometry and Mesh Generation
Papers in
-
- Advanced Graph Theory Research 51
- Complexity and Algorithms in Graphs 39
-
- Computational Geometry and Mesh Generation 19
- Co-authors
- Éva Tardos (5 shared papers)Tibor Jordán (4 shared papers)Tamás Király (4 shared papers)Zoltán Király (3 shared papers)William H. Cunningham (1 shared paper)Matthias Kriesell (1 shared paper)Jørgen Bang‐Jensen (1 shared paper)Bill Jackson (1 shared paper)
In The Last Decade
András Frank
67 papers receiving 1.6k citations
Peers
Comparison fields: 5 of 80
- Computational Theory and Mathematics 1.4k
- Computer Graphics and Computer-Aided Design 282
- Discrete Mathematics and Combinatorics 139
- Computer Networks and Communications 768
- Industrial and Manufacturing Engineering 187
Countries citing papers authored by András Frank
This map shows the geographic impact of András Frank'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 András Frank with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites András Frank more than expected).
Fields of papers citing papers by András Frank
This network shows the impact of papers produced by András Frank. 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 András Frank. The network helps show where András Frank may publish in the future.
Co-authors
The 25 scholars most cited alongside András Frank, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 69 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1987 | 140 | |
| 2 | 1992 | 137 | |
| 3 | 1988 | 99 | |
| 4 | 1981 | 95 | |
| 5 | 2002 | 86 | |
| 6 | 1989 | 78 | |
| 7 | 2004 | 71 | |
| 8 | 1995 | 63 | |
| 9 | 2012 | 63 | |
| 10 | 1980 | 60 | |
| 11 | SOME POLYNOMIAL ALGORITHMS FOR CERTAIN GRAPHS AND HYPERGRAPHS. | 1976 | 59 |
| 12 | 2003 | 58 | |
| 13 | 1985 | 55 | |
| 14 | 1982 | 49 | |
| 15 | 1984 | 42 | |
| 16 | 1992 | 41 | |
| 17 | 2009 | 40 | |
| 18 | 2003 | 40 | |
| 19 | 1995 | 40 | |
| 20 | 1985 | 37 |
About András Frank
András Frank is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Computer Networks and Communications, Electrical and Electronic Engineering and Discrete Mathematics and Combinatorics, having authored 69 papers that have together received 1.8k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (51 papers), Complexity and Algorithms in Graphs (39 papers), Computational Geometry and Mesh Generation (19 papers), Interconnection Networks and Systems (9 papers), Optimization and Search Problems (7 papers), Limits and Structures in Graph Theory (6 papers), graph theory and CDMA systems (6 papers) and Optimization and Packing Problems (5 papers). The work is most often cited by research in Computational Theory and Mathematics (1.4k citations), Computer Graphics and Computer-Aided Design (282 citations), Discrete Mathematics and Combinatorics (139 citations), Computer Networks and Communications (768 citations) and Industrial and Manufacturing Engineering (187 citations). András Frank has collaborated with scholars based in Hungary, Japan and Germany. Frequent co-authors include Éva Tardos, Tibor Jordán, Tamás Király, Zoltán Király, William H. Cunningham, Matthias Kriesell, Jørgen Bang‐Jensen, Bill Jackson, William J. Cook and Michael Jünger. Their work appears in journals such as Discrete Applied Mathematics, Journal of Combinatorial Theory Series B, Mathematical Programming, Discrete Mathematics and COMBINATORICA.
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.