Simon Špacapan
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 20
- Graph Labeling and Dimension Problems 14
- Complexity and Algorithms in Graphs 3
-
- Graph theory and applications 13
- Co-authors
- Sandi Klavžar (7 shared papers)Boštjan Brešar (3 shared papers)Michel Mollard (2 shared papers)Paul Dorbec (2 shared papers)Iztok Peterin (4 shared papers)Sylvain Gravier (2 shared papers)Manoj Changat (3 shared papers)Kannan Balakrishnan (1 shared paper)
In The Last Decade
Simon Špacapan
30 papers receiving 331 citations
Peers
Comparison fields: 5 of 31
- Discrete Mathematics and Combinatorics 73
- Computational Theory and Mathematics 272
- Geometry and Topology 127
- Computer Networks and Communications 147
- Electrical and Electronic Engineering 79
Countries citing papers authored by Simon Špacapan
This map shows the geographic impact of Simon Špacapan'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 Simon Špacapan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Simon Špacapan more than expected).
Fields of papers citing papers by Simon Špacapan
This network shows the impact of papers produced by Simon Špacapan. 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 Simon Špacapan. The network helps show where Simon Špacapan may publish in the future.
Co-authors
The 18 scholars most cited alongside Simon Špacapan, 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 34 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2007 | 55 | |
| 2 | 2008 | 40 | |
| 3 | 2008 | 27 | |
| 4 | On the connectivity of the direct product of graphs. | 2008 | 22 |
| 5 | 2010 | 22 | |
| 6 | 2006 | 21 | |
| 7 | 2008 | 20 | |
| 8 | 2007 | 17 | |
| 9 | 2015 | 16 | |
| 10 | 2006 | 15 | |
| 11 | 2005 | 12 | |
| 12 | 2013 | 10 | |
| 13 | 2006 | 10 | |
| 14 | 2005 | 10 | |
| 15 | 2009 | 8 | |
| 16 | 2011 | 7 | |
| 17 | 2007 | 5 | |
| 18 | 2009 | 4 | |
| 19 | 2011 | 4 | |
| 20 | 2013 | 4 |
About Simon Špacapan
Simon Špacapan is a scholar working on Computational Theory and Mathematics, Geometry and Topology, Computer Networks and Communications, Electrical and Electronic Engineering and Discrete Mathematics and Combinatorics, having authored 34 papers that have together received 350 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (20 papers), Graph Labeling and Dimension Problems (14 papers), Graph theory and applications (13 papers), Interconnection Networks and Systems (11 papers), graph theory and CDMA systems (9 papers), Limits and Structures in Graph Theory (4 papers), Coding theory and cryptography (4 papers) and Complexity and Algorithms in Graphs (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (73 citations), Computational Theory and Mathematics (272 citations), Geometry and Topology (127 citations), Computer Networks and Communications (147 citations) and Electrical and Electronic Engineering (79 citations). Simon Špacapan has collaborated with scholars based in Slovenia, India and Canada. Frequent co-authors include Sandi Klavžar, Boštjan Brešar, Michel Mollard, Paul Dorbec, Iztok Peterin, Sylvain Gravier, Manoj Changat, Kannan Balakrishnan, Primož Šparl and Janez Žerovnik. Their work appears in journals such as European Journal of Combinatorics, Discrete Applied Mathematics, SIAM Journal on Discrete Mathematics, Journal of Graph Theory and Discrete Mathematics.
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.