2-Edge Connectivity in Directed Graphs

2-Vertex Connectivity in Directed Graphs

A Forensic-as-a-Service Delivery Platform for Law Enforcement Agencies

A Forensic-as-a-Service Delivery Platform for Law Enforcement Agencies

A Model for the Dynamics of Bidders in the Simulation of Keyword Auctions

A new approach to dynamic all pairs shortest paths

A note on set union with arbitrary deunions

A traffic-based evolutionary algorithm for network clustering

Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks

An Experimental Study of Dynamic Dominators

An automatized methodology design for real-time signal processing applications in multiple multi-core platforms

scholarly article published June 2009

An evolutionary algorithm for network clustering through traffic matrices

Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs

Better transit routing by exploiting vehicle GPS data

CHECKCOL: Improved local search for graph coloring

Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming

Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs

Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries

Data reverse engineering on a smartphone

Data structures and algorithms for disjoint set union problems

scholarly article by Zvi Galil & Giuseppe F. Italiano published 1 September 1991 in ACM Computing Surveys

Data structures resilient to memory faults

Design of Dynamic Algorithms via Primal-Dual Method

Design of trees in the hose model: The balanced case

Designing reliable algorithms in unreliable memories

Dynamic maintenance of directed hypergraphs

Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures

Editorial

Engineering Color Barcode Algorithms for Mobile Applications

article by Donatella Firmani et al published 2014 in Lecture Notes in Computer Science

Erratum to: Editorial

scholarly article published in Algorithmica

Experimental Study of Resilient Algorithms and Data Structures

Experimental analysis of dynamic all pairs shortest path algorithms

scholarly article by Camil Demetrescu & Giuseppe F. Italiano published 1 October 2006 in ACM Transactions on Algorithms

Exploiting GPS Data in Public Transport Journey Planners

Extracting social networks from seized smartphones and web data

Finding Strong Bridges and Strong Articulation Points in Linear Time

Finding paths and deleting edges in directed acyclic graphs

Finding strong bridges and strong articulation points in linear time

Foreword

Frequency Domain Analysis of Large-Scale Proxy Logs for Botnet Traffic Detection

Fully dynamic all pairs shortest paths with real edge weights

Getting back to the past in the union-find problem

Graph Spanners in the Streaming Model: An Experimental Study

Handwritten Signature Verification with 2D Color Barcodes

scholarly article published 29 September 2014

Improved Approximation for Single-Sink Buy-at-Bulk

Improved algorithms for min cut and max flow in undirected planar graphs

Incremental algorithms for minimal length paths

Maintenance of a minimum spanning forest in a dynamic plane graph

Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure

Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem

Near real-time suffix tree construction via the fringe marked ancestor problem

On Resilient Graph Spanners

On Suffix Extensions in Suffix Trees

On suffix extensions in suffix trees

On-line algorithms for polynomially solvable satisfiability problems

scholarly article by Giorgio Ausiello & Giuseppe F. Italiano published January 1991 in The Journal of Logic Programming

On-line computation of minimal and maximal length paths

Optimal Resilient Sorting and Searching in the Presence of Memory Faults

Optimal resilient sorting and searching in the presence of memory faults

PREFACE: Festschrift for Zvi Galil

Penalized Second Price: A New Pricing Algorithm for Advertising in Search Engines

Portraying Algorithms with Leonardo Web

Preface

Preface

Preface

Preface

Reliability and data density in high capacity color barcodes

article by Marco Querini et al published 2014 in Computer Science and Information Systems

Resilient Algorithms and Data Structures

scholarly article by Giuseppe F. Italiano published 2010 in Lecture Notes in Computer Science

Resilient dictionaries

SecureMyDroid

Separator Based Sparsification

article published in 1996

Separator-Based Sparsification II: Edge and Vertex Connectivity

scientific article published in 1998

Shared Backup & Restore: Save, Recover and Share Personal Information into Closed Groups of Smartphones

Small stretch ( α , β ) -spanners in the streaming model

Sorting and Searching in Faulty Memories

Sparse Subgraphs for 2-Connectivity in Directed Graphs

Sparse dynamic programming I: linear cost functions

Sparse dynamic programming II: convex and concave cost functions

Sparsification---a technique for speeding up dynamic graph algorithms

Strong Articulation Points and Strong Bridges in Large Scale Graphs

Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs

The (not so) Critical Nodes of Criminal Networks

The Competitor Busting Strategy in Keyword Auctions: Who's Worst Hit?

The Price of Resiliency: a Case Study on Sorting with Memory Faults

The Quest for the Shortest Route

The set union problem with dynamic weighted backtracking

Topic 12: Theory and Algorithms for Parallel Computation

Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n2 barrier

Traffic vs topology in network clustering: Does it matter?

Traffic-based network clustering

Transaction Oriented Text Messaging with Trusted-SMS

scholarly article published December 2008

Wavelength rerouting in optical networks, or the Venetian Routing problem

What Do We Learn from Experimental Algorithmics?

Worst-case analysis of the set-union problem with extended backtracking