Daniele Frigioni

Filippo Tirabassi Pascucci

ACM Trans. Spatial Algorithms Syst., 2021

2020

Automated Selection of Optimal Model Transformation Chains via Shortest-Path Algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Software Eng., 2020

Journey Planning Algorithms for Massive Delay-Prone Transit Networks.

[BibT_eX]

[DOI]

Imran Khan

Algorithms, 2020

2019

Fully Dynamic 2-Hop Cover Labeling.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2019

Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

Special Issue on "Algorithm Engineering: Towards Practically Efficient Solutions to Combinatorial Problems".

[BibT_eX]

[DOI]

Algorithms, 2019

Distributed Shortest Paths on Power Law Networks in the Generalized Linear Preference Model: An Experimental Study.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications - ICCSA 2019, 2019

2018

Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane.

[BibT_eX]

[DOI]

Inf. Comput., 2018

A tool for automatically selecting optimal model transformation chains.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM/IEEE International Conference on Model Driven Engineering Languages and Systems: Companion Proceedings, 2018

On Mining Distances in Large-Scale Dynamic Graphs.

[BibT_eX]

[DOI]

Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

2017

Engineering graph-based models for dynamic timetable information systems.

[BibT_eX]

[DOI]

Kalliopi Giannakopoulou

Andreas Paraskevopoulos

Christos D. Zaroliagis

J. Discrete Algorithms, 2017

2016

Rigorous DC Solution of Partial Element Equivalent Circuit Models.

[BibT_eX]

[DOI]

IEEE Trans. Circuits Syst. I Regul. Pap., 2016

Distance Queries in Large-Scale Fully Dynamic Complex Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Improved Protocols for Luminous Asynchronous Robots.

[BibT_eX]

[DOI]

Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

On the Clustered Shortest-Path Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

Characterizing the Computational Power of Anonymous Mobile Robots.

[BibT_eX]

[DOI]

Proceedings of the 36th IEEE International Conference on Distributed Computing Systems, 2016

2015

Explore and repair graphs with black holes using mobile entities.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2015

Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2015

Synchronous Robots vs Asynchronous Lights-Enhanced Robots on Graphs.

[BibT_eX]

[DOI]

Proceedings of the 16th Italian Conference on Theoretical Computer Science, 2015

Path-Fault-Tolerant Approximate Shortest-Path Trees.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2015

2014

A loop-free shortest-path routing algorithm for dynamic networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Fully dynamic update of arc-flags.

[BibT_eX]

[DOI]

Networks, 2014

Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Engineering shortest-path algorithms for dynamic networks.

[BibT_eX]

[DOI]

Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

2013

Pruning the Computation of Distributed Shortest Paths in Power-law Networks.

[BibT_eX]

[DOI]

Informatica (Slovenia), 2013

Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks.

[BibT_eX]

[DOI]

Algorithmica, 2013

Dynamically Maintaining Shortest Path Trees under Batches of Updates.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2013

Exploring and Making Safe Dangerous Networks Using Mobile Entities.

[BibT_eX]

[DOI]

Proceedings of the Ad-hoc, Mobile, and Wireless Network - 12th International Conference, 2013

2012

Fully Dynamic Maintenance of Arc-Flags in Road Networks.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Engineering a New Loop-Free Shortest Paths Routing Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the Design and Analysis of Algorithms, 2012

2011

Dynamic Arc-Flags in Road Networks.

[BibT_eX]

[DOI]

Camillo Vitale

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

A Speed-Up Technique for Distributed Shortest Paths Computation.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

2010

Partially dynamic efficient algorithms for distributed shortest paths.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Hybrid Formulation of the Equation Systems of the 3-D PEEC Model Based on Graph Algorithms.

[BibT_eX]

[DOI]

Giulio Antonini

Giuseppe Miscione

IEEE Trans. Circuits Syst. I Regul. Pap., 2010

VISTO: A new CBIR system for vector images.

[BibT_eX]

[DOI]

Tania Di Mascio

Inf. Syst., 2010

A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

2009

Recoverable Robustness in Shunting and Timetabling.

[BibT_eX]

[DOI]

Proceedings of the Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems, 2009

Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases.

[BibT_eX]

[DOI]

J. Comb. Optim., 2009

Recoverable Robustness for Train Shunting Problems.

[BibT_eX]

[DOI]

Algorithmic Oper. Res., 2009

Evaluating the Effectiveness and the Efficiency of a Vector Image Search Tool.

[BibT_eX]

[DOI]

Proceedings of the Human Interface and the Management of Information. Information and Interaction, 2009

2008

Dynamic Multi-level Overlay Graphs for Shortest Paths.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2008

Delay Management Problem: Complexity Results and Robust Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2008

2007

Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation.

[BibT_eX]

[DOI]

J. Comput., 2007

Partially Dynamic Concurrent Update of Distributed Shortest Paths.

[BibT_eX]

[DOI]

Proceedings of the 2007 International Conference on Computing: Theory and Applications (ICCTA 2007), 2007

Evaluation of VISTO: A New Vector Image Search TOol.

[BibT_eX]

[DOI]

Tania Di Mascio

Proceedings of the Human-Computer Interaction. HCI Intelligent Multimodal Interaction Environments, 2007

Robust Algorithms and Price of Robustness in Shunting Problems.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2007, 2007

Maintenance of Multi-level Overlay Graphs for Timetable Queries.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2007, 2007

2005

Partially dynamic maintenance of minimum weight hyperpaths.

[BibT_eX]

[DOI]

Giorgio Ausiello

J. Discrete Algorithms, 2005

2004

Tuning a CBIR system for vector images: the interface support.

[BibT_eX]

[DOI]

Proceedings of the working conference on Advanced visual interfaces, 2004

2003

A fully dynamic algorithm for distributed shortest paths.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Fully dynamic shortest paths in digraphs with arbitrary arc weights.

[BibT_eX]

[DOI]

J. Algorithms, 2003

Multiple zooming in geographic maps.

[BibT_eX]

[DOI]

Data Knowl. Eng., 2003

2002

On Formal Aspects of Zooming in Geographic Maps.

[BibT_eX]

Tania Di Mascio

Informatica (Slovenia), 2002

A general strategy for decomposing topological invariants of spatial databases and an application.

[BibT_eX]

[DOI]

Paolino Di Felice

Data Knowl. Eng., 2002

2001

Dynamic algorithms for classes of constraint satisfaction problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Semi-dynamic breadth-first search in digraphs.

[BibT_eX]

[DOI]

Roberto Giaccio

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

Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach.

[BibT_eX]

[DOI]

Giorgio Ausiello

Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

2000

Fully Dynamic Algorithms for Maintaining Shortest Paths Trees.

[BibT_eX]

[DOI]

J. Algorithms, 2000

Dynamically Switching Vertices in Planar Graphs.

[BibT_eX]

[DOI]

Giuseppe F. Italiano

Algorithmica, 2000

Supporting a Focus+Context Interaction Style for Spatial Databases.

[BibT_eX]

[DOI]

Proceedings of the WISE 2000, 2000

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

[BibT_eX]

[DOI]

Camil Demetrescu

Proceedings of the Algorithm Engineering, 2000

On the formalization of zoom-based interaction with geographic databases.

[BibT_eX]

Proceedings of the Ottavo Convegno Nazionale su Sistemi Evoluti per Basi di Dati, 2000

Interacting with Geographic Databases: A Focus+Context Approach.

[BibT_eX]

[DOI]

Proceedings of the 11th International Workshop on Database and Expert Systems Applications (DEXA'00), 2000

Decomposing Spatial Databases and Applications.

[BibT_eX]

[DOI]

Paolino Di Felice

Proceedings of the 11th International Workshop on Database and Expert Systems Applications (DEXA'00), 2000

1999

Interacting with Topological Invariants of Spatial Databases.

[BibT_eX]

[DOI]

Proceedings of the 1999 International Symposium on Database Applications in Non-Traditional Environments (DANTE '99), 1999

1998

A Uniform Approach to Semi-Dynamic Problems on Digraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

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

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 1998

Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees.

[BibT_eX]

[DOI]

Algorithmica, 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

Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs.

[BibT_eX]

[DOI]

Roberto Giaccio

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn Formulae.

[BibT_eX]

[DOI]

Giorgio Ausiello

Roberto Giaccio

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Dynamically Switching Vertices in Planar Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Giuseppe F. Italiano

Proceedings of the Algorithms, 1997

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

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

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

[BibT_eX]

[DOI]