Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbdel Lisser
Person information
- affiliation: CentraleSupelec Paris, France
- affiliation (former): University of Paris-Sud, LRI
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j74]Dawen Wu
, Abdel Lisser:
Solving Constrained Pseudoconvex Optimization Problems with deep learning-based neurodynamic optimization. Math. Comput. Simul. 219: 424-434 (2024)- [j73]Dawen Wu, Abdel Lisser:
Predicting Nash Equilibria in Bimatrix Games Using a Robust Bichannel Convolutional Neural Network. IEEE Trans. Artif. Intell. 5(5): 2358-2370 (2024) - 2023
- [j72]V. Varagapriya, Vikas Vikram Singh, Abdel Lisser:
Joint chance-constrained Markov decision processes. Ann. Oper. Res. 322(2): 1013-1035 (2023) - [j71]Rossana Riccardi, Giorgia Oggioni, Elisabetta Allevi, Abdel Lisser:
Complementarity formulation of games with random payoffs. Comput. Manag. Sci. 20(1): 35 (2023) - [j70]Dawen Wu, Abdel Lisser:
Improved saddle point prediction in stochastic two-player zero-sum games with a deep learning approach. Eng. Appl. Artif. Intell. 126: 106664 (2023) - [j69]Dawen Wu, Abdel Lisser:
A deep learning approach for solving linear programming problems. Neurocomputing 520: 15-24 (2023) - [j68]Dawen Wu, Abdel Lisser:
CCGnet: A deep learning approach to predict Nash equilibrium of chance-constrained games. Inf. Sci. 627: 20-33 (2023) - [j67]Siham Tassouli, Abdel Lisser:
A neural network approach to solve geometric programs with joint probabilistic constraints. Math. Comput. Simul. 205: 765-777 (2023) - [j66]Dawen Wu, Abdel Lisser:
Enhancing neurodynamic approach with physics-informed neural networks for solving non-smooth convex optimization problems. Neural Networks 168: 419-430 (2023) - [j65]Tian Xia, Jia Liu, Abdel Lisser:
Distributionally robust chance constrained games under Wasserstein ball. Oper. Res. Lett. 51(3): 315-321 (2023) - [j64]Shangyuan Zhang, Makhlouf Hadji, Abdel Lisser, Yacine Mezali:
Variational Inequality for n-Player Strategic Chance-Constrained Games. SN Comput. Sci. 4(1): 82 (2023) - [j63]Shangyuan Zhang, Makhlouf Hadji, Abdel Lisser, Yacine Mezali:
Stochastic Optimization of Adaptive Cruise Control. SN Comput. Sci. 4(2): 111 (2023) - [j62]Pablo Adasme, Abdel Lisser:
A stochastic geometric programming approach for power allocation in wireless networks. Wirel. Networks 29(5): 2235-2250 (2023) - 2022
- [j61]Shen Peng, Francesca Maggioni, Abdel Lisser:
Bounds for probabilistic programming with application to a blend planning problem. Eur. J. Oper. Res. 297(3): 964-976 (2022) - [j60]Dawen Wu, Abdel Lisser:
Using CNN for solving two-player zero-sum games. Expert Syst. Appl. 204: 117545 (2022) - [j59]Hoang Nam Nguyen, Abdel Lisser, Vikas Vikram Singh:
Random Games Under Elliptically Distributed Dependent Joint Chance Constraints. J. Optim. Theory Appl. 195(1): 249-264 (2022) - [j58]Jia Liu, Abdel Lisser, Zhiping Chen:
Distributionally Robust Chance Constrained Geometric Optimization. Math. Oper. Res. 47(4): 2950-2988 (2022) - [j57]Dawen Wu, Abdel Lisser:
A dynamical neural network approach for solving stochastic two-player zero-sum games. Neural Networks 152: 140-149 (2022) - [j56]Dawen Wu, Abdel Lisser:
MG-CNN: A deep CNN to predict saddle points of matrix games. Neural Networks 156: 49-57 (2022) - [j55]V. Varagapriya, Vikas Vikram Singh, Abdel Lisser:
Constrained Markov decision processes with uncertain costs. Oper. Res. Lett. 50(2): 218-223 (2022) - 2021
- [j54]Shen Peng, Navnit Yadav, Abdel Lisser, Vikas Vikram Singh:
Chance-constrained games with mixture distributions. Math. Methods Oper. Res. 94(1): 71-97 (2021) - [j53]Shen Peng, Abdel Lisser, Vikas Vikram Singh, Nalin Gupta, Eshan Balachandar:
Games with distributionally robust joint chance constraints. Optim. Lett. 15(6): 1931-1953 (2021) - 2020
- [j52]Zhiping Chen, Shen Peng, Abdel Lisser:
A sparse chance constrained portfolio selection model with multiple constraints. J. Glob. Optim. 77(4): 825-852 (2020) - 2019
- [j51]Immanuel M. Bomze, Jianqiang Cheng, Peter J. C. Dickinson, Abdel Lisser, Jia Liu:
Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches. Comput. Manag. Sci. 16(4): 593-619 (2019) - [j50]Vikas Vikram Singh, Abdel Lisser:
A second-order cone programming formulation for two player zero-sum games with chance constraints. Eur. J. Oper. Res. 275(3): 839-845 (2019) - [j49]Jianqiang Cheng, Céline Gicquel, Abdel Lisser:
Partial sample average approximation method for chance constrained problems. Optim. Lett. 13(4): 657-672 (2019) - 2018
- [j48]Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser:
Improved solution strategies for dominating trees. Expert Syst. Appl. 100: 30-40 (2018) - [j47]Vikas Vikram Singh, Abdel Lisser:
Variational inequality formulation for the games with random payoffs. J. Glob. Optim. 72(4): 743-760 (2018) - [j46]Vikas Vikram Singh, Abdel Lisser:
A Characterization of Nash Equilibrium for the Games with Random Payoffs. J. Optim. Theory Appl. 178(3): 998-1013 (2018) - [j45]Shen Peng, Vikas Vikram Singh, Abdel Lisser:
General sum games with joint chance constraints. Oper. Res. Lett. 46(5): 482-486 (2018) - 2017
- [j44]Pablo Adasme, Rafael Andrade, Abdel Lisser:
Minimum cost dominating tree sensor networks under probabilistic constraints. Comput. Networks 112: 208-222 (2017) - [j43]Immanuel M. Bomze, Jianqiang Cheng, Peter J. C. Dickinson, Abdel Lisser:
A fresh CP look at mixed-binary QPs: new formulations and relaxations. Math. Program. 166(1-2): 159-184 (2017) - [j42]Vikas Vikram Singh, Oualid Jouini, Abdel Lisser:
Distributionally robust chance-constrained games: existence and characterization of Nash equilibrium. Optim. Lett. 11(7): 1385-1405 (2017) - 2016
- [j41]Jianqiang Cheng, Janny Leung, Abdel Lisser:
New reformulations of distributionally robust shortest path problem. Comput. Oper. Res. 74: 196-204 (2016) - [j40]Pablo Adasme, Janny Leung, Abdel Lisser:
Resource allocation in uplink wireless multi-cell OFDMA networks. Comput. Stand. Interfaces 44: 274-289 (2016) - [j39]Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser:
Models for minimum cost dominating trees. Electron. Notes Discret. Math. 52: 101-107 (2016) - [j38]Jinqiang Cheng, Abdel Lisser, Janny Leung:
Stochastic nonlinear resource allocation problem. Electron. Notes Discret. Math. 52: 165-172 (2016) - [j37]Jia Liu, Abdel Lisser, Zhiping Chen:
Stochastic geometric programming with joint probabilistic constraints. Electron. Notes Discret. Math. 55: 49-52 (2016) - [j36]Vikas Vikram Singh, Oualid Jouini, Abdel Lisser:
Equivalent Nonlinear Complementarity Problem for Chance-constrained Games. Electron. Notes Discret. Math. 55: 151-154 (2016) - [j35]Jianqiang Cheng, Janny Leung, Abdel Lisser:
Random-payoff two-person zero-sum game with joint chance constraints. Eur. J. Oper. Res. 252(1): 213-219 (2016) - [j34]Pablo Adasme, Abdel Lisser:
A computational study for bilevel quadratic programs using semidefinite relaxations. Eur. J. Oper. Res. 254(1): 9-18 (2016) - [j33]Vikas Vikram Singh, Oualid Jouini, Abdel Lisser:
Existence of Nash equilibrium for chance-constrained games. Oper. Res. Lett. 44(5): 640-644 (2016) - [j32]Jia Liu, Abdel Lisser, Zhiping Chen:
Stochastic geometric optimization with joint probabilistic constraints. Oper. Res. Lett. 44(5): 687-691 (2016) - [j31]Pablo Adasme, Abdel Lisser:
Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks. J. Sched. 19(3): 349-366 (2016) - 2015
- [j30]Agnès Gorge, Abdel Lisser, Riadh Zorgati:
Generating cutting planes for the semidefinite relaxation of quadratic programs. Comput. Oper. Res. 55: 65-75 (2015) - [j29]Jianqiang Cheng, Abdel Lisser:
Maximum probability shortest path problem. Discret. Appl. Math. 192: 40-48 (2015) - [j28]Pablo Adasme, Rafael Andrade, Marc Letournel, Abdel Lisser:
Stochastic maximum weight forest problem. Networks 65(4): 289-305 (2015) - [j27]Jianqiang Cheng, Michal Houda, Abdel Lisser:
Chance constrained 0-1 quadratic programs using copulas. Optim. Lett. 9(7): 1283-1295 (2015) - [j26]Claudio Valencia Cordero, Abdel Lisser:
Jamming Attacks Reliable Prevention in a Clustered Wireless Sensor Network. Wirel. Pers. Commun. 85(3): 925-936 (2015) - 2014
- [j25]Céline Gicquel, Abdel Lisser, Michel Minoux:
An evaluation of semidefinite programming based approaches for discrete lot-sizing problems. Eur. J. Oper. Res. 237(2): 498-507 (2014) - [j24]Pablo Adasme, Abdel Lisser:
Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks. J. Sched. 17(5): 445-469 (2014) - [j23]Jianqiang Cheng, Erick Delage, Abdel Lisser:
Distributionally Robust Stochastic Knapsack Problem. SIAM J. Optim. 24(3): 1485-1506 (2014) - 2013
- [j22]Pablo Adasme, Rafael Andrade, Marc Letournel, Abdel Lisser:
A polynomial formulation for the stochastic maximum weight forest problem. Electron. Notes Discret. Math. 41: 29-36 (2013) - [j21]Jianqiang Cheng, Abdel Lisser, Marc Letournel:
Distributionally robust stochastic shortest path problem. Electron. Notes Discret. Math. 41: 511-518 (2013) - [j20]Jianqiang Cheng, Abdel Lisser:
A completely positive representation of 0-1 linear programs with joint probabilistic constraints. Oper. Res. Lett. 41(6): 597-601 (2013) - 2012
- [j19]Rafael Andrade, Abdel Lisser, Nelson Maculan:
Multi-service multi-facility network design under uncertainty. Ann. Oper. Res. 199(1): 157-178 (2012) - [j18]Agnès Gorge, Abdel Lisser, Riadh Zorgati:
Stochastic nuclear outages semidefinite relaxations. Comput. Manag. Sci. 9(3): 363-379 (2012) - [j17]Pablo Adasme, Abdel Lisser, Ismael Soto:
A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access. Networks 59(1): 3-12 (2012) - [j16]Stefanie Kosuch, Pierre Le Bodic, Janny Leung, Abdel Lisser:
On a stochastic bilevel programming problem. Networks 59(1): 107-116 (2012) - [j15]Jianqiang Cheng, Abdel Lisser:
A second-order cone programming approach for linear programs with joint probabilistic constraints. Oper. Res. Lett. 40(5): 325-328 (2012) - 2011
- [j14]Pablo Adasme, Abdel Lisser, Ismael Soto:
Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme. Comput. Oper. Res. 38(10): 1377-1399 (2011) - [j13]Stefanie Kosuch, Abdel Lisser:
On two-stage stochastic knapsack problems. Discret. Appl. Math. 159(16): 1827-1841 (2011) - [j12]Pablo Adasme, Abdel Lisser, Ismael Soto:
A Two Stage Stochastic Semidefinite Relaxation for wireless OFDMA Networks. Electron. Notes Discret. Math. 37: 69-74 (2011) - [j11]Alexei A. Gaivoronski, Abdel Lisser, Rafael Lopez, Hu Xu:
Knapsack problem with probability constraints. J. Glob. Optim. 49(3): 397-413 (2011) - 2010
- [j10]Stefanie Kosuch, Abdel Lisser:
Upper bounds for the 0-1 stochastic knapsack problem and a B&B algorithm. Ann. Oper. Res. 176(1): 77-93 (2010) - [j9]Abdel Lisser, Rafael Lopez:
Stochastic Quadratic Knapsack with Recourse. Electron. Notes Discret. Math. 36: 97-104 (2010) - [j8]Stefanie Kosuch, Abdel Lisser:
Stochastic Shortest Path Problem with Delay Excess Penalty. Electron. Notes Discret. Math. 36: 511-518 (2010) - [j7]Pablo Adasme, Abdel Lisser:
Semidefinite and Conic Programming for Robust wireless OFDMA networks. Electron. Notes Discret. Math. 36: 1225-1232 (2010) - [j6]Abdel Lisser, Rafael Lopez:
Application of semi definite relaxation and variable neighborhood search for multiuser detection in synchronous CDMA. Networks 55(3): 187-193 (2010) - 2006
- [j5]Rafael Andrade, Abdel Lisser, Nelson Maculan, Gérard Plateau:
Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models. Manag. Sci. 52(9): 1450-1455 (2006) - 2005
- [j4]Rafael Andrade, Abdel Lisser, Nelson Maculan, Gérard Plateau:
B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty. Ann. Oper. Res. 140(1): 49-65 (2005) - 2004
- [j3]Rafael Andrade, Abdel Lisser, Nelson Maculan, Gérard Plateau:
Telecommunication Network Capacity Design for Uncertain Demand. Comput. Optim. Appl. 29(2): 127-146 (2004) - 2003
- [j2]Abdel Lisser, Franz Rendl:
Graph partitioning using linear and semidefinite programming. Math. Program. 95(1): 91-101 (2003) - 2002
- [j1]Pierre Chardaire, Abdel Lisser:
Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems. Oper. Res. 50(2): 260-276 (2002)
Conference and Workshop Papers
- 2024
- [c38]Siham Tassouli, Abdel Lisser:
A Neurodynamic Duplex for Distributionally Robust Joint Chance-Constrained Optimization. ICORES 2024: 15-24 - 2023
- [c37]Mohammed Abdullah, Salah-Eddine Elayoubi, Tijani Chahed, Abdel Lisser:
Performance Modeling and Dimensioning of Latency-Critical Traffic in 5G Networks. GLOBECOM 2023: 4307-4312 - [c36]Shangyuan Zhang, Makhlouf Hadji, Abdel Lisser:
Distributionally Robust Optimization of Adaptive Cruise Control Under Uncertainty. ICORES 2023: 71-81 - [c35]Siham Tassouli, Abdel Lisser:
Maximizing Signal to Interference Noise Ratio for Massive MIMO: A Stochastic Neurodynamic Approach. MobiWIS 2023: 221-234 - 2022
- [c34]Shangyuan Zhang, Makhlouf Hadji, Abdel Lisser, Yacine Mezali:
Nonlinear Complementarity Problems for n-Player Strategic Chance-constrained Games. ICORES 2022: 94-104 - [c33]Shangyuan Zhang, Makhlouf Hadji, Abdel Lisser, Yacine Mezali:
Optimization of Adaptive Cruise Control under Uncertainty. ICORES 2022: 278-285 - [c32]Shangyuan Zhang, Makhlouf Hadji, Abdel Lisser:
Optimal Control Based Trajectory Planning Under Uncertainty. INTSYS 2022: 73-88 - 2019
- [c31]Pablo Adasme, Abdel Lisser:
A Variable Neighborhood Search Algorithm for Massive MIMO Resource Allocation. MobiWIS 2019: 3-15 - 2017
- [c30]Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser:
On a Traveling Salesman based Bilevel Programming Problem. ICORES 2017: 329-336 - 2016
- [c29]Vikas Vikram Singh, Oualid Jouini, Abdel Lisser:
Solving Chance-Constrained Games Using Complementarity Problems. ICORES (Selected Papers) 2016: 52-67 - [c28]Vikas Vikram Singh, Oualid Jouini, Abdel Lisser:
A Complementarity Problem Formulation for Chance-constraine Games. ICORES 2016: 58-67 - [c27]Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser:
A Two-stage Stochastic Programming Approach for the Traveling Salesman Problem. ICORES 2016: 163-169 - 2015
- [c26]Mathilde Excoffier, Céline Gicquel, Oualid Jouini, Abdel Lisser:
Distributionally Robust Optimization for Scheduling Problem in Call Centers with Uncertain Forecasts. ICORES (Selected Papers) 2015: 3-20 - [c25]Mathilde Excoffier, Céline Gicquel, Oualid Jouini, Abdel Lisser:
Scheduling Problem in Call Centers with Uncertain Arrival Rates Forecasts - A Distributionally Robust Approach. ICORES 2015: 5-13 - [c24]Chuan Xu, Jianqiang Cheng, Abdel Lisser:
A Sampling Method to Chance-constrained Semidefinite Optimization. ICORES 2015: 75-81 - [c23]Chuan Xu, Jianqiang Cheng, Abdel Lisser:
Stochastic Semidefinite Optimization Using Sampling Methods. ICORES (Selected Papers) 2015: 93-103 - [c22]Pablo Adasme, Rafael Andrade, Janny Leung, Abdel Lisser:
A Comparative Study of Network-based Approaches for Routing in Healthcare Wireless Body Area Networks. ICORES 2015: 125-132 - [c21]Pablo Adasme, Abdel Lisser:
Piecewise Linear Formulations for Downlink Wireless OFDMA Networks. MobiWIS 2015: 102-114 - 2014
- [c20]Belarmino Nuñez, Pablo Adasme, Ismael Soto, Jianqiang Cheng, Marc Letournel, Abdel Lisser:
A chance constrained approach for uplink wireless OFDMA networks. CSNDSP 2014: 754-757 - [c19]Michal Houda, Abdel Lisser:
On the Use of Copulas in Joint Chance-constrained Programming. ICORES 2014: 72-79 - [c18]Mathilde Excoffier, Céline Gicquel, Oualid Jouini, Abdel Lisser:
A Stochastic Programming Approach for Staffing and Scheduling Call Centers with Uncertain Demand Forecasts. ICORES 2014: 80-88 - [c17]Michal Houda, Abdel Lisser:
Archimedean Copulas in Joint Chance-Constrained Programming. ICORES (Selected Papers) 2014: 126-139 - [c16]Mathilde Excoffier, Céline Gicquel, Oualid Jouini, Abdel Lisser:
Comparison of Stochastic Programming Approaches for Staffing and Scheduling Call Centers with Uncertain Demand Forecasts. ICORES (Selected Papers) 2014: 140-156 - [c15]Chuan Xu, Abdel Lisser, Janny Leung, Marc Letournel:
The p-Median Problem with Concave Costs. ICORES 2014: 205-212 - [c14]Pablo Adasme, Abdel Lisser, Chuan Xu:
A Multicommodity Formulation for Routing in Healthcare Wireless Body Area Networks. ICORES 2014: 409-416 - [c13]Pablo Adasme, Abdel Lisser, Chen Wang:
Stochastic Resource Allocation for Uplink Wireless Multi-cell OFDMA Networks. MobiWIS 2014: 100-113 - 2013
- [c12]Pablo Adasme, Abdel Lisser, Chen Wang:
A Distributionally Robust Formulation for Stochastic Quadratic Bi-level Programming. ICORES 2013: 24-31 - 2012
- [c11]Pablo Adasme, Abdel Lisser:
A Semidefinite Relaxation Approach for Stochastic Bilevel Programming. CTW 2012: 5-8 - [c10]Jianqiang Cheng, Abdel Lisser:
Maximum Probability Problem in Stochastic Programming. CTW 2012: 76-79 - [c9]Jianqiang Cheng, Stefanie Kosuch, Abdel Lisser:
Stochastic Shortest Path Problem with Uncertain Delays. ICORES 2012: 256-264 - [c8]Abdel Lisser, Agnès Gorge, Riadh Zorgati:
Semidefinite Relaxations for the Scheduling Nuclear Outages Problem. ICORES 2012: 386-391 - [c7]Jianqiang Cheng, Céline Gicquel, Abdel Lisser:
A Second-Order Cone Programming Approximation to Joint Chance-Constrained Linear Programs. ISCO 2012: 71-80 - [c6]Agnès Gorge, Abdel Lisser, Riadh Zorgati:
Semidefinite Relaxations for Mixed 0-1 Second-Order Cone Program. ISCO 2012: 81-92 - 2011
- [c5]Hugo Rodríguez, Pablo Adasme, Abdel Lisser, Ismael Soto:
Computing Upper Bounds for a LBPP with and without Probabilistic Constraints. INOC 2011: 620-625 - [c4]Céline Gicquel, Abdel Lisser:
Tight lower bounds by semidefinite relaxations for the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs. OR 2011: 421-426 - 2010
- [c3]Pablo Adasme, Abdel Lisser:
Semidenite Programming for Stochastic Wireless OFDMA Networks. CTW 2010: 1-4 - [c2]Stefanie Kosuch, Marc Letournel, Abdel Lisser:
On a Stochastic Knapsack Problem. CTW 2010: 111-114 - 2009
- [c1]Stefanie Kosuch, Abdel Lisser:
On a Two-Stage Stochastic Knapsack Problem with Probabilistic Constraint. CTW 2009: 140-143
Parts in Books or Collections
- 2006
- [p1]Abdel Lisser, Philippe Mahey:
Multicommodity Flow Problems and Decomposition in Telecommunications Networks. Handbook of Optimization in Telecommunications 2006: 241-267
Reference Works
- 2009
- [r1]Pierre Chardaire, Abdel Lisser:
Nonoriented Multicommodity Flow Problems. Encyclopedia of Optimization 2009: 2647-2651
Informal and Other Publications
- 2015
- [i3]Pablo Adasme, Rafael Andrade, Abdel Lisser:
Probabilistic constrained dominating trees. CTW 2015: 59-62 - [i2]Vikas Vikram Singh, Oualid Jouini, Abdel Lisser:
Bi-matrix Game with Random Payoffs. CTW 2015: 113-116 - [i1]Chuan Xu, Alexei A. Gaivoronski, Abdel Lisser:
Stochastic bilevel network design problems. CTW 2015: 261-264
Coauthor Index
a service of 
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-06-03 00:14 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:
