default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMhand Hifi
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
[j78]Samah Boukhari, Mhand Hifi
:
An exact algorithm for the multiple-choice Knapsack problem with setups. Comput. Ind. Eng. 188: 109818 (2024)- [j77]Juntao Zhao, Mhand Hifi, Yulin Zhang, Xiaochuan Luo:
An incremental method-based machine learning approach for max-min knapsack with multiple scenarios. Comput. Ind. Eng. 190: 109984 (2024) - [j76]Juntao Zhao, Mhand Hifi:
An adaptive evolutionary search-based method for efficiently tackling the set-union knapsack problem. Inf. Sci. 676: 120855 (2024) - [j75]Samah Boukhari, Mhand Hifi:
Combining local branching and descent method for solving the multiple-choice knapsack problem with setups. Int. Trans. Oper. Res. 31(1): 29-52 (2024) - 2023
- [j74]Méziane Aïder, Imene Dey, Mhand Hifi:
A hybrid population-based algorithm for solving the fuzzy capacitated maximal covering location problem. Comput. Ind. Eng. 177: 108982 (2023) - [j73]Fatma Zohra Baatout, Mhand Hifi:
A two-phase hybrid evolutionary algorithm for solving the bi-objective scheduling multiprocessor tasks on two dedicated processors. J. Heuristics 29(2-3): 229-267 (2023) - [j72]Mhand Hifi, Shohre Sadeghsa:
A rounding strategy-based algorithm for the k-clustering minimum biclique completion problem. J. Oper. Res. Soc. 74(1): 258-271 (2023) - [j71]Mhand Hifi, Amir Mohamed-Youssouf, Labib Yousef:
A threshold search-based population algorithm for the sphere packing problem. Knowl. Based Syst. 261: 110177 (2023) - [j70]Méziane Aïder, Aida-Ilham Azzi, Mhand Hifi:
The ɛ-constraint as a learning strategy in the population-based algorithm: The case of Bi-Objective Obnoxious p-Median Problems. Knowl. Based Syst. 265: 110363 (2023) - [j69]Méziane Aïder, Oussama Gacem, Mhand Hifi:
Effect of learning strategies in an evolutionary method: the case of the bi-objective quadratic multiple knapsack problem. Neural Comput. Appl. 35(2): 1183-1209 (2023) - 2022
- [j68]Samah Boukhari, Isma Dahmani, Mhand Hifi:
Effect of the local branching strategy on the descent method: The case of the generalized multiple knapsack with setup. Comput. Ind. Eng. 165: 107934 (2022) - [j67]Mhand Hifi, Shohre Sadeghsa:
Effect of Local Branching on the Iterative Rounding-Based Method: The Case of k-Clustering Minimum Completion Problems. Cybern. Syst. 53(1): 58-79 (2022) - [j66]Isma Dahmani, Meriem Ferroum, Mhand Hifi:
Effect of Backtracking Strategy in Population-Based Approach: The Case of the Set-Union Knapsack Problem. Cybern. Syst. 53(1): 168-185 (2022) - [j65]Méziane Aïder, Oussama Gacem, Mhand Hifi:
A hybrid population-based algorithm for the bi-objective quadratic multiple knapsack problem. Expert Syst. Appl. 191: 116238 (2022) - [j64]Méziane Aïder, Oussama Gacem, Mhand Hifi:
Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem. J. Oper. Res. Soc. 73(3): 540-557 (2022) - [c33]Mhand Hifi, Amir Mohamed-Youssouf, Labib Yousef:
A Population-Based Algorithm for the Sphere Packing Problem. CoDIT 2022: 1455-1460 - [c32]Gérard-Michel Cochard, Mhand Hifi, E.-S. Samod, Labib Yousef:
A Population-Based Algorithm for the k-Clustering Minimum Biclique Completion Problem. CoDIT 2022: 1461-1466 - 2021
- [j63]Isma Dahmani, Mhand Hifi:
A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs. Ann. Oper. Res. 298(1): 125-147 (2021) - [j62]Méziane Aïder, Fatma Zohra Baatout, Mhand Hifi:
A look-ahead strategy-based method for scheduling multiprocessor tasks on two dedicated processors. Comput. Ind. Eng. 158: 107388 (2021) - [j61]Lei Wu, Mhand Hifi:
Data-driven robust optimization for the itinerary planning via large-scale GPS data. Knowl. Based Syst. 231: 107437 (2021) - [j60]Thekra Al Douri, Mhand Hifi, Vassilis Zissimopoulos:
An iterative algorithm for the Max-Min knapsack problem with multiple scenarios. Oper. Res. 21(2): 1355-1392 (2021) - [j59]Isma Dahmani, Meriem Ferroum, Mhand Hifi:
An iterative rounding strategy-based algorithm for the set-union knapsack problem. Soft Comput. 25(21): 13617-13639 (2021) - [c31]Samah Boukhari, Isma Dahmani, Mhand Hifi:
Computational Power of a Hybrid Algorithm for Solving the Multiple Knapsack Problem with Setup. SAI (1) 2021: 154-168 - [c30]Mhand Hifi, Shohre Sadeghsa:
An Iterative Randomized Rounding Algorithm for the k-Clustering Minimum Completion Problem with an Application in Telecommunication Field. SAI (1) 2021: 410-422 - 2020
- [j58]Lei Wu, Mhand Hifi:
Discrete scenario-based optimization for the robust vehicle routing problem: The case of time windows under delay uncertainty. Comput. Ind. Eng. 145: 106491 (2020) - [j57]Isma Dahmani, Mhand Hifi, Toufik Saadi, Labib Yousef:
A swarm optimization-based search algorithm for the quadratic knapsack problem with conflict Graphs. Expert Syst. Appl. 148: 113224 (2020) - [c29]Mhand Hifi, Shohre Sadeghsa:
Adaptation of the Rounding Search-Based Algorithm for the k-Clustering Minimum Completion Problem. CoDIT 2020: 1150-1155 - [c28]Isma Dahmani, Meriem Ferroum, Mhand Hifi, Shohre Sadeghsa:
A Hybrid Swarm Optimization-Based Algorithm for the Set-Union Knapsack Problem. CoDIT 2020: 1162-1167 - [c27]Mhand Hifi, Amir Mohamed-Youssouf, Toufik Saadi, Labib Yousef:
A Cooperative Swarm Optimization-Based Algorithm for the Quadratic Multiple Knapsack Problem. CoDIT 2020: 1168-1173 - [c26]Mhand Hifi, Adeline Goullieux, Shohre Sadeghsa:
An Iterative Descent Method for Predicting The Compressive Cement Strength Estimated Parameters. FedCSIS (Communication Papers) 2020: 7-12 - [c25]Méziane Aïder, Fatma Zohra Baatout, Mhand Hifi:
A Hybrid Method for Scheduling Multiprocessor Tasks on Two Dedicated Processors. WCO@FedCSIS 2020: 157-178 - [c24]Adeline Goullieux, Mhand Hifi, Shohre Sadeghsa:
Mathematical Model and Its Optimization to Predict the Parameters of Compressive Strength Test. WCO@FedCSIS 2020: 179-202 - [c23]Méziane Aïder, Fatma Zohra Baatout, Mhand Hifi:
A Reactive Search-Based Algorithm for Scheduling Multiprocessor Tasks on Two Dedicated Processors. FedCSIS 2020: 257-261 - [c22]Adeline Goullieux, Mhand Hifi, Shohre Sadeghsa:
Self Learning Strategy for the Team Orienteering Problem (SLS-TOP). ICORES 2020: 336-343
2010 – 2019
- 2019
- [j56]Mhand Hifi, Labib Yousef:
A local search-based method for sphere packing problems. Eur. J. Oper. Res. 274(2): 482-500 (2019) - 2018
- [j55]Hiba Bederina, Mhand Hifi:
A hybrid multi-objective evolutionary optimization approach for the robust vehicle routing problem. Appl. Soft Comput. 71: 980-993 (2018) - [j54]Mhand Hifi, Labib Yousef:
A hybrid algorithm for packing identical spheres into a container. Expert Syst. Appl. 96: 249-260 (2018) - [j53]Thekra Aldouri, Mhand Hifi:
A two-stage hybrid method for the multi-scenarios max-min knapsack problem. Int. J. Intell. Eng. Informatics 6(1/2): 99-114 (2018) - [j52]Ferhan Al-Maliky, Mhand Hifi, Hedi M'Halla:
Sensitivity analysis of the setup knapsack problem to perturbation of arbitrary profits or weights. Int. Trans. Oper. Res. 25(2): 637-666 (2018) - 2017
- [j51]Aristotelis Giannakos, Mhand Hifi, R. Kheffache, Rachid Ouafi:
An approximation algorithm for the k-fixed depots problem. Comput. Ind. Eng. 111: 50-55 (2017) - [j50]Lei Wu, Mhand Hifi, Hiba Bederina:
A new robust criterion for the vehicle routing problem with uncertain travel time. Comput. Ind. Eng. 112: 607-615 (2017) - [j49]Adel Bouchakhchoukha, Mhand Hifi:
A hybrid descent method for the two-edge disjoint survivable network design problem with relays. Comput. Ind. Eng. 112: 645-653 (2017) - [c21]Najat Al-Iedani, Mhand Hifi, Toufik Saadi:
A reactive search for the quadratic knapsack problem. CoDIT 2017: 495-499 - [c20]Mhand Hifi, Dominique Lazure, Labib Yousef:
Solving packing identical spheres into a smallest sphere with a particle swarm optimization. CoDIT 2017: 892-897 - [c19]Hiba Bederina, Mhand Hifi:
A hybrid multi-objective evolutionary algorithm for the team orienteering problem. CoDIT 2017: 898-903 - [i1]Aristotelis Giannakos, Mhand Hifi, Gregory Karagiorgos:
Data Delivery by Mobile Agents with Energy Constraints over a fixed path. CoRR abs/1703.05496 (2017) - 2016
- [j48]Isma Dahmani, Mhand Hifi, Lei Wu:
An exact decomposition algorithm for the generalized knapsack sharing problem. Eur. J. Oper. Res. 252(3): 761-774 (2016) - [c18]Thekra Al Douri, Mhand Hifi:
A diversified method for the multi-scenarios max-min knapsack problem. CoDIT 2016: 355-359 - [c17]Najat Al-Iedani, Mhand Hifi, Toufik Saadi:
Neighborhood search-based heuristic for the k-clustering minimum biclique completion problem. CoDIT 2016: 639-643 - [c16]Didier El Baz, Mhand Hifi, Lei Wu, Xiaochuan Shi:
A Parallel Ant Colony Optimization for the Maximum-Weight Clique Problem. IPDPS Workshops 2016: 796-800 - 2015
- [c15]Mhand Hifi, Ibrahim Moussa, Toufik Saadi, Sagvan Saleh:
An Adaptive Neighborhood Search for k-Clustering Minimum Bi-clique Completion Problems. MCO (1) 2015: 15-25 - 2014
- [j47]Mhand Hifi, Lei Wu:
New upper bounds and exact methods for the knapsack sharing problem. Appl. Math. Comput. 227: 518-530 (2014) - [j46]Mhand Hifi, Stéphane Nègre, Lei Wu:
Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem. Int. Trans. Oper. Res. 21(1): 59-79 (2014) - [c14]Moudher Kh. Abdal-Hammed, Mhand Hifi, Lei Wu:
Large neighborhood search for the vehicle routing problem with two-dimensional loading constraints. CoDIT 2014: 54-59 - [c13]Mhand Hifi, Laurent Moreau, Stéphane Nègre, Lei Wu:
A hybrid large neighborhood search for the pickup and delivery problem with time windows. CoDIT 2014: 104-109 - [c12]Ferhan Al-Maliky, Mhand Hifi, Hedi M'Halla:
An exact solution search for the max-min multiple knapsack problem. CoDIT 2014: 117-122 - [c11]Mhand Hifi, Lei Wu:
A hybrid metaheuristic for the Vehicle Routing Problem with Time Windows. CoDIT 2014: 188-194 - [c10]Mhand Hifi, Labib Yousef:
Width Beam and Hill-Climbing Strategies for the Three-Dimensional Sphere Packing Problem. FedCSIS 2014: 421-428 - [c9]Mhand Hifi, Ibrahim Moussa, Toufik Saadi:
A Two-Stage Resolution Search-Based Heuristic for the Team Orienteering Problem. FiCloud 2014: 442-447 - [c8]Mhand Hifi, Stéphane Nègre, Toufik Saadi, Sagvan Saleh, Lei Wu:
A Parallel Large Neighborhood Search-Based Heuristic for the Disjunctively Constrained Knapsack Problem. IPDPS Workshops 2014: 1547-1551 - [c7]Mhand Hifi, Sagvan Saleh, Lei Wu:
A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack Problems. ISCO 2014: 396-407 - 2013
- [j45]Hakim Akeb, Mhand Hifi:
Solving the circular open dimension problem by using separate beams and look-ahead strategies. Comput. Oper. Res. 40(5): 1243-1255 (2013) - [j44]Mhand Hifi, Hedi M'Halla:
Sensitivity analysis to perturbations of the weight of a subset of items: The knapsack case study. Discret. Optim. 10(4): 320-330 (2013) - [c6]Hakim Akeb, Adel Bouchakhchoukha, Mhand Hifi:
A Three-Stage Heuristic for the Capacitated Vehicle Routing Problem with Time Windows. WCO@FedCSIS 2013: 1-19 - [c5]Hakim Akeb, Adel Bouchakhchoukha, Mhand Hifi:
A Beam Search Based Algorithm for the Capacitated Vehicle Routing Problem with Time Windows. FedCSIS 2013: 329-336 - [p1]Hakim Akeb, Mhand Hifi, Dominique Lazure:
A Heuristic Based Algorithm for the 2D Circular Strip Packing Problem. Recent Advances in Computational Optimization 2013: 73-92 - 2012
- [j43]Mhand Hifi, Stéphane Nègre, Rachid Ouafi, Toufik Saadi:
A parallel algorithm for constrained two-staged two-dimensional cutting problems. Comput. Ind. Eng. 62(1): 177-189 (2012) - [j42]Mhand Hifi, Toufik Saadi:
A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems. Comput. Optim. Appl. 51(2): 783-807 (2012) - [j41]Mhand Hifi, Rym M'Hallah:
Special issue on knapsack problems and applications. Comput. Oper. Res. 39(1): 1-2 (2012) - [j40]Mhand Hifi, Lei Wu:
An equivalent Model for Exactly Solving the Multiple-choise Multidimensional Knapsack Problem. Int. J. Comb. Optim. Probl. Informatics 3(3): 43-58 (2012) - [c4]Didier El Baz, Mhand Hifi, Toufik Saadi:
Peer-to-Peer Solution of 2D Cutting Stocks Problems. CTW 2012: 116-120 - [c3]Hakim Akeb, Mhand Hifi, Dominique Lazure:
An Improved Algorithm for the Strip Packing Problem. FedCSIS 2012: 357-364 - 2011
- [j39]Hakim Akeb, Mhand Hifi, Mohamed Elhafedh Ould Ahmed Mounir:
Local branching-based algorithms for the disjunctively constrained knapsack problem. Comput. Ind. Eng. 60(4): 811-820 (2011) - [j38]Hakim Akeb, Mhand Hifi, Stéphane Nègre:
An augmented beam search-based algorithm for the circular open dimension problem. Comput. Ind. Eng. 61(2): 373-381 (2011) - [j37]Intesar M. Al-Mudahka, Mhand Hifi, Rym M'Hallah:
Packing circles in the smallest circle: an adaptive hybrid algorithm. J. Oper. Res. Soc. 62(11): 1917-1930 (2011) - [c2]Mhand Hifi, Toufik Saadi, Nawel Haddadou:
High Performance Peer-to-Peer Distributed Computing with Application to Constrained Two-Dimensional Guillotine Cutting Problem. PDP 2011: 552-559 - 2010
- [j36]N. Cherfi, Mhand Hifi:
A column generation method for the multiple-choice multi-dimensional knapsack problem. Comput. Optim. Appl. 46(1): 51-73 (2010) - [j35]Mhand Hifi, Hedi M'Halla:
Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study. Electron. Notes Discret. Math. 36: 439-446 (2010) - [j34]Mhand Hifi, Imed Kacem, Stéphane Nègre, Lei Wu:
A Linear Programming Approach for the Three-Dimensional Bin-Packing Problem. Electron. Notes Discret. Math. 36: 993-1000 (2010) - [j33]Hakim Akeb, Mhand Hifi, Rym M'Hallah:
Adaptive beam search lookahead algorithms for the circular packing problem. Int. Trans. Oper. Res. 17(5): 553-575 (2010) - [j32]Hakim Akeb, Mhand Hifi:
A hybrid beam search looking-ahead algorithm for the circular packing problem. J. Comb. Optim. 20(2): 101-130 (2010)
2000 – 2009
- 2009
- [j31]Mhand Hifi, Rym M'Hallah:
A Literature Review on Circle and Sphere Packing Problems: Models and Methodologies. Adv. Oper. Res. 2009: 150624:1-150624:22 (2009) - [j30]Mhand Hifi, Rym M'Hallah, Toufik Saadi:
Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem. Comput. Optim. Appl. 42(2): 303-326 (2009) - [j29]Hakim Akeb, Mhand Hifi, Rym M'Hallah:
A beam search algorithm for the circular packing problem. Comput. Oper. Res. 36(5): 1513-1528 (2009) - [j28]Mhand Hifi, Rym M'Hallah:
Beam search and non-linear programming tools for the circular packing problem. Int. J. Math. Oper. Res. 1(4): 476-503 (2009) - 2008
- [j27]Mhand Hifi, Rym M'Hallah:
Adaptive and restarting techniques-based algorithms for circular packing problems. Comput. Optim. Appl. 39(1): 17-35 (2008) - [j26]Tarik Belgacem, Mhand Hifi:
Sensitivity analysis of the knapsack sharing problem: Perturbation of the weight of an item. Comput. Oper. Res. 35(1): 295-308 (2008) - [j25]Tarik Belgacem, Mhand Hifi:
Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem. Discret. Optim. 5(4): 755-761 (2008) - [j24]Mhand Hifi, Rym M'Hallah, Toufik Saadi:
Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem. INFORMS J. Comput. 20(2): 212-221 (2008) - [j23]Tarik Belgacem, Mhand Hifi:
Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item. Int. Trans. Oper. Res. 15(1): 35-49 (2008) - [j22]Hakim Akeb, Mhand Hifi:
Algorithms for the circular two-dimensional open dimension problem. Int. Trans. Oper. Res. 15(6): 685-704 (2008) - [c1]Defu Zhang, Mhand Hifi, Qingshan Chen, Weiguo Ye:
A Hybrid Credit Scoring Model Based on Genetic Programming and Support Vector Machines. ICNC (7) 2008: 8-12 - 2007
- [j21]Mhand Hifi, M. Michrafy:
Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem. Comput. Oper. Res. 34(9): 2657-2673 (2007) - [j20]Mhand Hifi, Rym M'Hallah:
A dynamic adaptive local search algorithm for the circular packing problem. Eur. J. Oper. Res. 183(3): 1280-1294 (2007) - 2006
- [j19]Mhand Hifi, M. Michrafy, Abdelkader Sbihi:
A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem. Comput. Optim. Appl. 33(2-3): 271-285 (2006) - [j18]Mhand Hifi, Rym M'Hallah:
Strip generation algorithms for constrained two-dimensional two-staged cutting problems. Eur. J. Oper. Res. 172(2): 515-527 (2006) - [j17]Mhand Hifi, M. Michrafy:
A reactive local search-based algorithm for the disjunctively constrained knapsack problem. J. Oper. Res. Soc. 57(6): 718-726 (2006) - 2005
- [j16]Mhand Hifi, Hedi M'Halla, Slim Sadfi:
An exact algorithm for the knapsack sharing problem. Comput. Oper. Res. 32: 1311-1324 (2005) - [j15]Mhand Hifi, Rym M'Hallah:
An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems. Oper. Res. 53(1): 140-150 (2005) - [j14]Mhand Hifi, Hedi M'Halla, Slim Sadfi:
Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem. J. Comb. Optim. 10(3): 239-260 (2005) - 2004
- [j13]Mhand Hifi:
Exact algorithms for unconstrained three-dimensional cutting problems: a comparative study. Comput. Oper. Res. 31(5): 657-674 (2004) - [j12]Mhand Hifi, Rym M'Hallah:
Approximate algorithms for constrained circular cutting problems. Comput. Oper. Res. 31(5): 675-694 (2004) - [j11]Mhand Hifi, Vangelis Th. Paschos, Vassilis Zissimopoulos:
A simulated annealing approach for the circular cutting problem. Eur. J. Oper. Res. 159(2): 430-448 (2004) - [j10]Mhand Hifi:
Dynamic Programming and Hill-Climbing Techniques for Constrained Two-Dimensional Cutting Stock Problems. J. Comb. Optim. 8(1): 65-84 (2004) - [j9]Mhand Hifi, M. Michrafy, Abdelkader Sbihi:
Heuristic algorithms for the multiple-choice multidimensional knapsack problem. J. Oper. Res. Soc. 55(12): 1323-1332 (2004) - 2002
- [j8]Mhand Hifi, Slim Sadfi, Abdelkader Sbihi:
An Efficient Algorithm for the Knapsack Sharing Problem. Comput. Optim. Appl. 23(1): 27-45 (2002) - [j7]Mhand Hifi, Slim Sadfi:
The Knapsack Sharing Problem: An Exact Algorithm. J. Comb. Optim. 6(1): 35-54 (2002) - [j6]Mhand Hifi, Rym M'Hallah:
A Best-Local Position Procedure-Based Heuristic for Two-Dimensional Layout Problems. Stud. Inform. Univ. 2(1): 33-56 (2002) - 2001
- [j5]Mhand Hifi:
Exact Algorithms for Large-Scale Unconstrained Two and Three Staged Cutting Problems. Comput. Optim. Appl. 18(1): 63-88 (2001) - [j4]Mhand Hifi, Catherine Roucairol:
Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems. J. Comb. Optim. 5(4): 465-494 (2001)
1990 – 1999
- 1998
- [j3]Mhand Hifi:
Exact algorithms for the guillotine strip cutting/packing problem. Comput. Oper. Res. 25(11): 925-940 (1998) - [j2]Didier Fayard, Mhand Hifi, Vassilis Zissimopoulos:
An efficient approach for large-scale two-dimensional guillotine cutting stock problems. J. Oper. Res. Soc. 49(12): 1270-1277 (1998) - 1997
- [j1]Mhand Hifi:
An improvement of viswanathan and bagchi's exact algorithm for constrained two-dimensional cutting stock. Comput. Oper. Res. 24(8): 727-736 (1997)
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 2024-07-05 20:15 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:
