default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoberto Montemanni
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
[j66]Mauro Dell'Amico
, Jafar Jamal, Roberto Montemanni:
Compact Models to Solve the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times. Algorithms 17(1): 12 (2024)- [j65]Roberto Montemanni, Mauro Dell'Amico, Andrea Corsini:
Parallel drone scheduling vehicle routing problems with collective drones. Comput. Oper. Res. 163: 106514 (2024) - [j64]Roberto Montemanni, Derek H. Smith:
On Solving the Set Orienteering Problem. Symmetry 16(3): 340 (2024) - [c32]Roberto Montemanni, Mauro Dell'Amico, Andrea Corsini:
Combining Heuristics and Constraint Programming for the Parallel Drone Scheduling Vehicle Routing Problem with Collective Drones. MIC (1) 2024: 136-142 - [c31]Sara Ceschia, Luca Di Gaspero, Simona Mancini, Vittorio Maniezzo, Roberto Montemanni, Roberto Maria Rosati, Andrea Schaerf:
Enhancing Real-World Applicability in Home Healthcare: A Metaheuristic Approach for Advanced Routing and Scheduling. MIC (1) 2024: 164-170 - [c30]Roberto Montemanni, Agnese Cervino, Francesco Lolli:
Picking Optimization in U-Shaped Corridors with a Movable Depot. ICIEA-EU 2024: 133-145 - 2023
- [j63]Roberto Montemanni, Mauro Dell'Amico:
Solving the Parallel Drone Scheduling Traveling Salesman Problem via Constraint Programming. Algorithms 16(1): 40 (2023) - [j62]Mauro Dell'Amico, Jafar Jamal, Roberto Montemanni:
A branch-and-bound algorithm for the Precedence-Constrained Minimum-Cost Arborescence problem. Comput. Oper. Res. 156: 106248 (2023) - [j61]Derek H. Smith, Roberto Montemanni:
The missing Moore graph as an optimization problem. EURO J. Comput. Optim. 11: 100060 (2023) - [j60]Roberto Montemanni, Mauro Dell'Amico:
Constraint programming models for the parallel drone scheduling vehicle routing problem. EURO J. Comput. Optim. 11: 100078 (2023) - [j59]Xiaochen Chou, Mauro Dell'Amico, Jafar Jamal, Roberto Montemanni:
Precedence-Constrained arborescences. Eur. J. Oper. Res. 307(2): 575-589 (2023) - [c29]Mauro Dell'Amico, Jafar Jamal, Roberto Montemanni:
Modelling and Solving the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting-Times. FedCSIS 2023: 421-430 - 2022
- [j58]Giulia Pugliese, Xiaochen Chou, Dominic Loske, Matthias Klumpp, Roberto Montemanni:
AMR-Assisted Order Picking: Models for Picker-to-Parts Systems in a Two-Blocks Warehouse. Algorithms 15(11): 413 (2022) - [j57]Roberto Montemanni, Xiaochen Chou, Derek H. Smith:
Upper and lower bounds based on linear programming for the b-coloring problem. EURO J. Comput. Optim. 10: 100049 (2022) - [j56]Pongchanun Luangpaiboon, Pasura Aungkulanon, Roberto Montemanni:
A decision support tool for intelligent manufacturing systems via an elevator kinematic optimisation based method. Expert Syst. Appl. 203: 117576 (2022) - [j55]Mauro Dell'Amico, Roberto Montemanni, Stefano Novellani:
Exact models for the flying sidekick traveling salesman problem. Int. Trans. Oper. Res. 29(3): 1360-1393 (2022) - [j54]János Barta, Roberto Montemanni:
The Maximum Clique Problem for Permutation Hamming Graphs. J. Optim. Theory Appl. 194(2): 492-507 (2022) - 2021
- [j53]Umberto Junior Mele, Luca Maria Gambardella, Roberto Montemanni:
A New Constructive Heuristic Driven by Machine Learning for the Traveling Salesman Problem. Algorithms 14(9): 267 (2021) - [j52]Nicola Ognibene Pietri, Xiaochen Chou, Dominic Loske, Matthias Klumpp, Roberto Montemanni:
The Buy-Online-Pick-Up-in-Store Retailing Model: Optimization Strategies for In-Store Picking and Packing. Algorithms 14(12): 350 (2021) - [j51]Xiaochen Chou, Luca Maria Gambardella, Roberto Montemanni:
A Tabu Search algorithm for the Probabilistic Orienteering Problem. Comput. Oper. Res. 126: 105107 (2021) - [j50]Mauro Dell'Amico, Roberto Montemanni, Stefano Novellani:
Modeling the flying sidekick traveling salesman problem with multiple drones. Networks 78(3): 303-327 (2021) - [j49]Mauro Dell'Amico, Roberto Montemanni, Stefano Novellani:
Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem. Optim. Lett. 15(5): 1617-1648 (2021) - [j48]Gianni A. Di Caro, Vittorio Maniezzo, Roberto Montemanni, Matteo Salani:
Machine learning and combinatorial optimization, editorial. OR Spectr. 43(3): 603-605 (2021) - [c28]Xiaochen Chou, Nicola Ognibene Pietri, Dominic Loske, Matthias Klumpp, Roberto Montemanni:
Optimization Strategies for In-Store Order Picking in Omnichannel Retailing. APMS (2) 2021: 603-611 - [c27]Tommaso Vitali, Umberto Junior Mele, Luca Maria Gambardella, Roberto Montemanni:
Machine Learning Constructives and Local Searches for the Travelling Salesman Problem. OR 2021: 59-65 - [c26]Nicola Ognibene Pietri, Xiaochen Chou, Dominic Loske, Matthias Klumpp, Jafar Jamal, Roberto Montemanni:
The Picking and Packing Problem in Buy-Online-Pick-up-in-Store Retailing. OR 2021: 239-244 - [i3]Mauro Dell'Amico, Roberto Montemanni, Stefano Novellani:
Benchmark Instances and Optimal Solutions for the Traveling Salesman Problem with Drone. CoRR abs/2107.13275 (2021) - [i2]Tommaso Vitali, Umberto Junior Mele, Luca Maria Gambardella, Roberto Montemanni:
Machine Learning Constructives and Local Searches for the Travelling Salesman Problem. CoRR abs/2108.00938 (2021) - [i1]Umberto Junior Mele, Luca Maria Gambardella, Roberto Montemanni:
A New Constructive Heuristic driven by Machine Learning for the Traveling Salesman Problem. CoRR abs/2108.10224 (2021) - 2020
- [j47]Derek H. Smith, Roberto Montemanni, Stephanie Perkins:
The Use of an Exact Algorithm within a Tabu Search Maximum Clique Algorithm. Algorithms 13(10): 253 (2020) - [j46]Mauro Dell'Amico, Roberto Montemanni, Stefano Novellani:
Matheuristic algorithms for the parallel drone scheduling traveling salesman problem. Ann. Oper. Res. 289(2): 211-226 (2020)
2010 – 2019
- 2019
- [j45]Derek H. Smith, Stephanie Perkins, Roberto Montemanni:
Solving the maximum clique problem with a hybrid algorithm. Int. J. Metaheuristics 7(2): 152-175 (2019) - [j44]Pongchanun Luangpaiboon, S. Boonhao, Roberto Montemanni:
Steepest ant sense algorithm for parameter optimisation of multi-response processes based on taguchi design. J. Intell. Manuf. 30(1): 441-457 (2019) - [c25]Xiaochen Chou, Luca Maria Gambardella, Roberto Montemanni:
A Metaheuristic Algorithm for the Probabilistic Orienteering Problem. MLMI 2019: 30-34 - 2018
- [c24]Roberto Montemanni, Federico D'ignazio, Xiaochen Chou, Luca Maria Gambardella:
Machine Learning and Monte Carlo Sampling for the Probabilistic Orienteering Problem. SCIS&ISIS 2018: 14-18 - 2017
- [j43]Murodzhon Akhmedov, Amanda J. Kedaigle, Renan Escalante Chong, Roberto Montemanni, Francesco Bertoni, Ernest Fraenkel, Ivo Kwee:
PCSF: An R-package for network-based interpretation of high-throughput data. PLoS Comput. Biol. 13(7) (2017) - [c23]Murodzhon Akhmedov, Alexander LeNail, Francesco Bertoni, Ivo Kwee, Ernest Fraenkel, Roberto Montemanni:
A Fast Prize-Collecting Steiner Forest Algorithm for Functional Analyses in Biological Networks. CPAIOR 2017: 263-276 - [c22]Jafar Jamal, Ghassan Shobaki, Vassilis Papapanagiotou, Luca Maria Gambardella, Roberto Montemanni:
Solving the sequential ordering problem using branch and bound. SSCI 2017: 1-9 - 2016
- [j42]Murodzhon Akhmedov, Ivo Kwee, Roberto Montemanni:
A divide and conquer matheuristic algorithm for the Prize-collecting Steiner Tree Problem. Comput. Oper. Res. 70: 18-25 (2016) - [c21]Thi Viet Ly Nguyen, Roberto Montemanni:
Integrated home health care optimization via genetic algorithms and mathematical programming. CEC 2016: 553-561 - [c20]Vassilis Papapanagiotou, Roberto Montemanni, Luca Maria Gambardella:
Comparison of Objective Function Evaluators for a Stochastic Orienteering Problem. SCIS&ISIS 2016: 465-471 - [c19]Vassilis Papapanagiotou, Roberto Montemanni, Luca Maria Gambardella:
A Sampling-Based Metaheuristic for the Orienteering Problem with Stochastic Travel Times. TPNC 2016: 97-109 - [c18]Roberto Montemanni, János Barta, Derek H. Smith:
Graph Colouring and Branch and Bound Approaches for Permutation Code Algorithms. WorldCIST (1) 2016: 223-232 - 2015
- [c17]Murodzhon Akhmedov, Ivo Kwee, Roberto Montemanni:
A Comparison of Heuristic Methods for the Prize-Collecting Steiner Tree Problem and Their Application in Genomics. OR 2015: 101-108 - [p2]Andrea Emilio Rizzoli, Roberto Montemanni, Andrea Bettoni, Luca Canetta:
Software Support for Sustainable Supply Chain Configuration and Management. ICT Innovations for Sustainability 2015: 271-283 - 2014
- [j41]Dan Tulpan, Derek H. Smith, Roberto Montemanni:
Thermodynamic Post-Processing versusGC-Content Pre-Processing for DNA CodesSatisfying the Hamming Distance andReverse-Complement Constraints. IEEE ACM Trans. Comput. Biol. Bioinform. 11(2): 441-452 (2014) - [c16]Matthias Klumpp, Nihat Engin Toklu, Vassilis Papapanagiotou, Roberto Montemanni, Luca Maria Gambardella:
Green Bullwhip Effect Cost Simulation in Distribution Networks. LDIC 2014: 387-395 - [c15]Vassilis Papapanagiotou, Roberto Montemanni, Luca Maria Gambardella:
Sampling-Based Objective Function Evaluation Techniques for the Orienteering Problem with Stochastic Travel and Service Times. OR 2014: 445-450 - 2013
- [j40]Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella:
Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling. Comput. Oper. Res. 40(7): 1661-1670 (2013) - [j39]Derek H. Smith, Roberto Montemanni:
Permutation codes with specified packing radius. Des. Codes Cryptogr. 69(1): 95-106 (2013) - [j38]Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella:
A metaheuristic framework for stochastic combinatorial optimization problems based on GPGPU with a case study on the probabilistic traveling salesman problem with deadlines. J. Parallel Distributed Comput. 73(1): 74-85 (2013) - [c14]Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella:
An Improved Heuristic for the Probabilistic Traveling Salesman Problem with Deadlines Based on GPGPU. EUROCAST (1) 2013: 332-339 - [c13]N. E. Toklu, Roberto Montemanni, Luca Maria Gambardella:
A Robust Multiple Ant Colony System for the Capacitated Vehicle Routing Problem. SMC 2013: 1871-1876 - [c12]N. E. Toklu, Roberto Montemanni, Luca Maria Gambardella:
An ant colony system for the capacitated vehicle routing problem with uncertain travel costs. SIS 2013: 32-39 - 2012
- [j37]Derek H. Smith, Roberto Montemanni:
Some Constant Weight Codes from Primitive Permutation Groups. Electron. J. Comb. 19(4): 4 (2012) - [j36]Derek H. Smith, Roberto Montemanni:
A new table of permutation codes. Des. Codes Cryptogr. 63(2): 241-253 (2012) - [j35]Luca Maria Gambardella, Roberto Montemanni, Dennis Weyland:
Coupling ant colony systems with strong local searches. Eur. J. Oper. Res. 220(3): 831-843 (2012) - [c11]Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella:
An Enhanced Ant Colony System for the Probabilistic Traveling Salesman Problem. BIONETICS 2012: 237-249 - [c10]Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella:
Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines. ISCO 2012: 392-403 - 2011
- [j34]János Barta, Valeria Leggieri, Roberto Montemanni, Paolo Nobili, Chefi Triki:
Minimum power multicasting in wireless networks under probabilistic node failures. Comput. Optim. Appl. 49(1): 193-212 (2011) - [j33]Davide Anghinolfi, Roberto Montemanni, Massimo Paolucci, Luca Maria Gambardella:
A hybrid particle swarm optimization approach for the sequential ordering problem. Comput. Oper. Res. 38(7): 1076-1085 (2011) - [j32]Derek H. Smith, Niema Aboluion, Roberto Montemanni, Stephanie Perkins:
Linear and nonlinear constructions of DNA codes with Hamming distance d and constant GC-content. Discret. Math. 311(13): 1207-1219 (2011) - [j31]Roberto Montemanni, Parvaz Mahdabi:
A Linear Programming-based Evolutionary Algorithm for the Minimum Power Broadcast Problem in Wireless Sensor Networks. J. Math. Model. Algorithms 10(2): 145-162 (2011) - [j30]Roberto Montemanni, Valeria Leggieri:
A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks. Math. Methods Oper. Res. 74(3): 327-342 (2011) - [c9]Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella:
Using Statistical Tests for Improving State-of-the-Art Heuristics for the Probabilistic Traveling Salesman Problem with Deadlines. EUROCAST (1) 2011: 448-455 - [c8]Davide Anghinolfi, Luca Maria Gambardella, Roberto Montemanni, Cristiano Nattero, Massimo Paolucci, N. E. Toklu:
A Matheuristic Algorithm for a Large-Scale Energy Management Problem. LSSC 2011: 173-181 - [c7]Luca Maria Gambardella, Roberto Montemanni, Dennis Weyland:
An Enhanced Ant Colony System for the Sequential Ordering Problem. OR 2011: 355-360 - 2010
- [j29]Roberto Montemanni, Derek H. Smith:
Heuristic manipulation, tabu search and frequency assignment. Comput. Oper. Res. 37(3): 543-551 (2010) - [j28]Roberto Montemanni, Valeria Leggieri:
An exact algorithm for the Minimum Power Multicasting Problem in Wireless Sensor Networks. Electron. Notes Discret. Math. 36: 215-222 (2010) - [j27]János Barta, Valeria Leggieri, Roberto Montemanni, Paolo Nobili, Chefi Triki:
Some Valid Inequalities for the Probabilistic Minimum Power Multicasting Problem. Electron. Notes Discret. Math. 36: 463-470 (2010) - [j26]Roberto Montemanni:
Integer Programming Formulations for Maximum Lifetime Broadcasting Problems in Wireless Sensor Networks. Wirel. Sens. Netw. 2(12): 924-935 (2010)
2000 – 2009
- 2009
- [j25]Roberto Montemanni, Derek H. Smith, Andrea Emilio Rizzoli, Luca Maria Gambardella:
Sequential ordering problems for crane scheduling in port terminals. Int. J. Simul. Process. Model. 5(4): 348-361 (2009) - [j24]Roberto Montemanni, Derek H. Smith:
Heuristic algorithms for constructing binary constant weight codes. IEEE Trans. Inf. Theory 55(10): 4651-4656 (2009) - [c6]Roberto Montemanni:
Maximum Lifetime Broadcasting Topologies in Wireless Sensor Networks: Advanced Mathematical Programming Models. HICSS 2009: 1-10 - 2008
- [j23]Luca Negri, Davide Zanetti, Roberto Montemanni, Silvia Giordano:
Power-Optimized Topology Formation and Configuration in Bluetooth Sensor Networks: An Experimental Approach. Ad Hoc Sens. Wirel. Networks 6(1-2): 145-175 (2008) - [j22]Roberto Montemanni, D. H. Smith, Luca Maria Gambardella:
A heuristic manipulation technique for the sequential ordering problem. Comput. Oper. Res. 35(12): 3931-3944 (2008) - [j21]Alberto V. Donati, Roberto Montemanni, Norman Casagrande, Andrea Emilio Rizzoli, Luca Maria Gambardella:
Time dependent vehicle routing problem with a multi ant colony system. Eur. J. Oper. Res. 185(3): 1174-1191 (2008) - [j20]Roberto Montemanni, Valeria Leggieri, Chefi Triki:
Mixed integer formulations for the probabilistic minimum energy broadcast problem in wireless networks. Eur. J. Oper. Res. 190(2): 578-585 (2008) - [j19]Roberto Montemanni, Derek H. Smith:
Construction of Constant GC-Content DNA Codes via a Variable Neighbourhood Search Algorithm. J. Math. Model. Algorithms 7(3): 311-326 (2008) - [j18]J. S. Graham, Roberto Montemanni, Jim N. J. Moon, D. H. Smith:
Frequency assignment, multiple interference and binary constraints. Wirel. Networks 14(4): 449-464 (2008) - 2007
- [j17]Roberto Montemanni:
A Mixed Integer Programming Formulation for the Total Flow Time Single Machine Robust Scheduling Problem with Interval Data. J. Math. Model. Algorithms 6(2): 287-296 (2007) - [j16]Andrea Emilio Rizzoli, Roberto Montemanni, Enzo Lucibello, Luca Maria Gambardella:
Ant colony optimization for real-world vehicle routing problems. Swarm Intell. 1(2): 135-151 (2007) - [j15]Roberto Montemanni, János Barta, Monaldo Mastrolilli, Luca Maria Gambardella:
The Robust Traveling Salesman Problem with Interval Data. Transp. Sci. 41(3): 366-381 (2007) - [j14]Derek H. Smith, Lesley A. Hughes, Jim N. J. Moon, Roberto Montemanni:
Measuring the Effectiveness of Frequency Assignment Algorithms. IEEE Trans. Veh. Technol. 56(1): 331-341 (2007) - [c5]Roberto Montemanni, Derek H. Smith, Luca Maria Gambardella:
Ant Colony Systems for Large Sequential Ordering Problems. SIS 2007: 60-67 - 2006
- [j13]Roberto Montemanni:
A Benders decomposition approach for the robust spanning tree problem with interval data. Eur. J. Oper. Res. 174(3): 1479-1490 (2006) - [j12]Özalp Babaoglu, Geoffrey Canright, Andreas Deutsch, Gianni Di Caro, Frederick Ducatelle, Luca Maria Gambardella, Niloy Ganguly, Márk Jelasity, Roberto Montemanni, Alberto Montresor, Tore Urnes:
Design patterns from biology for distributed computing. ACM Trans. Auton. Adapt. Syst. 1(1): 26-66 (2006) - 2005
- [j11]Roberto Montemanni, Luca Maria Gambardella:
The robust shortest path problem with interval data via Benders decomposition. 4OR 3(4): 315-328 (2005) - [j10]Roberto Montemanni, Luca Maria Gambardella:
Exact algorithms for the minimum power symmetric connectivity problem in wireless networks. Comput. Oper. Res. 32: 2891-2904 (2005) - [j9]Roberto Montemanni, Luca Maria Gambardella:
A branch and bound algorithm for the robust spanning tree problem with interval data. Eur. J. Oper. Res. 161(3): 771-779 (2005) - [j8]Roberto Montemanni, Luca Maria Gambardella, Andrea Emilio Rizzoli, Alberto V. Donati:
Ant Colony System for a Dynamic Vehicle Routing Problem. J. Comb. Optim. 10(4): 327-343 (2005) - [c4]Roberto Montemanni, Luca Maria Gambardella:
Power-Aware Distributed Protocol for a Connectivity Problem in Wireless Sensor Networks. Self-star Properties in Complex Information Systems 2005: 403-416 - [c3]Roberto Montemanni, Luca Maria Gambardella:
Swarm approach for a connectivity problem in wireless networks. SIS 2005: 265-272 - [c2]Roberto Montemanni, Luca Maria Gambardella, Arindam Kumar Das:
The minimum power broadcast problem in wireless networks: a simulated annealing approach. WCNC 2005: 2057-2062 - [p1]Roberto Montemanni, Luca Maria Gambardella, Arindam Kumar Das:
Models and Algorithms for the MPSCP. Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks 2005: 133-146 - 2004
- [j7]Roberto Montemanni, Luca Maria Gambardella:
An exact algorithm for the robust shortest path problem with interval data. Comput. Oper. Res. 31(10): 1667-1680 (2004) - [j6]Roberto Montemanni, D. H. Smith, Stuart M. Allen:
An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem. Eur. J. Oper. Res. 156(3): 736-751 (2004) - [j5]Roberto Montemanni, Luca Maria Gambardella, Alberto V. Donati:
A branch and bound algorithm for the robust shortest path problem with interval data. Oper. Res. Lett. 32(3): 225-232 (2004) - [c1]Roberto Montemanni, Luca Maria Gambardella:
Minimum Power Symmetric Connectivity Problem in Wireless Networks: A New Approach. MWCN 2004: 497-508 - 2003
- [j4]Roberto Montemanni:
Upper and lower bounds for the fixed spectrum frequency assignment problem. 4OR 1(3): 257-260 (2003) - [j3]Roberto Montemanni, Jim N. J. Moon, Derek H. Smith:
An improved tabu search algorithm for the fixed-spectrum frequency-assignment problem. IEEE Trans. Veh. Technol. 52(4): 891-901 (2003) - 2002
- [j2]Roberto Montemanni, Derek H. Smith, Stuart M. Allen:
An ANTS algorithm for the minimum-span frequency-assignment problem with multiple interference. IEEE Trans. Veh. Technol. 51(5): 949-953 (2002) - 2001
- [j1]Roberto Montemanni, D. H. Smith, Stuart M. Allen:
Lower Bounds for Fixed Spectrum Frequency Assignment. Ann. Oper. Res. 107(1-4): 237-250 (2001)
Coauthor Index
Derek H. Smith
aka: D. H. Smith
aka: D. H. Smith
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-09-10 02:11 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:
