Ola Svensson

2.3k citations
69 papers · 789 indexed · h-index 16

Ola Svensson

64 papers receiving 741 citations

Peers

Ola Svensson
Comparison fields: 5 of 61
  • Industrial and Manufacturing Engineering 278
  • Computational Theory and Mathematics 315
  • Computer Networks and Communications 377
  • Computer Graphics and Computer-Aided Design 48
  • Organizational Behavior and Human Resource Management 116
Replace Viswanath Nagarajan with:
Viswanath Nagarajan United States
Jochen Könemann Canada
Kazuhisa Makino Japan
Fabrizio Grandoni Switzerland
Vinayaka Pandit India
Harald Räcke United States
Y. Bartal Israel
Stavros G. Kolliopoulos Canada
Michele Conforti Italy
Vangélis Th. Paschos France
Ola Svensson relative to Viswanath Nagarajan United States Viswanath Nagarajan's profile →
Citations per field
00.5×1.5×2.1×
Viswanath Nagarajan · 1×
Citations per year

Countries citing papers authored by Ola Svensson

Since Specialization
Citations

This map shows the geographic impact of Ola Svensson'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 Ola Svensson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ola Svensson more than expected).

Fields of papers citing papers by Ola Svensson

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ola Svensson. 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 Ola Svensson. The network helps show where Ola Svensson may publish in the future.

Co-authorship network

The 25 scholars most cited alongside Ola Svensson, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Ola Svensson Line = papers co-authored together Ola Svensson links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown
#Work
1 20250
2 20220
3
Parallel and Efficient Hierarchical k-Median Clustering
20211
4
The Primal-Dual method for Learning Augmented Algorithms
20203
5
Learning Augmented Energy Minimization via Speed Scaling
20201
6
20180
7 20186
8 20173
9 20171
10 20173
11
Linear Relaxations for Finding Diverse Elements in Metric Spaces
20168
12 201613
13 20151
14
A Simple Order-Oblivious O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem
20140
15
20137
16 201324
17
Faster approximation algorithms for scheduling with fixed jobs
20111
18 201110
19
Precedence Constraint Scheduling and Connections to Dimension Theory of Partial Orders
20081
20 2007122

About Ola Svensson

Ola Svensson is a scholar working on Industrial and Manufacturing Engineering, Computational Theory and Mathematics and Computer Networks and Communications, having authored 69 papers that have together received 789 indexed citations. Recurring topics across this work include Optimization and Search Problems (37 papers), Complexity and Algorithms in Graphs (31 papers), Scheduling and Optimization Algorithms (17 papers), Advanced Graph Theory Research (17 papers), Optimization and Packing Problems (8 papers), Vehicle Routing Optimization Methods (7 papers), Cryptography and Data Security (6 papers) and Facility Location and Emergency Management (6 papers). The work is most often cited by research in Industrial and Manufacturing Engineering (278 citations), Computational Theory and Mathematics (315 citations) and Computer Networks and Communications (377 citations). Ola Svensson has collaborated with scholars based in Switzerland, United States and France. Frequent co-authors include Christoph Ambühl, Monaldo Mastrolilli, Shi Li, Mohit Singh, Rico Zenklusen, Moran Feldman, Tobias Mömke, Nelson A. Uhan, Andreas S. Schulz and Maurice Queyranne. Their work appears in journals such as IEEE Transactions on Smart Grid, Journal of the ACM and Mathematical Programming.

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

Rankless by CCL
2026