Michael J. Pelsmajer
-
- Computational Geometry and Mesh Generation 14
-
- Limits and Structures in Graph Theory 6
-
- Advanced Graph Theory Research 22
- Graph Labeling and Dimension Problems 6
- Complexity and Algorithms in Graphs 5
- Geometry and Topology top 10%
-
- Data Management and Algorithms 6
-
- Digital Image Processing Techniques 4
-
- Optimization and Search Problems 4
- Co-authors
- Marcus SchaeferDaniel ŠtefankovičAndré KündgenAlexandr KostochkaDouglas B. WestGe XiaIyad KanjHenry Martyn Mulder
- Cited by
- Computer Graphics and Computer-Aided DesignDiscrete Mathematics and CombinatoricsComputational Theory and Mathematics
- Journals
- Journal of Computer and System Sciences (1 paper)Discrete Mathematics (4 papers)Journal of Combinatorial Theory Series B (1 paper)
- Partner nations
- United StatesNetherlandsIndia
In The Last Decade
Michael J. Pelsmajer
29 papers receiving 199 citations
Peers
Comparison fields: 5 of 25
- Computer Graphics and Computer-Aided Design 74
- Discrete Mathematics and Combinatorics 56
- Computational Theory and Mathematics 185
- Geometry and Topology 26
- Signal Processing 19
Countries citing papers authored by Michael J. Pelsmajer
This map shows the geographic impact of Michael J. Pelsmajer'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 Michael J. Pelsmajer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael J. Pelsmajer more than expected).
Fields of papers citing papers by Michael J. Pelsmajer
This network shows the impact of papers produced by Michael J. Pelsmajer. 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 Michael J. Pelsmajer. The network helps show where Michael J. Pelsmajer may publish in the future.
Co-authorship network
The 18 scholars most cited alongside Michael J. Pelsmajer, 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 | 2024 | 0 | |
| 2 | 2023 | 1 | |
| 3 | 2021 | 1 | |
| 4 | 2017 | 3 | |
| 5 | 2013 | 1 | |
| 6 | 2010 | 17 | |
| 7 | 2010 | 19 | |
| 8 | 2010 | 2 | |
| 9 | 2009 | 7 | |
| 10 | 2009 | 6 | |
| 11 | 2009 | 1 | |
| 12 | 2007 | 30 | |
| 13 | Generalized centrality in trees | 2006 | 1 |
| 14 | Axiomization of the center function on trees | 2006 | 11 |
| 15 | 2006 | 12 | |
| 16 | 2006 | 6 | |
| 17 | 2006 | 0 | |
| 18 | Integer Programming Methods for Several Optimization Problems in Graph Theory. | 2005 | 7 |
| 19 | Odd crossing number is not crossing number | 2005 | 1 |
| 20 | 2003 | 29 |
About Michael J. Pelsmajer
Michael J. Pelsmajer is a scholar working on Computer Graphics and Computer-Aided Design, Discrete Mathematics and Combinatorics and Computational Theory and Mathematics, having authored 33 papers that have together received 215 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (22 papers), Computational Geometry and Mesh Generation (14 papers), Graph Labeling and Dimension Problems (6 papers), Data Management and Algorithms (6 papers), Limits and Structures in Graph Theory (6 papers), Complexity and Algorithms in Graphs (5 papers), Digital Image Processing Techniques (4 papers) and Optimization and Search Problems (4 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (74 citations), Discrete Mathematics and Combinatorics (56 citations) and Computational Theory and Mathematics (185 citations). Michael J. Pelsmajer has collaborated with scholars based in United States, Netherlands and India. Frequent co-authors include Marcus Schaefer, Daniel Štefankovič, André Kündgen, Alexandr Kostochka, Douglas B. West, Ge Xia, Iyad Kanj, Henry Martyn Mulder, K. B. Reid and Radoslav Fulek. Their work appears in journals such as Journal of Computer and System Sciences, Discrete Mathematics and Journal of Combinatorial Theory Series B.
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.