Stephen T. Hedetniemi
Stephen T. Hedetniemi publishes mostly in Computational Theory and Mathematics, Computer Networks and Communications and Geometry and Topology, on topics such as Advanced Graph Theory Research, Graph Labeling and Dimension Problems and Complexity and Algorithms in Graphs.
- World rank
- #153,411 of 7,710,434 ranked researchers
- Rank in United States
- #57,785 of 1,627,098
- Works
- 230
- Citations
- 14k
- Citations per work
- 62.6
What does Stephen T. Hedetniemi research?
Stephen T. Hedetniemi's work is mostly in Computer Science (72%), Mathematics (12%), Engineering (3%).
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 Sciences20087.0%
- Computer Science16672.1%
- Mathematics2812.2%
- Engineering62.7%
- Everything else3013.0%
- 1Computational Theory and Mathematics51% of their works
- 2Computer Networks and Communications19% of their works
- 3Geometry and Topology6% of their works
- 4Discrete Mathematics and Combinatorics6% of their works
- 5Electrical and Electronic Engineering3% of their works
- 6Artificial Intelligence2% of their works
Research topics
Which keywords describe Stephen T. Hedetniemi's research?
The keywords of their largest research topics: Algorithmic Applications, Approximation Algorithms, Graph Theory, Parameterized Complexity, Graph Labeling, Metric Dimension, Combinatorial Optimization and Complexity Theory.
- Interconnection Networks
- Szemerédi's Theorem
- Graph Limits
- Consistency
- Mobile Robots
- Complexity Theory
- Metric Dimension
- Parameterized Complexity
- Approximation Algorithms
- Algorithmic Applications
- Graph Theory
- Graph Labeling
- Combinatorial Optimization
- Fault Tolerance
- Online Algorithms
- Distributed Systems
- Graph Spectra
- Topological Indices
- Networks on Chip
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. The words come from the keyword list OpenAlex gives each topic, not from the text of the papers, so a word can appear that none of the papers uses.
All 19 words, with their numbers
- Algorithmic Applications2162 topics
- Approximation Algorithms2162 topics
- Graph Theory1651 topic
- Parameterized Complexity1651 topic
- Graph Labeling691 topic
- Metric Dimension691 topic
- Combinatorial Optimization511 topic
- Complexity Theory511 topic
- Fault Tolerance502 topics
- Mobile Robots451 topic
- Online Algorithms451 topic
- Consistency321 topic
- Distributed Systems321 topic
- Graph Limits321 topic
- Graph Spectra321 topic
- Szemerédi's Theorem321 topic
- Topological Indices321 topic
- Interconnection Networks181 topic
- Networks on Chip181 topic
Where does Stephen T. Hedetniemi work?
Stephen T. Hedetniemi's main affiliation in the publication record is Clemson University, United States.
How many publications and citations does Stephen T. Hedetniemi have?
OpenAlex counts 230 works and 14,394 citations for Stephen T. Hedetniemi, an h-index of 48, ranking #153,411 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised citation 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 Stephen T. Hedetniemi. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.