Sandra M. Hedetniemi
- Computational Theory and Mathematics top 0.5%
- Advanced Graph Theory Research 23
- Complexity and Algorithms in Graphs 11
- Graph Labeling and Dimension Problems 8
-
- Optimization and Search Problems 8
- Interconnection Networks and Systems 5
- Distributed systems and fault tolerance 3
- Geometry and Topology top 5%
- Graph theory and applications 5
- Hardware and Architecture top 10%
-
- Bayesian Modeling and Causal Inference 3
- Co-authors
- Stephen T. HedetniemiArthur L. LiestmanE. J. CockaynePaul DreyerTeresa W. HaynesMichael A. HenningAshraf M. AbdelbarRenu Laskar
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsComputer Networks and Communications
- Journals
- Artificial Intelligence (2 papers)SIAM Journal on Computing (1 paper)Transportation Science (1 paper)
- Partner nations
- United StatesCanadaEgypt
In The Last Decade
Sandra M. Hedetniemi
35 papers receiving 1.7k citations
Hit Papers
Peers
Comparison fields: 5 of 76
- Computational Theory and Mathematics 966
- Discrete Mathematics and Combinatorics 158
- Computer Networks and Communications 1.1k
- Geometry and Topology 113
- Hardware and Architecture 77
Countries citing papers authored by Sandra M. Hedetniemi
This map shows the geographic impact of Sandra M. Hedetniemi'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 Sandra M. Hedetniemi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sandra M. Hedetniemi more than expected).
Fields of papers citing papers by Sandra M. Hedetniemi
This network shows the impact of papers produced by Sandra M. Hedetniemi. 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 Sandra M. Hedetniemi. The network helps show where Sandra M. Hedetniemi may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Sandra M. Hedetniemi, 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 | 2015 | 4 | |
| 2 | Quorum Colorings of Graphs | 2013 | 4 |
| 3 | 2008 | 17 | |
| 4 | 2008 | 25 | |
| 5 | 2005 | 29 | |
| 6 | 2005 | 29 | |
| 7 | Domination and irredundance in tournaments. | 2004 | 11 |
| 8 | 2003 | 336 | |
| 9 | 2003 | 49 | |
| 10 | 2002 | 12 | |
| 11 | 2000 | 13 | |
| 12 | 1999 | 2 | |
| 13 | 1998 | 7 | |
| 14 | 1998 | 70 | |
| 15 | 1997 | 19 | |
| 16 | 1997 | 6 | |
| 17 | 1995 | 11 | |
| 18 | A survey of gossiping and broadcasting in communication networks | 1988 | 7 |
| 19 | 1985 | 8 | |
| 20 | 1984 | 64 |
About Sandra M. Hedetniemi
Sandra M. Hedetniemi is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Geometry and Topology, having authored 35 papers that have together received 1.9k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (23 papers), Complexity and Algorithms in Graphs (11 papers), Optimization and Search Problems (8 papers), Graph Labeling and Dimension Problems (8 papers), Interconnection Networks and Systems (5 papers), Graph theory and applications (5 papers), Bayesian Modeling and Causal Inference (3 papers) and Distributed systems and fault tolerance (3 papers). The work is most often cited by research in Computational Theory and Mathematics (966 citations), Discrete Mathematics and Combinatorics (158 citations) and Computer Networks and Communications (1.1k citations). Sandra M. Hedetniemi has collaborated with scholars based in United States, Canada and Egypt. Frequent co-authors include Stephen T. Hedetniemi, Arthur L. Liestman, E. J. Cockayne, Paul Dreyer, Teresa W. Haynes, Michael A. Henning, Ashraf M. Abdelbar, Renu Laskar, Wayne Goddard and David P. Jacobs. Their work appears in journals such as Artificial Intelligence, SIAM Journal on Computing and Transportation Science.
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.