N. Sauer
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Computability, Logic, AI Algorithms
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Graph Theory Research 20
- Advanced Algebra and Logic 11
- Graph Labeling and Dimension Problems 6
- semigroups and automata theory 5
-
- Advanced Topology and Set Theory 18
- Graph theory and applications 5
- Co-authors
- Robert Woodrow (4 shared papers)Bill Sands (3 shared papers)Mohamed H. El-Zahar (7 shared papers)D. L. Hanson (1 shared paper)H. L. Abbott (1 shared paper)Xuding Zhu (4 shared papers)Dwight Duffus (3 shared papers)E. C. Milner (4 shared papers)
- Journals
- Discrete Mathematics (9 papers)Journal of Combinatorial Theory Series B (6 papers)Canadian Journal of Mathematics (4 papers)European Journal of Combinatorics (3 papers)COMBINATORICA (3 papers)
- Partner nations
- CanadaUnited StatesHungary
In The Last Decade
N. Sauer
49 papers receiving 984 citations
N. Sauer's Hit Papers
Peers
Comparison fields: 5 of 70
- Discrete Mathematics and Combinatorics 362
- Computational Theory and Mathematics 629
- Geometry and Topology 325
- Mathematical Physics 124
- Computer Graphics and Computer-Aided Design 44
Countries citing papers authored by N. Sauer
This map shows the geographic impact of N. Sauer'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 N. Sauer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites N. Sauer more than expected).
Fields of papers citing papers by N. Sauer
This network shows the impact of papers produced by N. Sauer. 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 N. Sauer. The network helps show where N. Sauer may publish in the future.
Co-authors
The 19 scholars most cited alongside N. Sauer, 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 53 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | On the density of families of sets Hit paper breakdown → | 1972 | 548 |
| 2 | 1982 | 91 | |
| 3 | 1993 | 57 | |
| 4 | 1972 | 47 | |
| 5 | 1991 | 34 | |
| 6 | 1992 | 20 | |
| 7 | 1989 | 18 | |
| 8 | 1991 | 17 | |
| 9 | 1969 | 17 | |
| 10 | 1994 | 16 | |
| 11 | 2006 | 16 | |
| 12 | 1971 | 14 | |
| 13 | 2003 | 13 | |
| 14 | 1994 | 12 | |
| 15 | 1970 | 11 | |
| 16 | 2012 | 10 | |
| 17 | 1981 | 8 | |
| 18 | 1993 | 8 | |
| 19 | 1988 | 8 | |
| 20 | 1984 | 8 |
About N. Sauer
N. Sauer is a scholar working on Computational Theory and Mathematics, Geometry and Topology, Discrete Mathematics and Combinatorics, Mathematical Physics and Electrical and Electronic Engineering, having authored 53 papers that have together received 1.1k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (20 papers), Limits and Structures in Graph Theory (20 papers), Advanced Topology and Set Theory (18 papers), Advanced Algebra and Logic (11 papers), graph theory and CDMA systems (6 papers), Graph Labeling and Dimension Problems (6 papers), semigroups and automata theory (5 papers) and Graph theory and applications (5 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (362 citations), Computational Theory and Mathematics (629 citations), Geometry and Topology (325 citations), Mathematical Physics (124 citations) and Computer Graphics and Computer-Aided Design (44 citations). N. Sauer has collaborated with scholars based in Canada, United States and Hungary. Frequent co-authors include Robert Woodrow, Bill Sands, Mohamed H. El-Zahar, D. L. Hanson, H. L. Abbott, Xuding Zhu, Dwight Duffus, E. C. Milner, Dugald Macpherson and K.M. Koh. Their work appears in journals such as Discrete Mathematics, Journal of Combinatorial Theory Series B, Canadian Journal of Mathematics, European Journal of Combinatorics 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.