Can Akkan
- Industrial and Manufacturing Engineering top 2%
- Management Science and Operations Research top 5%
- Computer Networks and Communications top 10%
- Building and Construction top 10%
- Management Information Systems top 10%
- Co-authors
- F. Tevhide AltekinAndreas DrexlAlf KimmsSelçuk KarabatıFüsun ÜlenginMelis Almula KaradayıElif KaraosmanoğluNimet Uray
- Topics
- Scheduling and Optimization Algorithms (9 papers)Scheduling and Timetabling Solutions (7 papers)Constraint Satisfaction and Optimization (6 papers)
- Cited by
- Industrial and Manufacturing EngineeringManagement Science and Operations ResearchManagement Information Systems
In The Last Decade
Can Akkan
22 papers receiving 448 citations
Peers
Comparison fields: 5 of 66
- Industrial and Manufacturing Engineering 288
- Management Science and Operations Research 187
- Computer Networks and Communications 69
- Building and Construction 56
- Management Information Systems 45
Countries citing papers authored by Can Akkan
This map shows the geographic impact of Can Akkan'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 Can Akkan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Can Akkan more than expected).
Fields of papers citing papers by Can Akkan
This network shows the impact of papers produced by Can Akkan. 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 Can Akkan. The network helps show where Can Akkan may publish in the future.
Co-authorship network of co-authors of Can Akkan
This figure shows the co-authorship network connecting the top 25 collaborators of Can Akkan. A scholar is included among the top collaborators of Can Akkan 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 Can Akkan. Can Akkan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 7 | |
| 3 | 6 | |
| 4 | 1 | |
| 5 | 21 | |
| 6 | 28 | |
| 7 | İSTANBUL İÇİN ACİL SERVİS BİRİMLERİNİN ETKİNLİĞİNİN KATEGORİK VERİ ZARFLAMA ANALİZİ İLE DEĞERLENDİRİLMESİ | 2 |
| 8 | 62 | |
| 9 | 2 | |
| 10 | 9 | |
| 11 | 10 | |
| 12 | 17 | |
| 13 | 113 | |
| 14 | 78 | |
| 15 | 3 | |
| 16 | 39 | |
| 17 | 34 | |
| 18 | 1 | |
| 19 | 19 | |
| 20 | Chip assignment algorithms for dynamic wafer design in semiconductor manufacturing | 1 |
About Can Akkan
Can Akkan is a scholar working on Industrial and Manufacturing Engineering, Management Science and Operations Research and Computer Networks and Communications, having authored 22 papers that have together received 467 indexed citations. Recurring topics across this work include Scheduling and Optimization Algorithms (9 papers), Scheduling and Timetabling Solutions (7 papers) and Constraint Satisfaction and Optimization (6 papers). The work is most often cited by research in Industrial and Manufacturing Engineering (288 citations), Management Science and Operations Research (187 citations) and Management Information Systems (45 citations). Can Akkan has collaborated with scholars based in Türkiye and Germany. Frequent co-authors include F. Tevhide Altekin, Andreas Drexl, Alf Kimms, Selçuk Karabatı, Füsun Ülengin, Melis Almula Karadayı, Elif Karaosmanoğlu, Nimet Uray and David C. Heath. Their work appears in journals such as European Journal of Operational Research, IEEE Access and Journal of the Operational Research Society.
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.