Umberto Nanni

Fabrizio Silvestri

CoRR, August, 2025

Beyond Position: the emergence of wavelet-like properties in Transformers.

[BibT_eX]

[DOI]

Valeria Ruscio

Federico Maria Scafoglieri

Fabrizio Silvestri

Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2025

2024

Ontology-driven data management design in healthcare domain: The ADCATER experience.

[BibT_eX]

[DOI]

Proceedings of the Joint Ontology Workshops (JOWO), 2024

2021

Non-isomorphic CNF Generation.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Artificial Intelligence, 2021

2019

Recommending Tasks in Online Judges.

[BibT_eX]

[DOI]

Proceedings of the Methodologies and Intelligent Systems for Technology Enhanced Learning, 2019

2018

Visual Analysis of Vertex-Disjoint Path Connectivity in Networks.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference Information Visualisation, 2018

2014

The Organization of Large-Scale Repositories of Learning Objects with Directed Hypergraphs.

[BibT_eX]

[DOI]

Luigi Laura

Marco Temperini

Proceedings of the New Horizons in Web Based Learning, 2014

Visual Analysis Based on Dominator Trees with Application to Personalized eLearning.

[BibT_eX]

[DOI]

Luigi Laura

Marco Temperini

Proceedings of the Advances in Web-Based Learning - ICWL 2014, 2014

2012

Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011

Linear time analysis of properties of conflict-free and general Petri nets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

2003

Fully dynamic shortest paths in digraphs with arbitrary arc weights.

[BibT_eX]

[DOI]

J. Algorithms, 2003

2001

Dynamic algorithms for classes of constraint satisfaction problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

An Experimental Study of Dynamic Algorithms for Transitive Closure.

[BibT_eX]

[DOI]

Tobias Miller

Christos D. Zaroliagis

ACM J. Exp. Algorithmics, 2001

2000

Fully Dynamic Algorithms for Maintaining Shortest Paths Trees.

[BibT_eX]

[DOI]

J. Algorithms, 2000

Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study.

[BibT_eX]

[DOI]

Camil Demetrescu

Proceedings of the Algorithm Engineering, 2000

A Fully Dynamic Algorithm for Distributed Shortest Paths.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1998

Multidimensional Interval Routing Schemes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

A Uniform Approach to Semi-Dynamic Problems on Digraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees.

[BibT_eX]

[DOI]

Algorithmica, 1998

Characterization results of all shortest paths interval routing schemes.

[BibT_eX]

Proceedings of the SIROCCO'98, 1998

Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

An Experimental Study of Dynamic Algorithms for Directed Graphs.

[BibT_eX]

[DOI]

Christos D. Zaroliagis

Proceedings of the Algorithms, 1998

Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1998

1997

The Incremental Maintenance of a Depth-First-Search Tree in Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Paolo Giulio Franciosa

Giorgio Gambosi

Inf. Process. Lett., 1997

Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem.

[BibT_eX]

Proceedings of the Workshop on Algorithm Engineering, 1997

1996

Maintaining a Topological Order Under Edge Insertions.

[BibT_eX]

[DOI]

Hans Rohnert

Inf. Process. Lett., 1996

Counting Edges in a Dag.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1995

Multi-Dimensional Interval Routing Schemes.

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 9th International Workshop, 1995

1994

Incremental Algorithms for the Single-Source Shortest Path Problem.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

On the Structure of DFS-Forests on Directed Graphs and the Dynamic Maintenance of DFS on DAG's.

[BibT_eX]

[DOI]

Paolo Giulio Franciosa

Giorgio Gambosi

Proceedings of the Algorithms, 1994

Dynamization of Backtrack-Free Search for the Constraint Satisfaction Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, Second Italian Conference, 1994

1993

The Weighted List Update Problem and the Lazy Adversary.

[BibT_eX]

[DOI]

Fabrizio d'Amore

Theor. Comput. Sci., 1993

The LOGIDATA+ Prototype System.

[BibT_eX]

[DOI]

Silvio Salza

Mario Terranova

Proceedings of the LOGIDATA+: Deductive Databases with Complex Objects, 1993

LOA: The LOGIDATA+ Object Algebra.

[BibT_eX]

[DOI]

Silvio Salza

Mario Terranova

Proceedings of the LOGIDATA+: Deductive Databases with Complex Objects, 1993

On-line Graph Algorithms for Incremental Compilation.

[BibT_eX]

[DOI]

Hans Rohnert

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992

On-Line Computation of Minimal and Maximal Length Paths.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets.

[BibT_eX]

[DOI]

Paola Alimonti

Esteban Feuerstein

Proceedings of the LATIN '92, 1992

1991

Competitive Algorithms for the Weighted List Update Problem.

[BibT_eX]

[DOI]

Fabrizio d'Amore

Proceedings of the Algorithms and Data Structures, 1991

1990

Dynamic Maintenance of Directed Hypergraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1990

Incremental Algorithms for Minimal Length Paths.

[BibT_eX]

[DOI]

Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

1989

Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 1989

1988

Dynamic Maintenance of Paths and Path Expressions on Graphs.

[BibT_eX]

[DOI]