default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSerafino Cicerone
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
[j45]Serafino Cicerone, Gabriele Di Stefano
, Sandi Klavzar, Ismael G. Yero:
Mutual-visibility in strong products of graphs via total mutual-visibility. Discret. Appl. Math. 358: 136-146 (2024)- [j44]Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar, Ismael G. Yero:
Mutual-visibility problems on graphs of diameter two. Eur. J. Comb. 120: 103995 (2024) - [j43]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) - [c48]Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra, Francesco Piselli:
Mutual Visibility in Hypercube-Like Graphs. SIROCCO 2024: 192-207 - [c47]Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra:
Gathering of Robots in Butterfly Networks. SSS 2024: 106-120 - [c46]Sahar Badri, Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano:
An Optimal Algorithm for Geodesic Mutual Visibility on Hexagonal Grids. SSS 2024: 161-176 - [i9]Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar, Ismael G. Yero:
Mutual-visibility problems on graphs of diameter two. CoRR abs/2401.02373 (2024) - [i8]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) - 2023
- [j42]Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra:
Molecular Oblivious Robots: A New Model for Robots With Assembling Capabilities. IEEE Access 11: 15701-15724 (2023) - [j41]Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar:
On the mutual visibility in Cartesian products and triangle-free graphs. Appl. Math. Comput. 438: 127619 (2023) - [j40]Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra:
The geodesic mutual visibility problem: Oblivious robots on grids and trees. Pervasive Mob. Comput. 95: 101842 (2023) - [j39]Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra:
Arbitrary pattern formation on infinite regular tessellation graphs. Theor. Comput. Sci. 942: 1-20 (2023) - [j38]Serafino Cicerone, Gabriele Di Stefano, Lara Drozdek, Jaka Hedzet, Sandi Klavzar, Ismael G. Yero:
Variety of mutual-visibility problems in graphs. Theor. Comput. Sci. 974: 114096 (2023) - [c45]Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra:
The Geodesic Mutual Visibility Problem for Oblivious Robots: the case of Trees. ICDCN 2023: 150-159 - [c44]Serafino Cicerone, Gabriele Di Stefano:
Mutual-visibility in distance-hereditary graphs: a linear-time algorithm. LAGOS 2023: 104-111 - [c43]Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra:
Time-Optimal Geodesic Mutual Visibility of Robots on Grids Within Minimum Area. SSS 2023: 385-399 - [e1]Sigeru Omatu, Rashid Mehmood, Pawel Sitek, Serafino Cicerone, Sara Rodríguez:
Distributed Computing and Artificial Intelligence, 19th International Conference, DCAI 2022, L'Aquila, Italy, 13-15 July 2022. Lecture Notes in Networks and Systems 583, Springer 2023, ISBN 978-3-031-20858-4 [contents] - [i7]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) - [i6]Serafino Cicerone, Gabriele Di Stefano:
Mutual-visibility in distance-hereditary graphs: a linear-time algorithm. CoRR abs/2307.10661 (2023) - [i5]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) - [i4]Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra, Francesco Piselli:
Mutual visibility in hypercube-like graphs. CoRR abs/2308.14443 (2023) - 2022
- [c42]Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra:
Molecular Robots with Chirality on Grids. ALGOSENSORS 2022: 45-59 - 2021
- [j37]Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
"Semi-Asynchronous": A New Scheduler in Distributed Computing. IEEE Access 9: 41540-41557 (2021) - [j36]Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
Solving the Pattern Formation by Mobile Robots With Chirality. IEEE Access 9: 88177-88204 (2021) - [j35]Serafino Cicerone:
Breaking Symmetries on Tessellation Graphs via Asynchronous Robots: The Line Formation Problem as a Case Study. IEEE Access 9: 147855-147873 (2021) - [j34]Serafino Cicerone:
A Quasi-Hole Detection Algorithm for Recognizing k-Distance-Hereditary Graphs, with k < 2. Algorithms 14(4): 105 (2021) - [j33]Serafino Cicerone, Gabriele Di Stefano:
Special Issue on "Graph Algorithms and Applications". Algorithms 14(5): 150 (2021) - [j32]Serafino Cicerone, Mattia D'Emidio, Gabriele Di Stefano, Alfredo Navarra:
On the effectiveness of the genetic paradigm for polygonization. Inf. Process. Lett. 171: 106134 (2021) - [j31]Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
A structured methodology for designing distributed algorithms for mobile entities. Inf. Sci. 574: 111-132 (2021) - [j30]Serafino Cicerone, Gabriele Di Stefano:
Getting new algorithmic results by extending distance-hereditary graphs via split composition. PeerJ Comput. Sci. 7: e627 (2021) - [j29]Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
Gathering robots in graphs: The central role of synchronicity. Theor. Comput. Sci. 849: 99-120 (2021) - [j28]Serafino Cicerone, Mattia D'Emidio, Daniele Frigioni, Filippo Tirabassi Pascucci:
Combining Polygon Schematization and Decomposition Approaches for Solving the Cavity Decomposition Problem. ACM Trans. Spatial Algorithms Syst. 7(4): 22:1-22:37 (2021) - [c41]Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra:
MOBLOT: Molecular Oblivious Robots. AAMAS 2021: 350-358 - [c40]Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra:
Arbitrary Pattern Formation on Infinite Regular Tessellation Graphs. ICDCN 2021: 56-65 - 2020
- [c39]Serafino Cicerone:
On Building Networks with Limited Stretch Factor. AINA Workshops 2020: 926-936 - [c38]Serafino Cicerone:
Breaking Symmetries on Tessellation Graphs via Asynchronous Robots. ICTCS 2020: 122-136 - [i3]Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
A methodology to design distributed algorithms for mobile entities: the pattern formation problem as case study. CoRR abs/2010.12463 (2020) - [i2]Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo Navarra:
Arbitrary Pattern Formation on Infinite Regular Tessellation Graphs. CoRR abs/2010.14152 (2020)
2010 – 2019
- 2019
- [j27]Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach. Distributed Comput. 32(2): 91-132 (2019) - [j26]Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
Embedded pattern formation by asynchronous robots without chirality. Distributed Comput. 32(4): 291-315 (2019) - [j25]Serafino Cicerone, Gabriele Di Stefano:
Approximation algorithms for decomposing octilinear polygons. Theor. Comput. Sci. 779: 17-36 (2019) - [c37]Serafino Cicerone, Gabriele Di Stefano, Leszek Gasieniec, Tomasz Jurdzinski, Alfredo Navarra, Tomasz Radzik, Grzegorz Stachowiak:
Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements. CIAC 2019: 174-186 - [c36]Serafino Cicerone, Gabriele Di Stefano, Leszek Gasieniec, Alfredo Navarra:
Asynchronous Rendezvous with Different Maps. SIROCCO 2019: 154-169 - [c35]Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
Gathering Synchronous Robots in Graphs: From General Properties to Dense and Symmetric Topologies. SIROCCO 2019: 170-184 - [c34]Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
On Gathering of Semi-synchronous Robots in Graphs. SSS 2019: 84-98 - [p2]Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
Asynchronous Robots on Graphs: Gathering. Distributed Computing by Mobile Entities 2019: 184-217 - 2018
- [j24]Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
Gathering of robots on meeting-points: feasibility and optimal resolution algorithms. Distributed Comput. 31(1): 1-50 (2018) - [c33]Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
"Semi-Asynchronous": A New Scheduler for Robot Based Computing Systems. ICDCS 2018: 176-187 - [c32]Serafino Cicerone, Mattia D'Emidio, Daniele Frigioni:
On Mining Distances in Large-Scale Dynamic Graphs. ICTCS 2018: 77-81 - 2017
- [i1]Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
Asynchronous Pattern Formation: the effects of a rigorous approach. CoRR abs/1706.02474 (2017) - 2016
- [c31]Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
Asynchronous Embedded Pattern Formation Without Orientation. DISC 2016: 85-98 - 2015
- [c30]Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
Gathering of Robots on Meeting-Points. ALGOSENSORS 2015: 183-195 - [c29]Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
MinMax-Distance Gathering on Given Meeting Points. CIAC 2015: 127-139 - 2014
- [c28]Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
Minimum-Traveled-Distance Gathering of Oblivious Robots over Given Meeting Points. ALGOSENSORS 2014: 57-72 - 2013
- [j23]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Vinicio Maurizio:
Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks. Algorithmica 66(1): 51-86 (2013) - [c27]Serafino Cicerone, Gabriele Di Stefano:
Decomposing Octilinear Polygons into Triangles and Rectangles. JCDCGG 2013: 18-30 - 2012
- [j22]Serafino Cicerone, Gabriele Di Stefano, Michael Schachtebeck, Anita Schöbel:
Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances. Inf. Sci. 190: 107-126 (2012) - [c26]Serafino Cicerone, Matteo Cermignani:
Fast and Simple Approach for Polygon Schematization. ICCSA (1) 2012: 267-279 - 2011
- [j21]Serafino Cicerone:
Characterizations of Graphs with Stretch Number less than 2. Electron. Notes Discret. Math. 37: 375-380 (2011) - [c25]Serafino Cicerone:
Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way - (Extended Abstract). TAMC 2011: 286-297 - 2010
- [j20]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni:
Partially dynamic efficient algorithms for distributed shortest paths. Theor. Comput. Sci. 411(7-9): 1013-1037 (2010) - [c24]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Vinicio Maurizio:
A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation. SEA 2010: 59-70
2000 – 2009
- 2009
- [j19]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) - [j18]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases. J. Comb. Optim. 18(3): 229-257 (2009) - [p1]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra, Michael Schachtebeck, Anita Schöbel:
Recoverable Robustness in Shunting and Timetabling. Robust and Online Large-Scale Optimization 2009: 28-60 - 2008
- [j17]Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni:
Dynamic Multi-level Overlay Graphs for Shortest Paths. Math. Comput. Sci. 1(4): 709-736 (2008) - [c23]Serafino Cicerone, Gabriele Di Stefano, Michael Schachtebeck, Anita Schöbel:
Dynamic Algorithms for Recoverable Robustness Problems. ATMOS 2008 - [c22]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Delay Management Problem: Complexity Results and Robust Algorithms. COCOA 2008: 458-468 - 2007
- [j16]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) - [c21]Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni:
Maintenance of Multi-level Overlay Graphs for Timetable Queries. ATMOS 2007 - [c20]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Robust Algorithms and Price of Robustness in Shunting Problems. ATMOS 2007 - [c19]Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni:
Partially Dynamic Concurrent Update of Distributed Shortest Paths. ICCTA 2007: 32-38 - 2005
- [j15]Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke:
Self-spanner graphs. Discret. Appl. Math. 150(1-3): 99-120 (2005) - 2004
- [j14]Serafino Cicerone, Paolino Di Felice:
Cardinal directions between spatial objects: the pairwise-consistency problem. Inf. Sci. 164(1-4): 165-188 (2004) - [j13]Serafino Cicerone, Gabriele Di Stefano:
Networks with small stretch number. J. Discrete Algorithms 2(4): 383-405 (2004) - 2003
- [j12]Serafino Cicerone, Eliseo Clementini:
Efficient Estimation of Qualitative Topological Relations based on the Weighted Walkthroughs Model. GeoInformatica 7(3): 211-227 (2003) - [j11]Serafino Cicerone, Gabriele Di Stefano:
(k, +)-distance-hereditary graphs. J. Discrete Algorithms 1(3-4): 281-302 (2003) - [j10]Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni:
A fully dynamic algorithm for distributed shortest paths. Theor. Comput. Sci. 297(1-3): 83-102 (2003) - 2002
- [j9]Serafino Cicerone, Daniele Frigioni, Paolino Di Felice:
A general strategy for decomposing topological invariants of spatial databases and an application. Data Knowl. Eng. 42(1): 57-87 (2002) - [j8]Serafino Cicerone, Gabriele Di Stefano, Michele Flammini:
Static and dynamic low-congested interval routing schemes. Theor. Comput. Sci. 276(1-2): 315-354 (2002) - [c18]Serafino Cicerone, Eliseo Clementini:
Extraction of qualitative information from the weighted walkthroughs. ACM-GIS 2002: 137-142 - 2001
- [j7]Serafino Cicerone, Gabriele Di Stefano:
Graphs with bounded induced distance. Discret. Appl. Math. 108(1-2): 3-21 (2001) - [j6]Serafino Cicerone, Gabriele Di Stefano, Michele Flammini:
Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. J. Parallel Distributed Comput. 61(10): 1472-1488 (2001) - [c17]Serafino Cicerone, Gianluca D'Ermiliis, Gabriele Di Stefano:
(k, +)-Distance-Hereditary Graphs. WG 2001: 66-77 - 2000
- [j5]Serafino Cicerone, Gabriele Di Stefano, Michele Flammini:
Low-congested interval routing schemes for hypercubelike networks. Networks 36(3): 191-201 (2000) - [c16]Serafino Cicerone, Daniele Frigioni, Paolino Di Felice:
Decomposing Spatial Databases and Applications. DEXA Workshop 2000: 861-868 - [c15]Serafino Cicerone, Daniele Frigioni, Laura Tarantino:
Interacting with Geographic Databases: A Focus+Context Approach. DEXA Workshop 2000: 869-875 - [c14]Serafino Cicerone, Paolino Di Felice:
Cardinal relations between regions with a broad boundary. ACM-GIS 2000: 15-20 - [c13]Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni:
A Fully Dynamic Algorithm for Distributed Shortest Paths. LATIN 2000: 247-257 - [c12]Serafino Cicerone, Daniele Frigioni, Laura Tarantino:
On the formalization of zoom-based interaction with geographic databases. SEBD 2000: 401-414 - [c11]Serafino Cicerone, Gabriele Di Stefano:
Networks with Small Stretch Number. WG 2000: 95-106 - [c10]Serafino Cicerone, Daniele Frigioni, Laura Tarantino:
Supporting a Focus+Context Interaction Style for Spatial Databases. WISE 2000: 328-335
1990 – 1999
- 1999
- [j4]Serafino Cicerone, Gabriele Di Stefano:
On the Extension of Bipartite to Parity Graphs. Discret. Appl. Math. 95(1-3): 181-195 (1999) - [j3]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, Daniele Frigioni, Laura Tarantino, Paolino Di Felice:
Interacting with Topological Invariants of Spatial Databases. DANTE 1999: 213-217 - [c8]Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke:
Survivable Networks with Bounded Delay: The Edge Failure Case. ISAAC 1999: 205-214 - [c7]Serafino Cicerone, Gabriele Di Stefano, Michele Flammini:
Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. SIROCCO 1999: 62-77 - 1998
- [j2]Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese:
A Uniform Approach to Semi-Dynamic Problems on Digraphs. Theor. Comput. Sci. 203(1): 69-90 (1998) - [c6]Serafino Cicerone, Gabriele Di Stefano, Michele Flammini:
Static and Dynamic Low-Congested Interval Routing Schemes. ICALP 1998: 592-603 - [c5]Serafino Cicerone, Gabriele Di Stefano:
Graphs with Bounded Induced Distance. WG 1998: 177-191 - 1997
- [j1]Serafino Cicerone, Francesco Parisi-Presicce:
On the Complexity of Specification Morphisms. Theor. Comput. Sci. 189(1-2): 239-248 (1997) - [c4]Serafino Cicerone, Gabriele Di Stefano:
On the Equivalence in Complexity among Basic Problems on Bipartite and Parity Graphs. ISAAC 1997: 354-363 - 1996
- [c3]Serafino Cicerone, Gabriele Di Stefano:
Graph Classes between Parity and Distance-Hereditary Graphs. DMTCS 1996: 168-181 - [c2]Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese:
Counting Edges in a Dag. WG 1996: 85-100 - 1994
- [c1]Serafino Cicerone, Francesco Parisi-Presicce:
Strategies in Modular System Design by Interface Rewriting. ESOP 1994: 165-179
Coauthor Index
[j45] [j44] [j43] [c48] [c47] [c46] [i9] [i8] [j42] [j41] [j40] [j39] [j38] [c45] [c44] [c43] [i7] [i6] [i5] [i4] [c42] [j37] [j36] [j33] [j32] [j31] [j30] [j29] [c41] [c40] [i3] [i2] [j27] [j26] [j25] [c37] [c36] [c35] [c34] [p2] [j24] [c33] [i1] [c31] [c30] [c29] [c28] [j23] [c27] [j22] [j20] [c24] [j19] [j18] [p1] [j17] [c23] [c22] [j16] [c21] [c20] [c19] [j15] [j13] [j11] [j10] [j8] [j7] [j6] [c17] [j5] [c13] [c11] [j4] [j3] [c8] [c7] [c6] [c5] [c4] [c3]
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 21:08 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:
