Matt DeVos
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in
-
- Limits and Structures in Graph Theory 14
-
- Advanced Graph Theory Research 24
- Topological and Geometric Data Analysis 6
- Complexity and Algorithms in Graphs 5
- Graph Labeling and Dimension Problems 4
- Co-authors
- Bojan Mohar (17 shared papers)Luis Goddyn (6 shared papers)Klaas Hartmann (2 shared papers)Arne Ø. Mooers (3 shared papers)Aki Mimoto (3 shared papers)David W. Redding (2 shared papers)Drago Bokal (3 shared papers)Robert Šámal (8 shared papers)
- Journals
- Journal of Combinatorial Theory Series B (7 papers)Journal of Graph Theory (4 papers)Discrete Mathematics (3 papers)The Electronic Journal of Combinatorics (3 papers)COMBINATORICA (2 papers)
- Partner nations
- CanadaUnited StatesSlovenia
In The Last Decade
Matt DeVos
41 papers receiving 520 citations
Peers
Comparison fields: 5 of 60
- Discrete Mathematics and Combinatorics 193
- Computational Theory and Mathematics 324
- Geometry and Topology 146
- Computer Graphics and Computer-Aided Design 45
- Ecological Modeling 30
Countries citing papers authored by Matt DeVos
This map shows the geographic impact of Matt DeVos'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 Matt DeVos with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Matt DeVos more than expected).
Fields of papers citing papers by Matt DeVos
This network shows the impact of papers produced by Matt DeVos. 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 Matt DeVos. The network helps show where Matt DeVos may publish in the future.
Co-authors
The 25 scholars most cited alongside Matt DeVos, 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 45 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2007 | 106 | |
| 2 | 2004 | 67 | |
| 3 | 2007 | 36 | |
| 4 | 2008 | 31 | |
| 5 | 2014 | 30 | |
| 6 | 2005 | 27 | |
| 7 | 2008 | 26 | |
| 8 | 2008 | 25 | |
| 9 | 2020 | 22 | |
| 10 | 2004 | 15 | |
| 11 | 2020 | 13 | |
| 12 | 2013 | 12 | |
| 13 | 2010 | 12 | |
| 14 | 2013 | 11 | |
| 15 | 2012 | 10 | |
| 16 | 2016 | 8 | |
| 17 | Game Theory: A Playful Introduction | 2016 | 7 |
| 18 | 2014 | 7 | |
| 19 | 2000 | 7 | |
| 20 | 2014 | 6 |
About Matt DeVos
Matt DeVos is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Computer Graphics and Computer-Aided Design and Mathematical Physics, having authored 45 papers that have together received 537 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (24 papers), Limits and Structures in Graph Theory (14 papers), Computational Geometry and Mesh Generation (7 papers), graph theory and CDMA systems (7 papers), Topological and Geometric Data Analysis (6 papers), Graph theory and applications (5 papers), Complexity and Algorithms in Graphs (5 papers) and Graph Labeling and Dimension Problems (4 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (193 citations), Computational Theory and Mathematics (324 citations), Geometry and Topology (146 citations), Computer Graphics and Computer-Aided Design (45 citations) and Ecological Modeling (30 citations). Matt DeVos has collaborated with scholars based in Canada, United States and Slovenia. Frequent co-authors include Bojan Mohar, Luis Goddyn, Klaas Hartmann, Arne Ø. Mooers, Aki Mimoto, David W. Redding, Drago Bokal, Robert Šámal, Dirk Vertigan and Paul D. Seymour. Their work appears in journals such as Journal of Combinatorial Theory Series B, Journal of Graph Theory, Discrete Mathematics, The Electronic Journal of Combinatorics and COMBINATORICA.
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.