default search action
Gabriele Di Stefano
Person information
- affiliation: University of L'Aquila, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j62]Elias John Thomas, S. V. Ullas Chandran, James Tuite
, Gabriele Di Stefano:
On the general position number of Mycielskian graphs. Discret. Appl. Math. 353: 29-43 (2024) - [j61]Elias John Thomas
On monophonic position sets in graphs. Discret. Appl. Math. 354: 72-82 (2024) - [j60]Serafino Cicerone, Gabriele Di Stefano
Mutual-visibility in strong products of graphs via total mutual-visibility. Discret. Appl. Math. 358: 136-146 (2024) - [j59]Maya G. S. Thankachy, S. V. Ullas Chandran
On the vertex position number of graphs. Discuss. Math. Graph Theory 44(3): 1169 (2024) - [j58]Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar, Ismael G. Yero:
Mutual-visibility problems on graphs of diameter two. Eur. J. Comb. 120: 103995 (2024) - [j57]Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra
Molecular pattern formation on grids in the Moblot model. Theor. Comput. Sci. 996: 114510 (2024) - [c60]Gianlorenzo D'Angelo, Mattia D'Emidio, Esmaeil Delfaraz, Gabriele Di Stefano:
Improved Algorithms for the Capacitated Team Orienteering Problem. ATMOS 2024: 7:1-7:17 - [c59]Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra, Francesco Piselli:
Mutual Visibility in Hypercube-Like Graphs. SIROCCO 2024: 192-207 - [c58]Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra:
Gathering of Robots in Butterfly Networks. SSS 2024: 106-120 - [c57]Sahar Badri, Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano:
An Optimal Algorithm for Geodesic Mutual Visibility on Hexagonal Grids. SSS 2024: 161-176 - [i13]Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar, Ismael G. Yero:
Mutual-visibility problems on graphs of diameter two. CoRR abs/2401.02373 (2024) - [i12]Sahar Badri, Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano:
An optimal algorithm for geodesic mutual visibility on hexagonal grids. CoRR abs/2405.13615 (2024) - [i11]Davide Bilò, Alessia Di Fonso, Gabriele Di Stefano, Stefano Leucci:
On the approximability of graph visibility problems. CoRR abs/2407.00409 (2024) - 2023
- [j56]Serafino Cicerone
Molecular Oblivious Robots: A New Model for Robots With Assembling Capabilities. IEEE Access 11: 15701-15724 (2023) - [j55]Serafino Cicerone
On the mutual visibility in Cartesian products and triangle-free graphs. Appl. Math. Comput. 438: 127619 (2023) - [j54]Serafino Cicerone
The geodesic mutual visibility problem: Oblivious robots on grids and trees. Pervasive Mob. Comput. 95: 101842 (2023) - [j53]Serafino Cicerone
Arbitrary pattern formation on infinite regular tessellation graphs. Theor. Comput. Sci. 942: 1-20 (2023) - [j52]Serafino Cicerone
Variety of mutual-visibility problems in graphs. Theor. Comput. Sci. 974: 114096 (2023) - [c56]Serafino Cicerone
The Geodesic Mutual Visibility Problem for Oblivious Robots: the case of Trees. ICDCN 2023: 150-159 - [c55]Serafino Cicerone, Gabriele Di Stefano:
Mutual-visibility in distance-hereditary graphs: a linear-time algorithm. LAGOS 2023: 104-111 - [c54]Serafino Cicerone
Time-Optimal Geodesic Mutual Visibility of Robots on Grids Within Minimum Area. SSS 2023: 385-399 - [i10]Serafino Cicerone, Gabriele Di Stefano, Lara Drozdek, Jaka Hedzet, Sandi Klavzar, Ismael G. Yero:
Variety of mutual-visibility problems in graphs. CoRR abs/2304.00864 (2023) - [i9]Serafino Cicerone, Gabriele Di Stefano:
Mutual-visibility in distance-hereditary graphs: a linear-time algorithm. CoRR abs/2307.10661 (2023) - [i8]Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra:
Time-optimal geodesic mutual visibility of robots on grids within minimum area. CoRR abs/2308.01855 (2023) - [i7]Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra, Francesco Piselli:
Mutual visibility in hypercube-like graphs. CoRR abs/2308.14443 (2023) - 2022
- [j51]Gabriele Di Stefano:
Mutual visibility in graphs. Appl. Math. Comput. 419: 126850 (2022) - [j50]Marc Demange, Alessia Di Fonso, Gabriele Di Stefano, Pierpaolo Vittorini
A graph theoretical approach to the firebreak locating problem. Theor. Comput. Sci. 914: 47-72 (2022) - [c53]Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra:
Molecular Robots with Chirality on Grids. ALGOSENSORS 2022: 45-59 - [i6]Marc Demange, Alessia Di Fonso, Gabriele Di Stefano, Pierpaolo Vittorini:
About the Infinite Windy Firebreak Location problem. CoRR abs/2204.05475 (2022) - 2021
- [j49]Serafino Cicerone
"Semi-Asynchronous": A New Scheduler in Distributed Computing. IEEE Access 9: 41540-41557 (2021) - [j48]Serafino Cicerone
Solving the Pattern Formation by Mobile Robots With Chirality. IEEE Access 9: 88177-88204 (2021) - [j47]Serafino Cicerone
Special Issue on "Graph Algorithms and Applications". Algorithms 14(5): 150 (2021) - [j46]Serafino Cicerone
On the effectiveness of the genetic paradigm for polygonization. Inf. Process. Lett. 171: 106134 (2021) - [j45]Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
A structured methodology for designing distributed algorithms for mobile entities. Inf. Sci. 574: 111-132 (2021) - [j44]Serafino Cicerone, Gabriele Di Stefano:
Getting new algorithmic results by extending distance-hereditary graphs via split composition. PeerJ Comput. Sci. 7: e627 (2021) - [j43]Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
Gathering robots in graphs: The central role of synchronicity. Theor. Comput. Sci. 849: 99-120 (2021) - [c52]Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra:
MOBLOT: Molecular Oblivious Robots. AAMAS 2021: 350-358 - [c51]Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra:
Arbitrary Pattern Formation on Infinite Regular Tessellation Graphs. ICDCN 2021: 56-65 - [i5]Marc Demange, Alessia Di Fonso, Gabriele Di Stefano, Pierpaolo Vittorini:
A graph theoretical approach to the firebreak locating problem. CoRR abs/2103.10115 (2021) - [i4]Gabriele Di Stefano:
Mutual Visibility in Graphs. CoRR abs/2105.02722 (2021) - 2020
- [i3]Serafino Cicerone
A methodology to design distributed algorithms for mobile entities: the pattern formation problem as case study. CoRR abs/2010.12463 (2020) - [i2]Serafino Cicerone
Arbitrary Pattern Formation on Infinite Regular Tessellation Graphs. CoRR abs/2010.14152 (2020)
2010 – 2019
- 2019
- [j42]Mattia D'Emidio
Bamboo Garden Trimming Problem: Priority Schedulings. Algorithms 12(4): 74 (2019) - [j41]Serafino Cicerone
Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach. Distributed Comput. 32(2): 91-132 (2019) - [j40]Serafino Cicerone
Embedded pattern formation by asynchronous robots without chirality. Distributed Comput. 32(4): 291-315 (2019) - [j39]Serafino Cicerone
Approximation algorithms for decomposing octilinear polygons. Theor. Comput. Sci. 779: 17-36 (2019) - [c50]Serafino Cicerone
Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements. CIAC 2019: 174-186 - [c49]Serafino Cicerone
Asynchronous Rendezvous with Different Maps. SIROCCO 2019: 154-169 - [c48]Serafino Cicerone
Gathering Synchronous Robots in Graphs: From General Properties to Dense and Symmetric Topologies. SIROCCO 2019: 170-184 - [c47]Mattia D'Emidio
Priority Scheduling in the Bamboo Garden Trimming Problem. SOFSEM 2019: 136-149 - [c46]Serafino Cicerone
On Gathering of Semi-synchronous Robots in Graphs. SSS 2019: 84-98 - [p2]Serafino Cicerone
Asynchronous Robots on Graphs: Gathering. Distributed Computing by Mobile Entities 2019: 184-217 - 2018
- [j38]Serafino Cicerone
Gathering of robots on meeting-points: feasibility and optimal resolution algorithms. Distributed Comput. 31(1): 1-50 (2018) - [j37]Mattia D'Emidio
Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane. Inf. Comput. 263: 57-74 (2018) - [c45]Serafino Cicerone
"Semi-Asynchronous": A New Scheduler for Robot Based Computing Systems. ICDCS 2018: 176-187 - [e2]Gabriele Di Stefano, Alfredo Navarra:
Proceedings of the GEOSAFE Workshop on Robust Solutions for Fire Fighting, RSFF 2018, L'Aquila, Italy, July 19-20, 2018. CEUR Workshop Proceedings 2146, CEUR-WS.org 2018 [contents] - 2017
- [j36]Gabriele Di Stefano, Alfredo Navarra
Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings. Distributed Comput. 30(2): 75-86 (2017) - [j35]Gabriele Di Stefano, Alfredo Navarra
Gathering of oblivious robots on infinite grids with minimum traveled distance. Inf. Comput. 254: 377-391 (2017) - [i1]Serafino Cicerone
Asynchronous Pattern Formation: the effects of a rigorous approach. CoRR abs/1706.02474 (2017) - 2016
- [j34]Gianlorenzo D'Angelo
Gathering of robots on anonymous grids and trees without multiplicity detection. Theor. Comput. Sci. 610: 158-168 (2016) - [c44]Mattia D'Emidio
Improved Protocols for Luminous Asynchronous Robots. ICTCS 2016: 136-148 - [c43]Serafino Cicerone
Asynchronous Embedded Pattern Formation Without Orientation. DISC 2016: 85-98 - 2015
- [j33]Gianlorenzo D'Angelo
Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks. Algorithmica 72(4): 1055-1096 (2015) - [c42]Serafino Cicerone
Gathering of Robots on Meeting-Points. ALGOSENSORS 2015: 183-195 - [c41]Serafino Cicerone
MinMax-Distance Gathering on Given Meeting Points. CIAC 2015: 127-139 - [c40]Gabriele Di Stefano, Pietro Montanari, Alfredo Navarra
About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings. IWOCA 2015: 136-147 - 2014
- [j32]Gianlorenzo D'Angelo
Gathering on rings under the Look-Compute-Move model. Distributed Comput. 27(4): 255-285 (2014) - [j31]Gabriele Di Stefano, Alfredo Navarra:
The Game of Scintillae: From Cellular Automata to Computing and Cryptography Systems. J. Cell. Autom. 9(2-3): 167-181 (2014) - [j30]Gianlorenzo D'Angelo
Gathering six oblivious robots on anonymous symmetric rings. J. Discrete Algorithms 26: 16-27 (2014) - [j29]Gianlorenzo D'Angelo
Flow Problems in Multi-Interface Networks. IEEE Trans. Computers 63(2): 361-374 (2014) - [c39]Serafino Cicerone
Minimum-Traveled-Distance Gathering of Oblivious Robots over Given Meeting Points. ALGOSENSORS 2014: 57-72 - [c38]Gabriele Di Stefano, Alfredo Navarra:
Optimal Gathering on Infinite Grids. SSS 2014: 211-225 - 2013
- [j28]Serafino Cicerone
Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks. Algorithmica 66(1): 51-86 (2013) - [j27]Tomassino Ferrauto, Domenico Parisi, Gabriele Di Stefano, Gianluca Baldassarre
Different Genetic Algorithms and the Evolution of Specialization: A Study with Groups of Simulated Neural Robots. Artif. Life 19(2): 221-253 (2013) - [c37]Gianlorenzo D'Angelo
A Unified Approach for Different Tasks on Rings in Robot-Based Computing Systems. IPDPS Workshops 2013: 667-676 - [c36]Serafino Cicerone
Decomposing Octilinear Polygons into Triangles and Rectangles. JCDCGG 2013: 18-30 - [c35]Gabriele Di Stefano, Alfredo Navarra
Optimal Gathering of Oblivious Robots in Anonymous Graphs. SIROCCO 2013: 213-224 - 2012
- [j26]Gianlorenzo D'Angelo
Minimize the Maximum Duty in Multi-interface Networks. Algorithmica 63(1-2): 274-295 (2012) - [j25]Marc Demange, Gabriele Di Stefano, Benjamin Leroy-Beaulieu:
On the online track assignment problem. Discret. Appl. Math. 160(7-8): 1072-1093 (2012) - [j24]Gabriele Di Stefano:
Distance-hereditary comparability graphs. Discret. Appl. Math. 160(18): 2669-2680 (2012) - [j23]Serafino Cicerone
Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances. Inf. Sci. 190: 107-126 (2012) - [c34]Gabriele Di Stefano, Alfredo Navarra:
Scintillae: How to Approach Computing Systems by Means of Cellular Automata. ACRI 2012: 534-543 - [c33]Gianlorenzo D'Angelo
Gathering of Robots on Anonymous Grids without Multiplicity Detection. SIROCCO 2012: 327-338 - [c32]Gianlorenzo D'Angelo
How to Gather Asynchronous Oblivious Robots on Anonymous Rings. DISC 2012: 326-340 - 2011
- [j22]Gianlorenzo D'Angelo
Recoverable Robust Timetables: An Algorithmic Approach on Trees. IEEE Trans. Computers 60(3): 433-446 (2011) - [c31]Gianlorenzo D'Angelo
Maximum flow and minimum-cost flow in multi-interface networks. ICUIMC 2011: 19 - [c30]Gianlorenzo D'Angelo
Gathering of Six Robots on Anonymous Symmetric Rings. SIROCCO 2011: 174-185 - [c29]Gianlorenzo D'Angelo
Min-Max Coverage in Multi-interface Networks. SOFSEM 2011: 190-201 - [c28]Gianlorenzo D'Angelo
Bandwidth Constrained Multi-interface Networks. SOFSEM 2011: 202-213 - 2010
- [j21]Serafino Cicerone
Partially dynamic efficient algorithms for distributed shortest paths. Theor. Comput. Sci. 411(7-9): 1013-1037 (2010) - [c27]Gianlorenzo D'Angelo
Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks. COCOA (2) 2010: 254-267 - [c26]Serafino Cicerone
A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation. SEA 2010: 59-70
2000 – 2009
- 2009
- [j20]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Recoverable Robustness for Train Shunting Problems. Algorithmic Oper. Res. 4(2): 102-116 (2009) - [j19]Sabine Cornelsen, Gabriele Di Stefano:
Treelike comparability graphs. Discret. Appl. Math. 157(8): 1711-1722 (2009) - [j18]Gabriele Di Stefano:
Distance-Hereditary Comparability Graphs. Electron. Notes Discret. Math. 35: 227-233 (2009) - [j17]Serafino Cicerone
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases. J. Comb. Optim. 18(3): 229-257 (2009) - [c25]Jens Clausen, Gabriele Di Stefano:
ATMOS 2009 Preface -- 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS 2009 - [c24]Gianlorenzo D'Angelo
Recoverable Robust Timetables on Trees. COCOA 2009: 451-462 - [c23]Gianlorenzo D'Angelo
Evaluation of Recoverable-Robust Timetables on Tree Networks. IWOCA 2009: 24-35 - [p1]Serafino Cicerone
Recoverable Robustness in Shunting and Timetabling. Robust and Online Large-Scale Optimization 2009: 28-60 - [e1]Jens Clausen, Gabriele Di Stefano:
ATMOS 2009 - 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, IT University of Copenhagen, Denmark, September 10, 2009. OASIcs 12, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2009 [contents] - 2008
- [j16]Marc Demange, Gabriele Di Stefano, Benjamin Leroy-Beaulieu:
Online Bounded Coloring of Permutation and Overlap Graphs. Electron. Notes Discret. Math. 30: 213-218 (2008) - [j15]Gabriele Di Stefano, Alberto Petricola:
A Distributed AOA Based Localization Algorithm for Wireless Sensor Networks. J. Comput. 3(4): 1-8 (2008) - [j14]Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke
On minimum k-modal partitions of permutations. J. Discrete Algorithms 6(3): 381-392 (2008) - [j13]Francesco Bruera, Serafino Cicerone
Dynamic Multi-level Overlay Graphs for Shortest Paths. Math. Comput. Sci. 1(4): 709-736 (2008) - [c22]Serafino Cicerone, Gabriele Di Stefano, Michael Schachtebeck, Anita Schöbel:
Dynamic Algorithms for Recoverable Robustness Problems. ATMOS 2008 - [c21]Serafino Cicerone
Delay Management Problem: Complexity Results and Robust Algorithms. COCOA 2008: 458-468 - 2007
- [j12]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alberto Petricola:
Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation. J. Comput. 2(9): 16-26 (2007) - [j11]Sabine Cornelsen, Gabriele Di Stefano:
Track assignment. J. Discrete Algorithms 5(2): 250-261 (2007) - [c20]Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni:
Maintenance of Multi-level Overlay Graphs for Timetable Queries. ATMOS 2007 - [c19]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Robust Algorithms and Price of Robustness in Shunting Problems. ATMOS 2007 - [c18]Gianlorenzo D'Angelo
Partially Dynamic Concurrent Update of Distributed Shortest Paths. ICCTA 2007: 32-38 - 2006
- [c17]Gabriele Di Stefano, Alberto Petricola, Christos D. Zaroliagis
On the Implementation of Parallel Shortest Path Algorithms on a Supercomputer. ISPA 2006: 406-417 - [c16]Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke
On Minimum k-Modal Partitions of Permutations. LATIN 2006: 374-385 - 2005
- [j10]Serafino Cicerone
Self-spanner graphs. Discret. Appl. Math. 150(1-3): 99-120 (2005) - 2004
- [j9]Serafino Cicerone
Networks with small stretch number. J. Discrete Algorithms 2(4): 383-405 (2004) - [c15]Sabine Cornelsen, Gabriele Di Stefano:
Platform Assignment. ATMOS 2004: 233-245 - [c14]Sabine Cornelsen, Gabriele Di Stefano:
Treelike Comparability Graphs: Characterization, Recognition, and Applications. WG 2004: 46-57 - 2003
- [j8]Serafino Cicerone
(k, +)-distance-hereditary graphs. J. Discrete Algorithms 1(3-4): 281-302 (2003) - [j7]Serafino Cicerone
A fully dynamic algorithm for distributed shortest paths. Theor. Comput. Sci. 297(1-3): 83-102 (2003) - [c13]Gabriele Di Stefano, Magnus Love Koci:
A Graph Theoretical Approach To The Shunting Problem. ATMOS 2003: 16-33 - 2002
- [j6]Serafino Cicerone
Static and dynamic low-congested interval routing schemes. Theor. Comput. Sci. 276(1-2): 315-354 (2002) - 2001
- [j5]Serafino Cicerone
Graphs with bounded induced distance. Discret. Appl. Math. 108(1-2): 3-21 (2001) - [j4]Serafino Cicerone
Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. J. Parallel Distributed Comput. 61(10): 1472-1488 (2001) - [c12]Serafino Cicerone, Gianluca D'Ermiliis, Gabriele Di Stefano:
(k, +)-Distance-Hereditary Graphs. WG 2001: 66-77 - 2000
- [j3]Serafino Cicerone, Gabriele Di Stefano, Michele Flammini:
Low-congested interval routing schemes for hypercubelike networks. Networks 36(3): 191-201 (2000) - [c11]Serafino Cicerone
A Fully Dynamic Algorithm for Distributed Shortest Paths. LATIN 2000: 247-257 - [c10]Serafino Cicerone
Networks with Small Stretch Number. WG 2000: 95-106
1990 – 1999
- 1999
- [j2]Serafino Cicerone, Gabriele Di Stefano:
On the Extension of Bipartite to Parity Graphs. Discret. Appl. Math. 95(1-3): 181-195 (1999) - [j1]Serafino Cicerone, Gabriele Di Stefano:
Graph Classes Between Parity and Distance-hereditary Graphs. Discret. Appl. Math. 95(1-3): 197-216 (1999) - [c9]Serafino Cicerone
Survivable Networks with Bounded Delay: The Edge Failure Case. ISAAC 1999: 205-214 - [c8]Serafino Cicerone, Gabriele Di Stefano, Michele Flammini:
Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. SIROCCO 1999: 62-77 - 1998
- [c7]Serafino Cicerone, Gabriele Di Stefano, Michele Flammini:
Static and Dynamic Low-Congested Interval Routing Schemes. ICALP 1998: 592-603 - [c6]Serafino Cicerone, Gabriele Di Stefano:
Graphs with Bounded Induced Distance. WG 1998: 177-191 - 1997
- [c5]Serafino Cicerone
On the Equivalence in Complexity among Basic Problems on Bipartite and Parity Graphs. ISAAC 1997: 354-363 - 1996
- [c4]Serafino Cicerone, Gabriele Di Stefano:
Graph Classes between Parity and Distance-Hereditary Graphs. DMTCS 1996: 168-181 - [c3]Gabriele Di Stefano:
A Routing Algorithm for Networks Based on Distance-Hereditary Topologies. SIROCCO 1996: 141-151 - 1995
- [c2]Gian Carlo Cardarilli, Gabriele Di Stefano, G. Fabrizi, P. Marinucci:
Analysis and implementation of a VLSI neural network. ICNN 1995: 1482-1486 - 1993
- [c1]Gabriele Di Stefano, M. V. Marabello, Alessandro D'Atri:
An Application of the MILFORD System to Handle Radiological Data. CISM - Advances in Database Systems 1993: 181-200
Coauthor Index
[j60] [j58] [j57] [c59] [c58] [c57] [i13] [i12] [j56] [j55] [j54] [j53] [j52] [c56] [c55] [c54] [i10] [i9] [i8] [i7] [c53] [j49] [j48] [j47] [j46] [j45] [j44] [j43] [c52] [c51] [i3] [i2] [j41] [j40] [j39] [c50] [c49] [c48] [c46] [p2] [j38] [c45] [i1] [c43] [c42] [c41] [c39] [j28] [c36] [j23] [j21] [c26] [j20] [j17] [p1] [j13] [c22] [c21] [j12] [c20] [c19] [c18] [j10] [j9] [j8] [j7] [j6] [j5] [j4] [c12] [j3] [c11] [c10] [j2] [j1] [c9] [c8] [c7] [c6] [c5] [c4]
[j57] [c59] [c58] [j56] [j54] [j53] [c56] [c54] [i8] [i7] [c53] [j49] [j48] [j46] [j45] [j43] [c52] [c51] [i3] [i2] [j42] [j41] [j40] [c50] [c49] [c48] [c47] [c46] [p2] [j38] [j37] [c45] [e2] [j36] [j35] [i1] [j34] [c44] [c43] [j33] [c42] [c41] [c40] [j32] [j31] [j30] [j29] [c39] [c38] [c37] [c35] [j26] [c34] [c33] [c32] [j22] [c31] [c30] [c29] [c28] [c27] [j20] [j17] [c24] [c23] [p1] [c21] [c19]
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-31 20:10 CET 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: