This map shows the geographic impact of Artur Czumaj'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 Artur Czumaj with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Artur Czumaj more than expected).
This network shows the impact of papers produced by Artur Czumaj. 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 Artur Czumaj. The network helps show where Artur Czumaj may publish in the future.
Co-authorship network of co-authors of Artur Czumaj
This figure shows the co-authorship network connecting the top 25 collaborators of Artur Czumaj.
A scholar is included among the top collaborators of Artur Czumaj 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 Artur Czumaj. Artur Czumaj is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Czumaj, Artur, Gereon Frahling, & Christian Sohler. (2007). Efficient Kinetic Data Structures for MaxCut.. Canadian Conference on Computational Geometry. 157–160.3 indexed citations
Czumaj, Artur, A. Shapira, & Christian Sohler. (2007). Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs.. Warwick Research Archive Portal (University of Warwick). 14.2 indexed citations
9.
Czumaj, Artur, Klaus Jansen, Friedhelm Meyer auf der Heide, & Ingo Schiermeyer. (2006). Algorithmic Graph Theory. Oberwolfach Reports. 3(1). 379–460.7 indexed citations
Czumaj, Artur & Andrzej Lingas. (1999). On approximability of the minimum-cost k-connected spanning subgraph problem. Symposium on Discrete Algorithms. 281–290.19 indexed citations
19.
Czumaj, Artur, et al.. (1999). Delayed path coupling and generating random permutations via distributed stochastic processes. Symposium on Discrete Algorithms. 271–280.16 indexed citations
20.
Czumaj, Artur, et al.. (1997). The Architecture of a Software Library for String Processing. Max Planck Institute for Plasma Physics. 166–176.3 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.