Stephen B. Maurer

591 total citations
33 papers, 301 citations indexed

About

Stephen B. Maurer is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Stephen B. Maurer has authored 33 papers receiving a total of 301 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Computational Theory and Mathematics, 5 papers in Geometry and Topology and 4 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Stephen B. Maurer's work include Advanced Graph Theory Research (11 papers), Computability, Logic, AI Algorithms (5 papers) and Graph Labeling and Dimension Problems (4 papers). Stephen B. Maurer is often cited by papers focused on Advanced Graph Theory Research (11 papers), Computability, Logic, AI Algorithms (5 papers) and Graph Labeling and Dimension Problems (4 papers). Stephen B. Maurer collaborates with scholars based in United States and Canada. Stephen B. Maurer's co-authors include Anthony Ralston, Frederic L. Pryor, Peter J. Slater, William T. Trotter and Laurence S. Seidman and has published in prestigious journals such as Annals of the New York Academy of Sciences, Journal of Development Economics and Journal of Public Economics.

In The Last Decade

Stephen B. Maurer

31 papers receiving 268 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Stephen B. Maurer United States 10 164 61 58 54 34 33 301
K. B. Reid United States 10 227 1.4× 90 1.5× 81 1.4× 106 2.0× 38 1.1× 45 310
J. W. T. Youngs United States 10 211 1.3× 81 1.3× 104 1.8× 96 1.8× 19 0.6× 36 406
Trevor Evans Australia 8 98 0.6× 75 1.2× 52 0.9× 17 0.3× 20 0.6× 46 314
Dan Hefetz Israel 13 349 2.1× 29 0.5× 95 1.6× 234 4.3× 19 0.6× 51 405
N. N. Vorob’ëv Belarus 9 68 0.4× 19 0.3× 27 0.5× 54 1.0× 12 0.4× 31 294
Erich Prisner Germany 12 296 1.8× 49 0.8× 108 1.9× 80 1.5× 74 2.2× 31 365
Miloš Stojaković Serbia 9 143 0.9× 8 0.1× 32 0.6× 114 2.1× 28 0.8× 33 214
Lorenz Halbeısen Switzerland 11 146 0.9× 22 0.4× 171 2.9× 46 0.9× 6 0.2× 60 290
Paul Horn United States 8 82 0.5× 20 0.3× 46 0.8× 45 0.8× 33 1.0× 29 217
Christian Elsholtz Austria 9 34 0.2× 68 1.1× 87 1.5× 147 2.7× 13 0.4× 43 321

Countries citing papers authored by Stephen B. Maurer

Since Specialization
Citations

This map shows the geographic impact of Stephen B. Maurer'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 Stephen B. Maurer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stephen B. Maurer more than expected).

Fields of papers citing papers by Stephen B. Maurer

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Stephen B. Maurer. 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 Stephen B. Maurer. The network helps show where Stephen B. Maurer may publish in the future.

Co-authorship network of co-authors of Stephen B. Maurer

This figure shows the co-authorship network connecting the top 25 collaborators of Stephen B. Maurer. A scholar is included among the top collaborators of Stephen B. Maurer based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Stephen B. Maurer. Stephen B. Maurer is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Maurer, Stephen B.. (2000). What is discrete mathematics? The many answers. 121–132. 1 indexed citations
2.
Maurer, Stephen B., et al.. (1993). Discrete Algorithmic Mathematics. College Mathematics Journal. 24(1). 107–107. 12 indexed citations
3.
Maurer, Stephen B.. (1991). ADVICE FOR UNDERGRADUATES ON SPECIAL ASPECTS OF WRITING MATHEMATICS. PRIMUS. 1(1). 9–28. 5 indexed citations
4.
Maurer, Stephen B.. (1990). Writing In Mathematics At Swarthmore: PDCs. Works - Scholarship, Research, & Creative Expression (Swarthmore College). 16. 22. 1 indexed citations
5.
Maurer, Stephen B.. (1985). The Algorithm Way of Life Is Best. College Mathematics Journal. 16(1). 2–2. 3 indexed citations
6.
Maurer, Stephen B.. (1985). U.S. Team Places Second In International Olympiad. Swarthmore College Works (Swarthmore College Libraries). 5(4). 1. 13 indexed citations
7.
Maurer, Stephen B.. (1984). Two Meanings of Algorithmic Mathematics. Mathematics Teacher Learning and Teaching PK-12. 77(6). 430–435. 4 indexed citations
8.
Maurer, Stephen B. & Laurence S. Seidman. (1984). The consumption tax, horizontal redistribution, and aggregate saving. Mathematical Modelling. 5(4). 205–222. 2 indexed citations
9.
Maurer, Stephen B., et al.. (1984). The Future of College Mathematics. College Mathematics Journal. 15(5). 458–458. 3 indexed citations
10.
Maurer, Stephen B., et al.. (1980). A generalization of Turán's theorem to directed graphs. Discrete Mathematics. 32(2). 167–189. 5 indexed citations
11.
Maurer, Stephen B.. (1980). The King Chicken Theorems. Mathematics Magazine. 53(2). 67–80. 13 indexed citations
12.
Maurer, Stephen B. & Peter J. Slater. (1979). MINIMALLY 2‐EDGE‐CONNECTED GRAPHS. Annals of the New York Academy of Sciences. 319(1). 377–382. 1 indexed citations
13.
Maurer, Stephen B.. (1979). Vertex colorings without isolates. Journal of Combinatorial Theory Series B. 27(3). 294–319. 9 indexed citations
14.
Maurer, Stephen B. & Peter J. Slater. (1978). On k-minimally n-edge-connected graphs. Discrete Mathematics. 24(2). 185–195. 10 indexed citations
15.
Maurer, Stephen B., et al.. (1977). Large minimal realizers of a partial order. Proceedings of the American Mathematical Society. 66(2). 211–216. 4 indexed citations
16.
Maurer, Stephen B., et al.. (1977). Large Minimal Realizers of a Partial Order. Proceedings of the American Mathematical Society. 66(2). 211–211. 3 indexed citations
17.
Maurer, Stephen B.. (1975). A maximum-rank minimum-term-rank theorem for matroids. Linear Algebra and its Applications. 10(2). 129–137. 1 indexed citations
18.
Maurer, Stephen B.. (1975). Intervals in matroid basis graphs. Discrete Mathematics. 11(2). 147–159. 4 indexed citations
19.
Maurer, Stephen B.. (1973). Matroid basis graphs. I. Journal of Combinatorial Theory Series B. 14(3). 216–240. 57 indexed citations
20.
Maurer, Stephen B.. (1973). Matroid basis graphs. II. Journal of Combinatorial Theory Series B. 15(2). 121–145. 21 indexed citations

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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026