default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlberto Caprara
Person information
- affiliation: University of Bologna, Italy
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2019
[j81]Valentina Cacchiani
, Alberto Caprara, Paolo Toth:
An Effective Peak Period Heuristic for Railway Rolling Stock Planning. Transp. Sci. 53(3): 746-762 (2019)- 2016
- [j80]Alberto Caprara, Marco Locatelli, Michele Monaci:
Theoretical and computational results about optimality-based domain reductions. Comput. Optim. Appl. 64(2): 513-533 (2016) - [j79]Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger:
Bilevel Knapsack with Interdiction Constraints. INFORMS J. Comput. 28(2): 319-333 (2016) - [j78]Alberto Caprara, Fabio Furini, Enrico Malaguti, Emiliano Traversi:
Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation. Inf. Process. Lett. 116(5): 379-386 (2016) - 2015
- [j77]Martin Bergner, Alberto Caprara, Alberto Ceselli, Fabio Furini, Marco E. Lübbecke, Enrico Malaguti, Emiliano Traversi:
Automatic Dantzig-Wolfe reformulation of mixed integer programs. Math. Program. 149(1-2): 391-424 (2015) - [j76]Alberto Caprara, Mauro Dell'Amico, José Carlos Díaz Díaz, Manuel Iori, Romeo Rizzi:
Friendly bin packing instances without Integer Round-up Property. Math. Program. 150(1): 5-17 (2015) - [j75]Alberto Caprara:
Timetabling and assignment problems in railway planning and integer multicommodity flow. Networks 66(1): 1-10 (2015) - 2014
- [j74]Alberto Caprara, Laura Galli, Sebastian Stiller, Paolo Toth:
Delay-Robust Event Scheduling. Oper. Res. 62(2): 274-283 (2014) - [j73]Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger:
A Study on the Computational Complexity of the Bilevel Knapsack Problem. SIAM J. Optim. 24(2): 823-838 (2014) - [j72]Alberto Caprara, Fabio Furini, Andrea Lodi, Mauro Mangia, Riccardo Rovatti, Gianluca Setti:
Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics. IEEE Trans. Signal Process. 62(6): 1603-1612 (2014) - 2013
- [j71]Valentina Cacchiani, Alberto Caprara, Roberto Roberti, Paolo Toth:
A new lower bound for curriculum-based course timetabling. Comput. Oper. Res. 40(10): 2466-2477 (2013) - [j70]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
A Lagrangian heuristic for a train-unit assignment problem. Discret. Appl. Math. 161(12): 1707-1718 (2013) - [j69]Alberto Caprara, Fabio Furini, Enrico Malaguti:
Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem. INFORMS J. Comput. 25(3): 560-571 (2013) - [j68]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
Finding cliques of maximum weight on a generalization of permutation graphs. Optim. Lett. 7(2): 289-296 (2013) - [j67]Valentina Cacchiani, Alberto Caprara, Gábor Maróti, Paolo Toth:
On integer polytopes with few nonzero vertices. Oper. Res. Lett. 41(1): 74-77 (2013) - [c37]Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger:
A Complexity and Approximability Study of the Bilevel Knapsack Problem. IPCO 2013: 98-109 - 2012
- [j66]Christoph Buchheim, Alberto Caprara, Andrea Lodi:
An effective branch-and-bound algorithm for convex quadratic integer programming. Math. Program. 135(1-2): 369-395 (2012) - [j65]Francesco Paterna, Andrea Acquaviva, Alberto Caprara, Francesco Papariello, Giuseppe Desoli, Luca Benini:
Variability-Aware Task Allocation for Energy-Efficient Quality of Service Provisioning in Embedded Streaming Multimedia Applications. IEEE Trans. Computers 61(7): 939-953 (2012) - [j64]Valentina Cacchiani, Alberto Caprara, Matteo Fischetti:
A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling. Transp. Sci. 46(1): 124-133 (2012) - [j63]Valentina Cacchiani, Alberto Caprara, Laura Galli, Leo G. Kroon, Gábor Maróti, Paolo Toth:
Railway Rolling Stock Planning: Robustness Against Large Disruptions. Transp. Sci. 46(2): 217-232 (2012) - [c36]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
A Fast Heuristic Algorithm for the Train Unit Assignment Problem. ATMOS 2012: 1-9 - [c35]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
Models and Algorithms for the Train Unit Assignment Problem. ISCO 2012: 24-35 - 2011
- [j62]Alberto Caprara, Adam N. Letchford, Juan José Salazar González:
Decorous Lower Bounds for Minimum Linear Arrangement. INFORMS J. Comput. 23(1): 26-40 (2011) - [j61]Alberto Caprara, Marcus Oswald, Gerhard Reinelt, Robert Schwarz, Emiliano Traversi:
Optimal linear arrangements using betweenness variables. Math. Program. Comput. 3(3): 261-280 (2011) - [j60]Alberto Caprara, Enrico Malaguti, Paolo Toth:
A Freight Service Design Problem for a Railway Corridor. Transp. Sci. 45(2): 147-162 (2011) - [j59]Alberto Caprara, Laura Galli, Paolo Toth:
Solution of the Train Platforming Problem. Transp. Sci. 45(2): 246-257 (2011) - [c34]Alberto Caprara, Spyros C. Kontogiannis:
Frontmatter, Table of Contents, Preface, Workshop Organization. ATMOS 2011 - [c33]Francesco Paterna, Andrea Acquaviva, Alberto Caprara, Francesco Papariello, Giuseppe Desoli, Luca Benini:
An efficient on-line task allocation algorithm for QoS and energy efficiency in multicore multimedia platforms. DATE 2011: 100-105 - [c32]Martin Bergner, Alberto Caprara, Fabio Furini, Marco E. Lübbecke, Enrico Malaguti, Emiliano Traversi:
Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation. IPCO 2011: 39-51 - [e1]Alberto Caprara, Spyros C. Kontogiannis:
ATMOS 2011 - 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, Saarbrücken, Germany, September 8, 2011. OASIcs 20, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2011, ISBN 978-3-939897-33-0 [contents] - 2010
- [j58]Alberto Caprara, Andrea Lodi, Michele Monaci:
An approximation scheme for the two-stage, two-dimensional knapsack problem. Discret. Optim. 7(3): 114-124 (2010) - [j57]Alberto Caprara, Adam N. Letchford, Juan José Salazar González:
Lower Bounds for the Minimum Linear Arrangement of a Graph. Electron. Notes Discret. Math. 36: 843-849 (2010) - [j56]Alberto Caprara, Adam N. Letchford:
New techniques for cost sharing in combinatorial optimization games. Math. Program. 124(1-2): 93-118 (2010) - [j55]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
Solving a real-world train-unit assignment problem. Math. Program. 124(1-2): 207-231 (2010) - [j54]Alberto Caprara, Marco Locatelli:
Global optimization problems and domain reduction strategies. Math. Program. 125(1): 123-137 (2010) - [j53]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
Non-cyclic train timetabling and comparability graphs. Oper. Res. Lett. 38(3): 179-184 (2010) - [c31]Alberto Caprara:
Almost 20 Years of Combinatorial Optimization for Railway Planning: from Lagrangian Relaxation to Column Generation. ATMOS 2010: 1-12 - [c30]Alberto Caprara, Laura Galli, Leo G. Kroon, Gábor Maróti, Paolo Toth:
Robust Train Routing and Online Re-scheduling. ATMOS 2010: 24-33 - [c29]Francesco Paterna, Andrea Acquaviva, Alberto Caprara, Francesco Papariello, Giuseppe Desoli, Luca Benini:
Variability-tolerant run-time workload allocation for MPSoC energy minimization under real-time constraints. Conf. Computing Frontiers 2010: 109-110 - [c28]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
A Heuristic Algorithm for the Train-Unit Assignment Problem. CTW 2010: 33-36 - [c27]Federico Bizzarri, Christoph Buchheim, Sergio Callegari, Alberto Caprara, Andrea Lodi, Riccardo Rovatti, Gianluca Setti:
Practical Solution of Periodic Filtered Approximation as a Convex Quadratic Integer Program. CSDM 2010: 149-160 - [c26]Christoph Buchheim, Alberto Caprara, Andrea Lodi:
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming. IPCO 2010: 285-298
2000 – 2009
- 2009
- [j52]Alberto Caprara, Michele Monaci:
Bidimensional packing by bilinear programming. Math. Program. 118(1): 75-108 (2009) - [j51]Nikhil Bansal, Alberto Caprara, Maxim Sviridenko:
A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing. SIAM J. Comput. 39(4): 1256-1278 (2009) - [c25]Valentina Cacchiani, Alberto Caprara, Matteo Fischetti:
Robustness in Train Timetabling. CTW 2009: 171-174 - [c24]Nikhil Bansal, Alberto Caprara, Klaus Jansen, Lars Prädel, Maxim Sviridenko:
A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability. ISAAC 2009: 77-86 - 2008
- [j50]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
A column generation approach to train timetabling on a corridor. 4OR 6(2): 125-142 (2008) - [j49]André Renato Sales Amaral, Alberto Caprara, Adam N. Letchford, Juan José Salazar González:
A New Lower Bound for the Minimum Linear Arrangement of a Graph. Electron. Notes Discret. Math. 30: 87-92 (2008) - [j48]Alberto Caprara:
Constrained 0-1 quadratic programming: Basic approaches and extensions. Eur. J. Oper. Res. 187(3): 1494-1503 (2008) - [j47]Alberto Caprara:
Packing d-Dimensional Bins in d Stages. Math. Oper. Res. 33(1): 203-215 (2008) - [c23]Valentina Cacchiani, Alberto Caprara, Laura Galli, Leo G. Kroon, Gábor Maróti:
Recoverable Robustness for Railway Rolling Stock Planning. ATMOS 2008 - [c22]Alberto Caprara, Emiliano Traversi, Joerg Schweizer:
An Application of Network Design with Orientation Constraints. CTW 2008: 16-21 - 2007
- [j46]Giuseppe Andreello, Alberto Caprara, Matteo Fischetti:
Embedding {0, }-Cuts in a Branch-and-Cut Framework: A Computational Study. INFORMS J. Comput. 19(2): 229-238 (2007) - [c21]Valentina Cacchiani, Alberto Caprara, Paolo Toth:
Solving a Real-World Train Unit Assignment Problem. ATMOS 2007 - [c20]Alberto Caprara, Laura Galli, Paolo Toth:
Solution of the Train Platforming Problem. ATMOS 2007 - [p1]Alberto Caprara, Leo G. Kroon, Michele Monaci, Marc Peeters, Paolo Toth:
Chapter 3 Passenger Railway Optimization. Transportation 2007: 129-187 - 2006
- [j45]Alberto Caprara, Michele Monaci, Paolo Toth, Pier Luigi Guida:
A Lagrangian heuristic algorithm for a real-world train timetabling problem. Discret. Appl. Math. 154(5): 738-753 (2006) - [j44]Alberto Caprara, Andrea Lodi, Silvano Martello, Michele Monaci:
Packing into the smallest square: Worst-case analysis of lower bounds. Discret. Optim. 3(4): 317-326 (2006) - [j43]Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert:
A branch-and-cut algorithm for multiple sequence alignment. Math. Program. 105(2-3): 387-425 (2006) - [c19]Nikhil Bansal, Alberto Caprara, Maxim Sviridenko:
Improved approximation algorithms for multidimensional bin packing problems. FOCS 2006: 697-708 - 2005
- [j42]Alberto Caprara, Juan José Salazar González:
Laying Out Sparse Graphs with Provably Minimum Bandwidth. INFORMS J. Comput. 17(3): 356-373 (2005) - [j41]Alberto Caprara, Ulrich Pferschy:
Modified subset sum heuristics for bin packing. Inf. Process. Lett. 96(1): 18-23 (2005) - [j40]Alberto Caprara, Andrea Lodi, Michele Monaci:
Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing. Math. Oper. Res. 30(1): 150-172 (2005) - [j39]Federico Angiolini, Luca Benini, Alberto Caprara:
An efficient profile-based algorithm for scratchpad memory partitioning. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 24(11): 1660-1676 (2005) - [c18]Alberto Caprara, Marco Locatelli, Michele Monaci:
Bidimensional Packing by Bilinear Programming. IPCO 2005: 377-391 - 2004
- [j38]Alberto Caprara:
Knapsack problems: A book review. 4OR 2(4): 317-320 (2004) - [j37]Alberto Caprara, Robert D. Carr, Sorin Istrail, Giuseppe Lancia, Brian Walenz:
1001 Optimal PDB Structure Alignments: Integer Programming Methods for Finding the Maximum Contact Map Overlap. J. Comput. Biol. 11(1): 27-52 (2004) - [j36]Alberto Caprara, Alessandro Panconesi, Romeo Rizzi:
Packing cuts in undirected graphs. Networks 44(1): 1-11 (2004) - [j35]Alberto Caprara, Andrea Lodi, Romeo Rizzi:
On d-threshold graphs and d-dimensional bin packing. Networks 44(4): 266-280 (2004) - [j34]Alberto Caprara, Michele Monaci:
On the two-dimensional Knapsack Problem. Oper. Res. Lett. 32(1): 5-14 (2004) - [j33]Alberto Caprara, Ulrich Pferschy:
Worst-case analysis of the subset sum algorithm for bin packing. Oper. Res. Lett. 32(2): 159-166 (2004) - [j32]Alberto Caprara:
Book reviews. Oper. Res. Lett. 32(5): 496-497 (2004) - 2003
- [j31]Alberto Caprara, Hans Kellerer, Ulrich Pferschy:
A 3/4-Approximation Algorithm for Multiple Subset Sum. J. Heuristics 9(2): 99-111 (2003) - [j30]Alberto Caprara:
The Reversal Median Problem. INFORMS J. Comput. 15(1): 93-113 (2003) - [j29]Alberto Caprara, Alessandro Panconesi, Romeo Rizzi:
Packing cycles in undirected graphs. J. Algorithms 48(1): 239-256 (2003) - [j28]Alberto Caprara, Adam N. Letchford:
On the separation of split cuts and related inequalities. Math. Program. 94(2-3): 279-294 (2003) - [j27]Alberto Caprara, Michele Monaci, Paolo Toth:
Models and algorithms for a staff scheduling problem. Math. Program. 98(1-3): 445-476 (2003) - [c17]Federico Angiolini, Luca Benini, Alberto Caprara:
Polynomial-time algorithm for on-chip scratchpad memory partitioning. CASES 2003: 318-326 - 2002
- [j26]Alberto Caprara, Federico Malucelli, Daniele Pretolani:
On bandwidth-2 graphs. Discret. Appl. Math. 117(1-3): 1-13 (2002) - [j25]Alberto Caprara, Matteo Fischetti, Paolo Toth:
Modeling and Solving the Train Timetabling Problem. Oper. Res. 50(5): 851-861 (2002) - [j24]Claudio Arbib, Alberto Caprara:
On the stability number of the edge intersection of two graphs. Inf. Process. Lett. 83(3): 173-174 (2002) - [j23]Alberto Caprara, Romeo Rizzi:
Packing triangles in bounded degree graphs. Inf. Process. Lett. 84(4): 175-180 (2002) - [j22]Alberto Caprara, Giuseppe F. Italiano, Gurusamy Mohan, Alessandro Panconesi, Aravind Srinivasan:
Wavelength rerouting in optical networks, or the Venetian Routing problem. J. Algorithms 45(2): 93-125 (2002) - [j21]Alberto Caprara, Romeo Rizzi:
Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals. J. Comb. Optim. 6(2): 157-182 (2002) - [j20]Alberto Caprara:
Additive Bounding, Worst-Case Analysis, and the Breakpoint Median Problem. SIAM J. Optim. 13(2): 508-519 (2002) - [c16]Alberto Caprara, Giuseppe Lancia:
Optimal and Near - Optimal Solutions for 3D Structure Comparisons. 3DPVT 2002: 737-745 - [c15]Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert:
Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics. ECCB 2002: 4-16 - [c14]Alberto Caprara:
Packing 2-Dimensional Bins in Harmony. FOCS 2002: 490-499 - [c13]Alberto Caprara, Andrea Lodi, Michele Monaci:
An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem. IPCO 2002: 315-328 - [c12]Alberto Caprara, Giuseppe Lancia:
Structural alignment of large-size proteins via lagrangian relaxation. RECOMB 2002: 100-108 - 2001
- [j19]Alberto Caprara, Paolo Toth:
Lower bounds and algorithms for the 2-dimensional vector packing problem. Discret. Appl. Math. 111(3): 231-262 (2001) - [j18]Alberto Caprara, Giuseppe Lancia, See-Kiong Ng:
Sorting Permutations by Reversals Through Branch-and-Price. INFORMS J. Comput. 13(3): 224-244 (2001) - [c11]Alberto Caprara, Alessandro Panconesi, Romeo Rizzi:
Packing Cycles and Cuts in Undirected Graphs. ESA 2001: 512-523 - [c10]Alberto Caprara, Matteo Fischetti, Pier Luigi Guida, Michele Monaci, Giuseppe Sacco, Paolo Toth:
Solution of Real-World Train Timetabling Problems. HICSS 2001 - [c9]Alberto Caprara, Hans Kellerer, Ulrich Pferschy:
Approximation Schemes for Ordered Vector Packing Problems. RANDOM-APPROX 2001: 63-74 - [c8]Alberto Caprara:
On the Practical Solution of the Reversal Median Problem. WABI 2001: 238-251 - 2000
- [j17]Alberto Caprara, Paolo Toth, Matteo Fischetti:
Algorithms for the Set Covering Problem. Ann. Oper. Res. 98(1-4): 353-371 (2000) - [j16]Alberto Caprara, Hans Kellerer, Ulrich Pferschy, David Pisinger:
Approximation algorithms for knapsack problems with cardinality constraints. Eur. J. Oper. Res. 123(2): 333-345 (2000) - [j15]Alberto Caprara, Hans Kellerer, Ulrich Pferschy:
A PTAS for the Multiple Subset Sum Problem with different knapsack capacities. Inf. Process. Lett. 73(3-4): 111-118 (2000) - [j14]Alberto Caprara, Matteo Fischetti, Adam N. Letchford:
On the separation of maximally violated mod- k cuts. Math. Program. 87(1): 37-56 (2000) - [j13]Alberto Caprara, Hans Kellerer, Ulrich Pferschy:
The Multiple Subset Sum Problem. SIAM J. Optim. 11(2): 308-319 (2000) - [c7]Alberto Caprara, Giuseppe F. Italiano, Gurusamy Mohan, Alessandro Panconesi, Aravind Srinivasan:
Wavelength rerouting in optical networks, or the Venetian routing problem. APPROX 2000: 72-83 - [c6]Alberto Caprara, Giuseppe Lancia, See-Kiong Ng:
Fast practical solution of sorting by reversals. SODA 2000: 12-21
1990 – 1999
- 1999
- [j12]Alberto Caprara, Juan José Salazar González:
Separating Lifted Odd-hole Inequalities to Solve the Index Selection Problem. Discret. Appl. Math. 92(2-3): 111-134 (1999) - [j11]Alberto Caprara, David Pisinger, Paolo Toth:
Exact Solution of the Quadratic Knapsack Problem. INFORMS J. Comput. 11(2): 125-137 (1999) - [j10]Alberto Caprara, Matteo Fischetti, Paolo Toth:
A Heuristic Method for the Set Covering Problem. Oper. Res. 47(5): 730-743 (1999) - [j9]Alberto Caprara:
On the Tightness of the Alternating-Cycle Lower Bound for Sorting by Reversals. J. Comb. Optim. 3(2-3): 149-182 (1999) - [j8]Alberto Caprara:
Sorting Permutations by Reversals and Eulerian Cycle Decompositions. SIAM J. Discret. Math. 12(1): 91-110 (1999) - [c5]Alberto Caprara, Matteo Fischetti, Adam N. Letchford:
On the Separation of Maximally Violated mod-k Cuts. IPCO 1999: 87-98 - [c4]Alberto Caprara:
Formulations and hardness of multiple sorting by reversals. RECOMB 1999: 84-94 - 1998
- [j7]Alberto Caprara:
Properties of some ILP Formulations of a Class of Partitioning Problems. Discret. Appl. Math. 87(1-3): 11-23 (1998) - [j6]Alberto Caprara, Paolo Toth, Daniele Vigo, Matteo Fischetti:
Modeling and Solving the Crew Rostering Problem. Oper. Res. 46(6): 820-830 (1998) - [j5]Alberto Caprara, Romeo Rizzi:
Improving a Family of Approximation Algorithms to Edge Color Multigraphs. Inf. Process. Lett. 68(1): 11-15 (1998) - [j4]Alberto Caprara, Filippo Focacci, Evelina Lamma, Paola Mello, Michela Milano, Paolo Toth, Daniele Vigo:
Integrating Constraint Logic Programming and Operations Research Techniques for the Crew Rostering Problem. Softw. Pract. Exp. 28(1): 49-76 (1998) - [c3]Alberto Caprara, Giuseppe Lancia, See-Kiong Ng:
A column-generation based branch-and-bound algorithm for sorting by reversals. Mathematical Support for Molecular Biology 1998: 213-226 - 1997
- [j3]Alberto Caprara, Matteo Fischetti, Paolo Toth, Daniele Vigo, Pier Luigi Guida:
Algorithms for railway crew management. Math. Program. 79: 125-141 (1997) - [c2]Alberto Caprara:
Sorting by reversals is difficult. RECOMB 1997: 75-83 - 1996
- [j2]Alberto Caprara, Matteo Fischetti:
{0, 1/2}-Chvátal-Gomory cuts. Math. Program. 74: 221-235 (1996) - [c1]Alberto Caprara, Matteo Fischetti, Paolo Toth:
A Heuristic Algorithm for the Set Covering Problem. IPCO 1996: 72-84 - 1995
- [j1]Alberto Caprara, Matteo Fischetti, Dario Maio:
Exact and Approximate Algorithms for the Index Selection Problem in Physical Database Design. IEEE Trans. Knowl. Data Eng. 7(6): 955-967 (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-04-24 22:53 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:
