Maintenance of Multi-level Overlay Graphs for Timetable Queries. - Francesco Bruera; Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni (ATMOS, 2007)

Robust Algorithms and Price of Robustness in Shunting Problems. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni; Alfredo Navarra (ATMOS, 2007)

Partially Dynamic Concurrent Update of Distributed Shortest Paths. - Gianlorenzo D'Angelo; Serafino Cicerone; Gabriele Di Stefano; Daniele Frigioni (ICCTA, 2007)

Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni; Alberto Petricola (J. Comput., 2007)

Delay Management Problem: Complexity Results and Robust Algorithms. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni; Alfredo Navarra (COCOA, 2008)

Dynamic Multi-level Overlay Graphs for Shortest Paths. - Francesco Bruera; Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni (Math. Comput. Sci., 2008)

Arc-Flags in Dynamic Graphs. - Emanuele Berrettini; Gianlorenzo D'Angelo; Daniel Delling (ATMOS, 2009)

Recoverable Robust Timetables on Trees. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra; Maria Cristina Pinotti (COCOA, 2009)

Evaluation of Recoverable-Robust Timetables on Tree Networks. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra (IWOCA, 2009)

The Shortcut Problem - Complexity and Approximation. - Reinhard Bauer; Gianlorenzo D'Angelo; Daniel Delling; Dorothea Wagner (SOFSEM, 2009)

Recoverable Robustness for Train Shunting Problems. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni; Alfredo Navarra (Algorithmic Oper. Res., 2009)

Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni; Alfredo Navarra (J. Comb. Optim., 2009)

Recoverable Robustness in Shunting and Timetabling. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni; Alfredo Navarra; Michael Schachtebeck; Anita Schöbel (Robust and Online Large-Scale Optimization, 2009)

Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra (COCOA (2), 2010)

A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni; Vinicio Maurizio (SEA, 2010)

Partially dynamic efficient algorithms for distributed shortest paths. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni (Theor. Comput. Sci., 2010)

Mixed-Criticality Scheduling of Sporadic Task Systems. - Sanjoy K. Baruah; Vincenzo Bonifaci; Gianlorenzo D'Angelo; Alberto Marchetti-Spaccamela; Suzanne van der Ster; Leen Stougie (ESA, 2011)

A Speed-Up Technique for Distributed Shortest Paths Computation. - Gianlorenzo D'Angelo; Mattia D'Emidio; Daniele Frigioni; Vinicio Maurizio (ICCSA (2), 2011)

Maximum flow and minimum-cost flow in multi-interface networks. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra (ICUIMC, 2011)

Gathering of Six Robots on Anonymous Symmetric Rings. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra (SIROCCO, 2011)

Min-Max Coverage in Multi-interface Networks. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra (SOFSEM, 2011)

Bandwidth Constrained Multi-interface Networks. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra (SOFSEM, 2011)

Dynamic Arc-Flags in Road Networks. - Gianlorenzo D'Angelo; Daniele Frigioni; Camillo Vitale (SEA, 2011)

Recoverable Robust Timetables: An Algorithmic Approach on Trees. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra; Maria Cristina Pinotti (IEEE Trans. Computers, 2011)

Diverse routing in networks with star SRLGs. - Jean-Claude Bermond; David Coudert; Gianlorenzo D'Angelo; Fatima Zahra Moataz (StudentWorkshop@CoNEXT, 2012)

The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems. - Sanjoy K. Baruah; Vincenzo Bonifaci; Gianlorenzo D'Angelo; Haohan Li; Alberto Marchetti-Spaccamela; Suzanne van der Ster; Leen Stougie (ECRTS, 2012)

Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks. - Gianlorenzo D'Angelo; Mattia D'Emidio; Daniele Frigioni; Daniele Romano (MedAlg, 2012)

Gathering of Robots on Anonymous Grids without Multiplicity Detection. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Ralf Klasing; Alfredo Navarra (SIROCCO, 2012)

How to Gather Asynchronous Oblivious Robots on Anonymous Rings. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra (DISC, 2012)

Engineering a New Loop-Free Shortest Paths Routing Algorithm. - Gianlorenzo D'Angelo; Mattia D'Emidio; Daniele Frigioni; Vinicio Maurizio (SEA, 2012)

Fully Dynamic Maintenance of Arc-Flags in Road Networks. - Gianlorenzo D'Angelo; Mattia D'Emidio; Daniele Frigioni; Camillo Vitale (SEA, 2012)

Minimize the Maximum Duty in Multi-interface Networks. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra (Algorithmica, 2012)

The Shortcut Problem - Complexity and Algorithms. - Reinhard Bauer; Gianlorenzo D'Angelo; Daniel Delling; Andrea Schumm; Dorothea Wagner (J. Graph Algorithms Appl., 2012)

Scheduling Real-Time Mixed-Criticality Jobs. - Sanjoy K. Baruah; Vincenzo Bonifaci; Gianlorenzo D'Angelo; Haohan Li; Alberto Marchetti-Spaccamela; Nicole Megow; Leen Stougie (IEEE Trans. Computers, 2012)

Approximation Bounds for the Minimum k-Storage Problem. - Gianlorenzo D'Angelo; Daniele Diodati; Alfredo Navarra; Cristina M. Pinotti (ALGOSENSORS, 2013)

SRLG-diverse routing with the star property. - Jean-Claude Bermond; David Coudert; Gianlorenzo D'Angelo; Fatima Zahra Moataz (DRCN, 2013)

A Unified Approach for Different Tasks on Rings in Robot-Based Computing Systems. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra; Nicolas Nisse; Karol Suchan (IPDPS Workshops, 2013)

Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni; Vinicio Maurizio (Algorithmica, 2013)

Pruning the Computation of Distributed Shortest Paths in Power-law Networks. - Gianlorenzo D'Angelo; Mattia D'Emidio; Daniele Frigioni (Informatica (Slovenia), 2013)

Understanding the Power of Stigmergy of Anonymous Agents in Discrete Environments. - Gianlorenzo D'Angelo; Xavier Défago; Nicolas Nisse (CANDAR, 2014)

Gathering and Exclusive Searching on Rings under Minimal Assumptions. - Gianlorenzo D'Angelo; Alfredo Navarra; Nicolas Nisse (ICDCN, 2014)

Optimal placement of storage nodes in a wireless sensor network. - Gianlorenzo D'Angelo; Daniele Diodati; Alfredo Navarra; Maria Cristina Pinotti (ICTCS, 2014)

Gathering on rings under the Look-Compute-Move model. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra (Distributed Comput., 2014)

Gathering six oblivious robots on anonymous symmetric rings. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra (J. Discrete Algorithms, 2014)

Fully dynamic update of arc-flags. - Gianlorenzo D'Angelo; Mattia D'Emidio; Daniele Frigioni (Networks, 2014)

Flow Problems in Multi-Interface Networks. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra (IEEE Trans. Computers, 2014)

A loop-free shortest-path routing algorithm for dynamic networks. - Gianlorenzo D'Angelo; Mattia D'Emidio; Daniele Frigioni (Theor. Comput. Sci., 2014)

Greedily Improving Our Own Centrality in A Network. - Pierluigi Crescenzi; Gianlorenzo D'Angelo; Lorenzo Severini; Yllka Velaj (SEA, 2015)

Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Alfredo Navarra; Nicolas Nisse; Karol Suchan (Algorithmica, 2015)

On the Maximum Betweenness Improvement Problem. - Gianlorenzo D'Angelo; Lorenzo Severini; Yllka Velaj (ICTCS, 2015)

Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems. - Sanjoy K. Baruah; Vincenzo Bonifaci; Gianlorenzo D'Angelo; Haohan Li; Alberto Marchetti-Spaccamela; Suzanne van der Ster; Leen Stougie (J. ACM, 2015)

Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios. - Gianlorenzo D'Angelo; Mattia D'Emidio; Daniele Frigioni; Daniele Romano (Theory Comput. Syst., 2015)

Finding disjoint paths in networks with star shared risk link groups. - Jean-Claude Bermond; David Coudert; Gianlorenzo D'Angelo; Fatima Zahra Moataz (Theor. Comput. Sci., 2015)

The minimum k-storage problem on directed graphs. - Gianlorenzo D'Angelo; Daniele Diodati; Alfredo Navarra; Cristina M. Pinotti (Theor. Comput. Sci., 2015)

Multiprocessor Real-Time Scheduling with Hierarchical Processor Affinities. - Vincenzo Bonifaci; Björn B. Brandenburg; Gianlorenzo D'Angelo; Alberto Marchetti-Spaccamela (ECRTS, 2016)

Influence Maximization in the Independent Cascade Model. - Gianlorenzo D'Angelo; Lorenzo Severini; Yllka Velaj (ICTCS, 2016)

Distance Queries in Large-Scale Fully Dynamic Complex Networks. - Gianlorenzo D'Angelo; Mattia D'Emidio; Daniele Frigioni (IWOCA, 2016)

Local Distributed Verification. - Alkida Balliu; Gianlorenzo D'Angelo; Pierre Fraigniaud; Dennis Olivetti (CoRR, 2016)

Approximation bounds for centrality maximization problems. - Gianlorenzo D'Angelo (Bull. EATCS, 2016)

Gathering of robots on anonymous grids and trees without multiplicity detection. - Gianlorenzo D'Angelo; Gabriele Di Stefano; Ralf Klasing; Alfredo Navarra (Theor. Comput. Sci., 2016)

Greedily Improving Our Own Closeness Centrality in a Network. - Pierluigi Crescenzi; Gianlorenzo D'Angelo; Lorenzo Severini; Yllka Velaj (ACM Trans. Knowl. Discov. Data, 2016)

The Minimum k-Storage Problem: Complexity, Approximation, and Experimental Analysis. - Gianlorenzo D'Angelo; Daniele Diodati; Alfredo Navarra; Cristina M. Pinotti (IEEE Trans. Mob. Comput., 2016)

Selecting Nodes and Buying Links to Maximize the Information Diffusion in a Network. - Gianlorenzo D'Angelo; Lorenzo Severini; Yllka Velaj (MFCS, 2017)

A unified approach for gathering and exclusive searching on rings under weak assumptions. - Gianlorenzo D'Angelo; Alfredo Navarra; Nicolas Nisse (Distributed Comput., 2017)

Engineering graph-based models for dynamic timetable information systems. - Alessio Cionini; Gianlorenzo D'Angelo; Mattia D'Emidio; Daniele Frigioni; Kalliopi Giannakopoulou; Andreas Paraskevopoulos; Christos D. Zaroliagis (J. Discrete Algorithms, 2017)

Approximation and Exact Algorithms for Optimally Placing a Limited Number of Storage Nodes in a Wireless Sensor Network. - Gianlorenzo D'Angelo; Alfredo Navarra; Maria Cristina Pinotti (Handbook of Approximation Algorithms and Metaheuristics (2), 2018)

On the Maximum Connectivity Improvement Problem. - Federico Coro; Gianlorenzo D'Angelo; Cristina M. Pinotti (ALGOSENSORS, 2018)

Report on SEA 2018. - Gianlorenzo D'Angelo; Mattia D'Emidio (Bull. EATCS, 2018)

What can be verified locally? - Alkida Balliu; Gianlorenzo D'Angelo; Pierre Fraigniaud; Dennis Olivetti (J. Comput. Syst. Sci., 2018)

Improving the Betweenness Centrality of a Node by Adding Links. - Elisabetta Bergamini; Pierluigi Crescenzi; Gianlorenzo D'Angelo; Henning Meyerhenke; Lorenzo Severini; Yllka Velaj (ACM J. Exp. Algorithmics, 2018)

Coverage Centrality Maximization in Undirected Networks. - Gianlorenzo D'Angelo; Martin Olsen; Lorenzo Severini (AAAI, 2019)

Vote For Me!: Election Control via Social Influence in Arbitrary Scoring Rule Voting Systems. - Federico Corò; Emilio Cruciani; Gianlorenzo D'Angelo; Stefano Ponziani (AAMAS, 2019)

Building International Doctoral Schools in Computer Science in Italy, De Nicola's Way. - Luca Aceto; Gianlorenzo D'Angelo; Michele Flammini; Omar Inverso; Ludovico Iovino; Catia Trubiani (Models, Languages, and Tools for Concurrent and Distributed Programming, 2019)

Models and Algorithms for Election Control through Influence Maximization. - Mohammad Abouei Mehrizi; Federico Corò; Emilio Cruciani; Gianlorenzo D'Angelo; Stefano Ponziani (ICTCS, 2019)

Exploiting Social Influence to Control Elections Based on Scoring Rules. - Federico Corò; Emilio Cruciani; Gianlorenzo D'Angelo; Stefano Ponziani (IJCAI, 2019)

Recommending Links to Maximize the Influence in Social Networks. - Federico Corò; Gianlorenzo D'Angelo; Yllka Velaj (IJCAI, 2019)

Recommending Links to Control Elections via Social Influence. - Federico Corò; Gianlorenzo D'Angelo; Yllka Velaj (Algorithms, 2019)

Election Control with Voters' Uncertainty: Hardness and Approximation Results. - Mohammad Abouei Mehrizi; Federico Corò; Emilio Cruciani; Gianlorenzo D'Angelo (CoRR, 2019)

Introduction to the Special Issue SEA 2018. - Gianlorenzo D'Angelo (ACM J. Exp. Algorithmics, 2019)

Fully Dynamic 2-Hop Cover Labeling. - Gianlorenzo D'Angelo; Mattia D'Emidio; Daniele Frigioni (ACM J. Exp. Algorithmics, 2019)

Recommending links through influence maximization. - Gianlorenzo D'Angelo; Lorenzo Severini; Yllka Velaj (Theor. Comput. Sci., 2019)

Balancing Spreads of Influence in a Social Network. - Ruben Becker; Federico Corò; Gianlorenzo D'Angelo; Hugo Gilbert (AAAI, 2020)

Leader Election and Compaction for Asynchronous Silent Programmable Matter. - Gianlorenzo D'Angelo; Mattia D'Emidio; Shantanu Das 001; Alfredo Navarra; Giuseppe Prencipe (AAMAS, 2020)

Election Control Through Social Influence with Unknown Preferences. - Mohammad Abouei Mehrizi; Federico Corò; Emilio Cruciani; Gianlorenzo D'Angelo (COCOON, 2020)

Multi-winner Election Control via Social Influence. - Mohammad Abouei Mehrizi; Gianlorenzo D'Angelo (SIROCCO, 2020)

Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction. - Gianlorenzo D'Angelo; Mattia D'Emidio; Shantanu Das 001; Alfredo Navarra; Giuseppe Prencipe (IEEE Access, 2020)

Adding Edges for Maximizing Weighted Reachability. - Federico Corò; Gianlorenzo D'Angelo; Cristina M. Pinotti (Algorithms, 2020)

Multi-Winner Election Control via Social Influence: Hardness and Algorithms for Restricted Cases. - Mohammad Abouei Mehrizi; Gianlorenzo D'Angelo (Algorithms, 2020)

On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem. - Federico Corò; Gianlorenzo D'Angelo; Vahan Mkrtchyan (Theory Comput. Syst., 2020)

Unveiling the Truth in Liquid Democracy with Misinformed Voters. - Ruben Becker; Gianlorenzo D'Angelo; Esmaeil Delfaraz; Hugo Gilbert (ADT, 2021)

Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. - Eugenio Angriman; Ruben Becker; Gianlorenzo D'Angelo; Hugo Gilbert; Alexander van der Grinten; Henning Meyerhenke (ALENEX, 2021)

Maximizing Influence-Based Group Shapley Centrality. - Ruben Becker; Gianlorenzo D'Angelo; Hugo Gilbert (AAMAS, 2021)

The Multi-budget Maximum Weighted Coverage Problem. - Francesco Cellinese; Gianlorenzo D'Angelo; Gianpiero Monaco; Yllka Velaj (CIAC, 2021)

Influence Maximization With Co-Existing Seeds. - Ruben Becker; Gianlorenzo D'Angelo; Hugo Gilbert (CIKM, 2021)

Mitigating Negative Influence Diffusion is Hard. - Gianlorenzo D'Angelo; Mohammad Abouei Mehrizi (CIKM, 2021)

Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies. - Gianlorenzo D'Angelo; Debashmita Poddar; Cosimo Vinci (ICALP, 2021)

When Can Liquid Democracy Unveil the Truth? - Ruben Becker; Gianlorenzo D'Angelo; Esmaeil Delfaraz; Hugo Gilbert (CoRR, 2021)

Finding single-source shortest p-disjoint paths: fast computation and sparse preservers. - Davide Bilò; Gianlorenzo D'Angelo; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Mirko Rossi (CoRR, 2021)

Generalized budgeted submodular set function maximization. - Francesco Cellinese; Gianlorenzo D'Angelo; Gianpiero Monaco; Yllka Velaj (Inf. Comput., 2021)

Algorithms for hierarchical and semi-partitioned parallel scheduling. - Vincenzo Bonifaci; Gianlorenzo D'Angelo; Alberto Marchetti-Spaccamela (J. Comput. Syst. Sci., 2021)

Link Recommendation for Social Influence Maximization. - Federico Coro; Gianlorenzo D'Angelo; Yllka Velaj (ACM Trans. Knowl. Discov. Data, 2021)

Computation and Bribery of Voting Power in Delegative Simple Games. - Gianlorenzo D'Angelo; Esmaeil Delfaraz; Hugo Gilbert (AAMAS, 2022)

Sparse Temporal Spanners with Low Stretch. - Davide Bilò; Gianlorenzo D'Angelo; Luciano Gualà; Stefano Leucci 001; Mirko Rossi (ESA, 2022)

Budgeted Out-Tree Maximization with Submodular Prizes. - Gianlorenzo D'Angelo; Esmaeil Delfaraz; Hugo Gilbert (ISAAC, 2022)

Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. - Davide Bilò; Gianlorenzo D'Angelo; Luciano Gualà; Stefano Leucci 001; Guido Proietti; Mirko Rossi (STACS, 2022)

Approximation algorithms for Node-weighted Steiner Problems: Digraphs with Additive Prizes and Graphs with Submodular Prizes. - Gianlorenzo D'Angelo; Esmaeil Delfaraz (CoRR, 2022)

Exploiting social influence to control elections based on positional scoring rules. - Federico Corò; Emilio Cruciani; Gianlorenzo D'Angelo; Stefano Ponziani (Inf. Comput., 2022)

Fairness in Influence Maximization through Randomization. - Ruben Becker; Gianlorenzo D'Angelo; Sajjad Ghobadi; Hugo Gilbert (J. Artif. Intell. Res., 2022)

Election control through social influence with voters' uncertainty. - Mohammad Abouei Mehrizi; Federico Corò; Emilio Cruciani; Gianlorenzo D'Angelo (J. Comb. Optim., 2022)

On the Cost of Demographic Parity in Influence Maximization. - Ruben Becker; Gianlorenzo D'Angelo; Sajjad Ghobadi (AAAI, 2023)

Improving Fairness in Information Exposure by Adding Links. - Ruben Becker; Gianlorenzo D'Angelo; Sajjad Ghobadi (AAAI, 2023)

Better bounds on the adaptivity gap of influence maximization under full-adoption feedback. - Gianlorenzo D'Angelo; Debashmita Poddar; Cosimo Vinci (Artif. Intell., 2023)

Improved Algorithms for the Capacitated Team Orienteering Problem. - Gianlorenzo D'Angelo; Mattia D'Emidio; Esmaeil Delfaraz; Gabriele Di Stefano (ATMOS, 2024)

Approximation Algorithms for Node-Weighted Directed Steiner Problems. - Gianlorenzo D'Angelo; Esmaeil Delfaraz (IWOCA, 2024)

Blackout-tolerant temporal spanners. - Davide Bilò; Gianlorenzo D'Angelo; Luciano Gualà; Stefano Leucci 001; Mirko Rossi (J. Comput. Syst. Sci., 2024)

Approximating Optimal Labelings for Temporal Connectivity. - Daniele Carnevale 002; Gianlorenzo D'Angelo; Martin Olsen (AAAI, 2025)

Approximation Algorithms for Connected Maximum Coverage. - Gianlorenzo D'Angelo; Esmaeil Delfaraz (AAMAS, 2025)

Approximation Algorithms for Connected Maximum Coverage, Minimum Connected Set Cover, and Node-Weighted Group Steiner Tree. - Gianlorenzo D'Angelo; Esmaeil Delfaraz (CoRR, 2025)