Karol Suchan

481 total citations
28 papers, 141 citations indexed

About

Karol Suchan is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Geometry and Topology. According to data from OpenAlex, Karol Suchan has authored 28 papers receiving a total of 141 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Computational Theory and Mathematics, 7 papers in Computer Networks and Communications and 4 papers in Geometry and Topology. Recurrent topics in Karol Suchan's work include Advanced Graph Theory Research (16 papers), Complexity and Algorithms in Graphs (14 papers) and Graph Labeling and Dimension Problems (7 papers). Karol Suchan is often cited by papers focused on Advanced Graph Theory Research (16 papers), Complexity and Algorithms in Graphs (14 papers) and Graph Labeling and Dimension Problems (7 papers). Karol Suchan collaborates with scholars based in Chile, Poland and France. Karol Suchan's 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 and has published in prestigious journals such as SHILAP Revista de lepidopterología, Computers & Operations Research and Theoretical Computer Science.

In The Last Decade

Karol Suchan

24 papers receiving 133 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Karol Suchan Chile	7	103	44	26	17	13	28	141
N. S. Narayanaswamy India	6	115 1.1×	46 1.0×	13 0.5×	23 1.4×	20 1.5×	39	149
Vinícius F. dos Santos Brazil	7	88 0.9×	15 0.3×	50 1.9×	29 1.7×	12 0.9×	39	148
Anna Adamaszek Denmark	9	58 0.6×	50 1.1×	13 0.5×	5 0.3×	51 3.9×	27	142
Alexandru Popa Romania	7	65 0.6×	53 1.2×	30 1.2×	18 1.1×	2 0.2×	37	151
Yahav Nussbaum Israel	9	101 1.0×	55 1.3×	5 0.2×	5 0.3×	7 0.5×	13	152
Jara Uitto Switzerland	7	113 1.1×	76 1.7×	52 2.0×	4 0.2×	4 0.3×	20	151
Daniel Johannsen Germany	9	130 1.3×	30 0.7×	214 8.2×	15 0.9×	21 1.6×	19	253
Frank Kammer Germany	7	57 0.6×	51 1.2×	13 0.5×	5 0.3×	3 0.2×	21	110
Manfred Kunde Germany	8	42 0.4×	112 2.5×	19 0.7×	3 0.2×	29 2.2×	17	143
Aleksei V. Fishkin Germany	7	32 0.3×	63 1.4×	6 0.2×	4 0.2×	58 4.5×	14	123

Countries citing papers authored by Karol Suchan

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Suchan, Karol, et al.. (2024). Zero-sum partitions of Abelian groups and their applications to magic- and antimagic-type labelings. Discrete Mathematics & Theoretical Computer Science. vol. 26:3(Combinatorics).

Suchan, Karol, et al.. (2023). Zero-sum partitions of Abelian groups of order $2^n$. Discrete Mathematics & Theoretical Computer Science. vol. 25:1(Combinatorics). 2 indexed citations

Suchan, Karol, et al.. (2022). Territory Design for the Multi-Period Vehicle Routing Problem with Time Windows. Computers & Operations Research. 145. 105866–105866. 4 indexed citations

Suchan, Karol, et al.. (2022). Local Optima Network Analysis of Multi-Attribute Vehicle Routing Problems. Mathematics. 10(24). 4644–4644. 4 indexed citations

Suchan, Karol, et al.. (2021). Constrained Fitness Landscape Analysis of Capacitated Vehicle Routing Problems. Entropy. 24(1). 53–53. 8 indexed citations

Ducoffe, Guillaume, et al.. (2018). On interval number in cycle convexity. SHILAP Revista de lepidopterología. 2 indexed citations

Nisse, Nicolas, et al.. (2017). Minimum size tree-decompositions. Discrete Applied Mathematics. 245. 109–127. 2 indexed citations

Gaspers, Serge, Mathieu Liedloff, Maya Stein, & Karol Suchan. (2014). Complexity of splits reconstruction for low-degree trees. Discrete Applied Mathematics. 180. 89–100.

D’Angelo, Gianlorenzo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, & Karol Suchan. (2014). Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks. Algorithmica. 72(4). 1055–1096. 8 indexed citations

10.

Nisse, Nicolas, Iván Rapaport, & Karol Suchan. (2012). Distributed computing of efficient routing schemes in generalized chordal graphs. Theoretical Computer Science. 444. 17–27. 3 indexed citations

11.

Kowalik, Łukasz, Marcin Pilipczuk, & Karol Suchan. (2012). Towards optimal kernel for connected vertex cover in planar graphs. Discrete Applied Mathematics. 161(7-8). 1154–1161. 6 indexed citations

12.

Kosowski, Adrian, et al.. (2012). Allowing each node to communicate only once in a distributed system. 11–17. 3 indexed citations

13.

Matamala, Martı́n, et al.. (2011). Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round. 508–514. 10 indexed citations

14.

Correa, José, Nicole Megow, Rajiv Raman, & Karol Suchan. (2009). Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs. Max Planck Institute for Plasma Physics. 347–350. 4 indexed citations

15.

Fomin, Fedor V., Petr A. Golovach, Jan Kratochvı́l, Nicolas Nisse, & Karol Suchan. (2009). Pursuing a fast robber on a graph. Theoretical Computer Science. 411(7-9). 1167–1181. 37 indexed citations

16.

Suchan, Karol & Ioan Todinca. (2008). Minimal interval completion through graph exploration. Theoretical Computer Science. 410(1). 35–43. 2 indexed citations

17.

Suchan, Karol & Ioan Todinca. (2007). On powers of graphs of bounded NLC-width (clique-width). Discrete Applied Mathematics. 155(14). 1885–1893. 16 indexed citations

18.

Heggernes, Pinar, Karol Suchan, Ioan Todinca, & Yngve Villanger. (2007). Characterizing minimal interval completions towards better understanding of profile and pathwidth. 236–247. 5 indexed citations

19.

Rapaport, Iván, Karol Suchan, & Ioan Todinca. (2007). Minimal proper interval completions. Information Processing Letters. 106(5). 195–202. 5 indexed citations

20.

Suchan, Karol & Ioan Todinca. (2006). Minimal interval completion through graph exploration. 1 indexed citations

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.

Explore authors with similar magnitude of impact