Citations per year, relative to Sergei Vorobyov Sergei Vorobyov (= 1×)
peers
Henrik Björklund
Countries citing papers authored by Sergei Vorobyov
Since
Specialization
Citations
This map shows the geographic impact of Sergei Vorobyov'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 Sergei Vorobyov with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sergei Vorobyov more than expected).
This network shows the impact of papers produced by Sergei Vorobyov. 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 Sergei Vorobyov. The network helps show where Sergei Vorobyov may publish in the future.
Co-authorship network of co-authors of Sergei Vorobyov
This figure shows the co-authorship network connecting the top 25 collaborators of Sergei Vorobyov.
A scholar is included among the top collaborators of Sergei Vorobyov 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 Sergei Vorobyov. Sergei Vorobyov is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Andersson, Daniel & Sergei Vorobyov. (2006). Fast Algorithms for Monotonic Discounted Linear Programs with Two Variables per Inequality. La Revue du praticien. 46(17). 2056–61.7 indexed citations
Björklund, Henrik, Sven Sandberg, & Sergei Vorobyov. (2004). Randomized Subexponential Algorithms for Infinite Games. KTH Publication Database DiVA (KTH Royal Institute of Technology).5 indexed citations
8.
Björklund, Henrik, Olle Nilsson, Ola Svensson, & Sergei Vorobyov. (2004). The Controlled Linear Programming Problem.2 indexed citations
Björklund, Henrik, Sven Sandberg, & Sergei Vorobyov. (2003). On Combinatorial Structure and Algorithms for Parity Games. KTH Publication Database DiVA (KTH Royal Institute of Technology).8 indexed citations
Björklund, Henrik, Sven Sandberg, & Sergei Vorobyov. (2002). An Experimental Study of Algorithms for Completely Unimodal Optimization. KTH Publication Database DiVA (KTH Royal Institute of Technology).2 indexed citations
13.
Björklund, Henrik & Sergei Vorobyov. (2002). Two Adversary Lower Bounds for Parity Games. KTH Publication Database DiVA (KTH Royal Institute of Technology).
14.
Vorobyov, Sergei, et al.. (2001). A randomized subexponential algorithm for parity games. KTH Publication Database DiVA (KTH Royal Institute of Technology). 8(3). 324–345.14 indexed citations
15.
Vorobyov, Sergei, et al.. (2001). Is Randomized Gurvich-Karzanov-Khachiyan's Algorithm for Parity Games Polynomial?. KTH Publication Database DiVA (KTH Royal Institute of Technology).6 indexed citations
16.
Vorobyov, Sergei. (1998). forall exists*-Equational Theory of Context Unification is Pi10-Hard. 597–606.2 indexed citations
17.
Vorobyov, Sergei. (1998). AE-Equational theory of context unification is Co-RE-Hard. Max Planck Digital Library.
Vorobyov, Sergei. (1996). On the decision complexity of the bounded theories of trees. MPG.PuRe (Max Planck Society).
20.
Vorobyov, Sergei. (1994). Hierarchies of decidable extensions of bounded quantification. HAL (Le Centre pour la Communication Scientifique Directe).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.