Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIvana Ljubic
Ivana D. Ljubic – Ivana Ljubić
Person information
- unicode name: Ivana Ljubić
- affiliation: ESSEC Business School, Paris, France
- affiliation (former): University of Vienna, Austria
- affiliation (former, 2004): Vienna University of Technology, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j73]Yerlan Kuzbakov, Ivana Ljubic
:
New formulations for two location problems with interconnected facilities. Eur. J. Oper. Res. 314(1): 51-65 (2024)- [i5]Alice Calamita, Ivana Ljubic, Laura Palagi:
Benders decomposition for congested partial set covering location with uncertain demand. CoRR abs/2401.12625 (2024) - 2023
- [j72]Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis:
An exact method for binary fortification games. Eur. J. Oper. Res. 307(3): 1026-1039 (2023) - [j71]Martina Cerulli, Domenico Serra, Carmine Sorgente, Claudia Archetti, Ivana Ljubic:
Mathematical programming formulations for the Collapsed k-Core Problem. Eur. J. Oper. Res. 311(1): 56-72 (2023) - [j70]Yasmine Beck, Ivana Ljubic, Martin Schmidt:
A survey on bilevel optimization under uncertainty. Eur. J. Oper. Res. 311(2): 401-426 (2023) - [j69]Yasmine Beck, Ivana Ljubic, Martin Schmidt:
Exact methods for discrete ${\varGamma }$-robust interdiction problems with an application to the bilevel knapsack problem. Math. Program. Comput. 15(4): 733-782 (2023) - [j68]Ahlam Mouaci, Éric Gourdin, Ivana Ljubic, Nancy Perrot:
Two extended formulations for the virtual network function placement and routing problem. Networks 82(1): 32-51 (2023) - [j67]Cristian Ramirez-Pico, Ivana Ljubic, Eduardo Moreno:
Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs. Transp. Sci. 57(5): 1252-1275 (2023) - 2022
- [j66]Laurent Alfandari, Ivana Ljubic, Marcos de Melo da Silva:
A tailored Benders decomposition approach for last-mile delivery with autonomous robots. Eur. J. Oper. Res. 299(2): 510-525 (2022) - [j65]Claudia Archetti, Ivana Ljubic:
Comparison of formulations for the Inventory Routing Problem. Eur. J. Oper. Res. 303(3): 997-1008 (2022) - [j64]Fabio Furini, Ivana Ljubic, Enrico Malaguti, Paolo Paronuzzi:
Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem. Oper. Res. 70(4): 2399-2420 (2022) - [j63]Stefano Coniglio, Fabio Furini, Ivana Ljubic:
Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems. Math. Program. 196(1): 9-56 (2022) - [j62]Milad Keshvari Fard, Ivana Ljubic, Felix Papier:
Budgeting in International Humanitarian Organizations. Manuf. Serv. Oper. Manag. 24(3): 1562-1577 (2022) - [j61]Elena Fernández, Markus Leitner, Ivana Ljubic, Mario Ruthmair:
Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption. Transp. Sci. 56(5): 1219-1237 (2022) - [c27]Ivana Ljubic:
A Tailored Benders Decomposition Approach for Last-mile Delivery with Autonomous Robots. ICORES 2022: 9 - [c26]Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis:
SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs. IPCO 2022: 262-276 - [e2]Ivana Ljubic, Francisco Barahona, Santanu S. Dey, Ali Ridha Mahjoub:
Combinatorial Optimization - 7th International Symposium, ISCO 2022, Virtual Event, May 18-20, 2022, Revised Selected Papers. Lecture Notes in Computer Science 13526, Springer 2022, ISBN 978-3-031-18529-8 [contents] - [i4]Yuanyuan Li, Claudia Archetti, Ivana Ljubic:
Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates. CoRR abs/2207.00885 (2022) - [i3]Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis:
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. CoRR abs/2207.05014 (2022) - 2021
- [j60]Ivana Ljubic, Ahlam Mouaci, Nancy Perrot, Éric Gourdin:
Benders decomposition for a node-capacitated Virtual Network Function placement and routing problem. Comput. Oper. Res. 130: 105227 (2021) - [j59]Thomas Kleinert, Martine Labbé, Ivana Ljubic, Martin Schmidt:
A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization. EURO J. Comput. Optim. 9: 100007 (2021) - [j58]Eduardo Álvarez-Miranda, Marcos Goycoolea, Ivana Ljubic, Markus Sinnl:
The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements. Eur. J. Oper. Res. 289(3): 1013-1029 (2021) - [j57]Laurent Alfandari, Alborz Hassanzadeh, Ivana Ljubic:
An exact method for assortment optimization under the nested logit model. Eur. J. Oper. Res. 291(3): 830-845 (2021) - [j56]Fabio Furini, Ivana Ljubic, Pablo San Segundo, Yanlu Zhao:
A branch-and-cut algorithm for the Edge Interdiction Clique Problem. Eur. J. Oper. Res. 294(1): 54-69 (2021) - [j55]Ivana Ljubic:
Solving Steiner trees: Recent advances, challenges, and perspectives. Networks 77(2): 177-204 (2021) - [i2]Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis:
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs. CoRR abs/2111.06824 (2021) - [i1]Markus Leitner, Ivana Ljubic, Michele Monaci, Markus Sinnl, Kübra Taninmis:
An Exact Method for Fortification Games. CoRR abs/2111.13400 (2021) - 2020
- [j54]Fabio Furini, Ivana Ljubic, Emiliano Traversi:
Preface: decomposition methods for hard optimization problems. Ann. Oper. Res. 284(2): 483-485 (2020) - [j53]Luis Gouveia, Markus Leitner, Ivana Ljubic:
A polyhedral study of the diameter constrained minimum spanning tree problem. Discret. Appl. Math. 285: 364-379 (2020) - [j52]Fabio Furini, Ivana Ljubic, Enrico Malaguti, Paolo Paronuzzi:
On integer and bilevel formulations for the k-vertex cut problem. Math. Program. Comput. 12(2): 133-164 (2020) - [j51]Georg Brandstätter, Markus Leitner, Ivana Ljubic:
Location of Charging Stations in Electric Car Sharing Systems. Transp. Sci. 54(5): 1408-1438 (2020) - [c25]Ahlam Mouaci, Éric Gourdin, Ivana Ljubic, Nancy Perrot:
Virtual Network Functions Placement and Routing Problem: Path formulation. Networking 2020: 55-63
2010 – 2019
- 2019
- [j50]Ashwin Arulselvan, Andreas Bley, Ivana Ljubic:
The incremental connected facility location problem. Comput. Oper. Res. 112 (2019) - [j49]Jean-François Cordeau, Fabio Furini, Ivana Ljubic:
Benders decomposition for very large scale partial set covering and maximal covering location problems. Eur. J. Oper. Res. 275(3): 882-896 (2019) - [j48]Fabio Furini, Ivana Ljubic, Sébastien Martin, Pablo San Segundo:
The maximum clique interdiction problem. Eur. J. Oper. Res. 277(1): 112-127 (2019) - [j47]Pablo San Segundo, Stefano Coniglio, Fabio Furini, Ivana Ljubic:
A new branch-and-bound algorithm for the maximum edge-weighted clique problem. Eur. J. Oper. Res. 278(1): 76-90 (2019) - [j46]Markus Leitner, Ivana Ljubic, Martin Riedler, Mario Ruthmair:
Exact Approaches for Network Design Problems with Relays. INFORMS J. Comput. 31(1): 171-192 (2019) - [j45]Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl:
Interdiction Games and Monotonicity, with Application to Knapsack Problems. INFORMS J. Comput. 31(2): 390-410 (2019) - 2018
- [j44]Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl:
Decomposition methods for the two-stage stochastic Steiner tree problem. Comput. Optim. Appl. 69(3): 713-752 (2018) - [j43]Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl:
The connected facility location polytope. Discret. Appl. Math. 234: 151-167 (2018) - [j42]Ivana Ljubic, Eduardo Moreno:
Outer approximation and submodular cuts for maximum capture facility location problems with random utilities. Eur. J. Oper. Res. 266(1): 46-56 (2018) - [j41]Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl:
A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems. INFORMS J. Comput. 30(2): 402-420 (2018) - [j40]Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl:
On the use of intersection cuts for bilevel optimization. Math. Program. 172(1-2): 77-103 (2018) - 2017
- [j39]Ivana Ljubic, Petra Mutzel, Bernd Zey:
Stochastic survivable network design problems: Theory and practice. Eur. J. Oper. Res. 256(2): 333-348 (2017) - [j38]Eduardo Álvarez-Miranda, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl:
Solving minimum-cost shared arborescence problems. Eur. J. Oper. Res. 258(3): 887-901 (2017) - [j37]Matthias Ehrgott, Ivana Ljubic, Sophie N. Parragh:
Feature cluster: Recent advances in exact methods for multi-objective optimisation. Eur. J. Oper. Res. 260(3): 805-806 (2017) - [j36]Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl:
An algorithmic framework for the exact solution of tree-star problems. Eur. J. Oper. Res. 261(1): 54-66 (2017) - [j35]Fabio Furini, Ivana Ljubic, Markus Sinnl:
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem. Eur. J. Oper. Res. 262(2): 438-448 (2017) - [j34]Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl:
A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs. Oper. Res. 65(6): 1615-1637 (2017) - [j33]Matteo Fischetti, Ivana Ljubic, Markus Sinnl:
Redesigning Benders Decomposition for Large-Scale Facility Location. Manag. Sci. 63(7): 2146-2162 (2017) - [j32]Matteo Fischetti, Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Michele Monaci, Max Resch, Domenico Salvagnin, Markus Sinnl:
Thinning out Steiner trees: a node-based model for uniform edge costs. Math. Program. Comput. 9(2): 203-229 (2017) - [j31]Andreas Bley, Ivana Ljubic, Olaf Maurer:
A node-based ILP formulation for the node-weighted dominating Steiner problem. Networks 69(1): 33-51 (2017) - [e1]Karl F. Doerner, Ivana Ljubic, Georg Pflug, Gernot Tragler:
Operations Research Proceedings 2015, Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies (GOR, ÖGOR, SVOR/ASRO), University of Vienna, Austria, September 1-4, 2015. Operations Research Proceedings, Springer 2017, ISBN 978-3-319-42901-4 [contents] - 2016
- [j30]Markus Leitner, Ivana Ljubic, Markus Sinnl, Axel Werner:
ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design. Comput. Oper. Res. 72: 128-146 (2016) - [j29]Matteo Fischetti, Ivana Ljubic, Markus Sinnl:
Benders decomposition without separability: A computational study for capacitated facility location problems. Eur. J. Oper. Res. 253(3): 557-569 (2016) - [j28]Markus Sinnl, Ivana Ljubic:
A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints. Math. Program. Comput. 8(4): 461-490 (2016) - [c24]Matteo Fischetti, Ivana Ljubic, Michele Monaci, Markus Sinnl:
Intersection Cuts for Bilevel Optimization. IPCO 2016: 77-88 - 2015
- [j27]Eduardo Álvarez-Miranda, Ivana Ljubic, S. Raghavan, Paolo Toth:
The Recoverable Robust Two-Level Network Design Problem. INFORMS J. Comput. 27(1): 1-19 (2015) - [j26]Markus Leitner, Ivana Ljubic, Markus Sinnl:
A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem. INFORMS J. Comput. 27(1): 118-134 (2015) - [j25]Si Chen, Ivana Ljubic, S. Raghavan:
The Generalized Regenerator Location Problem. INFORMS J. Comput. 27(2): 204-220 (2015) - [j24]Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic:
The two-level diameter constrained spanning tree problem. Math. Program. 150(1): 49-78 (2015) - [c23]Fabio Furini, Ivana Ljubic, Markus Sinnl:
ILP and CP Formulations for the Lazy Bureaucrat Problem. CPAIOR 2015: 255-270 - 2014
- [j23]Ivana Ljubic, Peter Putz, Juan José Salazar González:
A MIP-based approach to solve the prize-collecting local access network design problem. Eur. J. Oper. Res. 235(3): 727-739 (2014) - [j22]Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic:
Hop constrained Steiner trees with multiple root nodes. Eur. J. Oper. Res. 236(1): 100-112 (2014) - [c22]Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Max Resch:
A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs. Hybrid Metaheuristics 2014: 56-70 - [c21]Markus Leitner, Ivana Ljubic, Juan José Salazar González, Markus Sinnl:
On the Asymmetric Connected Facility Location Polytope. ISCO 2014: 371-383 - 2013
- [j21]Eduardo Álvarez-Miranda, Ivana Ljubic, Paolo Toth:
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems. 4OR 11(4): 349-360 (2013) - [j20]Stefan Gollowitzer, Bernard Gendron, Ivana Ljubic:
A cutting plane algorithm for the Capacitated Connected Facility Location Problem. Comput. Optim. Appl. 55(3): 647-674 (2013) - [j19]Andreas Bley, Ivana Ljubic, Olaf Maurer:
Lagrangian decompositions for the two-level FTTx network design problem. EURO J. Comput. Optim. 1(3-4): 221-252 (2013) - [j18]Markus Leitner, Ivana Ljubic, Markus Sinnl:
Solving the bi-objective prize-collecting Steiner tree problem with the ϵ-constraint method. Electron. Notes Discret. Math. 41: 181-188 (2013) - [j17]Ivana Ljubic, Petra Mutzel, Bernd Zey:
Stochastic Survivable Network Design Problems. Electron. Notes Discret. Math. 41: 245-252 (2013) - [j16]Markus Leitner, Ivana Ljubic, Markus Sinnl, Axel Werner:
On the Two-Architecture Connected Facility Location Problem. Electron. Notes Discret. Math. 41: 359-366 (2013) - [j15]Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Ivana Ljubic:
Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities. Eur. J. Oper. Res. 225(2): 211-222 (2013) - [j14]Eduardo Álvarez-Miranda, Ivana Ljubic, Paolo Toth:
Exact approaches for solving robust prize-collecting Steiner tree problems. Eur. J. Oper. Res. 229(3): 599-612 (2013) - [j13]Ivana Ljubic, Stefan Gollowitzer:
Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem. INFORMS J. Comput. 25(2): 256-270 (2013) - [c20]Eduardo Álvarez-Miranda, Ivana Ljubic, Petra Mutzel:
The Rooted Maximum Node-Weight Connected Subgraph Problem. CPAIOR 2013: 300-315 - 2012
- [j12]Jozef Kratica, Markus Leitner, Ivana Ljubic:
Variable Neighborhood Search for Solving the Balanced Location Problem. Electron. Notes Discret. Math. 39: 21-28 (2012) - [j11]Ivana Ljubic, Peter Putz, Juan José Salazar González:
Exact approaches to the single-source network loading problem. Networks 59(1): 89-106 (2012) - [c19]Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic:
On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes. ISCO 2012: 201-212 - 2011
- [j10]Stefan Gollowitzer, Ivana Ljubic:
MIP models for connected facility location: A theoretical and computational study. Comput. Oper. Res. 38(2): 435-449 (2011) - [c18]Eduardo Álvarez-Miranda, Ivana Ljubic, Paolo Toth:
Exact solutions for the robust prize-collecting steiner tree problem. ICUMT 2011: 1-7 - [c17]Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Ivana Ljubic:
A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes. INOC 2011: 57-70 - [c16]Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Ivana Ljubic:
The Two Level Network Design Problem with Secondary Hop Constraints. INOC 2011: 71-76 - [c15]Ivana Ljubic, Peter Putz, Juan José Salazar González:
A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem. INOC 2011: 139-144 - [c14]Ashwin Arulselvan, Andreas Bley, Stefan Gollowitzer, Ivana Ljubic, Olaf Maurer:
MIP Modeling of Incremental Connected Facility Location. INOC 2011: 490-502 - 2010
- [j9]Ivana Ljubic, Stefan Gollowitzer:
Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs. Electron. Notes Discret. Math. 36: 207-214 (2010) - [j8]Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel:
Orientation-based models for {0, 1, 2}-survivable network design: theory and practice. Math. Program. 124(1-2): 413-439 (2010) - [j7]Si Chen, Ivana Ljubic, S. Raghavan:
The regenerator location problem. Networks 55(3): 205-220 (2010) - [j6]Ivana Ljubic:
A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation. Networks 56(3): 169-182 (2010) - [c13]Immanuel M. Bomze, Markus Chimani, Michael Jünger, Ivana Ljubic, Petra Mutzel, Bernd Zey:
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut. ISAAC (1) 2010: 427-439
2000 – 2009
- 2009
- [j5]Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel:
Obtaining optimal k-cardinality trees fast. ACM J. Exp. Algorithmics 14 (2009) - 2008
- [c12]Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel:
Obtaining Optimal k-Cardinality Trees Fast. ALENEX 2008: 27-36 - [c11]Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel:
Strong Formulations for 2-Node-Connected Steiner Network Problems. COCOA 2008: 190-200 - [c10]Alessandro Tomazic, Ivana Ljubic:
A GRASP Algorithm for the Connected Facility Location Problem. SAINT 2008: 257-260 - 2007
- [c9]Ivana Ljubic:
A Hybrid VNS for Connected Facility Location. Hybrid Metaheuristics 2007: 157-169 - 2006
- [j4]Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti:
An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. Math. Program. 105(2-3): 427-449 (2006) - 2005
- [c8]Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti:
Solving the Prize-Collecting Steiner Tree Problem to Optimality. ALENEX/ANALCO 2005: 68-76 - 2004
- [c7]Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra Mutzel, Philipp Neuner, Ulrich Pferschy, Günther R. Raidl, René Weiskircher:
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem. GECCO (1) 2004: 1304-1315 - 2003
- [j3]Ivana Ljubic, Günther R. Raidl:
A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs. J. Heuristics 9(5): 401-427 (2003) - [c6]Gunnar W. Klau, Ivana Ljubic, Petra Mutzel, Ulrich Pferschy, René Weiskircher:
The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract. ESA 2003: 691-702 - [c5]Jozef Kratica, Ivana Ljubic, Dusan Tosic:
A Genetic Algorithm for the Index Selection Problem. EvoWorkshops 2003: 280-290 - 2002
- [j2]Günther R. Raidl, Ivana Ljubic:
Evolutionary local search for the edge-biconnectivity augmentation problem. Inf. Process. Lett. 82(1): 39-45 (2002) - [c4]Sandor Kersting, Günther R. Raidl, Ivana Ljubic:
A Memetic Algorithm for Vertex-Biconnectivity Augmentation. EvoWorkshops 2002: 102-111 - 2001
- [j1]Jozef Kratica, Dusan Tosic, Vladimir Filipovic, Ivana Ljubic:
Solving the simple plant location problem by genetic algorithm. RAIRO Oper. Res. 35(1): 127-142 (2001) - [c3]Ivana Ljubic, Günther R. Raidl:
An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem. EvoWorkshops 2001: 20-29 - 2000
- [c2]Ivana D. Ljubic, Jozef J. Kratica:
A genetic algorithm for the biconnectivity augmentation problem. CEC 2000: 89-96 - [c1]Ivana Ljubic, Günther R. Raidl, Jozef Kratica:
A Hybrid GA for the Edge-Biconnectivity Augmentation Problem. PPSN 2000: 641-650
Coauthor Index
a service of 
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-02 20:12 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:
