default search action
Marco Locatelli 0001
Person information
- affiliation: University of Parma, Italy
- affiliation (1999 - 2009): University of Turin, Italy
- affiliation (1998 - 1999): University of Florence, Italy
- affiliation (1997 - 1998): University of Trier, Department of Mathematics, Germany
- affiliation (PhD 1996): University of Milan, Italy
Other persons with the same name
- Marco Locatelli 0002 — IRCCS University Hospital San Raffaele, Milan, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j101]Stefano Ardizzoni, Luca Consolini, Marco Locatelli, Irene Saccani:
Constrained Motion Planning and Multi-Agent Path Finding on directed graphs. Autom. 165: 111593 (2024) - [j100]Luca Consolini, Marco Locatelli:
Is time-optimal speed planning under jerk constraints a convex problem? Autom. 169: 111864 (2024) - [j99]Marco Locatelli
:
A new technique to derive tight convex underestimators (sometimes envelopes). Comput. Optim. Appl. 87(2): 475-499 (2024) - [j98]Manuel Iori, Alberto Locatelli
Tool switching problems with tool order constraints. Discret. Appl. Math. 347: 249-262 (2024) - [j97]Stefano Ardizzoni, Irene Saccani, Luca Consolini, Marco Locatelli, Bernhard Nebel:
An Algorithm with Improved Complexity for Pebble Motion/Multi-Agent Path Finding on Trees. J. Artif. Intell. Res. 79: 483-514 (2024) - [j96]Roberto Esposito, Mattia Cerrato, Marco Locatelli:
Partitioned least squares. Mach. Learn. 113(9): 6839-6869 (2024) - [j95]Marco Locatelli
A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools. Optim. Lett. 18(4): 873-887 (2024) - [j94]Luca Consolini
A Dynamic Programming Approach for Cooperative Pallet-Loading Manipulators. IEEE Trans Autom. Sci. Eng. 21(4): 5280-5296 (2024) - [i11]Giulia Di Credico, Luca Consolini, Mattia Laurini, Marco Locatelli, Marco Milanesi, Michele Schiavo, Antonio Visioli:
A Branch and Bound method for the exact parameter identification of the PK/PD model for anesthetic drugs. CoRR abs/2403.16742 (2024) - [i10]Mattia Laurini, Irene Saccani, Stefano Ardizzoni, Luca Consolini, Marco Locatelli:
A Dynamic Programming Approach for Road Traffic Estimation. CoRR abs/2403.18561 (2024) - [i9]Irene Saccani, Stefano Ardizzoni, Luca Consolini, Marco Locatelli:
Dynamic Programming based Local Search approaches for Multi-Agent Path Finding problems on Directed Graphs. CoRR abs/2410.07954 (2024) - 2023
- [j93]Manuel Iori
A GRASP for a real-world scheduling problem with unrelated parallel print machines and sequence-dependent setup times. Int. J. Prod. Res. 61(21): 7367-7385 (2023) - [j92]Marco Locatelli
KKT-based primal-dual exactness conditions for the Shor relaxation. J. Glob. Optim. 86(2): 285-301 (2023) - [j91]Luca Consolini, Marco Locatelli
Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem. SIAM J. Optim. 33(2): 868-898 (2023) - [j90]Stefano Ardizzoni
Solution Algorithms for the Bounded Acceleration Shortest Path Problem. IEEE Trans. Autom. Control. 68(3): 1910-1917 (2023) - [c23]Stefano Ardizzoni, Irene Saccani, Luca Consolini, Marco Locatelli:
Local Optimization of MAPF Solutions on Directed Graphs. CDC 2023: 8081-8086 - [c22]Alberto Locatelli
Setup Time Prediction Using Machine Learning Algorithms: A Real-World Case Study. APMS (3) 2023: 707-721 - [i8]Stefano Ardizzoni, Irene Saccani, Luca Consolini, Marco Locatelli, Bernhard Nebel:
An algorithm with improved complexity for pebble motion/multi-agent path finding on trees. CoRR abs/2307.12770 (2023) - 2022
- [j89]Stefano Ardizzoni, Luca Consolini, Mattia Laurini
Shortest path with acceleration constraints: complexity and approximation algorithms. Comput. Optim. Appl. 83(2): 555-592 (2022) - [j88]Marco Locatelli
Exact and approximate results for convex envelopes of special structured functions over simplices. J. Glob. Optim. 83(2): 201-220 (2022) - [j87]Giampaolo Liuzzi, Marco Locatelli
A computational study on QP problems with general linear constraints. Optim. Lett. 16(6): 1633-1647 (2022) - [j86]Luca Consolini
A Sequential Algorithm for Jerk Limited Speed Planning. IEEE Trans Autom. Sci. Eng. 19(4): 3192-3209 (2022) - [c21]Stefano Ardizzoni, Irene Saccani, Luca Consolini, Marco Locatelli:
Multi-Agent Path Finding on Strongly Connected Digraphs. CDC 2022: 7194-7199 - [c20]Manuel Iori
Tool Switching Problems in the Context of Overlay Printing with Multiple Colours. ISCO 2022: 260-271 - [i7]Stefano Ardizzoni, Irene Saccani, Luca Consolini, Marco Locatelli:
Multi-Agent Path Finding on Strongly Connected Digraphs: feasibility and solution algorithms. CoRR abs/2209.04286 (2022) - [i6]Stefano Ardizzoni, Luca Consolini, Marco Locatelli, Irene Saccani:
Constrained Multi-Agent Path Finding on Directed Graphs. CoRR abs/2209.12506 (2022) - 2021
- [j85]Giampaolo Liuzzi, Marco Locatelli
Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems. Comput. Optim. Appl. 79(3): 561-599 (2021) - [j84]Marco Locatelli
(Global) Optimization: Historical notes and recent developments. EURO J. Comput. Optim. 9: 100012 (2021) - [j83]Mattia Laurini
Optimizing Cooperative Pallet Loading Robots: A Mixed Integer Approach. IEEE Robotics Autom. Lett. 6(3): 5300-5307 (2021) - [j82]Mattia Laurini
A Graph-Based Algorithm for Optimal Control of Switched Systems: An Application to Car Parking. IEEE Trans. Autom. Control. 66(12): 6049-6055 (2021) - [c19]Stefano Ardizzoni, Luca Consolini, Mattia Laurini
Efficient solution algorithms for the Bounded Acceleration Shortest Path problem. CDC 2021: 5729-5734 - [c18]Manuel Iori
Scheduling of Parallel Print Machines with Sequence-Dependent Setup Costs: A Real-World Case Study. APMS (2) 2021: 637-645 - [i5]Stefano Ardizzoni, Luca Consolini, Mattia Laurini, Marco Locatelli:
The Bounded Acceleration Shortest Path problem: complexity and solution algorithms. CoRR abs/2103.02914 (2021) - 2020
- [j81]Luca Consolini, Marco Locatelli
Efficient local search procedures for quadratic fractional programming problems. Comput. Optim. Appl. 76(1): 201-232 (2020) - [j80]Luca Consolini, Mattia Laurini
A solution of the minimum-time speed planning problem based on lattice theory. J. Frankl. Inst. 357(12): 7617-7637 (2020) - [j79]Marco Locatelli
Convex envelope of bivariate cubic functions over rectangular regions. J. Glob. Optim. 76(1): 1-24 (2020) - [j78]Luca Consolini
Convergence Analysis of Spatial-Sampling-Based Algorithms for Time-Optimal Smooth Velocity Planning. J. Optim. Theory Appl. 184(3): 1083-1108 (2020) - [c17]Mattia Laurini
Fast numerical solution of optimal control problems for switched systems: An application to path planning. CDC 2020: 4105-4110 - [c16]Manuel Iori
Reactive GRASP-Based Algorithm for Pallet Building Problem with Visibility and Contiguity Constraints. ICCL 2020: 651-665 - [c15]Manuel Iori
A Mixed Approach for Pallet Building Problem with Practical Constraints. ICEIS (Revised Selected Papers) 2020: 122-139 - [c14]Manuel Iori, Marco Locatelli, Mayron César O. Moreira
Solution of a Practical Pallet Building Problem with Visibility and Contiguity Constraints. ICEIS (1) 2020: 327-338 - [i4]Roberto Esposito, Mattia Cerrato, Marco Locatelli:
Partitioned Least Squares. CoRR abs/2006.16202 (2020)
2010 – 2019
- 2019
- [j77]Luca Consolini, Mattia Laurini
Graph-based algorithms for the efficient solution of optimization problems involving monotone functions. Comput. Optim. Appl. 73(1): 101-128 (2019) - [j76]Giampaolo Liuzzi
A new branch-and-bound algorithm for standard quadratic programming problems. Optim. Methods Softw. 34(1): 79-97 (2019) - [j75]Luca Consolini
Optimal Time-Complexity Speed Planning for Robot Manipulators. IEEE Trans. Robotics 35(3): 790-797 (2019) - [c13]Roberto Esposito
Partitioned Least Squares. AI*IA 2019: 180-192 - [i3]Luca Consolini, Mattia Laurini, Marco Locatelli, Dario Lodi Rizzini
Globally Optimal Registration based on Fast Branch and Bound. CoRR abs/1901.09641 (2019) - 2018
- [j74]Federico Cabassi, Luca Consolini, Marco Locatelli:
Time-optimal velocity planning by a bound-tightening technique. Comput. Optim. Appl. 70(1): 61-90 (2018) - [j73]Marco Locatelli:
Convex envelopes of bivariate functions through the solution of KKT systems. J. Glob. Optim. 72(2): 277-303 (2018) - [j72]Marco Locatelli:
Convex envelopes of separable functions over regions defined by separable functions of the same type. Optim. Lett. 12(8): 1725-1739 (2018) - [c12]Mattia Laurini
A Multigraph-Based Selective Update Method for the Efficient Solution of Dynamic Programming. CDC 2018: 5916-5921 - [i2]Luca Consolini, Marco Locatelli, Andrea Minari, Ákos Nagy, István Vajk:
Optimal time-complexity speed planning for robot manipulators. CoRR abs/1802.03294 (2018) - 2017
- [j71]Luca Consolini
On the complexity of quadratic programming with two quadratic constraints. Math. Program. 164(1-2): 91-128 (2017) - [j70]Luca Consolini, Marco Locatelli, Andrea Minari
An optimal complexity algorithm for minimum-time velocity planning. Syst. Control. Lett. 103: 50-57 (2017) - [j69]Luca Consolini, Marco Locatelli, Andrea Minari, Aurelio Piazzi:
Corrigendum to "An optimal complexity algorithm for minimum-time velocity planning" [Systems & Control Letters 103 (2017) 50-57]. Syst. Control. Lett. 108: 80 (2017) - [j68]Marco Locatelli
On the Complexity of Optimal Power Allocation in a Multi-Tone Multiuser Communication System. IEEE Trans. Inf. Theory 63(10): 6622-6627 (2017) - [c11]Piero Micelli, Luca Consolini, Marco Locatelli:
Path planning with limited numbers of maneuvers for automatic guided vehicles: An optimization-based approach. MED 2017: 204-209 - [c10]Francesco Denaro, Luca Consolini, Marco Locatelli:
A branch and bound approach for a class of non-convex problems with applications to robust regression. MED 2017: 382-387 - 2016
- [j67]Marco Locatelli, Fabio Schoen
Global optimization based on local searches. Ann. Oper. Res. 240(1): 251-270 (2016) - [j66]Alberto Caprara, Marco Locatelli, Michele Monaci
Theoretical and computational results about optimality-based domain reductions. Comput. Optim. Appl. 64(2): 513-533 (2016) - [j65]Federico Cabassi, Marco Locatelli:
Computational investigation of simple memetic approaches for continuous global optimization. Comput. Oper. Res. 72: 50-70 (2016) - [j64]Marco Locatelli:
Non polyhedral convex envelopes for 1-convex functions. J. Glob. Optim. 65(4): 637-655 (2016) - [j63]Marco Locatelli:
Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes. J. Glob. Optim. 66(4): 629-668 (2016) - [j62]Marco Locatelli:
Exactness conditions for an SDP relaxation of the extended trust region problem. Optim. Lett. 10(6): 1141-1151 (2016) - [c9]Mattia Laurini
A Jacobi-like acceleration for dynamic programming. CDC 2016: 7371-7376 - [c8]Luca Consolini
A linear-time algorithm for minimum-time velocity planning of autonomous vehicles. MED 2016: 490-495 - [c7]Marina Raineri
A real-time strategy for the management of kinematic singularities: New progresses. MMAR 2016: 345-350 - 2015
- [j61]Marco Locatelli
Improving upper bounds for the clique number by non-valid inequalities. Math. Program. 150(2): 511-525 (2015) - [j60]Marco Locatelli
(Non) convergence results for the differential evolution method. Optim. Lett. 9(3): 413-425 (2015) - [j59]Marco Locatelli
Alternative branching rules for some nonconvex problems. Optim. Methods Softw. 30(2): 365-378 (2015) - [j58]Marco Locatelli
Some results for quadratic problems with one or two quadratic constraints. Oper. Res. Lett. 43(2): 126-131 (2015) - [j57]Marco Locatelli
Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex. SIAM J. Optim. 25(1): 589-621 (2015) - [c6]Simone Perri, Corrado Guarino Lo Bianco
Jerk bounded velocity planner for the online management of autonomous vehicles. CASE 2015: 618-625 - [c5]Federico Cabassi, Marco Locatelli:
A Computational Comparison of Memetic Differential Evolution Approaches. GECCO (Companion) 2015: 1181-1184 - 2014
- [j56]Marco Locatelli
Differential evolution methods based on local searches. Comput. Oper. Res. 43: 169-180 (2014) - [j55]Marco Locatelli
A technique to derive the analytical form of convex envelopes for some bivariate functions. J. Glob. Optim. 59(2-3): 477-501 (2014) - [j54]Marco Locatelli
On convex envelopes for bivariate functions over polytopes. Math. Program. 144(1-2): 65-91 (2014) - 2013
- [b1]Marco Locatelli, Fabio Schoen:
Global Optimization - Theory, Algorithms, and Applications. MOS-SIAM Series on Optimization 15, SIAM 2013, ISBN 978-1-61197-266-5, pp. I-VI, 1-437 - [j53]Marco Locatelli
Global optimization based on local searches. 4OR 11(4): 301-321 (2013) - [j52]Andrea Cassioli, Luca Consolini
Optimization and homotopy methods for the Gibbs free energy of simple magmatic mixtures. Comput. Optim. Appl. 55(2): 427-457 (2013) - [j51]Marco Locatelli
Approximation algorithm for a class of global optimization problems. J. Glob. Optim. 55(1): 13-25 (2013) - [j50]Marco Locatelli
Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program. Oper. Res. Lett. 41(4): 370-372 (2013) - [p1]Marco Locatelli
Global Optimization for Atomic Cluster Distance Geometry Problems. Distance Geometry 2013: 197-212 - 2012
- [j49]Andrea Cassioli, David Di Lorenzo, Marco Locatelli
Machine learning for global optimization. Comput. Optim. Appl. 51(1): 279-303 (2012) - [j48]Marco Di Summa, Andrea Grosso, Marco Locatelli
Branch and cut algorithms for detecting critical nodes in undirected graphs. Comput. Optim. Appl. 53(3): 649-680 (2012) - [j47]Marco Locatelli
Local search based heuristics for global optimization: Atomic clusters and beyond. Eur. J. Oper. Res. 222(1): 1-9 (2012) - [j46]Marco Locatelli
On the relation between concavity cuts and the surrogate dual for convex maximization problems. J. Glob. Optim. 52(3): 411-421 (2012) - [j45]Immanuel M. Bomze
Separable standard quadratic optimization problems. Optim. Lett. 6(5): 857-866 (2012) - 2011
- [j44]Bernardetta Addis
A global optimization method for the design of space trajectories. Comput. Optim. Appl. 48(3): 635-652 (2011) - [j43]Andrea Cassioli, Marco Locatelli
A heuristic approach for packing identical rectangles in convex regions. Comput. Oper. Res. 38(9): 1342-1350 (2011) - [j42]Marco Di Summa, Andrea Grosso, Marco Locatelli
Complexity of the critical node problem over trees. Comput. Oper. Res. 38(12): 1766-1774 (2011) - [j41]Daniele Depetrini, Marco Locatelli
Approximation of linear fractional-multiplicative problems. Math. Program. 128(1-2): 437-443 (2011) - [j40]Massimiliano Vasile
An Inflationary Differential Evolution Algorithm for Space Trajectory Optimization. IEEE Trans. Evol. Comput. 15(2): 267-281 (2011) - [i1]Massimiliano Vasile, Edmondo A. Minisci, Marco Locatelli:
An inflationary differential evolution algorithm for space trajectory optimization. CoRR abs/1104.4731 (2011) - 2010
- [j39]Andrea Cassioli, Marco Locatelli
Dissimilarity measures for population-based global optimization algorithms. Comput. Optim. Appl. 45(2): 257-281 (2010) - [j38]Andrea Grosso, A. R. M. J. U. Jamali, Marco Locatelli
Solving the problem of packing equal and unequal circles in a circular container. J. Glob. Optim. 47(1): 63-81 (2010) - [j37]Immanuel M. Bomze
Copositivity cuts for improving SDP bounds on the clique number. Math. Program. 124(1-2): 13-32 (2010) - [j36]Alberto Caprara, Marco Locatelli
Global optimization problems and domain reduction strategies. Math. Program. 125(1): 123-137 (2010)
2000 – 2009
- 2009
- [j35]Andrea Grosso, Marco Locatelli
Solving molecular distance geometry problems by global optimization algorithms. Comput. Optim. Appl. 43(1): 23-37 (2009) - [j34]Daniele Depetrini, Marco Locatelli
A FPTAS for a class of linear multiplicative problems. Comput. Optim. Appl. 44(2): 275-288 (2009) - [j33]Federico Della Croce
A heuristic approach for the max-min diversity problem based on max-clique. Comput. Oper. Res. 36(8): 2429-2433 (2009) - [j32]Andrea Grosso, A. R. M. J. U. Jamali, Marco Locatelli
Finding maximin latin hypercube designs by Iterated Local Search heuristics. Eur. J. Oper. Res. 197(2): 541-547 (2009) - [j31]Massimiliano Vasile
A hybrid multiagent approach for global trajectory optimization. J. Glob. Optim. 44(4): 461-479 (2009) - [j30]Andrea Cassioli, Marco Locatelli
Global optimization of binary Lennard-Jones clusters. Optim. Methods Softw. 24(4-5): 819-835 (2009) - [c4]Massimiliano Vasile
A dynamical system perspective on evolutionary heuristics applied to space trajectory optimization problems. IEEE Congress on Evolutionary Computation 2009: 2340-2347 - [c3]Marco Antognozzi, Andrea Bottino
RE-LIVING LAS VEGAS: A multi-user, mixed-reality edutainment environment based on the enhancement of original archival materials. VECIMS 2009: 292-297 - 2008
- [j29]Andrea Grosso, Marco Locatelli
Simple ingredients leading to very efficient heuristics for the maximum clique problem. J. Heuristics 14(6): 587-612 (2008) - [j28]Bernardetta Addis
Disk Packing in a Square: A New Global Optimization Approach. INFORMS J. Comput. 20(4): 516-524 (2008) - [j27]Immanuel M. Bomze
New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability. Math. Program. 115(1): 31-64 (2008) - [j26]Bernardetta Addis
Efficiently packing unequal disks in a circle. Oper. Res. Lett. 36(1): 37-42 (2008) - 2007
- [j25]Andrea Grosso, Marco Locatelli
An experimental analysis of a population based approach for global optimization. Comput. Optim. Appl. 38(3): 351-370 (2007) - [j24]Bernardetta Addis
A new class of test functions for global optimization. J. Glob. Optim. 38(3): 479-501 (2007) - [j23]Andrea Grosso, Marco Locatelli
A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity Measures. Math. Program. 110(2): 373-404 (2007) - 2006
- [j22]Giuliana Carello
A "maximum node clustering" problem. J. Comb. Optim. 11(4): 373-385 (2006) - 2005
- [j21]Marco Locatelli
On the Multilevel Structure of Global Optimization Problems. Comput. Optim. Appl. 30(1): 5-22 (2005) - [j20]Marco Locatelli
Objective Function Features Providing Barriers to Rapid Global Optimization. J. Glob. Optim. 31(4): 549-565 (2005) - [j19]Bernardetta Addis
Local optima smoothing for global optimization. Optim. Methods Softw. 20(4-5): 417-437 (2005) - [c2]Alberto Caprara, Marco Locatelli, Michele Monaci:
Bidimensional Packing by Bilinear Programming. IPCO 2005: 377-391 - 2004
- [j18]Immanuel M. Bomze
Undominated d.c. Decompositions of Quadratic Functions and Applications to Branch-and-Bound Approaches. Comput. Optim. Appl. 28(2): 227-245 (2004) - [j17]Andrea Grosso, Marco Locatelli
Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem. J. Heuristics 10(2): 135-152 (2004) - [j16]Jonathan P. K. Doye
Global Optimization of Morse Clusters by Potential Energy Transformations. INFORMS J. Comput. 16(4): 371-379 (2004) - [j15]Marco Locatelli
The combinatorics of pivoting for the maximum weight clique. Oper. Res. Lett. 32(6): 523-529 (2004) - 2003
- [j14]Marco Locatelli
Efficient Algorithms for Large Scale Global Optimization: Lennard-Jones Clusters. Comput. Optim. Appl. 26(2): 173-190 (2003) - [j13]Marco Locatelli
A Note on the Griewank Test Function. J. Glob. Optim. 25(2): 169-174 (2003) - [c1]Paolo Fosser, Roland Glantz, Marco Locatelli, Marcello Pelillo:
Swap Strategies for Graph Matching. GbRPR 2003: 142-153 - 2002
- [j12]Marco Locatelli
Fast Global Optimization of Difficult Lennard-Jones Clusters. Comput. Optim. Appl. 21(1): 55-70 (2002) - [j11]Marco Locatelli
Packing equal circles in a square: a deterministic global optimization approach. Discret. Appl. Math. 122(1-3): 139-166 (2002) - [j10]Marco Locatelli, Fabio Schoen:
Minimal interatomic distance in Morse clusters. J. Glob. Optim. 22(1-4): 175-190 (2002) - 2001
- [j9]Marco Locatelli
Convergence and first hitting time of simulated annealing algorithms for continuous global optimization. Math. Methods Oper. Res. 54(2): 171-199 (2001) - 2000
- [j8]Marco Locatelli, Nguyen V. Thoai:
Finite Exact Branch-and-Bound Algorithms for Concave Minimization over Polytopes. J. Glob. Optim. 18(2): 107-128 (2000) - [j7]Marco Locatelli:
Convergence of a Simulated Annealing Algorithm for Continuous Global Optimization. J. Glob. Optim. 18(3): 219-233 (2000)
1990 – 1999
- 1999
- [j6]Marco Locatelli, Fabio Schoen:
Random Linkage: a family of acceptance/rejection algorithms for global optimisation. Math. Program. 85(2): 379-396 (1999) - [j5]Marco Locatelli:
Finiteness of conical algorithms with ω-subdivisions. Math. Program. 85(3): 593-616 (1999) - 1998
- [j4]Marco Locatelli:
Relaxing the Assumptions of the Multilevel Single Linkage Algorithm. J. Glob. Optim. 13(1): 25-42 (1998) - 1997
- [j3]Marco Locatelli:
Bayesian Algorithms for One-Dimensional Global Optimization. J. Glob. Optim. 10(1): 57-76 (1997) - 1996
- [j2]Marco Locatelli, Fabio Schoen:
Simple linkage: Analysis of a threshold-accepting global optimization method. J. Glob. Optim. 9(1): 95-111 (1996) - 1995
- [j1]Marco Locatelli
An adaptive stochastic global optimization algorithm for one-dimensional functions. Ann. Oper. Res. 58(4): 261-278 (1995)
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-11-19 20:38 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: