default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichele Conforti
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
[j90]Manuel Aprile
, Michele Conforti, Samuel Fiorini, Yuri Faenza, Tony Huynh, Marco Macchia:
Slack matrices, k-products, and 2-level polytopes. Discret. Appl. Math. 354: 199-213 (2024)- [j89]Manuel Aprile, Michele Conforti, Marco Di Summa:
Binary Extended Formulations and Sequential Convexification. Math. Oper. Res. 49(3): 1566-1581 (2024) - 2023
- [j88]Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang:
Complexity of branch-and-bound and cutting planes in mixed-integer optimization. Math. Program. 198(1): 787-810 (2023) - 2022
- [j87]Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang:
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II. Comb. 42(6): 971-996 (2022) - [j86]Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge:
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles. Math. Program. 192(1): 547-566 (2022) - 2021
- [j85]Michele Conforti, Marianna De Santis, Marco Di Summa, Francesco Rinaldi:
Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective. 4OR 19(4): 531-548 (2021) - [j84]Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang:
Split Cuts in the Plane. SIAM J. Optim. 31(1): 331-347 (2021) - [c19]Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang:
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II. IPCO 2021: 383-398 - [i10]Manuel Aprile, Michele Conforti, Marco Di Summa:
Binary extended formulations and sequential convexification. CoRR abs/2106.00354 (2021) - [i9]Manuel Aprile, Michele Conforti, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia:
Slack matrices, k-products, and 2-level polytopes. CoRR abs/2106.12829 (2021) - [i8]Amitabh Basu, Tongtong Chen, Michele Conforti, Hongyi Jiang:
Helly systems and certificates in optimization. CoRR abs/2111.05225 (2021) - 2020
- [j83]Amitabh Basu, Michele Conforti, Marco Di Summa:
An extreme function which is nonnegative and discontinuous everywhere. Math. Program. 179(1): 447-453 (2020) - [j82]Michele Conforti, Marco Di Summa, Yuri Faenza:
Balas formulation for the union of polytopes is optimal. Math. Program. 180(1): 311-326 (2020) - [c18]Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge:
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles. IPCO 2020: 104-116 - [c17]Michele Conforti, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Stefan Weltge:
The stable set problem in graphs with bounded genus and bounded odd cycle packing number. SODA 2020: 2896-2915 - [i7]Manuel Aprile, Michele Conforti, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia:
Recognizing Cartesian products of matrices and polytopes. CoRR abs/2002.02264 (2020) - [i6]Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang:
Complexity of cutting planes and branch-and-bound in mixed-integer optimization. CoRR abs/2003.05023 (2020) - [i5]Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang:
Complexity of branch-and-bound and cutting planes in mixed-integer optimization - II. CoRR abs/2011.05474 (2020)
2010 – 2019
- 2019
- [j81]Amitabh Basu, Michele Conforti, Marco Di Summa, Giacomo Zambelli:
Optimal Cutting Planes from the Group Relaxations. Math. Oper. Res. 44(4): 1208-1220 (2019) - [j80]Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat:
The Structure of the Infinite Models in Integer Programming. Math. Oper. Res. 44(4): 1412-1430 (2019) - [j79]Michele Conforti, Laurence A. Wolsey:
"Facet" separation with one linear program. Math. Program. 178(1-2): 361-380 (2019) - [i4]Michele Conforti, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Stefan Weltge:
The stable set problem in graphs with bounded genus and bounded odd cycle packing number. CoRR abs/1908.06300 (2019) - [i3]Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge:
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles. CoRR abs/1911.12179 (2019) - 2018
- [j78]Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat:
Extreme functions with an arbitrary number of slopes. Math. Program. 172(1-2): 303-327 (2018) - 2017
- [j77]Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Robert Weismantel, Stefan Weltge:
Optimality certificates for convex minimization and Helly numbers. Oper. Res. Lett. 45(6): 671-674 (2017) - [c16]Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat:
The Structure of the Infinite Models in Integer Programming. IPCO 2017: 63-74 - 2016
- [j76]Michele Conforti, Kanstantsin Pashkovich:
The projected faces property and polyhedral relations. Math. Program. 156(1-2): 331-342 (2016) - [j75]Michele Conforti, Samuel Fiorini, Kanstantsin Pashkovich:
Cut Dominants and Forbidden Minors. SIAM J. Discret. Math. 30(3): 1571-1589 (2016) - [j74]Michele Conforti, Marco Di Summa:
Maximal S-Free Convex Sets and the Helly Number. SIAM J. Discret. Math. 30(4): 2206-2216 (2016) - [c15]Amitabh Basu, Michele Conforti, Marco Di Summa, Joseph Paat:
Extreme Functions with an Arbitrary Number of Slopes. IPCO 2016: 190-201 - 2015
- [j73]Michele Conforti, Gérard Cornuéjols, Aris Daniilidis, Claude Lemaréchal, Jérôme Malick:
Cut-Generating Functions and S-Free Sets. Math. Oper. Res. 40(2): 276-391 (2015) - [j72]Amitabh Basu, Michele Conforti, Marco Di Summa:
A geometric approach to cut-generating functions. Math. Program. 151(1): 153-189 (2015) - [j71]Michele Conforti, Bert Gerards, Kanstantsin Pashkovich:
Stable sets and graphs with no even holes. Math. Program. 153(1): 13-39 (2015) - [j70]Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza:
Reverse split rank. Math. Program. 154(1-2): 273-303 (2015) - [j69]Michele Conforti, Volker Kaibel, Matthias Walter, Stefan Weltge:
Subgraph polytopes and independence polytopes of count matroids. Oper. Res. Lett. 43(5): 457-460 (2015) - [j68]Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe:
Reverse Chvátal-Gomory Rank. SIAM J. Discret. Math. 29(1): 166-181 (2015) - [i2]Michele Conforti, Volker Kaibel, Matthias Walter, Stefan Weltge:
Subgraph Polytopes and Independence Polytopes of Count Matroids. CoRR abs/1502.02817 (2015) - 2014
- [j67]Michele Conforti, Alberto Del Pia:
Disjunctive programming and relaxations of polyhedra. Math. Program. 144(1-2): 307-314 (2014) - [c14]Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza:
Reverse Split Rank. IPCO 2014: 234-248 - [i1]Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza:
Reverse Split Rank. CoRR abs/1407.2034 (2014) - 2013
- [j66]Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Extended formulations in combinatorial optimization. Ann. Oper. Res. 204(1): 97-143 (2013) - [j65]Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Unique lifting of integer variables in minimal inequalities. Math. Program. 141(1-2): 561-576 (2013) - [j64]Pierre Bonami, Michele Conforti, Gérard Cornuéjols, Marco Molinaro, Giacomo Zambelli:
Cutting planes from two-term disjunctions. Oper. Res. Lett. 41(5): 442-444 (2013) - [j63]Gennadiy Averkov, Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza:
On the Convergence of the Affine Hull of the Chvátal-Gomory Closures. SIAM J. Discret. Math. 27(3): 1492-1502 (2013) - [c13]Michele Conforti, Gérard Cornuéjols, Aris Daniilidis, Claude Lemaréchal, Jérôme Malick:
Cut-Generating Functions. IPCO 2013: 123-132 - [c12]Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe:
Reverse Chvátal-Gomory Rank. IPCO 2013: 133-144 - 2012
- [j62]Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
A counterexample to a conjecture of Gomory and Johnson. Math. Program. 133(1-2): 25-38 (2012) - 2011
- [j61]Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
A Geometric Perspective on Lifting. Oper. Res. 59(3): 569-577 (2011) - 2010
- [j60]Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Extended formulations in combinatorial optimization. 4OR 8(1): 1-48 (2010) - [j59]Michele Conforti, Laurence A. Wolsey, Giacomo Zambelli:
Projecting an Extended Formulation for Mixed-Integer Covers on Bipartite Graphs. Math. Oper. Res. 35(3): 603-623 (2010) - [j58]Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Maximal Lattice-Free Convex Sets in Linear Subspaces. Math. Oper. Res. 35(3): 704-720 (2010) - [j57]Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Equivalence between intersection cuts and the corner polyhedron. Oper. Res. Lett. 38(3): 153-155 (2010) - [j56]Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Minimal Inequalities for an Infinite Relaxation of Integer Programs. SIAM J. Discret. Math. 24(1): 158-168 (2010) - [c11]Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
On Lifting Integer Variables in Minimal Inequalities. IPCO 2010: 85-95 - [p2]Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Polyhedral Approaches to Mixed Integer Linear Programming. 50 Years of Integer Programming 2010: 343-385
2000 – 2009
- 2009
- [j55]Michele Conforti, Marco Di Summa, Friedrich Eisenbrand, Laurence A. Wolsey:
Network Formulations of Mixed-Integer Programs. Math. Oper. Res. 34(1): 194-209 (2009) - [j54]Michele Conforti, Giacomo Zambelli:
The mixing set with divisible capacities: A simple approach. Oper. Res. Lett. 37(6): 379-383 (2009) - 2008
- [j53]Michele Conforti, Laurence A. Wolsey:
Compact formulations as a union of polyhedra. Math. Program. 114(2): 277-289 (2008) - [c10]Michele Conforti, Marco Di Summa, Laurence A. Wolsey:
The Mixing Set with Divisible Capacities. IPCO 2008: 435-449 - 2007
- [j52]Michele Conforti, Marco Di Summa, Giacomo Zambelli:
Minimally Infeasible Set-Partitioning Problems with Balanced Constraints. Math. Oper. Res. 32(3): 497-507 (2007) - [j51]Michele Conforti, Bert Gerards:
Packing Odd Circuits. SIAM J. Discret. Math. 21(2): 273-302 (2007) - [j50]Michele Conforti, Marco Di Summa, Laurence A. Wolsey:
The Mixing Set with Flows. SIAM J. Discret. Math. 21(2): 396-407 (2007) - [c9]Michele Conforti, Bert Gerards, Giacomo Zambelli:
Mixed-Integer Vertex Covers on Bipartite Graphs. IPCO 2007: 324-336 - [c8]Michele Conforti, Marco Di Summa, Laurence A. Wolsey:
The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows. IPCO 2007: 352-366 - 2006
- [j49]Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements. Comb. 26(5): 533-558 (2006) - [j48]Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic:
Balanced matrices. Discret. Math. 306(19-20): 2411-2437 (2006) - [j47]Michele Conforti, Giacomo Zambelli:
Recognizing Balanceable Matrices. Math. Program. 105(2-3): 161-179 (2006) - [j46]Michele Conforti, Gérard Cornuéjols, Xinming Liu, Kristina Vuskovic, Giacomo Zambelli:
Odd Hole Recognition in Graphs of Bounded Clique Size. SIAM J. Discret. Math. 20(1): 42-48 (2006) - 2005
- [j45]Livio Colussi, Michele Conforti, Giacomo Zambelli:
Disjoint paths in arborescences. Discret. Math. 292(1-3): 187-191 (2005) - 2004
- [j44]Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic:
Decomposition of odd-hole-free graphs by double star cutsets and 2-joins. Discret. Appl. Math. 141(1-3): 41-91 (2004) - [j43]Michele Conforti, Giovanni Rinaldi, Laurence A. Wolsey:
On the cut polyhedron. Discret. Math. 277(1-3): 279-285 (2004) - [j42]Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic:
Square-free perfect graphs. J. Comb. Theory B 90(2): 257-307 (2004) - [c7]Michele Conforti, Anna Galluccio, Guido Proietti:
Edge-Connectivity Augmentation and Network Matrices. WG 2004: 355-364 - [p1]Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Bicolorings and Equitable Bicolorings of Matrices. The Sharpest Cut 2004: 33-37 - 2003
- [j41]Michele Conforti, Gérard Cornuéjols:
Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs. J. Comb. Theory B 87(2): 300-330 (2003) - [j40]Michele Conforti, Refael Hassin, R. Ravi:
Reconstructing edge-disjoint paths. Oper. Res. Lett. 31(3): 273-276 (2003) - 2002
- [j39]Michele Conforti, Gérard Cornuéjols, Grigor Gasparyan, Kristina Vuskovic:
Perfect Graphs, Partitionable Graphs and Cutsets. Comb. 22(1): 19-33 (2002) - [j38]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Even-hole-free graphs part I: Decomposition theorem. J. Graph Theory 39(1): 6-49 (2002) - [j37]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Even-hole-free graphs part II: Recognition algorithm. J. Graph Theory 40(4): 238-266 (2002) - 2001
- [j36]Michele Conforti, Romeo Rizzi:
Shortest paths in conservative graphs. Discret. Math. 226(1-3): 143-153 (2001) - [j35]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Perfect, ideal and balanced matrices. Eur. J. Oper. Res. 133(3): 455-461 (2001) - [j34]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Balanced 0-1 Matrices I. Decomposition. J. Comb. Theory B 81(2): 243-274 (2001) - [j33]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Balanced 0-1 Matrices II. Recognition Algorithm. J. Comb. Theory B 81(2): 275-306 (2001) - 2000
- [j32]Michele Conforti, Bert Gerards, Ajai Kapoor:
A Theorem of Truemper. Comb. 20(1): 15-26 (2000) - [j31]Lorenzo Brunetta, Michele Conforti, Matteo Fischetti:
A polyhedral approach to an integer multicommodity flow problem. Discret. Appl. Math. 101(1-3): 13-36 (2000) - [j30]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Triangle-free graphs that are signable without even holes. J. Graph Theory 34(3): 204-220 (2000)
1990 – 1999
- 1999
- [j29]Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic:
Balanced cycles and holes in bipartite graphs. Discret. Math. 199(1-3): 27-33 (1999) - [j28]Michele Conforti, Gérard Cornuéjols, M. R. Rao:
Decomposition of Balanced Matrices. J. Comb. Theory B 77(2): 292-406 (1999) - [j27]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Even and odd holes in cap-free graphs. J. Graph Theory 30(4): 289-308 (1999) - 1998
- [c6]Michele Conforti, Ajai Kapoor:
A Theorem of Truemper. IPCO 1998: 53-68 - 1997
- [j26]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Universally Signable Graphs. Comb. 17(1): 67-77 (1997) - [j25]Lorenzo Brunetta, Michele Conforti, Giovanni Rinaldi:
A branch-and-cut algorithm for the equicut problem. Math. Program. 77: 243-263 (1997) - [c5]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Finding an Even Hole in a Graph. FOCS 1997: 480-485 - 1996
- [j24]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Perfect Matchings in Balanced Hypergraphs. Comb. 16(3): 325-329 (1996) - [j23]Paolo Codato, Michele Conforti, Claudia Serafini:
Packing T-joins. J. Graph Theory 22(4): 293-296 (1996) - 1995
- [j22]Michele Conforti, Gérard Cornuéjols, M. R. Rao:
Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs. Discret. Appl. Math. 62(1-3): 103-117 (1995) - [j21]Michele Conforti, Gérard Cornuéjols:
A Class of Logic Problems Solvable by Linear Programming. J. ACM 42(5): 1107-1113 (1995) - [j20]Michele Conforti, Gérard Cornuéjols:
Balanced 0, +-1-matrixces, bicoloring and total dual integrality. Math. Program. 71: 249-258 (1995) - [c4]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
A Mickey-Mouse Decomposition Theorem. IPCO 1995: 321-328 - 1994
- [j19]Michele Conforti, Gérard Cornuéjols, Klaus Truemper:
From Totally Unimodular to Balanced 0, ±1 Matrices: A Family of Integer Polytopes. Math. Oper. Res. 19(1): 21-23 (1994) - [c3]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Recognizing Balanced 0, +/- Matrices. SODA 1994: 103-111 - 1993
- [j18]Michele Conforti, M. R. Rao:
Testing balancedness and perfection of linear matrices. Math. Program. 61: 1-18 (1993) - 1992
- [j17]Michele Conforti, M. R. Rao:
Articulation sets in linear perfect matrices I: forbidden configurations and star cutsets. Discret. Math. 104(1): 23-47 (1992) - [j16]Michele Conforti, M. R. Rao:
Articulation sets in linear perfect matrices II: the wheel theorem and clique articulations. Discret. Math. 110(1-3): 81-118 (1992) - [j15]Michele Conforti, M. R. Rao:
Properties of balanced and perfect matrices. Math. Program. 55: 35-47 (1992) - [j14]Michele Conforti, M. R. Rao:
Structural properties and decomposition of linear balanced matrices. Math. Program. 55: 129-168 (1992) - [c2]Michele Conforti, Gérard Cornuéjols:
A Class of Logic Problems Solvable by Linear Programming. FOCS 1992: 670-675 - 1991
- [j13]Michele Conforti, M. R. Rao, Antonio Sassano:
The equipartition polytope. I: Formulations, dimension and basic facets. Math. Program. 49: 49-70 (1991) - [j12]Michele Conforti, M. R. Rao, Antonio Sassano:
The equipartition polytope. II: Valid inequalities and facets. Math. Program. 49: 71-90 (1991) - 1990
- [c1]Michele Conforti, Gérard Cornuéjols:
A Decomposition Theorem for Balanced Matrices. IPCO 1990: 147-169
1980 – 1989
- 1989
- [j11]Michele Conforti, Monique Laurent:
On the geometric structure of independence systems. Math. Program. 45(1-3): 255-277 (1989) - [j10]Michele Conforti, M. R. Rao:
Odd cycles and matrices with integrality properties. Math. Program. 45(1-3): 279-294 (1989) - 1988
- [j9]Michele Conforti, Monique Laurent:
A characterization of matroidal systems of inequalities. Discret. Math. 69(2): 165-171 (1988) - [j8]Michele Conforti, Monique Laurent:
On the Facial Structure of Independence System Polyhedra. Math. Oper. Res. 13(4): 543-555 (1988) - 1987
- [j7]Francisco Barahona, Michele Conforti:
A construction for binary matroids. Discret. Math. 66(3): 213-218 (1987) - [j6]Michele Conforti, Derek Gordon Corneil, Ali Ridha Mahjoub:
Ki-covers. II. Ki-perfect graphs. J. Graph Theory 11(4): 569-584 (1987) - [j5]Michele Conforti, M. R. Rao:
Some New Matroids on Graphs: Cut Sets and the Max Cut Problem. Math. Oper. Res. 12(2): 193-204 (1987) - [j4]Michele Conforti, M. R. Rao:
Structural properties and recognition of restricted and strongly unimodular matrices. Math. Program. 38(1): 17-27 (1987) - [j3]Michele Conforti, Gérard Cornuéjols:
An algorithmic framework for the matching problem in some hypergraphs. Networks 17(4): 365-386 (1987) - 1986
- [j2]Michele Conforti, Derek G. Corneil, Ali Ridha Mahjoub:
Ki-covers I: Complexity and polytopes. Discret. Math. 58(2): 121-142 (1986) - 1984
- [j1]Michele Conforti, Gérard Cornuéjols:
Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. Discret. Appl. Math. 7(3): 251-274 (1984)
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-09-22 00:35 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:
