Countries citing papers authored by Wojciech Rytter
Since
Specialization
Citations
This map shows the geographic impact of Wojciech Rytter'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 Wojciech Rytter with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Wojciech Rytter more than expected).
This network shows the impact of papers produced by Wojciech Rytter. 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 Wojciech Rytter. The network helps show where Wojciech Rytter may publish in the future.
Co-authorship network of co-authors of Wojciech Rytter
This figure shows the co-authorship network connecting the top 25 collaborators of Wojciech Rytter.
A scholar is included among the top collaborators of Wojciech Rytter 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 Wojciech Rytter. Wojciech Rytter is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Crochemore, Maxime, Lucian Ilie, Costas S. Iliopoulos, et al.. (2012). Computing the Longest Previous Factor. European Journal of Combinatorics. 34(1). 15–26.9 indexed citations
5.
Rytter, Wojciech, et al.. (2012). The Number of Cubes in Sturmian Words.. 89–102.1 indexed citations
6.
Rytter, Wojciech, et al.. (2011). Computing the Number of Cubic Runs in Standard Sturmian Words.. 106–120.1 indexed citations
7.
Rytter, Wojciech, et al.. (2009). Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words.. 237–248.1 indexed citations
8.
Rytter, Wojciech, et al.. (2008). Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words.. 193–207.1 indexed citations
9.
Rytter, Wojciech, et al.. (2007). Occurrence and Lexicographic Properties of Standard Sturmian Words.. 79–90.2 indexed citations
10.
Bhattacharya, Binay, et al.. (2007). Faster Algorithms for k-Medians in Trees (Extended Abstract).1 indexed citations
11.
Lasota, Sławomir & Wojciech Rytter. (2006). Faster algorithm for bisimulation equivalence of normed context-free processes. Lecture notes in computer science. 4162. 646–657.2 indexed citations
12.
Crochemore, Maxime, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, & Wojciech Rytter. (2002). Three Heuristics for delta-Matching: delta-BM Algorithms. Research Portal (King's College London).3 indexed citations
Karpiński, Marek, Wojciech Rytter, & Ayumi Shinohara. (1997). An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions.. Nordic journal of computing. 4. 172–186.38 indexed citations
16.
Gąsieniec, Leszek, Marek Karpiński, Wojciech Plandowski, & Wojciech Rytter. (1996). Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach. Max Planck Institute for Plasma Physics. 39–49.6 indexed citations
Rytter, Wojciech. (1990). On parallel computations of expressions and straight programs. Computing and Informatics / Computers and Artificial Intelligence. 9(5). 427–439.1 indexed citations
19.
Diks, Krzysztof, Torben Hagerup, & Wojciech Rytter. (1989). Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract). 207–217.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.