default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSaïd Hanafi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j79]Song Wu
, Wei Yang, Saïd Hanafi, Christophe Wilbaut, Yang Wang:
Iterated local search with ejection chains for the space-free multi-row facility layout problem. Eur. J. Oper. Res. 316(3): 873-886 (2024)- 2023
- [j78]Christophe Wilbaut, Raca Todosijevic, Saïd Hanafi, Arnaud Fréville:
Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem. Eur. J. Oper. Res. 304(3): 901-911 (2023) - [j77]Saïd Hanafi, Yang Wang, Fred W. Glover, Wei Yang, Rick Hennig:
Tabu search exploiting local optimality in binary optimization. Eur. J. Oper. Res. 308(3): 1037-1055 (2023) - [j76]Vinicius Leal do Forte, Saïd Hanafi, Abilio Lucena:
Extended formulations for perfect domination problems and their algorithmic implications. Eur. J. Oper. Res. 310(2): 566-581 (2023) - [j75]Michel Vasquez, Mirsad Buljubasic, Saïd Hanafi:
An efficient scenario penalization matheuristic for a stochastic scheduling problem. J. Heuristics 29(2-3): 383-408 (2023) - [j74]Rachid Benmansour, Raca Todosijevic, Saïd Hanafi:
Variable neighborhood search for the single machine scheduling problem to minimize the total early work. Optim. Lett. 17(9): 2169-2184 (2023) - 2022
- [j73]Christophe Wilbaut, Raca Todosijevic, Saïd Hanafi, Arnaud Fréville:
Variable neighborhood search for the discounted {0-1} knapsack problem. Appl. Soft Comput. 131: 109821 (2022) - [j72]Raca Todosijevic, Saïd Hanafi, Fred W. Glover:
On convergence of scatter search and star paths with directional rounding for 0-1 mixed integer programs. Discret. Appl. Math. 308: 235-254 (2022) - 2020
- [j71]Hanane Krim, Rachid Benmansour, David Duvivier, Daoud Aït-Kadi, Saïd Hanafi:
Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance. Comput. Optim. Appl. 75(1): 291-320 (2020) - [j70]Saïd Hanafi, Renata Mansini, Roberto Zanotti:
The multi-visit team orienteering problem with precedence constraints. Eur. J. Oper. Res. 282(2): 515-529 (2020) - [j69]Shahin Gelareh, Bernard Gendron, Saïd Hanafi, Rahimeh Neamatian Monemi, Raca Todosijevic:
The selective traveling salesman problem with draft limits. J. Heuristics 26(3): 339-352 (2020) - [j68]Saïd Hanafi, Gintaras Palubeckis, Fred W. Glover:
Bi-objective optimization of biclustering with binary data. Inf. Sci. 538: 444-466 (2020) - [j67]Noura Smiti, Mohamed Mahjoub Dhiaf, Bassem Jarboui, Saïd Hanafi:
Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem. Int. Trans. Oper. Res. 27(1): 651-664 (2020) - [i5]Fred W. Glover, Saïd Hanafi, Gintaras Palubeckis:
Bi-objective Optimization of Biclustering with Binary Data. CoRR abs/2002.04711 (2020)
2010 – 2019
- 2019
- [j66]Oualid Guemri, Placide Nduwayo, Raca Todosijevic, Saïd Hanafi, Fred W. Glover:
Probabilistic Tabu Search for the Cross-Docking Assignment Problem. Eur. J. Oper. Res. 277(3): 875-885 (2019) - [j65]Issam Krimi, Rachid Benmansour, Saïd Hanafi, Nizar El Hachemi:
Two-machine flow shop with synchronized periodic maintenance. RAIRO Oper. Res. 53(1): 351-365 (2019) - [j64]Rachid Benmansour, Oliver Braun, Saïd Hanafi:
The single-processor scheduling problem with time restrictions: complexity and related problems. J. Sched. 22(4): 465-471 (2019) - [c15]Igor Crévits, Saïd Hanafi, Ali Ridha Mahjoub, Raouia Taktak, Christophe Wilbaut:
A special case of Variable-Sized Bin Packing Problem with Color Constraints. CoDIT 2019: 1150-1154 - 2018
- [j63]Diego Arenas, Paola Pellegrini, Saïd Hanafi, Joaquin Rodriguez:
Timetable rearrangement to cope with railway maintenance activities. Comput. Oper. Res. 95: 123-138 (2018) - [j62]Bernard Gendron, Saïd Hanafi, Raca Todosijevic:
Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design. Eur. J. Oper. Res. 268(1): 70-81 (2018) - [j61]Safa Khalouli, Rachid Benmansour, Saïd Hanafi:
Ant colony optimisation combined with variable neighbourhood search for scheduling preventive railway maintenance activities. Int. J. Intell. Eng. Informatics 6(1/2): 78-98 (2018) - [c14]Rachid Benmansour, Oliver Braun, Saïd Hanafi, Nenad Mladenovic:
Using a Variable Neighborhood Search to Solve the Single Processor Scheduling Problem with Time Restrictions. ICVNS 2018: 202-215 - 2017
- [j60]Raca Todosijevic, Saïd Hanafi, Dragan Urosevic, Bassem Jarboui, Bernard Gendron:
A general variable neighborhood search for the swap-body vehicle routing problem. Comput. Oper. Res. 78: 468-479 (2017) - [j59]Pierre Hansen, Nenad Mladenovic, Raca Todosijevic, Saïd Hanafi:
Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3): 423-454 (2017) - [j58]Danijela Doric, Abdessamad Ait El Cadi, Saïd Hanafi, Nenad Mladenovic, Abdelhakim Artiba:
Clustering approach in maintenance of capillary railway network. Electron. Notes Discret. Math. 58: 239-246 (2017) - [j57]François Clautiaux, Saïd Hanafi, Rita Macedo, Marie-Emilie Voge, Cláudio Alves:
Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints. Eur. J. Oper. Res. 258(2): 467-477 (2017) - [j56]Saïd Hanafi, Raca Todosijevic:
Mathematical programming based heuristics for the 0-1 MIP: a survey. J. Heuristics 23(4): 165-206 (2017) - [j55]Anis Mjirda, Raca Todosijevic, Saïd Hanafi, Pierre Hansen, Nenad Mladenovic:
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem. Int. Trans. Oper. Res. 24(3): 615-633 (2017) - [j54]Raca Todosijevic, Anis Mjirda, Marko Mladenovic, Saïd Hanafi, Bernard Gendron:
A general variable neighborhood search variants for the travelling salesman problem with draft limits. Optim. Lett. 11(6): 1047-1056 (2017) - [j53]Abdessamad Ait El Cadi, Rabie Ben Atitallah, Saïd Hanafi, Nenad Mladenovic, Abdelhakim Artiba:
New MIP model for multiprocessor scheduling problem with communication delays. Optim. Lett. 11(6): 1091-1107 (2017) - [j52]Raca Todosijevic, Dragan Urosevic, Nenad Mladenovic, Saïd Hanafi:
A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem. Optim. Lett. 11(6): 1109-1121 (2017) - [j51]Mariem Ben Salem, Saïd Hanafi, Raouia Taktak, Hanêne Ben-Abdallah:
Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem. RAIRO Oper. Res. 51(3): 627-637 (2017) - [j50]Nacira Chikhi, Moncef Abbas, Rachid Benmansour, Saïd Hanafi:
New complexity results on scheduling problem in a robotic cell. RAIRO Oper. Res. 51(3): 749-762 (2017) - 2016
- [j49]Boukthir Haddar, Mahdi Khemakhem, Saïd Hanafi, Christophe Wilbaut:
A hybrid quantum particle swarm optimization for the Multidimensional Knapsack Problem. Eng. Appl. Artif. Intell. 55: 1-13 (2016) - [j48]Raca Todosijevic, Rachid Benmansour, Saïd Hanafi, Nenad Mladenovic, Abdelhakim Artiba:
Nested general variable neighborhood search for the periodic maintenance problem. Eur. J. Oper. Res. 252(2): 385-396 (2016) - [j47]Igor Vasilyev, Maurizio Boccia, Saïd Hanafi:
An implementation of exact knapsack separation. J. Glob. Optim. 66(1): 127-150 (2016) - [c13]Safa Khalouli, Rachid Benmansour, Saïd Hanafi:
An ant colony algorithm based on opportunities for scheduling the preventive railway maintenance. CoDIT 2016: 594-599 - 2015
- [j46]Nacira Chikhi, Moncef Abbas, Rachid Benmansour, Abdelghani Bekrar, Saïd Hanafi:
A two-stage flow shop scheduling problem with transportation considerations. 4OR 13(4): 381-402 (2015) - [j45]Rita Macedo, Cláudio Alves, Saïd Hanafi, Bassem Jarboui, Nenad Mladenovic, Bruna Ramos, José M. Valério de Carvalho:
Skewed general variable neighborhood search for the location routing scheduling problem. Comput. Oper. Res. 61: 143-152 (2015) - [j44]Boukthir Haddar, Mahdi Khemakhem, Saïd Hanafi, Christophe Wilbaut:
A hybrid heuristic for the 0-1 Knapsack Sharing Problem. Expert Syst. Appl. 42(10): 4653-4666 (2015) - 2014
- [j43]Rachid Benmansour, Hamid Allaoui, Abdelhakim Artiba, Saïd Hanafi:
Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance. Comput. Oper. Res. 47: 106-113 (2014) - [j42]Nenad Mladenovic, Saïd Salhi, Saïd Hanafi, Jack Brimberg:
Editorial. Comput. Oper. Res. 52: 147-148 (2014) - [j41]Anis Mjirda, Bassem Jarboui, Rita Macedo, Saïd Hanafi, Nenad Mladenovic:
A two phase variable neighborhood search for the multi-product inventory routing problem. Comput. Oper. Res. 52: 291-299 (2014) - [c12]Mariem Baazaoui, Saïd Hanafi, Hichem Kamoun:
A Mathematical formulation and a lower bound for the three-dimensional multiple-bin-size bin packing problem (MBSBPP): A Tunisian industrial case. CoDIT 2014: 219-224 - [c11]Nacira Chikhi, Rachid Benmansour, Abdelghani Bekrar, Saïd Hanafi, Moncef Abbas:
A case study of a two-stage flow shop with dedicated machines and a single robot. CoDIT 2014: 246-250 - [c10]Karim M. A. Ali, Rabie Ben Atitallah, Saïd Hanafi, Jean-Luc Dekeyser:
A generic pixel distribution architecture for parallel video processing. ReConFig 2014: 1-8 - [i4]Diego Arenas, Remy Chevirer, Saïd Hanafi, Joaquin Rodriguez:
Solving the Periodic Timetabling Problem using a Genetic Algorithm. CoRR abs/1411.6998 (2014) - 2013
- [j40]Nenad Mladenovic, Dragan Urosevic, Saïd Hanafi:
Variable neighborhood search for the travelling deliveryman problem. 4OR 11(1): 57-73 (2013) - [j39]Bassem Jarboui, Houda Derbel, Saïd Hanafi, Nenad Mladenovic:
Variable neighborhood search for location routing. Comput. Oper. Res. 40(1): 47-57 (2013) - [j38]Adrien Bellanger, Saïd Hanafi, Christophe Wilbaut:
Three-stage hybrid-flowshop model for cross-docking. Comput. Oper. Res. 40(4): 1109-1121 (2013) - [j37]Luce Brotcorne, Saïd Hanafi, Raïd Mansi:
One-level reformulation of the bilevel Knapsack problem using dynamic programming. Discret. Optim. 10(1): 1-10 (2013) - [j36]Samira Almoustafa, Saïd Hanafi, Nenad Mladenovic:
New exact method for large asymmetric distance-constrained vehicle routing problem. Eur. J. Oper. Res. 226(3): 386-394 (2013) - [j35]Saïd Hanafi, Ahmed Riadh Rebai, Michel Vasquez:
Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems. J. Heuristics 19(4): 645-677 (2013) - 2012
- [j34]Igor Crévits, Saïd Hanafi, Raïd Mansi, Christophe Wilbaut:
Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem. Comput. Oper. Res. 39(1): 32-41 (2012) - [j33]Ali Khanafer, François Clautiaux, Saïd Hanafi, El-Ghazali Talbi:
The min-conflict packing problem. Comput. Oper. Res. 39(9): 2122-2132 (2012) - [j32]Anis Mjirda, Bassem Jarboui, Rita Macedo, Saïd Hanafi:
A variable neighborhood search for the multi-product inventory routing problem. Electron. Notes Discret. Math. 39: 91-98 (2012) - [j31]Raca Todosijevic, Marko Mladenovic, Saïd Hanafi, Igor Crévits:
VNS based heuristic for solving the Unit Commitment problem. Electron. Notes Discret. Math. 39: 153-160 (2012) - [j30]Nenad Mladenovic, Dragan Urosevic, Saïd Hanafi, Aleksandar Ilic:
A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. Eur. J. Oper. Res. 220(1): 270-285 (2012) - [j29]Houda Derbel, Bassem Jarboui, Saïd Hanafi, Habib Chabchoub:
Genetic algorithm with iterated local search for solving a location-routing problem. Expert Syst. Appl. 39(3): 2865-2871 (2012) - [j28]Mahdi Khemakhem, Boukthir Haddar, Khalil Chebil, Saïd Hanafi:
A Filter-and-Fan Metaheuristic for the 0-1 Multidimensional Knapsack Problem. Int. J. Appl. Metaheuristic Comput. 3(4): 43-63 (2012) - [j27]Saïd Hanafi, Raïd Mansi, Christophe Wilbaut, Arnaud Fréville:
Hybrid approaches for the two-scenario max-min knapsack problem. Int. Trans. Oper. Res. 19(3): 353-378 (2012) - [c9]Rita Macedo, Saïd Hanafi, François Clautiaux, Cláudio Alves, José M. Valério de Carvalho:
Generalized Disaggregation Algorithm for the Vehicle Routing Problem with Time Windows and Multiple Routes. ICORES 2012: 305-312 - 2011
- [j26]Saïd Hanafi, Nicola Yanev:
Tabu search approaches for solving the two-group classification problem. Ann. Oper. Res. 183(1): 25-46 (2011) - [j25]Saïd Hanafi, Christophe Wilbaut:
Improved convergent heuristics for the 0-1 multidimensional knapsack problem. Ann. Oper. Res. 183(1): 125-142 (2011) - [j24]Rita Macedo, Cláudio Alves, José M. Valério de Carvalho, François Clautiaux, Saïd Hanafi:
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. Eur. J. Oper. Res. 214(3): 536-545 (2011) - [j23]Saïd Hanafi, Claudio Sterle, Anton V. Ushakov, Igor Vasilyev:
A parallel subgradient algorithm for Lagrangean dual function of the p-median problem. Stud. Inform. Univ. 9(3): 105-124 (2011) - [i3]Ahmed Riadh Rebai, Saïd Hanafi:
An Adaptive Multimedia-Oriented Handoff Scheme for IEEE 802.11 WLANs. CoRR abs/1102.5189 (2011) - [i2]Ahmed Riadh Rebai, Saïd Hanafi:
A Dynamic Multimedia User-Weight Classification Scheme for IEEE_802.11 WLANs. CoRR abs/1103.3340 (2011) - 2010
- [j22]Jasmina Lazic, Saïd Hanafi, Nenad Mladenovic, Dragan Urosevic:
Variable neighbourhood decomposition search for 0-1 mixed integer programs. Comput. Oper. Res. 37(6): 1055-1067 (2010) - [j21]Arnaud Fréville, Saïd Hanafi, Frédéric Semet, Nicola Yanev:
A tabu search with an oscillation strategy for the discriminant analysis problem. Comput. Oper. Res. 37(10): 1688-1696 (2010) - [j20]Sylvain Boussier, Michel Vasquez, Yannick Vimont, Saïd Hanafi, Philippe Michelon:
A multi-level search strategy for the 0-1 Multidimensional Knapsack Problem. Discret. Appl. Math. 158(2): 97-109 (2010) - [j19]Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic:
Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility. Electron. Notes Discret. Math. 36: 759-766 (2010) - [j18]Houda Derbel, Bassem Jarboui, Saïd Hanafi, Habib Chabchoub:
An Iterated Local Search for Solving A Location-Routing Problem. Electron. Notes Discret. Math. 36: 875-882 (2010) - [j17]Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic, Christophe Wilbaut, Igor Crévits:
Hybrid Variable Neighbourhood Decomposition Search for 0-1 Mixed Integer Programming Problem. Electron. Notes Discret. Math. 36: 883-890 (2010) - [j16]Fred W. Glover, Saïd Hanafi:
Metaheuristic Search with Inequalities and Target Objectives for Mixed Binary Optimization Part I: Exploiting Proximity. Int. J. Appl. Metaheuristic Comput. 1(1): 1-15 (2010) - [j15]Fred W. Glover, Saïd Hanafi:
Metaheuristic Search with Inequalities and Target Objectives for Mixed Binary Optimization - Part II: Exploiting Reaction and Resistance. Int. J. Appl. Metaheuristic Comput. 1(2): 1-17 (2010) - [j14]Youssef Masmoudi, Habib Chabchoub, Saïd Hanafi, Ahmed Riadh Rebai:
A Mathematical Programming Based Procedure for Breast Cancer Classification. J. Math. Model. Algorithms 9(3): 247-255 (2010) - [c8]Saïd Hanafi, Jasmina Lazic, Nenad Mladenovic, Christophe Wilbaut, Igor Crévits:
New Hybrid Matheuristics for Solving the Multidimensional Knapsack Problem. Hybrid Metaheuristics 2010: 118-132 - [c7]Ahmed Riadh Rebai, M. Fliss Rebai, Hussein M. Alnuweiri, Saïd Hanafi:
An enhanced heuristic technique for AP selection in 802.11 handoff procedure. ICT 2010: 576-580 - [c6]Minh Hoang Ha, François Clautiaux, Saïd Hanafi, Christophe Wilbaut:
New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint. SEA 2010: 302-313
2000 – 2009
- 2009
- [j13]Christophe Wilbaut, Saïd Hanafi:
New convergent heuristics for 0-1 mixed integer programming. Eur. J. Oper. Res. 195(1): 62-74 (2009) - [j12]Christophe Wilbaut, Saïd Salhi, Saïd Hanafi:
An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem. Eur. J. Oper. Res. 199(2): 339-348 (2009) - [j11]Luce Brotcorne, Saïd Hanafi, Raïd Mansi:
A dynamic programming algorithm for the bilevel knapsack problem. Oper. Res. Lett. 37(3): 215-218 (2009) - [j10]Luce Brotcorne, Clarisse Dhaenens, Saïd Hanafi, El-Ghazali Talbi:
Articles ROADEF 2006. RAIRO Oper. Res. 43(3): 253 (2009) - [c5]Saïd Hanafi, Raïd Mansi, Christophe Wilbaut:
Iterative Relaxation-Based Heuristics for the Multiple-choice Multidimensional Knapsack Problem. Hybrid Metaheuristics 2009: 73-83 - [c4]Ahmed Riadh Rebai, Hussein M. Alnuweiri, Saïd Hanafi:
A novel prevent-scan Handoff technique for IEEE 802.11 WLANs. ICUMT 2009: 1-5 - [i1]Sylvain Boussier, Michel Vasquez, Yannick Vimont, Saïd Hanafi, Philippe Michelon:
Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search. CoRR abs/0905.0848 (2009) - 2008
- [j9]Saïd Hanafi, Christophe Wilbaut:
Scatter Search for the 0-1 Multidimensional Knapsack Problem. J. Math. Model. Algorithms 7(2): 143-159 (2008) - [c3]Ahmed Riadh Rebai, Mariem Fliss, Slah Jarboui, Saïd Hanafi:
A New Link Adaptation Scheme for IEEE 802.11 WLANs. NTMS 2008: 1-5 - 2007
- [j8]Thomas Bourdeaud'huy, Saïd Hanafi, Pascal Yim:
Mathematical programming approach to the Petri nets reachability problem. Eur. J. Oper. Res. 177(1): 176-197 (2007) - [j7]Saïd Hanafi, Fred W. Glover:
Exploiting nested inequalities and surrogate constraints. Eur. J. Oper. Res. 179(1): 50-63 (2007) - 2005
- [j6]Arnaud Fréville, Saïd Hanafi:
The Multidimensional 0-1 Knapsack Problem - Bounds and Computational Aspects. Ann. Oper. Res. 139(1): 195-227 (2005) - 2004
- [c2]Thomas Bourdeaud'huy, Saïd Hanafi, Pascal Yim:
Solving the Petri Nets Reachability Problem Using the Logical Abstraction Technique and Mathematical Programming. CPAIOR 2004: 112-126 - [c1]Thomas Bourdeaud'huy, Pascal Yim, Saïd Hanafi:
Efficient reachability analysis of bounded Petri nets using constraint programming. SMC (2) 2004: 1870-1875 - 2002
- [j5]Fred W. Glover, Saïd Hanafi:
Tabu search and finite convergence. Discret. Appl. Math. 119(1-2): 3-36 (2002) - [j4]Saïd Hanafi, Fred W. Glover:
Resolution Search and Dynamic Branch-and-Bound. J. Comb. Optim. 6(4): 401-423 (2002) - 2001
- [j3]Saïd Hanafi:
On the Convergence of Tabu Search. J. Heuristics 7(1): 47-58 (2001) - [j2]Saïd Hanafi, Arnaud Fréville:
Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List. RAIRO Oper. Res. 35(2): 251-267 (2001)
1990 – 1999
- 1998
- [j1]Saïd Hanafi, Arnaud Fréville:
An efficient tabu search approach for the 0-1 multidimensional knapsack problem. Eur. J. Oper. Res. 106(2-3): 659-675 (1998)
Coauthor Index
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 2025-01-20 22:46 CET 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:
