N. Sauer
-
- Limits and Structures in Graph Theory 19
-
- Advanced Graph Theory Research 18
- Advanced Algebra and Logic 10
- Graph Labeling and Dimension Problems 5
- Computability, Logic, AI Algorithms 5
- semigroups and automata theory 4
- Geometry and Topology top 2%
- Advanced Topology and Set Theory 17
- Graph theory and applications 5
- Mathematical Physics top 10%
- Co-authors
- Bill SandsRobert WoodrowMohamed H. El-ZaharXuding ZhuD. L. HansonH. L. AbbottDwight DuffusDugald Macpherson
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsGeometry and Topology
- Journals
- Discrete Mathematics (9 papers)Journal of Combinatorial Theory Series B (6 papers)Canadian Journal of Mathematics (4 papers)
- Partner nations
- CanadaUnited StatesAustria
In The Last Decade
N. Sauer
42 papers receiving 819 citations
Hit Papers
Peers
Comparison fields: 5 of 64
- Discrete Mathematics and Combinatorics 308
- Computational Theory and Mathematics 532
- Geometry and Topology 272
- Mathematical Physics 105
- Computer Graphics and Computer-Aided Design 36
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-authorship network
The 17 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
| # | Work | ||
|---|---|---|---|
| 1 | 2013 | 2 | |
| 2 | 2011 | 4 | |
| 3 | 2005 | 2 | |
| 4 | 2003 | 11 | |
| 5 | 1994 | 14 | |
| 6 | 1993 | 2 | |
| 7 | 1993 | 0 | |
| 8 | 1992 | 6 | |
| 9 | 1991 | 1 | |
| 10 | 1991 | 28 | |
| 11 | 1991 | 11 | |
| 12 | 1989 | 16 | |
| 13 | 1986 | 1 | |
| 14 | 1986 | 3 | |
| 15 | 1982 | 85 | |
| 16 | 1981 | 3 | |
| 17 | On the density of families of setsbreakdown → | 1972 | 463 |
| 18 | 1972 | 40 | |
| 19 | 1971 | 14 | |
| 20 | 1970 | 1 |
About N. Sauer
N. Sauer is a scholar working on Discrete Mathematics and Combinatorics, Geometry and Topology, Computational Theory and Mathematics, Algebra and Number Theory and Computer Graphics and Computer-Aided Design, having authored 47 papers that have together received 893 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (19 papers), Advanced Graph Theory Research (18 papers), Advanced Topology and Set Theory (17 papers), Advanced Algebra and Logic (10 papers), Graph Labeling and Dimension Problems (5 papers), Computability, Logic, AI Algorithms (5 papers), Graph theory and applications (5 papers) and semigroups and automata theory (4 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (308 citations), Computational Theory and Mathematics (532 citations), Geometry and Topology (272 citations), Mathematical Physics (105 citations) and Computer Graphics and Computer-Aided Design (36 citations). N. Sauer has collaborated with scholars based in Canada, United States and Austria. Frequent co-authors include Bill Sands, Robert Woodrow, Mohamed H. El-Zahar, Xuding Zhu, D. L. Hanson, H. L. Abbott, Dwight Duffus, Dugald Macpherson, E. C. Milner and V. Rödl. Their work appears in journals such as Discrete Mathematics, Journal of Combinatorial Theory Series B, Canadian Journal of Mathematics, COMBINATORICA and Journal of Combinatorial Theory Series A.
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.