default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuca Moscardelli
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
[j42]Vittorio Bilò
, Luca Moscardelli, Cosimo Vinci:
Uniform Mixed Equilibria in Network Congestion Games with Link Failures. Math. Oper. Res. 49(1): 509-535 (2024)- [c55]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci:
On Green Sustainability of Resource Selection Games with Equitable Cost-Sharing. AAMAS 2024: 207-215 - [c54]Gianluca Amato, Alessia Amelio, Luciano Caroprese, Piero Chiacchiaretta, Fabio Fioravanti, Luigi Ippoliti, Maria Chiara Meo, Gianpiero Monaco, Christian Morbidoni, Luca Moscardelli, Maurizio Parton, Francesca Scozzari:
AI for Sustainability: Research at Ud'A Node. Ital-IA 2024: 516-521 - [i5]Angelo Fanelli, Laurent Gourvès, Ayumi Igarashi, Luca Moscardelli:
Individually Stable Dynamics in Coalition Formation over Graphs. CoRR abs/2408.11488 (2024) - 2023
- [c53]Gianpiero Monaco, Luca Moscardelli:
Nash Stability in Fractional Hedonic Games with Bounded Size Coalitions. WINE 2023: 509-526 - 2022
- [j41]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Pricing Problems with Buyer Preselection. J. Artif. Intell. Res. 74: 1791-1822 (2022) - [j40]Cosimo Vinci, Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli:
Nash Social Welfare in Selfish and Online Load Balancing. ACM Trans. Economics and Comput. 10(2): 8:1-8:41 (2022) - [c52]Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli:
Hedonic Games with Fixed-Size Coalitions. AAAI 2022: 9287-9295 - [c51]Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci:
Nash Social Welfare in Selfish and Online Load Balancing. ICTCS 2022: 180-187 - [c50]Angelo Fanelli, Gianpiero Monaco, Luca Moscardelli:
Relaxed Core Stability in Fractional Hedonic Games. ISAIM 2022 - [i4]Maurizio Parton, Marco Angelone, Carlo Metta, Stefania D'Ovidio, Roberta Massarelli, Luca Moscardelli, Gianluca Amato:
Artificial intelligence and renegotiation of commercial lease contracts affected by pandemic-related contingencies from Covid-19. The project A.I.A.Co. CoRR abs/2210.09515 (2022) - 2021
- [j39]Vittorio Bilò, Michele Flammini, Luca Moscardelli:
On Nash Equilibria in Non-Cooperative All-Optical Networks. Algorithms 14(1): 15 (2021) - [j38]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation. Algorithms 14(5): 151 (2021) - [j37]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions. Distributed Comput. 34(1): 1-14 (2021) - [j36]Gianpiero Monaco, Luca Moscardelli, Yllka Velaj:
Additively Separable Hedonic Games with Social Context. Games 12(3): 71 (2021) - [j35]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
On the Online Coalition Structure Generation Problem. J. Artif. Intell. Res. 72: 1215-1250 (2021) - [c49]Angelo Fanelli, Gianpiero Monaco, Luca Moscardelli:
Relaxed Core Stability in Fractional Hedonic Games. IJCAI 2021: 182-188 - 2020
- [j34]Gianpiero Monaco, Luca Moscardelli, Yllka Velaj:
Stable outcomes in modified fractional hedonic games. Auton. Agents Multi Agent Syst. 34(1): 4 (2020) - [j33]Vittorio Bilò, Michele Flammini, Luca Moscardelli:
The price of stability for undirected broadcast network design with fair cost allocation is constant. Games Econ. Behav. 123: 359-376 (2020) - [c48]Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci:
Nash Social Welfare in Selfish and Online Load Balancing. WINE 2020: 323-337 - [i3]Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci:
Nash Social Welfare in Selfish and Online Load Balancing. CoRR abs/2007.08263 (2020)
2010 – 2019
- 2019
- [c47]Raffaello Carosi, Gianpiero Monaco, Luca Moscardelli:
Local Core Stability in Simple Symmetric Fractional Hedonic Games. AAMAS 2019: 574-582 - [c46]Gianpiero Monaco, Luca Moscardelli, Yllka Velaj:
On the Performance of Stable Outcomes in Modified Fractional Hedonic Games with Egalitarian Social Welfare. AAMAS 2019: 873-881 - [c45]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Optimality and Nash Stability in Additive Separable Generalized Group Activity Selection Problems. IJCAI 2019: 102-108 - 2018
- [j32]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Nash Stable Outcomes in Fractional Hedonic Games: Existence, Efficiency and Computation. J. Artif. Intell. Res. 62: 315-371 (2018) - [j31]Vittorio Bilò, Angelo Fanelli, Luca Moscardelli:
Opinion formation games with dynamic social influences. Theor. Comput. Sci. 746: 73-87 (2018) - [c44]Gianpiero Monaco, Luca Moscardelli, Yllka Velaj:
Stable Outcomes in Modified Fractional Hedonic Games. AAMAS 2018: 937-945 - [c43]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Online Coalition Structure Generation in Graph Games. AAMAS 2018: 1353-1361 - [c42]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
On the Impact of Buyers Preselection in Pricing Problems. AAMAS 2018: 1871-1873 - [c41]Vittorio Bilò, Luca Moscardelli, Cosimo Vinci:
Uniform Mixed Equilibria in Network Congestion Games with Link Failures. ICALP 2018: 146:1-146:14 - [c40]Gianpiero Monaco, Luca Moscardelli, Yllka Velaj:
Hedonic Games with Social Context. ICTCS 2018: 24-35 - [c39]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Pricing Problems with Buyer Preselection. MFCS 2018: 47:1-47:16 - [i2]Gianpiero Monaco, Luca Moscardelli, Yllka Velaj:
Stable Outcomes in Modified Fractional Hedonic Games. CoRR abs/1804.05040 (2018) - 2017
- [j30]Vittorio Bilò, Angelo Fanelli, Luca Moscardelli:
On lookahead equilibria in congestion games. Math. Struct. Comput. Sci. 27(2): 197-214 (2017) - [j29]Michele Flammini, Vasco Gallotti, Giovanna Melideo, Gianpiero Monaco, Luca Moscardelli:
Network Movement Games. Theor. Comput. Sci. 667: 101-118 (2017) - 2016
- [j28]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
The price of envy-freeness in machine scheduling. Theor. Comput. Sci. 613: 65-78 (2016) - [c38]Vittorio Bilò, Angelo Fanelli, Luca Moscardelli:
Opinion Formation Games with Dynamic Social Influences. WINE 2016: 444-458 - 2015
- [j27]Anna Angelucci, Vittorio Bilò, Michele Flammini, Luca Moscardelli:
On the sequential price of anarchy of isolation games. J. Comb. Optim. 29(1): 165-181 (2015) - [j26]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Some Anomalies of Farsighted Strategic Behavior. Theory Comput. Syst. 56(1): 156-180 (2015) - [c37]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
On the Price of Stability of Fractional Hedonic Games. AAMAS 2015: 1239-1247 - [c36]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions. WINE 2015: 118-131 - 2014
- [j25]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. Algorithmica 68(3): 671-691 (2014) - [c35]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
The Price of Envy-Freeness in Machine Scheduling. MFCS (2) 2014: 106-117 - [c34]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Nash Stability in Fractional Hedonic Games. WINE 2014: 486-491 - 2013
- [j24]Luca Moscardelli:
Convergence Issues in Congestion Games. Bull. EATCS 111 (2013) - [j23]Angelo Fanelli, Michele Flammini, Luca Moscardelli:
Stackelberg Strategies for Network Design Games. Internet Math. 9(4): 336-359 (2013) - [j22]Vittorio Bilò, Michele Flammini, Luca Moscardelli:
The price of stability of fair undirected broadcast games is constant. SIGecom Exch. 12(2): 42-45 (2013) - [j21]Ioannis Caragiannis, Michele Flammini, Luca Moscardelli:
An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks. IEEE/ACM Trans. Netw. 21(4): 1322-1331 (2013) - [c33]Anna Angelucci, Vittorio Bilò, Michele Flammini, Luca Moscardelli:
On the Sequential Price of Anarchy of Isolation Games. COCOON 2013: 17-28 - [c32]Vittorio Bilò, Michele Flammini, Luca Moscardelli:
The Price of Stability for Undirected Broadcast Network Design with Fair Cost Allocation Is Constant. FOCS 2013: 638-647 - [c31]Vittorio Bilò, Angelo Fanelli, Luca Moscardelli:
On Lookahead Equilibria in Congestion Games. WINE 2013: 54-67 - 2012
- [j20]Angelo Fanelli, Michele Flammini, Luca Moscardelli:
The speed of convergence in congestion games under best-response dynamics. ACM Trans. Algorithms 8(3): 25:1-25:15 (2012) - [c30]Angelo Fanelli, Luca Moscardelli, Alexander Skopalik:
On the Impact of Fair Best Response Dynamics. MFCS 2012: 360-371 - [c29]Michele Flammini, Vasco Gallotti, Giovanna Melideo, Gianpiero Monaco, Luca Moscardelli:
Mobile Network Creation Games. SIROCCO 2012: 159-170 - [c28]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
Some Anomalies of Farsighted Strategic Behavior. WAOA 2012: 229-241 - 2011
- [j19]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
Graphical Congestion Games. Algorithmica 61(2): 274-297 (2011) - [j18]Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli:
Tight Bounds for Selfish and Greedy Load Balancing. Algorithmica 61(3): 606-637 (2011) - [j17]Angelo Fanelli, Luca Moscardelli:
On best response dynamics in weighted congestion games with polynomial delays. Distributed Comput. 24(5): 245-254 (2011) - [j16]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
On the performances of Nash equilibria in isolation games. J. Comb. Optim. 22(3): 378-391 (2011) - [j15]Angelo Fanelli, Michele Flammini, Domenico Mango, Giovanna Melideo, Luca Moscardelli:
Experimental Evaluations of Algorithms for IP Table Minimization. J. Interconnect. Networks 12(4): 299-318 (2011) - [j14]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
Performance of One-Round Walks in Linear Congestion Games. Theory Comput. Syst. 49(1): 24-45 (2011) - [j13]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Optimizing regenerator cost in traffic grooming. Theor. Comput. Sci. 412(52): 7109-7121 (2011) - [j12]Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks:
On the complexity of the regenerator placement problem in optical networks. IEEE/ACM Trans. Netw. 19(2): 498-511 (2011) - [c27]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming. OPODIS 2011: 96-111 - [i1]Angelo Fanelli, Luca Moscardelli, Alexander Skopalik:
On the Impact of Fair Best Response Dynamics. CoRR abs/1104.5642 (2011) - 2010
- [j11]Angelo Fanelli, Michele Flammini, Luca Moscardelli:
On the Convergence of Multicast Games in Directed Networks. Algorithmica 57(2): 301-324 (2010) - [j10]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Giovanna Melideo, Luca Moscardelli:
Designing Fast Converging Cost Sharing Methods for Multicast Transmissions. Theory Comput. Syst. 47(2): 507-530 (2010) - [j9]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
When ignorance helps: Graphical multicast cost sharing games. Theor. Comput. Sci. 411(3): 660-671 (2010) - [j8]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks:
Minimizing total busy time in parallel scheduling with application to optical networks. Theor. Comput. Sci. 411(40-42): 3553-3562 (2010) - [c26]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract). OPODIS 2010: 443-458 - [c25]Angelo Fanelli, Michele Flammini, Luca Moscardelli:
Stackelberg Strategies for Network Design Games. WINE 2010: 222-233 - [p2]Tibor Cinkler, David Coudert, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Xavier Muñoz, Ignasi Sau, Mordechai Shalom, Shmuel Zaks:
Traffic Grooming: Combinatorial Results and Practical Resolutions. Graphs and Algorithms in Communication Networks 2010: 63-94 - [p1]Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Michele Flammini, Christos Kaklamanis, Gianpiero Monaco, Luca Moscardelli:
Game-Theoretic Approaches to Optimization Problems in Communication Networks. Graphs and Algorithms in Communication Networks 2010: 241-263
2000 – 2009
- 2009
- [c24]Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli:
On the Performances of Nash Equilibria in Isolation Games. COCOON 2009: 17-26 - [c23]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks:
Minimizing total busy time in parallel scheduling with application to optical networks. IPDPS 2009: 1-12 - [c22]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
Performances of One-Round Walks in Linear Congestion Games. SAGT 2009: 311-322 - [c21]Michele Flammini, Alberto Marchetti-Spaccamela, Gianpiero Monaco, Luca Moscardelli, Shmuel Zaks:
On the complexity of the regenerator placement problem in optical networks. SPAA 2009: 154-162 - [c20]Angelo Fanelli, Luca Moscardelli:
On Best Response Dynamics in Weighted Congestion Games with Polynomial Delays. WINE 2009: 55-66 - 2008
- [j7]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Selfishness, collusion and power of local search for the ADMs minimization problem. Comput. Networks 52(9): 1721-1731 (2008) - [j6]Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the traffic grooming problem. J. Discrete Algorithms 6(3): 472-479 (2008) - [j5]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the traffic grooming problem in tree and star networks. J. Parallel Distributed Comput. 68(7): 939-948 (2008) - [j4]Michele Flammini, Luca Moscardelli, Alfredo Navarra, Stéphane Pérennes:
Asymptotically Optimal Solutions for Small World Graphs. Theory Comput. Syst. 42(4): 632-650 (2008) - [j3]Vittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli:
On Nash equilibria for multicast transmissions in ad-hoc wireless networks. Wirel. Networks 14(2): 147-157 (2008) - [c19]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the Traffic Grooming Problem with Respect to ADMs and OADMs. Euro-Par 2008: 920-929 - [c18]Angelo Fanelli, Michele Flammini, Luca Moscardelli:
The Speed of Convergence in Congestion Games under Best-Response Dynamics. ICALP (1) 2008: 796-807 - [c17]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
When Ignorance Helps: Graphical Multicast Cost Sharing Games. MFCS 2008: 108-119 - [c16]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
Graphical congestion games with linear latencies. SPAA 2008: 194-196 - [c15]Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
Graphical Congestion Games. WINE 2008: 70-81 - [c14]Vincenzo Auletta, Luca Moscardelli, Paolo Penna, Giuseppe Persiano:
Interference Games in Wireless Networks. WINE 2008: 278-285 - 2007
- [c13]Ioannis Caragiannis, Michele Flammini, Luca Moscardelli:
An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks. ICALP 2007: 447-458 - [c12]Angelo Fanelli, Michele Flammini, Luca Moscardelli:
On the convergence of multicast games in directed networks. SPAA 2007: 330-338 - [c11]Angelo Fanelli, Michele Flammini, Domenico Mango, Giovanna Melideo, Luca Moscardelli:
Experimental Evaluations of Algorithms for IP Table Minimization. WEA 2007: 324-337 - [c10]Stefania Di Giannantonio, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem. WINE 2007: 404-411 - 2006
- [j2]Vittorio Bilò, Michele Flammini, Luca Moscardelli:
Pareto approximations for the bicriteria scheduling problem. J. Parallel Distributed Comput. 66(3): 393-402 (2006) - [j1]Vittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli, Alfredo Navarra:
Sharing the cost of multicast transmissions in wireless networks. Theor. Comput. Sci. 369(1-3): 269-284 (2006) - [c9]Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli:
Tight Bounds for Selfish and Greedy Load Balancing. ICALP (1) 2006: 311-322 - [c8]Angelo Fanelli, Michele Flammini, Giovanna Melideo, Luca Moscardelli:
Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves. MFCS 2006: 363-374 - [c7]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the Traffic Grooming Problem in Tree and Star Networks. WG 2006: 147-158 - 2005
- [c6]Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the Traffic Grooming Problem. ISAAC 2005: 915-924 - [c5]Vittorio Bilò, Michele Flammini, Luca Moscardelli:
On Nash Equilibria in Non-cooperative All-Optical Networks. STACS 2005: 448-459 - [c4]Michele Flammini, Luca Moscardelli, Alfredo Navarra, Stéphane Pérennes:
Asymptotically Optimal Solutions for Small World Graphs. DISC 2005: 414-428 - 2004
- [c3]Vittorio Bilò, Michele Flammini, Luca Moscardelli:
Pareto Approximations for the Bicriteria Scheduling Problem. IPDPS 2004 - [c2]Vittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli:
On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks. ISAAC 2004: 172-183 - [c1]Vittorio Bilò, Luca Moscardelli:
The Price of Anarchy in All-Optical Networks. SIROCCO 2004: 13-22
Coauthor Index
[c55] [j41] [j39] [j38] [j37] [j35] [j33] [c45] [j32] [c43] [c42] [c39] [j29] [j28] [j27] [j26] [c37] [c36] [j25] [c35] [c34] [j23] [j22] [j21] [c33] [c32] [j20] [c29] [c28] [j19] [j18] [j16] [j15] [j14] [j13] [j12] [c27] [j11] [j10] [j9] [j8] [c26] [c25] [p2] [p1] [c24] [c23] [c22] [c21] [j7] [j6] [j5] [j4] [j3] [c19] [c18] [c17] [c16] [c15] [c13] [c12] [c11] [c10] [j2] [j1] [c9] [c8] [c7] [c6] [c5] [c4] [c3] [c2]
[c55] [c54] [c53] [j41] [j40] [c52] [c51] [c50] [j38] [j37] [j36] [j35] [c49] [j34] [c48] [i3] [c47] [c46] [c45] [j32] [c44] [c43] [c42] [c40] [c39] [i2] [j29] [j28] [j26] [c37] [c36] [j25] [c35] [c34] [c29] [c28] [j16] [j13] [j12] [c27] [j8] [c26] [p2] [p1] [c24] [c23] [c21] [j7] [j5] [c19] [c10] [c7]
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-10-09 21:27 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:
