Countries citing papers authored by Marcus Schaefer
Since
Specialization
Citations
This map shows the geographic impact of Marcus Schaefer'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 Marcus Schaefer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Marcus Schaefer more than expected).
This network shows the impact of papers produced by Marcus Schaefer. 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 Marcus Schaefer. The network helps show where Marcus Schaefer may publish in the future.
Co-authorship network of co-authors of Marcus Schaefer
This figure shows the co-authorship network connecting the top 25 collaborators of Marcus Schaefer.
A scholar is included among the top collaborators of Marcus Schaefer 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 Marcus Schaefer. Marcus Schaefer is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Schaefer, Marcus. (2023). The Complexity of Angular Resolution. Journal of Graph Algorithms and Applications. 27(7). 565–580.1 indexed citations
3.
Fulek, Radoslav, Michael J. Pelsmajer, & Marcus Schaefer. (2023). Hanani-Tutte for Radial Planarity II. The Electronic Journal of Combinatorics. 30(1).1 indexed citations
Kanj, Iyad, Michael J. Pelsmajer, Marcus Schaefer, & Ge Xia. (2010). On the induced matching problem. Journal of Computer and System Sciences. 77(6). 1058–1070.19 indexed citations
6.
Pelsmajer, Michael J., Marcus Schaefer, & Daniel Štefankovič. (2009). Removing even crossings on surfaces. European Journal of Combinatorics. 30(7). 1704–1717.7 indexed citations
7.
Schaefer, Marcus, Eric Sedgwick, & Daniel Štefankovič. (2008). Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time. Canadian Conference on Computational Geometry.7 indexed citations
Schaefer, Marcus & Eric Sedgwick. (2007). Spiralling and Folding: The Topological View. Canadian Conference on Computational Geometry. 73–76.3 indexed citations
10.
Pelsmajer, Michael J., Marcus Schaefer, & Daniel Štefankovič. (2006). Removing even crossings. Journal of Combinatorial Theory Series B. 97(4). 489–500.12 indexed citations
11.
Pelsmajer, Michael J., Marcus Schaefer, & Daniel Štefankovič. (2005). Odd crossing number is not crossing number.1 indexed citations
12.
Schaefer, Marcus, et al.. (2003). Induced Graph Ramsey Theory.. Ars Combinatoria. 66.4 indexed citations
13.
Schaefer, Marcus, Eric Sedgwick, & Daniel Štefankovič. (2003). Recognizing string graphs in NP. Journal of Computer and System Sciences. 67(2). 365–380.29 indexed citations
14.
Schaefer, Marcus & Daniel Štefankovič. (2003). Decidability of string graphs. Journal of Computer and System Sciences. 68(2). 319–334.19 indexed citations
Schaefer, Marcus & Stephen Fenner. (1997). Simplicity and Strong Reductions. Electronic colloquium on computational complexity.1 indexed citations
19.
Schaefer, Marcus. (1996). Deciding The Vapnik-Chervonenkis Dimension Is Sigma_3-Complete. 77.1 indexed citations
20.
Schaefer, Marcus. (1988). ESTIMATION OF INTERSECTION TURNING MOVEMENTS FROM APPROACH COUNTS. ITE journal. 58(10).9 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.