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 16
- Complexity and Algorithms in Graphs 14
- Graph Labeling and Dimension Problems 7
-
- Optimization and Search Problems 5
- Distributed systems and fault tolerance 2
- Co-authors
- Ioan Todinca (8 shared papers)Nicolas Nisse (11 shared papers)Petr A. Golovach (1 shared paper)Jan Kratochvı́l (1 shared paper)Fedor V. Fomin (1 shared paper)Iván Rapaport (6 shared papers)Adrian Kosowski (3 shared papers)Alfredo Navarra (1 shared paper)
In The Last Decade
Karol Suchan
24 papers receiving 138 citations
Peers
Comparison fields: 5 of 30
- Computational Theory and Mathematics 106
- Discrete Mathematics and Combinatorics 19
- Computer Networks and Communications 45
- Industrial and Manufacturing Engineering 14
- Computer Graphics and Computer-Aided Design 4
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 28 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2009 | 38 | |
| 2 | 2007 | 17 | |
| 3 | 2011 | 10 | |
| 4 | 2014 | 9 | |
| 5 | 2014 | 8 | |
| 6 | 2021 | 8 | |
| 7 | 2012 | 6 | |
| 8 | 2022 | 6 | |
| 9 | Characterizing minimal interval completions towards better understanding of profile and pathwidth | 2007 | 5 |
| 10 | 2007 | 5 | |
| 11 | 2022 | 4 | |
| 12 | Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs | 2009 | 4 |
| 13 | 2009 | 4 | |
| 14 | 2023 | 3 | |
| 15 | 2012 | 3 | |
| 16 | 2012 | 3 | |
| 17 | 2014 | 2 | |
| 18 | 2017 | 2 | |
| 19 | 2008 | 2 | |
| 20 | 2018 | 2 |
About Karol Suchan
Karol Suchan is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Geometry and Topology, Industrial and Manufacturing Engineering and Discrete Mathematics and Combinatorics, having authored 28 papers that have together received 147 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (16 papers), Complexity and Algorithms in Graphs (14 papers), Graph Labeling and Dimension Problems (7 papers), Optimization and Search Problems (5 papers), Graph theory and applications (4 papers), Vehicle Routing Optimization Methods (3 papers), Limits and Structures in Graph Theory (3 papers) and Distributed systems and fault tolerance (2 papers). The work is most often cited by research in Computational Theory and Mathematics (106 citations), Discrete Mathematics and Combinatorics (19 citations), Computer Networks and Communications (45 citations), Industrial and Manufacturing Engineering (14 citations) and Computer Graphics and Computer-Aided Design (4 citations). Karol Suchan has collaborated with scholars based in Chile, Poland and France. Frequent co-authors include Ioan Todinca, Nicolas Nisse, Petr A. Golovach, Jan Kratochvı́l, Fedor V. Fomin, Iván Rapaport, Adrian Kosowski, Alfredo Navarra, Gianlorenzo D’Angelo and Marcin Pilipczuk. Their work appears in journals such as Discrete Applied Mathematics, Algorithmica, Theoretical Computer Science, Discrete Mathematics & Theoretical Computer Science and Computers & Operations Research.
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.