Luis Goddyn
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Graph Theory Research 18
- Graph Labeling and Dimension Problems 8
- Complexity and Algorithms in Graphs 4
- Topological and Geometric Data Analysis 2
-
- Limits and Structures in Graph Theory 11
- Finite Group Theory Research 2
- Co-authors
- Michael Tarsi (2 shared papers)Bojan Mohar (5 shared papers)Matt DeVos (5 shared papers)M. N. Ellingham (1 shared paper)Brian Alspach (2 shared papers)Cun‐Quan Zhang (2 shared papers)Robert Šámal (2 shared papers)Wojciech Bienia (1 shared paper)
- Journals
- Journal of Combinatorial Theory Series B (7 papers)Transactions of the American Mathematical Society (3 papers)COMBINATORICA (3 papers)Discrete Mathematics (3 papers)Journal of Graph Theory (2 papers)
- Partner nations
- CanadaUnited StatesIran
In The Last Decade
Luis Goddyn
31 papers receiving 400 citations
Peers
Comparison fields: 5 of 48
- Discrete Mathematics and Combinatorics 200
- Computational Theory and Mathematics 334
- Computer Graphics and Computer-Aided Design 38
- Geometry and Topology 75
- Algebra and Number Theory 13
Countries citing papers authored by Luis Goddyn
This map shows the geographic impact of Luis Goddyn'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 Luis Goddyn with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Luis Goddyn more than expected).
Fields of papers citing papers by Luis Goddyn
This network shows the impact of papers produced by Luis Goddyn. 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 Luis Goddyn. The network helps show where Luis Goddyn may publish in the future.
Co-authors
The 25 scholars most cited alongside Luis Goddyn, 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 32 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1994 | 46 | |
| 2 | 2006 | 43 | |
| 3 | 1998 | 43 | |
| 4 | 1998 | 39 | |
| 5 | 1996 | 38 | |
| 6 | 2008 | 31 | |
| 7 | 2003 | 27 | |
| 8 | 2008 | 24 | |
| 9 | 1997 | 21 | |
| 10 | 2007 | 20 | |
| 11 | 2004 | 15 | |
| 12 | 1989 | 12 | |
| 13 | 1985 | 12 | |
| 14 | 1990 | 11 | |
| 15 | 2002 | 7 | |
| 16 | 1999 | 7 | |
| 17 | 2016 | 7 | |
| 18 | 1994 | 5 | |
| 19 | 1999 | 4 | |
| 20 | 2006 | 4 |
About Luis Goddyn
Luis Goddyn is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering, Geometry and Topology and Artificial Intelligence, having authored 32 papers that have together received 435 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (18 papers), graph theory and CDMA systems (12 papers), Limits and Structures in Graph Theory (11 papers), Graph Labeling and Dimension Problems (8 papers), Complexity and Algorithms in Graphs (4 papers), Graph theory and applications (2 papers), Finite Group Theory Research (2 papers) and Topological and Geometric Data Analysis (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (200 citations), Computational Theory and Mathematics (334 citations), Computer Graphics and Computer-Aided Design (38 citations), Geometry and Topology (75 citations) and Algebra and Number Theory (13 citations). Luis Goddyn has collaborated with scholars based in Canada, United States and Iran. Frequent co-authors include Michael Tarsi, Bojan Mohar, Matt DeVos, M. N. Ellingham, Brian Alspach, Cun‐Quan Zhang, Robert Šámal, Wojciech Bienia, András Sebö and Jim Geelen. Their work appears in journals such as Journal of Combinatorial Theory Series B, Transactions of the American Mathematical Society, COMBINATORICA, Discrete Mathematics and Journal of Graph Theory.
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.