Citations per year, relative to Sven Sandberg Sven Sandberg (= 1×)
peers
Yoad Lustig
Countries citing papers authored by Sven Sandberg
Since
Specialization
Citations
This map shows the geographic impact of Sven Sandberg'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 Sven Sandberg with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sven Sandberg more than expected).
This network shows the impact of papers produced by Sven Sandberg. 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 Sven Sandberg. The network helps show where Sven Sandberg may publish in the future.
Co-authorship network of co-authors of Sven Sandberg
This figure shows the co-authorship network connecting the top 25 collaborators of Sven Sandberg.
A scholar is included among the top collaborators of Sven Sandberg 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 Sven Sandberg. Sven Sandberg is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
8 of 8 papers shown
1.
Abdulla, Parosh Aziz, Noomene Ben Henda, Richard Mayr, & Sven Sandberg. (2006). Eager Markov Chains. KTH Publication Database DiVA (KTH Royal Institute of Technology).
2.
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
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
5.
Björklund, Henrik & Sven Sandberg. (2003). Algorithms for Combinatorial Optimization and Games Adapted from Linear Programming. KTH Publication Database DiVA (KTH Royal Institute of Technology). 13–24.1 indexed citations
6.
Björklund, Henrik, Sven Sandberg, & Sergei Vorobyov. (2003). On Fixed-Parameter Complexity of Infinite Games. KTH Publication Database DiVA (KTH Royal Institute of Technology).4 indexed citations
7.
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
8.
Björklund, Henrik, Sergei Vorobyov, & Sven Sandberg. (2002). Optimization on Completely Unimodal Hypercubes. KTH Publication Database DiVA (KTH Royal Institute of Technology).6 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.