Adam Kasperski

1.4k total citations
53 papers, 727 citations indexed

About

Adam Kasperski is a scholar working on Management Science and Operations Research, Control and Systems Engineering and Industrial and Manufacturing Engineering. According to data from OpenAlex, Adam Kasperski has authored 53 papers receiving a total of 727 indexed citations (citations by other indexed papers that have themselves been cited), including 42 papers in Management Science and Operations Research, 21 papers in Control and Systems Engineering and 19 papers in Industrial and Manufacturing Engineering. Recurrent topics in Adam Kasperski's work include Multi-Criteria Decision Making (30 papers), Risk and Portfolio Optimization (27 papers) and Optimization and Mathematical Programming (21 papers). Adam Kasperski is often cited by papers focused on Multi-Criteria Decision Making (30 papers), Risk and Portfolio Optimization (27 papers) and Optimization and Mathematical Programming (21 papers). Adam Kasperski collaborates with scholars based in Poland, France and Germany. Adam Kasperski's co-authors include Paweł Zieliński, Stefan Chanas, Marc Goerigk, Adam Janiak and Jérôme Fortin and has published in prestigious journals such as European Journal of Operational Research, IEEE Transactions on Fuzzy Systems and Fuzzy Sets and Systems.

In The Last Decade

Adam Kasperski

50 papers receiving 701 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Adam Kasperski Poland 15 376 372 219 126 107 53 727
Hassène Aissi France 8 267 0.7× 192 0.5× 137 0.6× 110 0.9× 39 0.4× 14 512
Eduardo Conde Spain 15 261 0.7× 183 0.5× 130 0.6× 71 0.6× 51 0.5× 38 608
Si̇mge Küçükyavuz United States 17 409 1.1× 228 0.6× 300 1.4× 52 0.4× 75 0.7× 42 862
Kenichi Ida Japan 15 244 0.6× 250 0.7× 306 1.4× 39 0.3× 159 1.5× 51 705
S. Mehdi Hashemi Iran 16 235 0.6× 87 0.2× 316 1.4× 47 0.4× 151 1.4× 55 649
Grani A. Hanasusanto United States 12 505 1.3× 79 0.2× 301 1.4× 26 0.2× 128 1.2× 26 814
Linzhong Liu China 12 132 0.4× 111 0.3× 213 1.0× 30 0.2× 94 0.9× 43 572
Majid Aminnayeri Iran 15 98 0.3× 434 1.2× 105 0.5× 51 0.4× 60 0.6× 41 690
Genji Yamazaki Japan 15 252 0.7× 320 0.9× 64 0.3× 132 1.0× 52 0.5× 61 739
K Darby-Dowman United Kingdom 12 195 0.5× 128 0.3× 74 0.3× 67 0.5× 26 0.2× 31 478

Countries citing papers authored by Adam Kasperski

Since Specialization
Citations

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

Fields of papers citing papers by Adam Kasperski

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Adam Kasperski

This figure shows the co-authorship network connecting the top 25 collaborators of Adam Kasperski. A scholar is included among the top collaborators of Adam Kasperski 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 Adam Kasperski. Adam Kasperski is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Kasperski, Adam, et al.. (2025). Computational complexity of the recoverable robust shortest path problem with discrete recourse. Discrete Applied Mathematics. 370. 103–110. 1 indexed citations
2.
Kasperski, Adam & Paweł Zieliński. (2024). Approximating the shortest path problem with scenarios. Theoretical Computer Science. 1025. 114972–114972.
3.
Goerigk, Marc, et al.. (2024). Robust min-max (regret) optimization using ordered weighted averaging. European Journal of Operational Research. 322(1). 171–181. 2 indexed citations
4.
Kasperski, Adam, et al.. (2024). A framework of distributionally robust possibilistic optimization. Fuzzy Optimization and Decision Making. 23(2). 253–278. 3 indexed citations
5.
Kasperski, Adam, et al.. (2021). Robust Possibilistic Optimization with Copula Function. SPIRE - Sciences Po Institutional REpository. 36. 1–6. 1 indexed citations
6.
Goerigk, Marc, et al.. (2017). On recoverable and two-stage robust selection problems with budgeted uncertainty. European Journal of Operational Research. 265(2). 423–436. 14 indexed citations
7.
Kasperski, Adam & Paweł Zieliński. (2016). A robust approach to a class of uncertain optimization problems with imprecise probabilities. 228. 1606–1613. 1 indexed citations
8.
Kasperski, Adam & Paweł Zieliński. (2015). Using the WOWA operator in robust discrete optimization problems. International Journal of Approximate Reasoning. 68. 54–67. 7 indexed citations
9.
Kasperski, Adam & Paweł Zieliński. (2014). Combinatorial optimization problems with uncertain costs and the OWA criterion. Theoretical Computer Science. 565. 102–112. 13 indexed citations
10.
Kasperski, Adam, et al.. (2014). Approximability of the robust representatives selection problem. Operations Research Letters. 43(1). 16–19. 5 indexed citations
11.
Kasperski, Adam, et al.. (2012). A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data. Journal of Heuristics. 18(4). 593–625. 14 indexed citations
12.
Kasperski, Adam & Paweł Zieliński. (2011). Possibilistic bottleneck combinatorial optimization problems with ill-known weights. International Journal of Approximate Reasoning. 52(9). 1298–1311. 1 indexed citations
13.
Kasperski, Adam & Paweł Zieliński. (2010). On the approximability of robust spanning tree problems. Theoretical Computer Science. 412(4-5). 365–374. 14 indexed citations
14.
Kasperski, Adam, et al.. (2008). On Possibilistic Combinatorial Optimization Problems. 29. 324–329. 2 indexed citations
15.
Kasperski, Adam. (2007). SOME GENERAL PROPERTIES OF A FUZZY SINGLE MACHINE SCHEDULING PROBLEM. International Journal of Uncertainty Fuzziness and Knowledge-Based Systems. 15(1). 43–56. 4 indexed citations
16.
Kasperski, Adam & Paweł Zieliński. (2006). On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data. Operations Research Letters. 35(4). 525–532. 14 indexed citations
17.
Kasperski, Adam & Paweł Zieliński. (2005). The robust shortest path problem in series–parallel multidigraphs with interval data. Operations Research Letters. 34(1). 69–76. 32 indexed citations
18.
Chanas, Stefan & Adam Kasperski. (2005). Sensitivity analysis in the single‐machine scheduling problem with max–min criterion. International Transactions in Operational Research. 12(3). 287–298.
19.
Chanas, Stefan & Adam Kasperski. (2003). On two single machine scheduling problems with fuzzy processing times and fuzzy due dates. European Journal of Operational Research. 147(2). 281–296. 41 indexed citations
20.
Chanas, Stefan & Adam Kasperski. (2003). Possible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters. Fuzzy Sets and Systems. 142(3). 359–371. 17 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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Hassène Aissi Breakdown of academic impact, for papers by Eduardo Conde Breakdown of academic impact, for papers by Si̇mge Küçükyavuz Breakdown of academic impact, for papers by Kenichi Ida Breakdown of academic impact, for papers by S. Mehdi Hashemi Breakdown of academic impact, for papers by Grani A. Hanasusanto Breakdown of academic impact, for papers by Linzhong Liu Breakdown of academic impact, for papers by Majid Aminnayeri Breakdown of academic impact, for papers by Genji Yamazaki Breakdown of academic impact, for papers by K Darby-Dowman
Rankless by CCL
2026