Science Explorer Back to mapMap
Discussion
Researcher · Eötvös Loránd University · Hungary

András Frank

András Frank publishes mostly in Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Computer Networks and Communications, on topics such as Advanced Graph Theory Research, Complexity and Algorithms in Graphs and Computational Geometry and Mesh Generation.

ORCID 0000-0001-6161-4848 OpenAlex
World rank
#463,966
of 7,710,434 ranked researchers
Rank in Hungary
#458
of 25,218
Works
136
Citations
4.2k
Citations per work
30.7
h-index
34
i10-index 59Top 3.4% in Computational Theory and Mathematics
András Frank

What does András Frank research?

András Frank's work is mostly in Computer Science (64%), Engineering (9%), Mathematics (4%).

Physical Sciences: 104 works · 76.3% of their workComputer Science: 87 works · 63.7% of their workComputational Theory and Mathematics: 64 works · 47.1% of their workComputer Graphics and Computer-Aided Design: 11 works · 8.4% of their workComputer Networks and Communications: 11 works · 8.2% of their workEngineering: 12 works · 8.7% of their workElectrical and Electronic Engineering: 7 works · 5.0% of their workIndustrial and Manufacturing Engineering: 5 works · 3.7% of their workMathematics: 5 works · 3.9% of their workDiscrete Mathematics and Combinatorics: 5 works · 3.9% of their workEverything else: 32 works · 23.7% of their workTHEIR WORKAndrás Frank136works
Physical Sciences76%

Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.

The fields and subfields, with their numbers
    1. Computer Science8763.7%
    2. Engineering128.7%
    3. Mathematics53.9%
  2. Everything else3223.7%
  1. 1Computational Theory and Mathematics47% of their works
  2. 2Computer Graphics and Computer-Aided Design8% of their works
  3. 3Computer Networks and Communications8% of their works
  4. 4Electrical and Electronic Engineering5% of their works
  5. 5Discrete Mathematics and Combinatorics4% of their works
  6. 6Industrial and Manufacturing Engineering4% of their works

Research topics

Which keywords describe András Frank's research?

The keywords of their largest research topics: Approximation Algorithms, Algorithmic Applications, Graph Theory, Parameterized Complexity, Combinatorial Optimization, Complexity Theory, Delaunay Triangulations and Mesh Generation.

Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most.

All 18 words, with their numbers
  1. Approximation Algorithms1913 topics
  2. Algorithmic Applications1602 topics
  3. Graph Theory911 topic
  4. Parameterized Complexity911 topic
  5. Combinatorial Optimization691 topic
  6. Complexity Theory691 topic
  7. Delaunay Triangulations311 topic
  8. Mesh Generation311 topic
  9. Interconnection Networks161 topic
  10. Networks on Chip161 topic
  11. Fiber Bragg Grating121 topic
  12. Mobile Robots121 topic
  13. Online Algorithms121 topic
  14. Spectral Amplitude Coding121 topic
  15. Graph Spectra101 topic
  16. Topological Indices101 topic
  17. Graph Limits81 topic
  18. Szemerédi's Theorem81 topic

Where does András Frank work?

András Frank's main affiliation in the publication record is Eötvös Loránd University, Hungary.

How many publications and citations does András Frank have?

OpenAlex counts 136 works and 4,171 citations for András Frank, an h-index of 34, ranking #463,966 of 7,710,434 researchers worldwide on the quality score.

Ranked on field-normalised excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.

Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.

Discussion

Ask a question or share a note about András Frank. Posts are plain text and can be reported.