Michael R. Fellows
Michael R. Fellows publishes mostly in Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence, on topics such as Advanced Graph Theory Research, Complexity and Algorithms in Graphs and Graph Labeling and Dimension Problems.
- World rank
- #102,233 of 7,710,434 ranked researchers
- Rank in Australia
- #3,400 of 140,210
- Works
- 326
- Citations
- 18k
- Citations per work
- 56.3
What does Michael R. Fellows research?
Michael R. Fellows's work is mostly in Computer Science (72%), Biochemistry, Genetics and Molecular Biology (5%), Engineering (5%).
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
- Physical Sciences25678.4%
- Computer Science23371.5%
- Engineering154.6%
- Mathematics72.3%
- Everything else5516.8%
- Life Sciences164.8%
- 1Computational Theory and Mathematics53% of their works
- 2Computer Networks and Communications11% of their works
- 3Artificial Intelligence8% of their works
- 4Molecular Biology5% of their works
- 5Electrical and Electronic Engineering5% of their works
- 6Geometry and Topology2% of their works
Research topics
Which keywords describe Michael R. Fellows's research?
The keywords of their largest research topics: Algorithmic Applications, Approximation Algorithms, Graph Theory, Parameterized Complexity, Combinatorial Optimization, Complexity Theory, Graph Labeling and Metric Dimension.
- Networks on Chip
- Suffix Arrays
- Mobile Robots
- Distributed Algorithms
- Formal Languages
- Metric Dimension
- Complexity Theory
- Parameterized Complexity
- Approximation Algorithms
- Algorithmic Applications
- Graph Theory
- Combinatorial Optimization
- Graph Labeling
- Automata
- Constraint Optimization
- Compression
- Online Algorithms
- Interconnection Networks
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
- Algorithmic Applications3332 topics
- Approximation Algorithms3332 topics
- Graph Theory1981 topic
- Parameterized Complexity1981 topic
- Combinatorial Optimization1351 topic
- Complexity Theory1351 topic
- Graph Labeling471 topic
- Metric Dimension471 topic
- Automata391 topic
- Formal Languages391 topic
- Constraint Optimization321 topic
- Distributed Algorithms321 topic
- Compression301 topic
- Mobile Robots301 topic
- Online Algorithms301 topic
- Suffix Arrays301 topic
- Interconnection Networks261 topic
- Networks on Chip261 topic
Where does Michael R. Fellows work?
Michael R. Fellows's main affiliation in the publication record is University of Newcastle Australia, Australia.
How many publications and citations does Michael R. Fellows have?
OpenAlex counts 326 works and 18,362 citations for Michael R. Fellows, an h-index of 60, ranking #102,233 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 Michael R. Fellows. Posts are plain text and can be reported.