Eranda Çela

1.5k total citations
29 papers, 455 citations indexed

About

Eranda Çela is a scholar working on Computational Theory and Mathematics, Industrial and Manufacturing Engineering and Electrical and Electronic Engineering. According to data from OpenAlex, Eranda Çela has authored 29 papers receiving a total of 455 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computational Theory and Mathematics, 14 papers in Industrial and Manufacturing Engineering and 8 papers in Electrical and Electronic Engineering. Recurrent topics in Eranda Çela's work include Advanced Graph Theory Research (11 papers), Vehicle Routing Optimization Methods (9 papers) and Optimization and Packing Problems (8 papers). Eranda Çela is often cited by papers focused on Advanced Graph Theory Research (11 papers), Vehicle Routing Optimization Methods (9 papers) and Optimization and Packing Problems (8 papers). Eranda Çela collaborates with scholars based in Austria, United Kingdom and Germany. Eranda Çela's co-authors include Rainer E. Burkard, Gerhard J. Woeginger, Vladimir G. Deı̌neko, Bettina Klinz, Günter Rote, Cameron Walker, Stefan E. Karisch, Michael O’Sullivan, Jens Clausen and Shmuel Wimer and has published in prestigious journals such as European Journal of Operational Research, Journal of Banking & Finance and Mathematical Programming.

In The Last Decade

Eranda Çela

25 papers receiving 428 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Eranda Çela Austria 11 252 121 109 79 66 29 455
Gintaras Palubeckis Lithuania 14 384 1.5× 127 1.0× 91 0.8× 179 2.3× 39 0.6× 38 589
Bettina Klinz Austria 11 146 0.6× 177 1.5× 130 1.2× 42 0.5× 59 0.9× 33 516
Alain Sutter France 11 177 0.7× 101 0.8× 116 1.1× 71 0.9× 63 1.0× 13 360
Vladimir G. Deı̌neko United Kingdom 11 256 1.0× 104 0.9× 103 0.9× 55 0.7× 50 0.8× 45 463
C.W. Duin Netherlands 13 293 1.2× 175 1.4× 100 0.9× 66 0.8× 120 1.8× 22 509
Abílio Lucena Brazil 14 370 1.5× 167 1.4× 187 1.7× 66 0.8× 77 1.2× 37 570
Philippe Mahey France 12 181 0.7× 145 1.2× 126 1.2× 27 0.3× 94 1.4× 41 484
Kenji Onaga Japan 11 107 0.4× 199 1.6× 121 1.1× 62 0.8× 66 1.0× 67 395
Matthew J. Saltzman United States 12 222 0.9× 170 1.4× 104 1.0× 63 0.8× 47 0.7× 17 519
Mirjana Čangalović Serbia 14 154 0.6× 345 2.9× 44 0.4× 139 1.8× 113 1.7× 33 618

Countries citing papers authored by Eranda Çela

Since Specialization
Citations

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

Fields of papers citing papers by Eranda Çela

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Eranda Çela

This figure shows the co-authorship network connecting the top 25 collaborators of Eranda Çela. A scholar is included among the top collaborators of Eranda Çela 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 Eranda Çela. Eranda Çela 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.
2.
Çela, Eranda, Vladimir G. Deı̌neko, & Gerhard J. Woeginger. (2024). Travelling salesman paths on Demidenko matrices \n. Warwick Research Archive Portal (University of Warwick).
3.
Çela, Eranda, et al.. (2024). A linear time algorithm for linearizing quadratic and higher-order shortest path problems. Mathematical Programming. 210(1-2). 165–188.
4.
Çela, Eranda, Vladimir G. Deı̌neko, & Gerhard J. Woeginger. (2023). Recognising permuted Demidenko matrices. Operations Research Letters. 51(5). 494–500.
5.
Çela, Eranda, et al.. (2022). Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid. Journal of Graph Algorithms and Applications. 26(4). 519–552. 1 indexed citations
6.
O’Sullivan, Michael, et al.. (2021). A machine learning-based branch and price algorithm for a sampled vehicle routing problem. OR Spectrum. 43(3). 693–732. 28 indexed citations
7.
Çela, Eranda, Vladimir G. Deı̌neko, & Gerhard J. Woeginger. (2017). The multi-stripe travelling salesman problem. Annals of Operations Research. 259(1-2). 21–34. 6 indexed citations
8.
Çela, Eranda, Vladimir G. Deı̌neko, & Gerhard J. Woeginger. (2017). New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices. European Journal of Operational Research. 267(3). 818–834. 5 indexed citations
9.
Martin, Michael, Arno Eichberger, & Eranda Çela. (2016). Optimization Approach to Handle Global CO2 Fleet Emission Standards. SAE technical papers on CD-ROM/SAE technical paper series. 1. 1 indexed citations
10.
Çela, Eranda, Vladimir G. Deı̌neko, & Gerhard J. Woeginger. (2015). Well-solvable cases of the QAP with block-structured matrices. Discrete Applied Mathematics. 186. 56–65. 8 indexed citations
11.
Çela, Eranda, Vladimir G. Deı̌neko, & Gerhard J. Woeginger. (2012). The x-and-y-axes travelling salesman problem. European Journal of Operational Research. 223(2). 333–345. 5 indexed citations
12.
Çela, Eranda, Vladimir G. Deı̌neko, & Gerhard J. Woeginger. (2012). Another well-solvable case of the QAP: Maximizing the job completion time variance. Operations Research Letters. 40(5). 356–359. 10 indexed citations
13.
Çela, Eranda, et al.. (2011). The Wiener maximum quadratic assignment problem. Discrete Optimization. 8(3). 411–416. 25 indexed citations
14.
Albrecher, Hansjörg, Rainer E. Burkard, & Eranda Çela. (2005). An asymptotical study of combinatorial optimization problems by means of statistical mechanics. Journal of Computational and Applied Mathematics. 186(1). 148–162. 2 indexed citations
15.
Burkard, Rainer E., et al.. (2000). 2-Medians in trees with pos/neg weights. Discrete Applied Mathematics. 105(1-3). 51–71. 24 indexed citations
16.
Burkard, Rainer E., et al.. (1998). A unified approach to simple special cases of extremal permutation problems. Optimization. 44(2). 123–138. 4 indexed citations
17.
Burkard, Rainer E., et al.. (1997). Hamiltonian cycles in circulant digraphs with two stripes. Discrete Mathematics. 176(1-3). 233–254. 14 indexed citations
18.
Burkard, Rainer E. & Eranda Çela. (1995). Heuristics for biquadratic assignment problems and their computational comparison. European Journal of Operational Research. 83(2). 283–300. 18 indexed citations
19.
Burkard, Rainer E., Eranda Çela, & Gerhard J. Woeginger. (1995). A minimax assignment problem in treelike communication networks. European Journal of Operational Research. 87(3). 670–684. 2 indexed citations
20.
Burkard, Rainer E., Eranda Çela, & Bettina Klinz. (1994). On the biquadratic assignment problem. 117–146. 20 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

Rankless by CCL
2026