Karol Suchan
- Computational Theory and Mathematics top 5%
- Computer Networks and Communications
- Artificial Intelligence
- Discrete Mathematics and Combinatorics
- Industrial and Manufacturing Engineering
- Co-authors
- Nicolas NisseIoan TodincaJan Kratochvı́lPetr A. GolovachFedor V. FominIván RapaportAdrian KosowskiMarcin Pilipczuk
- Topics
- Advanced Graph Theory Research (16 papers)Complexity and Algorithms in Graphs (14 papers)Graph Labeling and Dimension Problems (7 papers)
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsComputer Networks and Communications
- Journals
- SHILAP Revista de lepidopterologíaComputers & Operations ResearchTheoretical Computer Science
In The Last Decade
Karol Suchan
24 papers receiving 133 citations
Peers
Comparison fields: 5 of 28
- Computational Theory and Mathematics 103
- Computer Networks and Communications 44
- Artificial Intelligence 26
- Discrete Mathematics and Combinatorics 17
- Industrial and Manufacturing Engineering 13
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-authorship network of co-authors of Karol Suchan
This figure shows the co-authorship network connecting the top 25 collaborators of Karol Suchan. A scholar is included among the top collaborators of Karol Suchan based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Karol Suchan. Karol Suchan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 2 | |
| 3 | 4 | |
| 4 | 4 | |
| 5 | 8 | |
| 6 | 2 | |
| 7 | 2 | |
| 8 | 0 | |
| 9 | 8 | |
| 10 | 3 | |
| 11 | 6 | |
| 12 | 3 | |
| 13 | 10 | |
| 14 | Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs | 4 |
| 15 | 37 | |
| 16 | 2 | |
| 17 | 16 | |
| 18 | Characterizing minimal interval completions towards better understanding of profile and pathwidth | 5 |
| 19 | 5 | |
| 20 | Minimal interval completion through graph exploration | 1 |
About Karol Suchan
Karol Suchan is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology, having authored 28 papers that have together received 141 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (16 papers), Complexity and Algorithms in Graphs (14 papers) and Graph Labeling and Dimension Problems (7 papers). The work is most often cited by research in Computational Theory and Mathematics (103 citations), Discrete Mathematics and Combinatorics (17 citations) and Computer Networks and Communications (44 citations). Karol Suchan has collaborated with scholars based in Chile, Poland and France. Frequent co-authors include Nicolas Nisse, Ioan Todinca, Jan Kratochvı́l, Petr A. Golovach, Fedor V. Fomin, Iván Rapaport, Adrian Kosowski, Marcin Pilipczuk, Gabriele Di Stefano and Łukasz Kowalik. Their work appears in journals such as SHILAP Revista de lepidopterología, Computers & Operations Research and Theoretical 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.