default search action
Mehmet Fatih Tasgetiren
Person information
- affiliation: Yasar University, Izmir, Turkey
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j43]Yuyan Han, Yuting Wang
, Quan-ke Pan, Ling Wang
Accelerated evaluation of blocking flowshop scheduling with total flow time criteria using a generalized critical machine-based approach. Eur. J. Oper. Res. 318(2): 424-441 (2024) - [j42]Ayca Kirimtat
A multi-objective optimization framework for functional arrangement in smart floating cities. Expert Syst. Appl. 237(Part B): 121476 (2024) - [j41]Damla Yüksel
Q-learning guided algorithms for bi-criteria minimization of total flow time and makespan in no-wait permutation flowshops. Swarm Evol. Comput. 89: 101617 (2024) - 2023
- [j40]Yuhang Wang
Intelligent optimization under the makespan constraint: Rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem. Eur. J. Oper. Res. 311(3): 816-832 (2023) - 2022
- [j39]Korhan Karabulut, Damla Kizilay, Mehmet Fatih Tasgetiren
An evolution strategy approach for the distributed blocking flowshop scheduling problem. Comput. Ind. Eng. 163: 107832 (2022) - [j38]Hande Öztop, Mehmet Fatih Tasgetiren
Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion. Comput. Oper. Res. 138: 105616 (2022) - [j37]Korhan Karabulut, Hande Öztop, Damla Kizilay, Mehmet Fatih Tasgetiren
An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times. Comput. Oper. Res. 142: 105733 (2022) - 2021
- [j36]Wen-Qiang Zou
An effective iterated greedy algorithm for solving a multi-compartment AGV scheduling problem in a matrix manufacturing workshop. Appl. Soft Comput. 99: 106945 (2021) - [j35]Yuanzhen Li
A green scheduling algorithm for the distributed flowshop problem. Appl. Soft Comput. 109: 107526 (2021) - [j34]Korhan Karabulut, Hande Öztop, Levent Kandiller, Mehmet Fatih Tasgetiren
Modeling and optimization of multiple traveling salesmen problems: An evolution strategy approach. Comput. Oper. Res. 129: 105192 (2021) - [j33]Yingli Li, Xinyu Li, Liang Gao
A discrete artificial bee colony algorithm for distributed hybrid flowshop scheduling problem with sequence-dependent setup times. Int. J. Prod. Res. 59(13): 3880-3899 (2021) - [j32]Yuanzhen Li
An Adaptive Iterated Greedy algorithm for distributed mixed no-idle permutation flowshop scheduling problems. Swarm Evol. Comput. 63: 100874 (2021) - 2020
- [j31]Wen-Qiang Zou
An Effective Discrete Artificial Bee Colony Algorithm for Scheduling an Automatic-Guided-Vehicle in a Linear Manufacturing Workshop. IEEE Access 8: 35063-35076 (2020) - [j30]Ayca Kirimtat
Future Trends and Current State of Smart City Concepts: A Survey. IEEE Access 8: 86448-86467 (2020) - [j29]Korhan Karabulut, Mehmet Fatih Tasgetiren
An evolution strategy approach to the team orienteering problem with time windows. Comput. Ind. Eng. 139: 106109 (2020) - [j28]Damla Yüksel
An energy-efficient bi-objective no-wait permutation flowshop scheduling problem to minimize total tardiness and total energy consumption. Comput. Ind. Eng. 145: 106431 (2020) - [j27]Hande Öztop, Mehmet Fatih Tasgetiren
An energy-efficient permutation flowshop scheduling problem. Expert Syst. Appl. 150: 113279 (2020) - [j26]Cemre Cubukcuoglu
A discrete event simulation procedure for validating programs of requirements: The case of hospital space planning. SoftwareX 12: 100539 (2020) - [j25]Hande Öztop, Mehmet Fatih Tasgetiren
Ensemble of metaheuristics for energy-efficient hybrid flowshops: Makespan versus total energy consumption. Swarm Evol. Comput. 54: 100660 (2020) - [j24]Guangchen Wang, Liang Gao
Energy-efficient distributed permutation flow shop scheduling problem using a multi-objective whale swarm algorithm. Swarm Evol. Comput. 57: 100716 (2020) - [c68]Ahmad Abdulla Al-Buenain, Damla Kizilay, Ozge Buyukdagli
A Novel Differential Evolution Algorithm with Q-Learning for Economical and Statistical Design of X-Bar Control Charts. CEC 2020: 1-8 - [c67]Damla Kizilay, Mehmet Fatih Tasgetiren
A Differential Evolution Algorithm with Q-Learning for Solving Engineering Design Problems. CEC 2020: 1-8 - [c66]Hande Öztop, Mehmet Fatih Tasgetiren
A Novel General Variable Neighborhood Search through Q-Learning for No-Idle Flowshop Scheduling. CEC 2020: 1-8 - [c65]Damla Yüksel
Metaheuristics for Energy-Efficient No-Wait Flowshops: A Trade-off Between Makespan and Total Energy Consumption. CEC 2020: 1-8 - [c64]Ayca Kirimtat
Evolutionary Computation for the Development of Smart Floating Cities. ICIT 2020: 822-828
2010 – 2019
- 2019
- [j23]Damla Kizilay
A Variable Block Insertion Heuristic for Solving Permutation Flow Shop Scheduling Problem with Makespan Criterion. Algorithms 12(5): 100 (2019) - [j22]Cemre Cubukcuoglu
OPTIMUS: Self-Adaptive Differential Evolution with Ensemble of Mutation Strategies for Grasshopper Algorithmic Modeling. Algorithms 12(7): 141 (2019) - [j21]Hande Öztop, Mehmet Fatih Tasgetiren
Metaheuristic algorithms for the hybrid flowshop scheduling problem. Comput. Oper. Res. 111: 177-196 (2019) - [c63]Jiaxin Fan, Damla Kizilay, Hande Öztop, Mehmet Fatih Tasgetiren
A Variable Block Insertion Heuristic for Single Machine with Release Dates and Sequence Dependent Setup Times for Makespan Minimization. SSCI 2019: 1676-1683 - [c62]Liangshan Shen, Mehmet Fatih Tasgetiren
A General Variable Neighborhood Search for the NoIdle Flowshop Scheduling Problem with Makespan Criterion. SSCI 2019: 1684-1691 - [c61]Sihan Wang, Jia Kang, Mehmet Fatih Tasgetiren
Differential Evolution Through Variable Neighborhood Search for Constrained Real-Parameter Optimization Problems. SSCI 2019: 2252-2260 - [p3]Cemre Cubukcuoglu, Ayca Kirimtat, Berk Ekici
Evolutionary Computation for Theatre Hall Acoustics. Optimization in Industry 2019: 55-83 - [p2]Esra Cevizci, Seckin Kutucu, Mauricio Morales-Beltran, Berk Ekici
Structural Optimization for Masonry Shell Design Using Multi-objective Evolutionary Algorithms. Optimization in Industry 2019: 85-119 - [p1]Ayca Kirimtat, Berk Ekici
Evolutionary Algorithms for Designing Self-sufficient Floating Neighborhoods. Optimization in Industry 2019: 121-147 - 2018
- [c60]Mehmet Fatih Tasgetiren
An energy-efficient single machine scheduling with release dates and sequence-dependent setup times. GECCO (Companion) 2018: 145-146 - [c59]Hande Öztop, Mehmet Fatih Tasgetiren
Iterated greedy algorithms for the hybrid flowshop scheduling with total flow time minimization. GECCO 2018: 379-385 - [c58]Mehmet Fatih Tasgetiren
Energy-Efficient Single Machine Total Weighted Tardiness Problem with Sequence-Dependent Setup Times. ICIC (1) 2018: 746-758 - [c57]Hande Öztop, Mehmet Fatih Tasgetiren
Green Permutation Flowshop Scheduling: A Trade- off- Between Energy Consumption and Total Flow Time. ICIC (3) 2018: 753-759 - 2017
- [j20]Mehmet Fatih Tasgetiren
Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion. Comput. Oper. Res. 77: 111-126 (2017) - [c56]Mehmet Fatih Tasgetiren
A variable block insertion heuristic for permutation flowshops with makespan criterion. CEC 2017: 726-733 - [c55]Ozgur Kabadurmus
Design of multi-product multi-period two-echelon supply chain network to minimize bullwhip effect through differential evolution. CEC 2017: 789-796 - [c54]Mehmet Fatih Tasgetiren
Variable block insertion heuristic for the quadratic assignment problem. CEC 2017: 1765-1770 - 2016
- [j19]Cemre Cubukcuoglu
A Multi-Objective Harmony Search Algorithm for Sustainable Design of Floating Settlements. Algorithms 9(3): 51 (2016) - [j18]Mehmet Fatih Tasgetiren
A Variable Block Insertion Heuristic for the Blocking Flowshop Scheduling Problem with Total Flowtime Criterion. Algorithms 9(4): 71 (2016) - [j17]Kai-Zhou Gao
Artificial bee colony algorithm for scheduling and rescheduling fuzzy flexible job shop problem with new job insertion. Knowl. Based Syst. 109: 1-16 (2016) - [c53]Berk Ekici
A multi-objective self-adaptive differential evolution algorithm for conceptual high-rise building design. CEC 2016: 2272-2279 - [c52]Cemre Cubukcuoglu
Multi-objective harmony search algorithm for layout design in theatre hall acoustics. CEC 2016: 2280-2287 - [c51]Cemre Cubukcuoglu
Multi-objective optimization through differential evolution for restaurant design. CEC 2016: 2288-2295 - [c50]Mert Paldrak, Mehmet Fatih Tasgetiren
An ensemble of differential evolution algorithms with variable neighborhood search for constrained function optimization. CEC 2016: 2610-2617 - [c49]Mehmet Fatih Tasgetiren
A memetic algorithm with a variable block insertion heuristic for single machine total weighted tardiness problem with sequence dependent setup times. CEC 2016: 2911-2918 - [c48]Yavuz Ince, Korhan Karabulut, Mehmet Fatih Tasgetiren
A discrete artificial bee colony algorithm for the permutation flowshop scheduling problem with sequence-dependent setup times. CEC 2016: 3401-3408 - 2015
- [j16]Kai-Zhou Gao
Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion. Comput. Ind. Eng. 90: 107-117 (2015) - [c47]Berk Ekici
Addressing the high-rise form finding problem by evolutionary computation. CEC 2015: 2253-2260 - [c46]Cemre Ugurlu, Ioannis Chatzikonstantinou
Evolutionary computation for architectural design of restaurant layouts. CEC 2015: 2279-2286 - [c45]Cemre Ugurlu, Ioannis Chatzikonstantinou
Identification of sustainable designs for floating settlements using computational design techniques. CEC 2015: 2303-2310 - [c44]Mehmet Fatih Tasgetiren
A populated local search with differential evolution for blocking flowshop scheduling problem. CEC 2015: 2789-2796 - [c43]Mehmet Fatih Tasgetiren
A differential evolution algorithm with variable neighborhood search for multidimensional knapsack problem. CEC 2015: 2797-2804 - 2014
- [j15]Korhan Karabulut, Mehmet Fatih Tasgetiren
A variable iterated greedy algorithm for the traveling salesman problem with time windows. Inf. Sci. 279: 383-395 (2014) - [c42]Önder Bulut
A discrete artificial bee colony algorithm for the Economic Lot Scheduling problem with returns. IEEE Congress on Evolutionary Computation 2014: 551-557 - [c41]Damla Kizilay
A discrete artificial bee colony algorithm for the assignment and parallel machine scheduling problem in DYO paint company. IEEE Congress on Evolutionary Computation 2014: 653-660 - [c40]Damla Kizilay
An iterated greedy algorithm for the hybrid flowshop problem with makespan criterion. CIPLS 2014: 16-23 - 2013
- [j14]Mehmet Fatih Tasgetiren
A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem. Comput. Oper. Res. 40(7): 1729-1743 (2013) - [c39]Korhan Karabulut, Mehmet Fatih Tasgetiren
A discrete artificial bee colony algorithm for the team orienteering problem with time windows. CIPLS 2013: 99-106 - [c38]Mehmet Fatih Tasgetiren
Metaheuristic algorithms for the quadratic assignment problem. CIPLS 2013: 131-137 - [c37]Kun Mao, Quan-Ke Pan
Lagrangian heuristic for scheduling a steelmaking-continuous casting process. CISched 2013: 68-74 - [c36]Mustafa Seçmen
Null control in linear antenna arrays with ensemble differential evolution. SDE 2013: 92-98 - [c35]Mehmet Fatih Tasgetiren
A Populated Iterated Greedy Algorithm with Inver-Over Operator for Traveling Salesman Problem. SEMCCO (1) 2013: 1-12 - [c34]Mehmet Fatih Tasgetiren
A General Variable Neighborhood Search Algorithm for the No-Idle Permutation Flowshop Scheduling Problem. SEMCCO (1) 2013: 24-34 - 2012
- [c33]Korhan Karabulut, Mehmet Fatih Tasgetiren
A discrete artificial bee colony algorithm for the traveling salesman problem with time windows. IEEE Congress on Evolutionary Computation 2012: 1-7 - [c32]Mehmet Fatih Tasgetiren
A discrete harmony search algorithm for the economic lot scheduling problem with power of two policy. IEEE Congress on Evolutionary Computation 2012: 1-8 - [c31]Mehmet Fatih Tasgetiren
A Variable Iterated Greedy Algorithm with Differential Evolution for Solving No-Idle Flowshops. ICAISC (SIDE-EC) 2012: 128-135 - [c30]Junqing Li, Quan-Ke Pan
Solving Fuzzy Job-Shop Scheduling Problem by a Hybrid PSO Algorithm. ICAISC (SIDE-EC) 2012: 275-282 - 2011
- [j13]Rammohan Mallipeddi, Ponnuthurai N. Suganthan
Differential evolution algorithm with ensemble of parameters and mutation strategies. Appl. Soft Comput. 11(2): 1679-1696 (2011) - [j12]Ling Wang, Quan-Ke Pan
A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem. Comput. Ind. Eng. 61(1): 76-83 (2011) - [j11]Quan-Ke Pan
A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem. Expert Syst. Appl. 38(4): 3252-3259 (2011) - [j10]Shi-Zheng Zhao, Ponnuthurai N. Suganthan
Dynamic multi-swarm particle swarm optimizer with harmony search. Expert Syst. Appl. 38(4): 3735-3742 (2011) - [j9]Quan-Ke Pan
A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inf. Sci. 181(12): 2455-2468 (2011) - [j8]Mehmet Fatih Tasgetiren
A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops. Inf. Sci. 181(16): 3459-3475 (2011) - [c29]Mehmet Fatih Tasgetiren
A discrete artificial bee colony algorithm for the economic lot scheduling problem. IEEE Congress on Evolutionary Computation 2011: 347-353 - [c28]Önder Bulut
A Genetic Algorithm for the Economic Lot Scheduling Problem under Extended Basic Period Approach and Power-of-Two Policy. ICIC (2) 2011: 57-65 - [c27]Evrim Ursavas Guldogan, Önder Bulut
A Dynamic Berth Allocation Problem with Priority Considerations under Stochastic Nature. ICIC (2) 2011: 74-82 - [c26]Mehmet Fatih Tasgetiren
A DE Based Variable Iterated Greedy Algorithm for the No-Idle Permutation Flowshop Scheduling Problem with Total Flowtime Criterion. ICIC (2) 2011: 83-90 - [c25]Mustafa Seçmen
A Differential Evolution Algorithm for the Extraction of Complex Natural Resonance Frequencies of Electromagnetic Targets. ICIC (1) 2011: 131-138 - [c24]Mehmet Fatih Tasgetiren
A differential evolution algorithm for the median cycle problem. SDE 2011: 157-163 - [c23]Mehmet Fatih Tasgetiren
A Differential Evolution algorithm for the economic lot scheduling problem. SDE 2011: 164-169 - 2010
- [j7]Mehmet Fatih Tasgetiren
An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem. Appl. Math. Comput. 215(9): 3356-3368 (2010) - [j6]Quan-Ke Pan
A self-adaptive global best harmony search algorithm for continuous optimization problems. Appl. Math. Comput. 216(3): 830-848 (2010) - [j5]Ling Wang, Quan-Ke Pan
Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms. Expert Syst. Appl. 37(12): 7929-7936 (2010) - [c22]Quan-Ke Pan, Mehmet Fatih Tasgetiren
Solving lot-streaming flow shop scheduling problems using a discrete harmony search algorithm. IEEE Congress on Evolutionary Computation 2010: 1-6 - [c21]Mehmet Fatih Tasgetiren
A discrete artificial bee colony algorithm for the permutation flow shop scheduling problem with total flowtime criterion. IEEE Congress on Evolutionary Computation 2010: 1-8 - [c20]Mehmet Fatih Tasgetiren
An ensemble of differential evolution algorithms for constrained function optimization. IEEE Congress on Evolutionary Computation 2010: 1-8
2000 – 2009
- 2009
- [j4]Mehmet Fatih Tasgetiren
A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times. Comput. Oper. Res. 36(6): 1900-1915 (2009) - [c19]Mehmet Fatih Tasgetiren
A differential evolution algorithm with variable parameter search for real-parameter continuous function optimization. IEEE Congress on Evolutionary Computation 2009: 1247-1254 - [c18]Quan-Ke Pan, Ponnuthurai N. Suganthan
A Harmony Search Algorithm with Ensemble of Parameter Sets. IEEE Congress on Evolutionary Computation 2009: 1815-1820 - [c17]Mehmet Fatih Tasgetiren
Differential Evolution Algorithms for the Generalized Assignment problem. IEEE Congress on Evolutionary Computation 2009: 2606-2613 - 2008
- [j3]Quan-Ke Pan
A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Comput. Ind. Eng. 55(4): 795-816 (2008) - [j2]Quan-Ke Pan
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput. Oper. Res. 35(9): 2807-2839 (2008) - [c16]Mehmet Fatih Tasgetiren
A discrete differential evolution algorithm for single machine total weighted tardiness problem with sequence dependent setup times. IEEE Congress on Evolutionary Computation 2008: 2613-2620 - [c15]Quan-Ke Pan, Mehmet Fatih Tasgetiren
Upper bounds on Taillard's benchmark suite for the no-wait flowshop scheduling problem with makespan criterion. IEEE Congress on Evolutionary Computation 2008: 2955-2961 - [c14]Shi-Zheng Zhao, Jing J. Liang
Dynamic multi-swarm particle swarm optimizer with local search for Large Scale Global Optimization. IEEE Congress on Evolutionary Computation 2008: 3845-3852 - 2007
- [j1]Mehmet Fatih Tasgetiren
A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. Eur. J. Oper. Res. 177(3): 1930-1947 (2007) - [c13]Mehmet Fatih Tasgetiren
A genetic algorithm for the generalized traveling salesman problem. IEEE Congress on Evolutionary Computation 2007: 2382-2389 - [c12]Vicky Ling Huang, A. Kai Qin
Multi-objective optimization based on self-adaptive differential evolution algorithm. IEEE Congress on Evolutionary Computation 2007: 3601-3608 - [c11]Mehmet Fatih Tasgetiren
A Discrete Differential Evolution Algorithm for the No-Wait Flowshop Scheduling Problem with Total Flowtime Criterion. CISched 2007: 251-258 - [c10]Mehmet Fatih Tasgetiren
A Discrete Differential Evolution Algorithm for the Total Earliness and Tardiness Penalties with a Common Due Date on a Single-Machine. CISched 2007: 271-278 - [c9]Quan-Ke Pan, Mehmet Fatih Tasgetiren
A discrete differential evolution algorithm for the permutation flowshop scheduling problem. GECCO 2007: 126-133 - [c8]Mehmet Fatih Tasgetiren
A discrete particle swarm optimization algorithm for the generalized traveling salesman problem. GECCO 2007: 158-167 - 2006
- [c7]Quan-Ke Pan, Mehmet Fatih Tasgetiren
Minimizing Total Earliness and Tardiness Penalties with a Common Due Date on a Single-Machine Using a Discrete Particle Swarm Optimization Algorithm. ANTS Workshop 2006: 460-467 - [c6]Mehmet Fatih Tasgetiren, Ponnuthurai Nagaratnam Suganthan
A Multi-Populated Differential Evolution Algorithm for Solving Constrained Optimization Problem. IEEE Congress on Evolutionary Computation 2006: 33-40 - [c5]Quan-Ke Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang:
A Discrete Particle Swarm Optimization Algorithm for Single Machine Total Earliness and Tardiness Problem with a Common Due Date. IEEE Congress on Evolutionary Computation 2006: 3281-3288 - [c4]Quan-Ke Pan, Mehmet Fatih Tasgetiren
A Discrete Particle Swarm Optimization Algorithm for the Permutation Flowshop Sequencing Problem with Makespan Criterion. SGAI Conf. 2006: 19-31 - 2004
- [c3]Mehmet Fatih Tasgetiren
Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem. ANTS Workshop 2004: 382-389 - [c2]Mehmet Fatih Tasgetiren, Mehmet Sevkli, Yun-Chia Liang, Günes Gençyilmaz:
Particle swarm optimization algorithm for single machine total weighted tardiness problem. IEEE Congress on Evolutionary Computation 2004: 1412-1419 - 2000
- [c1]Mehmet Fatih Tasgetiren, Alice E. Smith
A genetic algorithm for the orienteering problem. CEC 2000: 910-915
Coauthor Index
[j38] [j36] [j35] [j33] [j32] [j31] [j27] [c66] [c65] [j23] [j21] [c60] [c59] [c58] [c57] [j20] [c56] [c54] [j19] [j18] [j17] [c53] [c52] [c50] [c49] [c48] [j16] [c44] [c43] [c40] [j14] [c38] [c37] [c34] [c31] [c30] [j13] [j12] [j11] [j10] [j9] [j8] [c26] [c24] [j7] [j6] [j5] [c22] [c21] [c20] [j4] [c19] [c18] [j3] [j2] [c16] [c15] [c13] [c11] [c10] [c9] [c8] [c7] [c5] [c4]
Ponnuthurai N. Suganthan
aka: Ponnuthurai Nagaratnam Suganthan
aka: Ponnuthurai Nagaratnam Suganthan
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-27 21:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: