default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeo Liberti
2020 – today
- 2025
[j126]Liding Xu, Leo Liberti:
Submodular maximization and its generalization through an intersection cut lens. Math. Program. 211(1): 341-377 (2025)- [j125]Liding Xu
, Claudia D'Ambrosio, Leo Liberti, Sonia Haddad-Vanier:
Cutting Planes for Signomial Programming. SIAM J. Optim. 35(2): 899-926 (2025) - 2024
- [j124]Germano Abud, Jorge Alencar, Carlile Lavor, Leo Liberti, Antonio Mucherino:
An impossible combinatorial counting method in distance geometry. Discret. Appl. Math. 354: 83-93 (2024) - [j123]Wagner Rocha, Leo Liberti, Antonio Mucherino, Thérèse E. Malliavin:
Influence of Stereochemistry in a Local Approach for Calculating Protein Conformations. J. Chem. Inf. Model. 64(23): 8999-9008 (2024) - [c74]Wagner Rocha, Therese E. Malliavin, Antonio Mucherino, Leo Liberti:
Impact of Local Geometry on Methods for Constructing Protein Conformations. FedCSIS 2024: 677-681 - [e5]Leo Liberti:
22nd International Symposium on Experimental Algorithms, SEA 2024, July 23-26, 2024, Vienna, Austria. LIPIcs 301, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-325-6 [contents] - [i19]Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti:
A learning-based mathematical programming formulation for the automatic configuration of optimization solvers. CoRR abs/2401.04237 (2024) - [i18]Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti:
Learning to Configure Mathematical Programming Solvers by Mathematical Programming. CoRR abs/2401.05041 (2024) - [i17]Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti:
The Algorithm Configuration Problem. CoRR abs/2403.00898 (2024) - 2023
- [j122]Leo Liberti, Benedetto Manca, Pierre-Louis Poirion:
Random Projections for Linear Programming: An Improved Retrieval Phase. ACM J. Exp. Algorithmics 28: 2.2:1-2.2:33 (2023) - [j121]Diego Delle Donne, Matthieu Kowalski, Leo Liberti:
A Novel Integer Linear Programming Approach for Global L0 Minimization. J. Mach. Learn. Res. 24: 382:1-382:28 (2023) - [j120]Antoine Oustry, Marion Le Tilly, Thomas Heide Clausen, Claudia D'Ambrosio, Leo Liberti:
Optimal deployment of indoor wireless local area networks. Networks 81(1): 23-50 (2023) - [j119]Leo Liberti, Gabriele Iommazzo, Carlile Lavor, Nelson Maculan:
Cycle-based formulations in Distance Geometry. Open J. Math. Optim. 4: 1-16 (2023) - 2022
- [j118]Daniel Bienstock, Mauro Escobar, Claudio Gentile, Leo Liberti:
Mathematical programming formulations for the alternating current optimal power flow problem. Ann. Oper. Res. 314(1): 277-315 (2022) - [j117]Maurizio Bruglieri, Roberto Cordone, Leo Liberti:
Maximum feasible subsystems of distance geometry constraints. J. Glob. Optim. 83(1): 29-47 (2022) - [j116]Phillip M. Duxbury, Carlile Lavor, Leo Liberti, Luiz Leduíno de Salles Neto:
Unassigned distance geometry and molecular conformation problems. J. Glob. Optim. 83(1): 73-82 (2022) - [j115]Leo Liberti, Benedetto Manca:
Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections. J. Glob. Optim. 83(1): 83-118 (2022) - [j114]Martina Cerulli, Antoine Oustry, Claudia D'Ambrosio, Leo Liberti:
Convergent Algorithms for a Class of Convex Semi-infinite Programs. SIAM J. Optim. 32(4): 2493-2526 (2022) - [c73]Nabil Moncef Boukhatem, Davide Buscaldi, Leo Liberti:
Empirical Comparison of Semantic Similarity Measures for Technical Question Answering. ADBIS (Short Papers) 2022: 167-177 - [c72]Leo Liberti, Benedetto Manca, Pierre-Louis Poirion:
Practical Performance of Random Projections in Linear Programming. SEA 2022: 21:1-21:15 - 2021
- [j113]Douglas Soares Gonçalves, Carlile Lavor, Leo Liberti, Michael Souza:
A New Algorithm for the KDMDGP Subclass of Distance Geometry Problems with Exact Distances. Algorithmica 83(8): 2400-2426 (2021) - [j112]Gustavo Dias, Leo Liberti:
Exploiting symmetries in mathematical programming via orbital independence. Ann. Oper. Res. 298(1): 149-182 (2021) - [j111]Fabio Furini, Amélie Lambert, Lucas Létocart, Leo Liberti, Emiliano Traversi:
Preface: CTW 2018. Discret. Appl. Math. 296: 1 (2021) - [j110]Ruobing Shen, Bo Tang, Leo Liberti, Claudia D'Ambrosio, Stéphane Canu:
Learning discontinuous piecewise affine fitting functions using mixed integer programming over lattice. J. Glob. Optim. 81(1): 85-108 (2021) - [j109]Martina Cerulli, Claudia D'Ambrosio, Leo Liberti, Mercedes Pelegrín:
Detecting and solving aircraft conflicts using bilevel programming. J. Glob. Optim. 81(2): 529-557 (2021) - [j108]Sammy Khalife, Douglas Soares Gonçalves, Youssef Allouah, Leo Liberti:
Further results on latent discourse models and word embeddings. J. Mach. Learn. Res. 22: 270:1-270:36 (2021) - [j107]Leo Liberti, Sebastian Sager, Angelika Wiegele:
Preface. Math. Program. 188(2): 411-419 (2021) - [j106]Martina Cerulli, Leo Liberti:
Polynomial programming prevents aircraft (and other) conflicts. Oper. Res. Lett. 49(4): 447-451 (2021) - [c71]Simon B. Hengeveld, Therese E. Malliavin, J. H. Lin, Leo Liberti, Antonio Mucherino:
A study on the impact of the distance types involved in protein structure determination by NMR. BIBM 2021: 2502-2510 - [c70]Wagner Rocha, Carlile Lavor, Leo Liberti, Thérèse E. Malliavin:
Pseudo-dihedral Angles in Proteins Providing a New Description of the Ramachandran Map. GSI (2) 2021: 511-519 - [i16]Leo Liberti, Pierre-Louis Poirion, Ky Khac Vu:
Random projections for conic programs. CoRR abs/2101.04182 (2021) - [i15]Germano Abud, Jorge Alencar, Carlile Lavor, Leo Liberti, Antonio Mucherino:
An impossible utopia in distance geometry. CoRR abs/2110.01231 (2021) - 2020
- [j105]Dan Bienstock, Mauro Escobar, Claudio Gentile, Leo Liberti:
Mathematical programming formulations for the alternating current optimal power flow problem. 4OR 18(3): 249-292 (2020) - [j104]Pierre-Louis Poirion, Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti:
Algorithms and applications for a class of bilevel MILPs. Discret. Appl. Math. 272: 75-89 (2020) - [j103]Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Ky Khac Vu:
Random projections for quadratic programs. Math. Program. 183(1): 619-647 (2020) - [j102]Jon Lee, Leo Liberti:
On an SDP relaxation for kissing number. Optim. Lett. 14(2): 417-422 (2020) - [j101]Germano Abud, Jorge Alencar, Carlile Lavor, Leo Liberti, Antonio Mucherino:
The K-discretization and K-incident graphs for discretizable Distance Geometry. Optim. Lett. 14(2): 469-482 (2020) - [c69]Antonio Mucherino, Douglas Soares Gonçalves, Leo Liberti, Jung-Hsin Lin, Carlile Lavor, Nelson Maculan:
MD-jeep: a New Release for Discretizable Distance Geometry Problems with Interval Data. FedCSIS 2020: 289-294 - [c68]Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti:
Learning to Configure Mathematical Programming Solvers by Mathematical Programming. LION 2020: 377-389 - [c67]Gabriele Iommazzo, Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti:
A Learning-Based Mathematical Programming Formulation for the Automatic Configuration of Optimization Solvers. LOD (1) 2020: 700-712 - [c66]Guillaume Thiry, Ioana Manolescu, Leo Liberti:
A Question Answering System for Interacting with SDMX Databases. ASLD@ISWC 2020: 24-39 - [c65]Leo Liberti:
A New Distance Geometry Method for Constructing Word and Sentence Vectors. WWW (Companion Volume) 2020: 679-685 - [i14]Leo Liberti, Gabriele Iommazzo, Carlile Lavor, Nelson Maculan:
Cycle-based formulations in Distance Geometry. CoRR abs/2006.11523 (2020) - [i13]Douglas Soares Gonçalves, Carlile Lavor, Leo Liberti, Michael Souza:
A new algorithm for the KDMDGP subclass of Distance Geometry Problems. CoRR abs/2009.05404 (2020) - [i12]Diego Delle Donne, Matthieu Kowalski, Leo Liberti:
MIP and Set Covering approaches for Sparse Approximation. CoRR abs/2009.06312 (2020)
2010 – 2019
- 2019
- [j100]Ky Khac Vu, Pierre-Louis Poirion, Leo Liberti:
Gaussian random projections for Euclidean membership problems. Discret. Appl. Math. 253: 93-102 (2019) - [j99]Farid Alizadeh, Douglas Soares Gonçalves, Nathan Krislock, Leo Liberti:
Preface. Discret. Appl. Math. 256: 1-4 (2019) - [j98]Jorge Alencar, Carlile Lavor, Leo Liberti:
Realizing Euclidean distance matrices by sphere intersection. Discret. Appl. Math. 256: 5-10 (2019) - [j97]Carlile Lavor, Leo Liberti, Bruce Randall Donald, Bradley Worley, Benjamin Bardiaux, Thérèse E. Malliavin, Michael Nilges:
Minimal NMR distance information for rigidity of protein graphs. Discret. Appl. Math. 256: 91-104 (2019) - [j96]Carlile Lavor, Michael Souza, Luiz Mariano Carvalho, Leo Liberti:
On the polynomiality of finding KDMDGP re-orders. Discret. Appl. Math. 267: 190-194 (2019) - [j95]Thérèse E. Malliavin, Antonio Mucherino, Carlile Lavor, Leo Liberti:
Systematic Exploration of Protein Conformational Space Using a Distance Geometry Approach. J. Chem. Inf. Model. 59(10): 4486-4503 (2019) - [j94]Fabio Furini, Emiliano Traversi, Pietro Belotti, Antonio Frangioni, Ambros M. Gleixner, Nick Gould, Leo Liberti, Andrea Lodi, Ruth Misener, Hans D. Mittelmann, Nikolaos V. Sahinidis, Stefan Vigerske, Angelika Wiegele:
QPLIB: a library of quadratic programming instances. Math. Program. Comput. 11(2): 237-265 (2019) - [j93]Leo Liberti, Carlile Lavor, Nelson Maculan:
A mathematical programming formulation for the Hartree-Fock problem on open-shell systems. Optim. Lett. 13(2): 429-437 (2019) - [j92]Leo Liberti:
Undecidability and hardness in mixed-integer nonlinear programming. RAIRO Oper. Res. 53(1): 81-109 (2019) - [c64]Ky Khac Vu, Pierre-Louis Poirion, Claudia D'Ambrosio, Leo Liberti:
Random Projections for Quadratic Programs over a Euclidean Ball. IPCO 2019: 442-452 - [c63]Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Sonia Toubaline:
On the Observability of Smart Grids and Related Optimization Methods. OR 2019: 281-287 - [c62]Sammy Khalife, Leo Liberti, Michalis Vazirgiannis:
Geometry and Analogies: A Study and Propagation Method for Word Representations. SLSP 2019: 100-111 - [i11]Leo Liberti:
Distance Geometry and Data Science. CoRR abs/1909.08544 (2019) - 2018
- [j91]Olivier Wang, Christian de Sainte Marie, Changhai Ke, Leo Liberti:
Universality and prediction in business rules. Comput. Intell. 34(2): 763-785 (2018) - [j90]Wim van Ackooij, Claudia D'Ambrosio, Leo Liberti, Raouia Taktak, Dimitri Thomopulos, Sonia Toubaline:
Shortest Path Problem variants for the Hydro Unit Commitment Problem. Electron. Notes Discret. Math. 69: 309-316 (2018) - [j89]Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Baruch Schieber, Hadas Shachnai:
Complexity and inapproximability results for the Power Edge Set problem. J. Comb. Optim. 35(3): 895-905 (2018) - [j88]Felipe Fidalgo, Douglas Soares Gonçalves, Carlile Lavor, Leo Liberti, Antonio Mucherino:
A symmetry-based splitting strategy for discretizable distance geometry problems. J. Glob. Optim. 71(4): 717-733 (2018) - [j87]Farid Alizadeh, Douglas Soares Gonçalves, Nathan Krislock, Leo Liberti:
Preface: Special issue dedicated to Distance Geometry. J. Glob. Optim. 72(1): 1-4 (2018) - [j86]Bradley Worley, Florent Delhommel, Florence Cordier, Thérèse E. Malliavin, Benjamin Bardiaux, Nicolas Wolff, Michael Nilges, Carlile Lavor, Leo Liberti:
Tuning interval Branch-and-Prune for protein structure determination. J. Glob. Optim. 72(1): 109-127 (2018) - [j85]Ky Khac Vu, Pierre-Louis Poirion, Leo Liberti:
Random Projections for Linear Programming. Math. Oper. Res. 43(4): 1051-1071 (2018) - [j84]Leo Liberti, Ky Khac Vu:
Barvinok's naive algorithm in Distance Geometry. Oper. Res. Lett. 46(5): 476-481 (2018) - [c61]Pierre-Olivier Bauguion, Claudia D'Ambrosio, Leo Liberti:
Maximum Concurrent Flow with Incomplete Data. ISCO 2018: 77-88 - [c60]Esteban Salgado, Andrea Scozzari, Fabio Tardella, Leo Liberti:
Alternating Current Optimal Power Flow with Generator Selection. ISCO 2018: 364-375 - 2017
- [b4]Leo Liberti, Carlile Lavor:
Euclidean Distance Geometry - an Introduction. Springer undergraduate texts in mathematics and technology, Springer 2017, ISBN 978-3-319-60791-7, pp. 1-133 - [b3]Carlile Lavor, Leo Liberti, Weldon A. Lodwick, Tiago Mendonça da Costa:
An Introduction to Distance Geometry applied to Molecular Geometry. Springer Briefs in Computer Science, Springer 2017, ISBN 978-3-319-57182-9, pp. 1-49 - [j83]Matteo Fischetti, Leo Liberti, Domenico Salvagnin, Toby Walsh:
Orbital shrinking: Theory and applications. Discret. Appl. Math. 222: 109-123 (2017) - [j82]Claudia D'Ambrosio, Ky Khac Vu, Carlile Lavor, Leo Liberti, Nelson Maculan:
New Error Measures and Methods for Realizing Protein Graphs from Distance Data. Discret. Comput. Geom. 57(2): 371-418 (2017) - [j81]Luca Mencarelli, Youcef Sahraoui, Leo Liberti:
A multiplicative weights update algorithm for MINLP. EURO J. Comput. Optim. 5(1-2): 31-86 (2017) - [j80]Ky Khac Vu, Claudia D'Ambrosio, Youssef Hamadi, Leo Liberti:
Surrogate-based methods for black-box optimization. Int. Trans. Oper. Res. 24(3): 393-424 (2017) - [j79]Douglas Soares Gonçalves, Antonio Mucherino, Carlile Lavor, Leo Liberti:
Recent advances on the interval distance geometry problem. J. Glob. Optim. 69(3): 525-545 (2017) - [c59]Claudia D'Ambrosio, Leo Liberti:
Distance Geometry in Linearizable Norms. GSI 2017: 830-837 - [c58]Olivier Wang, Leo Liberti:
Controlling Some Statistical Properties of Business Rules Programs. LION 2017: 263-276 - [c57]Leo Liberti, Claudia D'Ambrosio:
The Isomap Algorithm in Distance Geometry. SEA 2017: 5:1-5:13 - 2016
- [j78]Leo Liberti, Thierry Marchant, Silvano Martello:
Preface. Ann. Oper. Res. 240(1): 1 (2016) - [j77]Leo Liberti, Thierry Marchant, Silvano Martello:
Twelve surveys in operations research. Ann. Oper. Res. 240(1): 3-11 (2016) - [j76]Alberto Costa, Sergey Kushnarev, Leo Liberti, Zeyu Sun:
Divisive heuristic for modularity density maximization. Comput. Oper. Res. 71: 100-109 (2016) - [j75]Gustavo Dias, Leo Liberti:
New methods for the Distance Geometry Problem. Electron. Notes Discret. Math. 55: 45-48 (2016) - [j74]Leo Liberti, Pierre-Louis Poirion, Ky Khac Vu:
Solving LP using random projections. Electron. Notes Discret. Math. 55: 53-56 (2016) - [j73]Carlile Lavor, Marcelo Firer, José Mario Martínez, Leo Liberti:
Preface to the Special Issue on Many Faces of Distances. Int. Trans. Oper. Res. 23(5): 841 (2016) - [j72]Leo Liberti, Carlile Lavor:
Six mathematical gems from the history of distance geometry. Int. Trans. Oper. Res. 23(5): 897-920 (2016) - [j71]Pierre-Louis Poirion, Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti:
The power edge set problem. Networks 68(2): 104-120 (2016) - [j70]Hassan L. Hijazi, Leo Liberti:
Constraint qualification failure in action. Oper. Res. Lett. 44(4): 503-506 (2016) - [c56]Gustavo Dias, Leo Liberti:
Diagonally Dominant Programming in Distance Geometry. ISCO 2016: 225-236 - [c55]Olivier Wang, Changhai Ke, Leo Liberti, Christian de Sainte Marie:
The Learnability of Business Rules. MOD 2016: 257-268 - [c54]Olivier Wang, Leo Liberti, Claudia D'Ambrosio, Christian de Sainte Marie, Changhai Ke:
Controlling the Average Behavior of Business Rules Programs. RuleML 2016: 83-96 - [i10]Claudia D'Ambrosio, Ky Khac Vu, Carlile Lavor, Leo Liberti, Nelson Maculan:
New error measures and methods for realizing protein graphs from distance data. CoRR abs/1607.00868 (2016) - [i9]Leo Liberti, Carlile Lavor:
Open research areas in distance geometry. CoRR abs/1610.00652 (2016) - 2015
- [j69]Leo Liberti, Thierry Marchant, Silvano Martello:
The dirty dozen of 4OR. 4OR 13(1): 1-13 (2015) - [j68]Andrea Cassioli, Benjamin Bardiaux, Guillaume Bouvier, Antonio Mucherino, Rafael Alves, Leo Liberti, Michael Nilges, Carlile Lavor, Thérèse E. Malliavin:
An algorithm to enumerate all possible protein conformations verifying a set of distance constraints. BMC Bioinform. 16: 23:1-23:15 (2015) - [j67]Leo Liberti:
Optimization and sustainable development. Comput. Manag. Sci. 12(3): 371-395 (2015) - [j66]Andrea Cassioli, Oktay Günlük, Carlile Lavor, Leo Liberti:
Discretization vertex orders in distance geometry. Discret. Appl. Math. 197: 27-41 (2015) - [j65]Jorge Alencar, Tibérius O. Bonates, Carlile Lavor, Leo Liberti:
An algorithm for realizing Euclidean distance matrices. Electron. Notes Discret. Math. 50: 397-402 (2015) - [j64]Andrea Bettinelli, Pierre Hansen, Leo Liberti:
Community detection with the weighted parsimony criterion. J. Syst. Sci. Complex. 28(3): 517-545 (2015) - [c53]Sonia Toubaline, Pierre-Louis Poirion, Claudia D'Ambrosio, Leo Liberti:
Observing the State of a Smart Grid Using Bilevel Programming. COCOA 2015: 364-376 - [c52]Gustavo Dias, Leo Liberti:
Orbital Independence in Symmetric Mathematical Programs. COCOA 2015: 467-480 - [c51]Leo Liberti, Grzegorz Swirszcz, Carlile Lavor:
Distance Geometry on the Sphere. JCDCGG 2015: 204-215 - [c50]Young M. Lee, Raya Horesh, Leo Liberti:
Simulation and optimization of energy efficient operation of HVAC system as demand response with distributed energy resources. WSC 2015: 991-999 - [i8]Gustavo Dias, Leo Liberti, Nelson Maculan:
Modelling Rank Constraints in Mathematical Programming. CTW 2015: 193-196 - [i7]Ky Khac Vu, Pierre-Louis Poirion, Leo Liberti:
Using the Johnson-Lindenstrauss lemma in linear and integer programming. CoRR abs/1507.00990 (2015) - [i6]Ky Khac Vu, Pierre-Louis Poirion, Leo Liberti:
Gaussian random projections for Euclidean membership problems. CoRR abs/1509.00630 (2015) - 2014
- [j63]Sonia Cafieri, Pierre Hansen, Leo Liberti:
Improving heuristics for network modularity maximization using an exact algorithm. Discret. Appl. Math. 163: 65-72 (2014) - [j62]Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino:
On the number of realizations of certain Henneberg graphs arising in protein conformation. Discret. Appl. Math. 165: 213-232 (2014) - [j61]Leo Liberti, Fabrizio Marinelli:
Mathematical programming: Turing completeness and applications to software analysis. J. Comb. Optim. 28(1): 82-104 (2014) - [j60]Dominik Kirchler, Leo Liberti, Roberto Wolfler Calvo:
Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks. ACM J. Exp. Algorithmics 19(1) (2014) - [j59]Leo Liberti, James Ostrowski:
Stabilizer-based symmetry breaking constraints for mathematical programs. J. Glob. Optim. 60(2): 183-194 (2014) - [j58]Isaac F. Fernandes, Daniel Aloise, Dario J. Aloise, Pierre Hansen, Leo Liberti:
On the Weber facility location problem with limited distances and side constraints. Optim. Lett. 8(2): 407-424 (2014) - [j57]Leo Liberti, Carlile Lavor, Nelson Maculan, Antonio Mucherino:
Euclidean Distance Geometry and Applications. SIAM Rev. 56(1): 3-69 (2014) - 2013
- [j56]Leo Liberti, Thierry Marchant, Silvano Martello:
Preface. Ann. Oper. Res. 204(1): 1 (2013) - [j55]Leo Liberti, Thierry Marchant, Silvano Martello:
Eleven surveys in operations research: III. Ann. Oper. Res. 204(1): 3-9 (2013) - [j54]Edoardo Amaldi, Kanika Dhyani, Leo Liberti:
A two-phase heuristic for the bottleneck k-hyperplane clustering problem. Comput. Optim. Appl. 56(3): 619-633 (2013) - [j53]Andrea Bettinelli, Leo Liberti, Franco Raimondi, David Savourey:
The Anonymous Subgraph Problem. Comput. Oper. Res. 40(4): 973-979 (2013) - [j52]Alberto Costa, Pierre Hansen, Leo Liberti:
On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square. Discret. Appl. Math. 161(1-2): 96-106 (2013) - [j51]Silas Sallaume, Simone de Lima Martins, Luiz Satoru Ochi, Warley Gramacho Da Silva, Carlile Lavor, Leo Liberti:
A discrete search algorithm for finding the structure of protein backbones and side chains. Int. J. Bioinform. Res. Appl. 9(3): 261-270 (2013) - [j50]Sonia Cafieri, Leo Liberti, Frédéric Messine:
Toulouse Global optimization Workshop 2010 (TOGO10). J. Glob. Optim. 56(3): 757-759 (2013) - [j49]Carlile Lavor, Leo Liberti, Antonio Mucherino:
The interval Branch-and-Prune algorithm for the discretizable molecular distance geometry problem with inexact distances. J. Glob. Optim. 56(3): 855-871 (2013) - [c49]Leo Liberti, Carlile Lavor, Jorge Alencar, Germano Abud:
Counting the Number of Solutions of KDMDGP Instances. GSI 2013: 224-230 - [c48]Rafael Alves, Andrea Cassioli, Antonio Mucherino, Carlile Lavor, Leo Liberti:
The integration of Clifford Algebra in the iBP algorithm for the DMDGP. IWBBIO 2013: 745-746 - [p6]Leo Liberti, Carlile Lavor, Antonio Mucherino:
The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins. Distance Geometry 2013: 47-60 - [p5]Nathanael Beeker, Stéphane Gaubert, Christian Glusa, Leo Liberti:
Is the Distance Geometry Problem in NP? Distance Geometry 2013: 85-93 - [p4]Antonio Mucherino, Leo Liberti:
A VNS-Based Heuristic for Feature Selection in Data Mining. Hybrid Metaheuristics 2013: 353-368 - [e4]Antonio Mucherino, Carlile Lavor, Leo Liberti, Nelson Maculan:
Distance Geometry: Theory, Methods, and Applications. Springer 2013, ISBN 978-1-4614-5127-3 [contents] - 2012
- [j48]Leo Liberti, Thierry Marchant, Silvano Martello:
No end of the world in 2012 for 4OR. 4OR 10(1): 1-13 (2012) - [j47]Vassilis Giakoumakis, Daniel Krob, Leo Liberti, Fabio Roda:
Technological architecture evolutions of information systems: Trade-off and optimization. Concurr. Eng. Res. Appl. 20(2): 127-147 (2012) - [j46]Carlile Lavor, Leo Liberti, Nelson Maculan, Antonio Mucherino:
The discretizable molecular distance geometry problem. Comput. Optim. Appl. 52(1): 115-146 (2012) - [j45]Carlile Lavor, Leo Liberti, Nelson Maculan, Antonio Mucherino:
Recent advances on the Discretizable Molecular Distance Geometry Problem. Eur. J. Oper. Res. 219(3): 698-706 (2012) - [j44]Antonio Mucherino, Carlile Lavor, Leo Liberti:
Exploiting Symmetry Properties of the Discretizable molecular Distance Geometry Problem. J. Bioinform. Comput. Biol. 10(3) (2012) - [j43]Hanif D. Sherali, Evrim Dalkiran, Leo Liberti:
Reduced RLT representations for nonconvex polynomial programming problems. J. Glob. Optim. 52(3): 447-469 (2012) - [j42]Jon Lee, Leo Liberti:
A matroid view of key theorems for edge-swapping algorithms. Math. Methods Oper. Res. 76(2): 125-127 (2012) - [j41]Daniel Aloise, Pierre Hansen, Leo Liberti:
An improved column generation algorithm for minimum sum-of-squares clustering. Math. Program. 131(1-2): 195-220 (2012) - [j40]Leo Liberti:
Reformulations in mathematical programming: automatic symmetry detection and exploitation. Math. Program. 131(1-2): 273-304 (2012) - [j39]Pierre Bonami, Leo Liberti, Andrew J. Miller, Annick Sartenaer:
Preface. Math. Program. 136(2): 229-231 (2012) - [j38]Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi:
A storm of feasibility pumps for nonconvex MINLP. Math. Program. 136(2): 375-402 (2012) - [j37]Giacomo Nannicini, Daniel Delling, Dominik Schultes, Leo Liberti:
Bidirectional A* search on time-dependent road networks. Networks 59(2): 240-251 (2012) - [j36]Carlile Lavor, Jon Lee, Audrey Lee-St. John, Leo Liberti, Antonio Mucherino, Maxim Sviridenko:
Discretization orders for distance geometry problems. Optim. Lett. 6(4): 783-796 (2012) - [j35]Antonio Mucherino, Carlile Lavor, Leo Liberti:
The discretizable distance geometry problem. Optim. Lett. 6(8): 1671-1686 (2012) - [c47]Hassan L. Hijazi, Leo Liberti:
Invex Formulations of Unbounded Disjunctions. CTW 2012: 143-146 - [c46]Leo Liberti:
Modelling Rank Constraints in Mathematical Programming. CTW 2012: 181-184 - [c45]Hassan L. Hijazi, Amadou Diallo, Michel Kieffer, Leo Liberti, Claudio Weidmann:
A MILP Approach for Designing Robust Variable-Length Codes Based on Exact Free Distance Computation. DCC 2012: 257-266 - [c44]Daniel Aloise, Gilles Caporossi, Pierre Hansen, Leo Liberti, Sylvain Perron, Manuel Ruiz:
Modularity maximization in networks by variable neighborhood search. Graph Partitioning and Graph Clustering 2012: 113-128 - [c43]Matteo Fischetti, Leo Liberti:
Orbital Shrinking. ISCO 2012: 48-58 - [c42]Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti, Frédéric Messine:
Compact Relaxations for Polynomial Programming Problems. SEA 2012: 75-86 - [c41]Alberto Costa, Leo Liberti:
Relaxations of Multilinear Convex Envelopes: Dual Is Better Than Primal. SEA 2012: 87-98 - [c40]Dominik Kirchler, Leo Liberti, Roberto Wolfler Calvo:
A Label Correcting Algorithm for the Shortest Path Problem on a Multi-modal Route Network. SEA 2012: 236-247 - [e3]Daniel Delling, Leo Liberti:
12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2012, September 13, 2012, Ljubljana, Slovenia. OASIcs 25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2012, ISBN 978-3-939897-45-3 [contents] - 2011
- [j34]Leo Liberti, Laurent Alfandari, Marie-Christine Plateau:
Edge cover by connected bipartite subgraphs. Ann. Oper. Res. 188(1): 307-329 (2011) - [j33]Sonia Cafieri, Ulrich Faigle, Leo Liberti:
8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009). Discret. Appl. Math. 159(16): 1659 (2011) - [j32]Leo Liberti, Carlile Lavor, Antonio Mucherino, Nelson Maculan:
Molecular distance geometry methods: from continuous to discrete. Int. Trans. Oper. Res. 18(1): 33-51 (2011) - [j31]Carlile Lavor, Leo Liberti, Nelson Maculan:
A note on "A branch-and-prune algorithm for the molecular distance geometry problem". Int. Trans. Oper. Res. 18(6): 751-752 (2011) - [j30]Carlile Lavor, Antonio Mucherino, Leo Liberti, Nelson Maculan:
On the computation of protein backbones by using artificial backbones of hydrogens. J. Glob. Optim. 50(2): 329-344 (2011) - [j29]Gérard Cornuéjols, Leo Liberti, Giacomo Nannicini:
Improved strategies for branching on general disjunctions. Math. Program. 130(2): 225-247 (2011) - [j28]Leo Liberti, Nenad Mladenovic, Giacomo Nannicini:
A recipe for finding good solutions to MINLPs. Math. Program. Comput. 3(4): 349-390 (2011) - [c39]Dominik Kirchler, Leo Liberti, Thomas Pajor, Roberto Wolfler Calvo:
UniALT for regular language contrained shortest paths on a multi-modal transportation network. ATMOS 2011: 64-75 - [c38]Antonio Mucherino, Carlile Lavor, Leo Liberti:
A symmetry-driven BP algorithm for the Discretizable Molecular Distance Geometry Problem. BIBM Workshops 2011: 390-395 - [c37]Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino:
On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem. COCOA 2011: 322-342 - [c36]Alberto Costa, Pierre Hansen, Leo Liberti:
Bound constraints for Point Packing in a Square. CTW 2011: 126-129 - [c35]Leo Liberti, Benoît Masson, Carlile Lavor, Antonio Mucherino:
Branch-and-Prune trees with bounded width. CTW 2011: 189-193 - [c34]Fabio Roda, Pierre Hansen, Leo Liberti:
The price of equity in the Hazmat. CTW 2011: 235-238 - [c33]Nora Touati Moungla, Pietro Belotti, Vincent Jost, Leo Liberti:
A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem. INOC 2011: 439-449 - [c32]Antonio Mucherino, Carlile Lavor, Therese E. Malliavin, Leo Liberti, Michael Nilges, Nelson Maculan:
Influence of Pruning Devices on the Solution of Molecular Distance Geometry Problems. SEA 2011: 206-217 - [c31]Fabio Roda, Leo Liberti, Franco Raimondi:
Evaluation of Collaborative Filtering Algorithms Using a Small Dataset. WEBIST 2011: 603-606 - [c30]Fabio Roda, Alberto Costa, Leo Liberti:
Optimal recommender systems blending. WIMS 2011: 60 - [p3]Giacomo Nannicini, Gérard Cornuéjols, Miroslav Karamanov, Leo Liberti:
Branching on Split Disjunctions. Combinatorial Optimization - Methods and Applications 2011: 164-182 - [i5]Leo Liberti, Carlile Lavor, Benoît Masson, Antonio Mucherino:
Polynomial cases of the Discretizable Molecular Distance Geometry Problem. CoRR abs/1103.1264 (2011) - 2010
- [j27]Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti:
Fast paths in large-scale dynamic road networks. Comput. Optim. Appl. 45(1): 143-158 (2010) - [j26]Alberto Costa, Leo Liberti, Pierre Hansen:
Formulation symmetries in circle packing. Electron. Notes Discret. Math. 36: 1303-1310 (2010) - [j25]Leo Liberti, Stéphane Le Roux, Jeremy Leconte, Fabrizio Marinelli:
Mathematical programming based debugging. Electron. Notes Discret. Math. 36: 1311-1318 (2010) - [j24]Sonia Cafieri, Jon Lee, Leo Liberti:
On convex relaxations of quadrilinear terms. J. Glob. Optim. 47(4): 661-685 (2010) - [j23]Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi:
On interval-subgradient and no-good cuts. Oper. Res. Lett. 38(5): 341-345 (2010) - [c29]Antonio Mucherino, Carlile Lavor, Leo Liberti, El-Ghazali Talbi:
A parallel version of the Branch & Prune algorithm for the Molecular Distance Geometry Problem. AICCSA 2010: 1-6 - [c28]Carlile Lavor, Leo Liberti, Antonio Mucherino:
On the solution of molecular distance geometry problems with interval data. BIBM Workshops 2010: 77-82 - [c27]Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti:
Feasibility-Based Bounds Tightening via Fixed Points. COCOA (1) 2010: 65-76 - [c26]Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti:
On the Convergence of Feasibility based Bounds Tightening. CTW 2010: 21-24 - [c25]Alberto Costa, Pierre Hansen, Leo Liberti:
Static Symmetry Breaking in Circle Packing. CTW 2010: 47-50 - [c24]Vassilis Giakoumakis, Daniel Krob, Leo Liberti, Fabio Roda:
Optimal Technological Architecture Evolutions of Information Systems. CSDM 2010: 137-148 - [c23]Antonio Mucherino, Leo Liberti, Carlile Lavor:
MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems. ICMS 2010: 186-197 - [c22]Leo Liberti, Sonia Cafieri, David Savourey:
The Reformulation-Optimization Software Engine. ICMS 2010: 303-314 - [c21]Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi:
Experiments with a Feasibility Pump Approach for Nonconvex MINLPs. SEA 2010: 350-360 - [c20]Eric Goubault, Stéphane Le Roux, Jeremy Leconte, Leo Liberti, Fabrizio Marinelli:
Static Analysis by Abstract Interpretation: A Mathematical Programming Approach. NSAD@SAS 2010: 73-87 - [p2]Leo Liberti, Giacomo Nannicini, Nenad Mladenovic:
A Good Recipe for Solving MINLPs. Matheuristics 2010: 231-244 - [i4]Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino:
On the number of solutions of the discretizable molecular distance geometry problem. CoRR abs/1010.1834 (2010)
2000 – 2009
- 2009
- [j22]Leo Liberti, Nelson Maculan:
Reformulation techniques in mathematical programming. Discret. Appl. Math. 157(6): 1165-1166 (2009) - [j21]Leo Liberti, Carlile Lavor, Nelson Maculan, Marco Antonio Chaer Nascimento:
Reformulation in mathematical programming: An application to quantum chemistry. Discret. Appl. Math. 157(6): 1309-1318 (2009) - [j20]Leo Liberti, Carlile Lavor, Nelson Maculan, Fabrizio Marinelli:
Double variable neighbourhood search with smoothing for the molecular distance geometry problem. J. Glob. Optim. 43(2-3): 207-218 (2009) - [j19]Edoardo Amaldi, Leo Liberti, Francesco Maffioli, Nelson Maculan:
Edge-swapping algorithms for the minimum fundamental cycle basis problem. Math. Methods Oper. Res. 69(2): 205-233 (2009) - [j18]Leo Liberti, Nelson Maculan, Yue Zhang:
Optimal configuration of gamma ray machine radiosurgery units: the sphere covering subproblem. Optim. Lett. 3(1): 109-121 (2009) - [j17]Pietro Belotti, Jon Lee, Leo Liberti, François Margot, Andreas Wächter:
Branching and bounds tighteningtechniques for non-convex MINLP. Optim. Methods Softw. 24(4-5): 597-634 (2009) - [j16]Leo Liberti:
Reformulations in Mathematical Programming: Definitions and Systematics. RAIRO Oper. Res. 43(1): 55-85 (2009) - [c19]Gérard Cornuéjols, Leo Liberti, Giacomo Nannicini:
Improved Strategies for Branching on General Disjunctions. CTW 2009: 144-145 - [c18]Fabio Roda, Leo Liberti, Franco Raimondi:
Combinatorial Optimization Based Recommender Systems. CTW 2009: 175-179 - [c17]Andrea Bettinelli, Leo Liberti, Franco Raimondi, David Savourey:
The Anonymous Subgraph Problem. CTW 2009: 269-274 - [c16]Antonio Mucherino, Leo Liberti, Carlile Lavor, Nelson Maculan:
Comparisons between an exact and a metaheuristic algorithm for the molecular distance geometry problem. GECCO 2009: 333-340 - [c15]Carlile Lavor, Antonio Mucherino, Leo Liberti, Nelson Maculan:
Computing artificial backbones of hydrogen atoms in order to discover protein backbones. IMCSIT 2009: 759-764 - [c14]Carlile Lavor, Leo Liberti, Antonio Mucherino, Nelson Maculan:
On a discretizable subclass of instances of the molecular distance geometry problem. SAC 2009: 804-805 - [p1]Leo Liberti, Sonia Cafieri, Fabien Tarissan:
Reformulations in Mathematical Programming: A Computational Approach. Foundations of Computational Intelligence (3) 2009: 153-234 - [e2]Sonia Cafieri, Antonio Mucherino, Giacomo Nannicini, Fabien Tarissan, Leo Liberti:
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009. 2009 [contents] - [r2]Carlile Lavor, Leo Liberti, Nelson Maculan:
Molecular Distance Geometry Problem. Encyclopedia of Optimization 2009: 2304-2311 - [r1]Hanif D. Sherali, Leo Liberti:
Reformulation-Linearization Technique for Global Optimization. Encyclopedia of Optimization 2009: 3263-3268 - 2008
- [j15]Leo Liberti, Carlile Lavor, Nelson Maculan:
A Branch-and-Prune algorithm for the Molecular Distance Geometry Problem. Int. Trans. Oper. Res. 15(1): 1-17 (2008) - [j14]Leo Liberti:
Spherical cuts for integer programming problems. Int. Trans. Oper. Res. 15(3): 283-294 (2008) - [j13]Giacomo Nannicini, Leo Liberti:
Shortest paths on dynamic graphs. Int. Trans. Oper. Res. 15(5): 551-563 (2008) - [c13]Leo Liberti, Franco Raimondi:
The Secret Santa Problem. AAIM 2008: 271-279 - [c12]Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti:
Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks. COCOA 2008: 225-234 - [c11]Leo Liberti:
Automatic Generation of Symmetry-Breaking Constraints. COCOA 2008: 328-338 - [c10]Leo Liberti:
Reformulations in Mathematical Programming: Definitions. CTW 2008: 66-70 - [c9]Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes:
Bidirectional A* on Time-dependent Graphs. CTW 2008: 132-135 - [c8]Kanika Dhyani, Leo Liberti:
Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem. MCO 2008: 87-96 - [c7]Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes:
Bidirectional A* Search for Time-Dependent Fast Paths. WEA 2008: 334-346 - 2007
- [b2]Leo Liberti:
Reformulation techniques in Mathematical Programming. Paris Dauphine University, France, 2007 - [j12]Leo Liberti:
Compact linearization for binary quadratic problems. 4OR 5(3): 231-245 (2007) - [j11]Sergei S. Kucherenko, Pietro Belotti, Leo Liberti, Nelson Maculan:
New formulations for the Kissing Number Problem. Discret. Appl. Math. 155(14): 1837-1841 (2007) - [c6]Leo Liberti:
A useful characterization of the feasible region of binary linear programs. CTW 2007: 103-106 - [c5]Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti:
Fast point-to-point shortest path queries on dynamic road networks with interfal data. CTW 2007: 115-118 - [c4]Marie-Christine Plateau, Leo Liberti, Laurent Alfandari:
Edge cover by bipartite subgraphs. CTW 2007: 127-132 - [i3]Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti:
Fast paths in large-scale dynamic road networks. CoRR abs/0704.1068 (2007) - 2006
- [j10]Ulrich Faigle, Leo Liberti, Francesco Maffioli, Stefan Pickl:
Graphs and combinatorial optimization. Discret. Optim. 3(3): 179 (2006) - [j9]Leo Liberti, Constantinos C. Pantelides:
An Exact Reformulation Algorithm for Large Nonconvex NLPs Involving Bilinear Terms. J. Glob. Optim. 36(2): 161-189 (2006) - 2005
- [j8]Leo Liberti, Sergei S. Kucherenko:
Comparison of deterministic and stochastic approaches to global optimization. Int. Trans. Oper. Res. 12(3): 263-285 (2005) - [j7]Leo Liberti:
Linearity Embedded in Nonconvex Programs. J. Glob. Optim. 33(2): 157-196 (2005) - 2004
- [b1]Leo Liberti:
Reformulation and Convex Relaxation Techniques for Global Optimization. (Techniques de reformulation et relaxation convexe pour l'optimisation globale). Imperial College London, UK, 2004 - [j6]Leo Liberti:
Reformulation and convex relaxation techniques for global optimization. 4OR 2(3): 255-258 (2004) - [j5]Leo Liberti, Francesco Maffioli:
Preface. Electron. Notes Discret. Math. 17: 1 (2004) - [j4]Edoardo Amaldi, Leo Liberti, Francesco Maffioli, Nelson Maculan:
Algorithms for finding minimum fundamental cycle bases in graphs. Electron. Notes Discret. Math. 17: 29-33 (2004) - [j3]Leo Liberti, Nelson Maculan, Sergei S. Kucherenko:
The Kissing Number Problem: A New Result from Global Optimization. Electron. Notes Discret. Math. 17: 203-207 (2004) - [c3]Edoardo Amaldi, Leo Liberti, Francesco Maffioli:
Algorithms for Finding Minimum Fundamental Cycle Bases in Graphs. CTW 2004: 33-36 - [c2]Leo Liberti, Nelson Maculan, Sergei S. Kucherenko:
The Kissing Number Problem: A New Result from Global Optimization. CTW 2004: 180-183 - [c1]Edoardo Amaldi, Leo Liberti, Nelson Maculan, Francesco Maffioli:
Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases. WEA 2004: 14-29 - [e1]Leo Liberti, Francesco Maffioli:
CTW04 Workshop on Graphs and Combinatorial Optimization, Scientific Program, Villa Vigoni, Menaggio (CO), Italy, 31st May to 2nd June 2004. 2004 [contents] - 2003
- [j2]Leo Liberti, Constantinos C. Pantelides:
Convex Envelopes of Monomials of Odd Degree. J. Glob. Optim. 25(2): 157-168 (2003) - 2002
- [i2]Leo Liberti:
Performance Comparison of Function Evaluation Methods. CoRR cs.SC/0206010 (2002)
1990 – 1999
- 1999
- [j1]Leo Liberti:
Structure of the Invertible CA Transformations Group. J. Comput. Syst. Sci. 59(3): 521-536 (1999) - 1997
- [i1]Leo Liberti:
Fondamenti algebrici degli automi cellulari invertibili. (Algebraic foundations of invertible cellular automata / Fondations algébriques des automates cellulaires inversibles). University of Turin, Italy, 1997
Coauthor Index
[j124] [j119] [j116] [j113] [c70] [i15] [j101] [c69] [i14] [i13] [j98] [j97] [j96] [j95] [j93] [j88] [j86] [b4] [b3] [j82] [j79] [j73] [j72] [i10] [i9] [j68] [j66] [j65] [c51] [j62] [j57] [j51] [j49] [c49] [c48] [p6] [e4] [j46] [j45] [j44] [j36] [j35] [j32] [j31] [j30] [c38] [c37] [c35] [c32] [i5] [c29] [c28] [c23] [i4] [j21] [j20] [c16] [c15] [c14] [r2] [j15]
Therese E. Malliavin
aka: Thérèse E. Malliavin
aka: Thérèse E. Malliavin
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.
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.
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.
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-05-23 00:40 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:
