Marcus Schaefer
Impact in
-
- Computational Geometry and Mesh Generation
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- semigroups and automata theory
Papers in ⓘ
-
- Advanced Graph Theory Research 19
- Complexity and Algorithms in Graphs 9
- Computability, Logic, AI Algorithms 7
-
- Computational Geometry and Mesh Generation 28
- Co-authors
- Daniel Štefankovič (23 shared papers)Eric Sedgwick (7 shared papers)Michael J. Pelsmajer (16 shared papers)Christopher Umans (1 shared paper)Iyad Kanj (2 shared papers)Ge Xia (2 shared papers)Dániel Marx (1 shared paper)Stephen Fenner (2 shared papers)
- Journals
- Journal of Graph Algorithms and Applications (9 papers)Journal of Computer and System Sciences (5 papers)SIAM Journal on Discrete Mathematics (4 papers)Theory of Computing Systems (3 papers)Algorithmica (3 papers)
- Partner nations
- United StatesGermanySlovakia
In The Last Decade
Marcus Schaefer
50 papers receiving 446 citations
Peers
Comparison fields: 5 of 52
- Computer Graphics and Computer-Aided Design 206
- Computational Theory and Mathematics 309
- Discrete Mathematics and Combinatorics 42
- Signal Processing 71
- Computational Mathematics 3
Countries citing papers authored by Marcus Schaefer
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).
Fields of papers citing papers by Marcus Schaefer
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-authors
The 16 scholars most cited alongside Marcus Schaefer, 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 57 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Completeness in the Polynomial-Time Hierarchy A Compendium ∗ | 2008 | 52 |
| 2 | 2002 | 46 | |
| 3 | 2015 | 35 | |
| 4 | 2003 | 29 | |
| 5 | 2013 | 29 | |
| 6 | 2001 | 23 | |
| 7 | 1999 | 22 | |
| 8 | 1999 | 20 | |
| 9 | 2003 | 19 | |
| 10 | 2010 | 19 | |
| 11 | 2018 | 17 | |
| 12 | 2013 | 13 | |
| 13 | 2006 | 12 | |
| 14 | 2009 | 11 | |
| 15 | 1998 | 10 | |
| 16 | ESTIMATION OF INTERSECTION TURNING MOVEMENTS FROM APPROACH COUNTS | 1988 | 9 |
| 17 | 2001 | 9 | |
| 18 | 2008 | 9 | |
| 19 | Multi-Sided Boundary Labeling | 2016 | 8 |
| 20 | 2008 | 8 |
About Marcus Schaefer
Marcus Schaefer is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Computer Vision and Pattern Recognition, Signal Processing and Artificial Intelligence, having authored 57 papers that have together received 488 indexed citations. Recurring topics across this work include Computational Geometry and Mesh Generation (28 papers), Advanced Graph Theory Research (19 papers), Data Management and Algorithms (11 papers), Complexity and Algorithms in Graphs (9 papers), Digital Image Processing Techniques (8 papers), Computability, Logic, AI Algorithms (7 papers), Algorithms and Data Compression (7 papers) and Limits and Structures in Graph Theory (6 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (206 citations), Computational Theory and Mathematics (309 citations), Discrete Mathematics and Combinatorics (42 citations), Signal Processing (71 citations) and Computational Mathematics (3 citations). Marcus Schaefer has collaborated with scholars based in United States, Germany and Slovakia. Frequent co-authors include Daniel Štefankovič, Eric Sedgwick, Michael J. Pelsmajer, Christopher Umans, Iyad Kanj, Ge Xia, Dániel Marx, Stephen Fenner, Ignaz Rutter and Radoslav Fulek. Their work appears in journals such as Journal of Graph Algorithms and Applications, Journal of Computer and System Sciences, SIAM Journal on Discrete Mathematics, Theory of Computing Systems and Algorithmica.
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.