Karol Suchan
Impact in
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
-
- Limits and Structures in Graph Theory
Papers in
-
- Advanced Graph Theory Research 25
- Complexity and Algorithms in Graphs 22
- Graph Labeling and Dimension Problems 11
-
- Optimization and Search Problems 5
- Interconnection Networks and Systems 3
- Co-authors
- Ioan Todinca (14 shared papers)Nicolas Nisse (14 shared papers)Yngve Villanger (5 shared papers)Iván Rapaport (9 shared papers)Pinar Heggernes (3 shared papers)Fedor V. Fomin (2 shared papers)Petr A. Golovach (2 shared papers)Jan Kratochvı́l (1 shared paper)
In The Last Decade
Karol Suchan
36 papers receiving 314 citations
Peers
Comparison fields: 5 of 32
- Computational Theory and Mathematics 260
- Discrete Mathematics and Combinatorics 44
- Computer Networks and Communications 127
- Computer Graphics and Computer-Aided Design 8
- Geometry and Topology 18
Countries citing papers authored by Karol Suchan
This map shows the geographic impact of Karol Suchan'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 Karol Suchan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Karol Suchan more than expected).
Fields of papers citing papers by Karol Suchan
This network shows the impact of papers produced by Karol Suchan. 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 Karol Suchan. The network helps show where Karol Suchan may publish in the future.
Co-authors
The 25 scholars most cited alongside Karol Suchan, 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 39 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2009 | 49 | |
| 2 | 2014 | 23 | |
| 3 | 2007 | 21 | |
| 4 | 2007 | 20 | |
| 5 | 2005 | 20 | |
| 6 | 2009 | 18 | |
| 7 | 2011 | 17 | |
| 8 | 2007 | 15 | |
| 9 | Characterizing minimal interval completions towards better understanding of profile and pathwidth | 2007 | 12 |
| 10 | 2014 | 9 | |
| 11 | 2021 | 9 | |
| 12 | 2012 | 9 | |
| 13 | 2006 | 9 | |
| 14 | 2007 | 9 | |
| 15 | Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs | 2009 | 7 |
| 16 | 2014 | 7 | |
| 17 | 2012 | 7 | |
| 18 | 2012 | 7 | |
| 19 | 2012 | 7 | |
| 20 | 2006 | 6 |
About Karol Suchan
Karol Suchan is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Discrete Mathematics and Combinatorics, Geometry and Topology and Electrical and Electronic Engineering, having authored 39 papers that have together received 327 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (25 papers), Complexity and Algorithms in Graphs (22 papers), Graph Labeling and Dimension Problems (11 papers), Optimization and Search Problems (5 papers), Limits and Structures in Graph Theory (5 papers), Graph theory and applications (4 papers), Vehicle Routing Optimization Methods (3 papers) and Interconnection Networks and Systems (3 papers). The work is most often cited by research in Computational Theory and Mathematics (260 citations), Discrete Mathematics and Combinatorics (44 citations), Computer Networks and Communications (127 citations), Computer Graphics and Computer-Aided Design (8 citations) and Geometry and Topology (18 citations). Karol Suchan has collaborated with scholars based in Poland, Chile and France. Frequent co-authors include Ioan Todinca, Nicolas Nisse, Yngve Villanger, Iván Rapaport, Pinar Heggernes, Fedor V. Fomin, Petr A. Golovach, Jan Kratochvı́l, Adrian Kosowski and Alfredo Navarra. Their work appears in journals such as Discrete Applied Mathematics, Algorithmica, Theoretical Computer Science, Discrete Mathematics & Theoretical Computer Science and Lecture notes in computer science.
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.