Massimo Franceschet

Orcid: 0000-0001-9490-1464

According to our database1, Massimo Franceschet authored at least 64 papers between 1997 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Decentraland: The Alleged Decentralization of Blockchain Applications.
Commun. ACM, June, 2023

Return on NFTs.
Frontiers Blockchain, 2023

2021
The Sentiment of Crypto Art.
Proceedings of the Conference on Computational Humanities Research, 2021

2020
Quantifying the higher-order influence of scientific publications.
Scientometrics, 2020

Art for Space.
ACM Journal on Computing and Cultural Heritage, 2020

2019
Art Metrics.
CoRR, 2019

Crypto art: A decentralized view.
CoRR, 2019

Quantifying the long-term influence of scientific publications.
Proceedings of the 17th International Conference on Scientometrics and Informetrics, 2019

2017
TimeRank: A dynamic approach to rate scholars using citations.
J. Informetrics, 2017

Arbitrarily regularizable graphs.
Internet Math., 2017

Approximations of the Generalized Inverse of the Graph Laplacian Matrix.
Internet Math., 2017

The temporalized Massey's method.
CoRR, 2017

The Massey's method for sport rating: a network science perspective.
CoRR, 2017

2016
Clustering citation histories in the Physical Review.
J. Informetrics, 2016

Network regularizability.
CoRR, 2016

A theory on power in networks.
Commun. ACM, 2016

2015
Vulnerability and power on networks.
Netw. Sci., 2015

Complex Beauty.
Complex Syst., 2015

2013
A graph-theoretic approach to map conceptual designs to XML schemas.
ACM Trans. Database Syst., 2013

Resistance distance, closeness, and betweenness.
Soc. Networks, 2013

2012
The large-scale structure of journal citation networks.
J. Assoc. Inf. Sci. Technol., 2012

Effective and efficient approximations of the generalized inverse of the graph Laplacian matrix with an application to current-flow betweenness centrality.
CoRR, 2012

2011
The first Italian research assessment exercise: A bibliometric perspective.
J. Informetrics, 2011

Collaboration in computer science: A network science approach.
J. Assoc. Inf. Sci. Technol., 2011

The skewness of computer science.
Inf. Process. Manag., 2011

Collaboration in computer science: a network science approach. Part II
CoRR, 2011

PageRank: standing on the shoulders of giants.
Commun. ACM, 2011

2010
A comparison of bibliometric indicators for computer science scholars and journals on Web of Science and Google Scholar.
Scientometrics, 2010

The effect of scholar collaboration on impact and quality of academic papers.
J. Informetrics, 2010

Journal influence factors.
J. Informetrics, 2010

The difference between popularity and prestige in the sciences and in the social sciences: A bibliometric analysis.
J. Informetrics, 2010

Ten good reasons to use the Eigenfactor<sup>TM</sup> metrics.
Inf. Process. Manag., 2010

The small world of computer science
CoRR, 2010

A logic for networks
CoRR, 2010

PageRank: Stand on the shoulders of giants
CoRR, 2010

The role of conference publications in CS.
Commun. ACM, 2010

From Entity Relationship to XML Schema: a Graph-Theoretic Approach (Extended Abstract).
Proceedings of the Eighteenth Italian Symposium on Advanced Database Systems, 2010

2009
A cluster analysis of scholar and journal bibliometric indicators.
J. Assoc. Inf. Sci. Technol., 2009

From Entity Relationship to XML Schema: A Graph-Theoretic Approach.
Proceedings of the Database and XML Technologies, 6th International XML Database Symposium, 2009

2008
Bibliometrics in a nutshell
CoRR, 2008

2007
Modeling and Validating Spatio-Temporal Conceptual Schemas in XML Schema.
Proceedings of the 18th International Workshop on Database and Expert Systems Applications (DEXA 2007), 2007

2006
Model checking hybrid logics (with an application to semistructured data).
J. Appl. Log., 2006

Definability and decidability of binary predicates for time granularity.
J. Appl. Log., 2006

A Logic-Based Approach to Cache Answerability for XPath Queries.
Proceedings of the Database and XML Technologies, 2006

XCheck: A Platform for Benchmarking XQuery Engines.
Proceedings of the 32nd International Conference on Very Large Data Bases, 2006

XPathMark: Functional and Performance Tests for XPath.
Proceedings of the XQuery Implementation Paradigms, 19.11. - 22.11.2006, 2006

2005
Guarded Fragments with Constants.
J. Log. Lang. Inf., 2005

XPathMark: An XPath Benchmark for the XMark Generated Data.
Proceedings of the Database and XML Technologies, 2005

On the Complexity of Hybrid Logics with Binders.
Proceedings of the Computer Science Logic, 19th International Workshop, 2005

2004
Temporalized logics and automata for time granularity.
Theory Pract. Log. Program., 2004

Representing and Reasoning about Temporal Granularities.
J. Log. Comput., 2004

Model Checking for Combined Logics with an Application to Mobile Systems.
Autom. Softw. Eng., 2004

CTL Model Checking for Processing Simple XPath Queries.
Proceedings of the 11th International Symposium on Temporal Representation and Reasoning (TIME 2004), 2004

2003
Hybrid Logics on Linear Structures: Expressivity and Complexity.
Proceedings of the 10th International Symposium on Temporal Representation and Reasoning / 4th International Conference on Temporal Logic (TIME-ICTL 2003), 2003

2002
A Logical Approach to Represent and Reason about Calendars.
Proceedings of the 9th International Symposium on Temporal Representation and Reasoning, 2002

2000
A Guided Tour through Some Extensions of the Event Calculus.
Comput. Intell., 2000

A graph-theoretic approach to efficiently reason about partially ordered events in (Modal) Event Calculus.
Ann. Math. Artif. Intell., 2000

1999
A Graph-Theoretic Approach to Efficiently Reason about Partially Ordered Events in the Event Calculus.
Proceedings of the 6th International Workshop on Temporal Representation and Reasoning, 1999

Indexing by Shape of Image Databases Based on Extended Grid Files.
Proceedings of the IEEE International Conference on Multimedia Computing and Systems, 1999

Pairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events.
Proceedings of the AI*IA 99:Advances in Artificial Intelligence, 1999

1998
The Complexity of Model Checking in Modal Event Calculi with Quantifiers.
Electron. Trans. Artif. Intell., 1998

Event Calculus with Explicit Quantifiers.
Proceedings of the 5th Workshop on Temporal Representation and Reasoning, 1998

1997
Modal Event Calculi with Preconditions.
Proceedings of the 4th International Workshop on Temporal Representation and Reasoning, 1997

The Complexity of Model Checking in Modal Event Calculi.
Proceedings of the Logic Programming, 1997


  Loading...