Gianlorenzo D'Angelo

151 papers A* 10A 14B 18C 15Misc 2Journal 73Unranked 16

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Optimizing Distances for Multi-Broadcast in Temporal Graphs. CoRR Daniele Carnevale, Gianlorenzo D'Angelo
2025	—	`conf`	Approximating Optimal Labelings for Temporal Connectivity (Extended Abstract). Green-Aware AI@ECAI Daniele Carnevale, Gianlorenzo D'Angelo, Martin Olsen
2025	A*	`conf`	Approximating Optimal Labelings for Temporal Connectivity. AAAI Daniele Carnevale, Gianlorenzo D'Angelo, Martin Olsen
2025	J	`jnl`	Approximating Optimal Labelings for Temporal Connectivity. CoRR Daniele Carnevale, Gianlorenzo D'Angelo, Martin Olsen
2025	J	`jnl`	Approximation Algorithms for Connected Maximum Coverage, Minimum Connected Set Cover, and Node-Weighted Group Steiner Tree. CoRR Gianlorenzo D'Angelo, Esmaeil Delfaraz
2025	A	`conf`	Approximation Algorithms for Connected Maximum Coverage. AAMAS Gianlorenzo D'Angelo, Esmaeil Delfaraz
2024	C	`conf`	Approximation Algorithms for Node-Weighted Directed Steiner Problems. IWOCA Gianlorenzo D'Angelo, Esmaeil Delfaraz
2024	J	`jnl`	Blackout-tolerant temporal spanners. J. Comput. Syst. Sci. Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
2024	C	`conf`	Improved Algorithms for the Capacitated Team Orienteering Problem. ATMOS Gianlorenzo D'Angelo, Mattia D'Emidio, Esmaeil Delfaraz, Gabriele Di Stefano
2023	J	`jnl`	Better bounds on the adaptivity gap of influence maximization under full-adoption feedback. Artif. Intell. Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci
2023	A*	`conf`	Improving Fairness in Information Exposure by Adding Links. AAAI Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi
2023	J	`jnl`	Improving Fairness in Information Exposure by Adding Links. CoRR Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi
2023	A*	`conf`	On the Cost of Demographic Parity in Influence Maximization. AAAI Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi
2023	J	`jnl`	On the Cost of Demographic Parity in Influence Maximization. CoRR Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi
2022	J	`jnl`	Approximation algorithms for Node-weighted Steiner Problems: Digraphs with Additive Prizes and Graphs with Submodular Prizes. CoRR Gianlorenzo D'Angelo, Esmaeil Delfaraz
2022	C	`conf`	Blackout-Tolerant Temporal Spanners. ALGOSENSORS Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
2022	B	`conf`	Budgeted Out-Tree Maximization with Submodular Prizes. ISAAC Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert
2022	J	`jnl`	Budgeted Out-tree Maximization with Submodular Prizes. CoRR Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert
2022	A	`conf`	Computation and Bribery of Voting Power in Delegative Simple Games. AAMAS Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert
2022	J	`jnl`	Election control through social influence with voters' uncertainty. J. Comb. Optim. Mohammad Abouei Mehrizi, Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo
2022	J	`jnl`	Exploiting social influence to control elections based on positional scoring rules. Inf. Comput. Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo, Stefano Ponziani
2022	J	`jnl`	Fairness in Influence Maximization through Randomization. J. Artif. Intell. Res. Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi, Hugo Gilbert
2022	A	`conf`	Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. STACS Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
2022	A	`conf`	Sparse Temporal Spanners with Low Stretch. ESA Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
2022	J	`jnl`	Sparse Temporal Spanners with Low Stretch. CoRR Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
2021	—	`ed.`	Algorithmic Aspects of Cloud Computing - 6th International Symposium, ALGOCLOUD 2021, Lisbon, Portugal, September 6-7, 2021, Revised Selected Papers ALGOCLOUD Gianlorenzo D'Angelo, Othon Michail
2021	J	`jnl`	Algorithms for hierarchical and semi-partitioned parallel scheduling. J. Comput. Syst. Sci. Vincenzo Bonifaci, Gianlorenzo D'Angelo, Alberto Marchetti-Spaccamela
2021	A*	`conf`	Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback. AAAI Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci
2021	J	`jnl`	Computation and Bribery of Voting Power in Delegative Simple Games. CoRR Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert
2021	A*	`conf`	Fairness in Influence Maximization through Randomization. AAAI Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi, Hugo Gilbert
2021	J	`jnl`	Finding single-source shortest p-disjoint paths: fast computation and sparse preservers. CoRR Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
2021	J	`jnl`	Generalized budgeted submodular set function maximization. Inf. Comput. Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj
2021	A	`conf`	Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. ALENEX Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert, Alexander van der Grinten, Henning Meyerhenke
2021	A*	`conf`	Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies. ICALP Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci
2021	A	`conf`	Influence Maximization With Co-Existing Seeds. CIKM Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert
2021	J	`jnl`	Link Recommendation for Social Influence Maximization. ACM Trans. Knowl. Discov. Data Federico Coro, Gianlorenzo D'Angelo, Yllka Velaj
2021	A	`conf`	Maximizing Influence-Based Group Shapley Centrality. AAMAS Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert
2021	A	`conf`	Mitigating Negative Influence Diffusion is Hard. CIKM Gianlorenzo D'Angelo, Mohammad Abouei Mehrizi
2021	C	`conf`	The Multi-budget Maximum Weighted Coverage Problem. CIAC Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj
2021	—	`conf`	Unveiling the Truth in Liquid Democracy with Misinformed Voters. ADT Ruben Becker, Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert
2021	J	`jnl`	When Can Liquid Democracy Unveil the Truth? CoRR Ruben Becker, Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert
2020	J	`jnl`	Adding Edges for Maximizing Weighted Reachability. Algorithms Federico Corò, Gianlorenzo D'Angelo, Cristina M. Pinotti
2020	J	`jnl`	Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction. IEEE Access Gianlorenzo D'Angelo, Mattia D'Emidio, Shantanu Das, Alfredo Navarra, Giuseppe Prencipe
2020	A*	`conf`	Balancing Spreads of Influence in a Social Network. AAAI Ruben Becker, Federico Corò, Gianlorenzo D'Angelo, Hugo Gilbert
2020	J	`jnl`	Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback. CoRR Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci
2020	Misc	`conf`	Election Control Through Social Influence with Unknown Preferences. COCOON Mohammad Abouei Mehrizi, Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo
2020	J	`jnl`	Fairness in Influence Maximization through Randomization. CoRR Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi, Hugo Gilbert
2020	J	`jnl`	Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. CoRR Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert, Alexander van der Grinten, Henning Meyerhenke
2020	J	`jnl`	Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies. CoRR Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci
2020	A	`conf`	Leader Election and Compaction for Asynchronous Silent Programmable Matter. AAMAS Gianlorenzo D'Angelo, Mattia D'Emidio, Shantanu Das, Alfredo Navarra, Giuseppe Prencipe
2020	J	`jnl`	Maximizing Influence-based Group Shapley Centrality. CoRR Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert
2020	J	`jnl`	Multi-Winner Election Control via Social Influence. CoRR Mohammad Abouei Mehrizi, Gianlorenzo D'Angelo
2020	J	`jnl`	Multi-Winner Election Control via Social Influence: Hardness and Algorithms for Restricted Cases. Algorithms Mohammad Abouei Mehrizi, Gianlorenzo D'Angelo
2020	B	`conf`	Multi-winner Election Control via Social Influence. SIROCCO Mohammad Abouei Mehrizi, Gianlorenzo D'Angelo
2020	J	`jnl`	On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem. Theory Comput. Syst. Federico Corò, Gianlorenzo D'Angelo, Vahan Mkrtchyan
2019	J	`jnl`	Balancing spreads of influence in a social network. CoRR Ruben Becker, Federico Corò, Gianlorenzo D'Angelo, Hugo Gilbert
2019	—	`conf`	Building International Doctoral Schools in Computer Science in Italy, De Nicola's Way. Models, Languages, and Tools for Concurrent and Distributed Programming Luca Aceto, Gianlorenzo D'Angelo, Michele Flammini, Omar Inverso, Ludovico Iovino, Catia Trubiani
2019	A*	`conf`	Coverage Centrality Maximization in Undirected Networks. AAAI Gianlorenzo D'Angelo, Martin Olsen, Lorenzo Severini
2019	J	`jnl`	Election Control with Voters' Uncertainty: Hardness and Approximation Results. CoRR Mohammad Abouei Mehrizi, Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo
2019	A*	`conf`	Exploiting Social Influence to Control Elections Based on Scoring Rules. IJCAI Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo, Stefano Ponziani
2019	J	`jnl`	Fully Dynamic 2-Hop Cover Labeling. ACM J. Exp. Algorithmics Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
2019	J	`jnl`	Introduction to the Special Issue SEA 2018. ACM J. Exp. Algorithmics Gianlorenzo D'Angelo
2019	—	`conf`	Models and Algorithms for Election Control through Influence Maximization. ICTCS Mohammad Abouei Mehrizi, Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo, Stefano Ponziani
2019	J	`jnl`	On the fixed-parameter tractability of the maximum connectivity improvement problem. CoRR Federico Corò, Gianlorenzo D'Angelo, Vahan Mkrtchyan
2019	J	`jnl`	Recommending Links to Control Elections via Social Influence. Algorithms Federico Corò, Gianlorenzo D'Angelo, Yllka Velaj
2019	A*	`conf`	Recommending Links to Maximize the Influence in Social Networks. IJCAI Federico Corò, Gianlorenzo D'Angelo, Yllka Velaj
2019	J	`jnl`	Recommending links through influence maximization. Theor. Comput. Sci. Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
2019	A	`conf`	Vote For Me!: Election Control via Social Influence in Arbitrary Scoring Rule Voting Systems. AAMAS Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo, Stefano Ponziani
2019	J	`jnl`	Vote for Me! Election Control via Social Influence in Arbitrary Scoring Rule Voting Systems. CoRR Federico Coro, Emilio Cruciani, Gianlorenzo D'Angelo, Stefano Ponziani
2018	B	`ed.`	17th International Symposium on Experimental Algorithms, SEA 2018, L'Aquila, Italy, June 27-29, 2018 SEA Gianlorenzo D'Angelo
2018	—	`ch.`	Approximation and Exact Algorithms for Optimally Placing a Limited Number of Storage Nodes in a Wireless Sensor Network. Handbook of Approximation Algorithms and Metaheuristics (2) Gianlorenzo D'Angelo, Alfredo Navarra, Maria Cristina Pinotti
2018	J	`jnl`	Coverage Centrality Maximization in Undirected Networks. CoRR Gianlorenzo D'Angelo, Martin Olsen, Lorenzo Severini
2018	B	`conf`	Generalized Budgeted Submodular Set Function Maximization. MFCS Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj
2018	J	`jnl`	Generalized budgeted submodular set function maximization. CoRR Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj
2018	J	`jnl`	Improving the Betweenness Centrality of a Node by Adding Links. ACM J. Exp. Algorithmics Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj
2018	C	`conf`	On the Maximum Connectivity Improvement Problem. ALGOSENSORS Federico Coro, Gianlorenzo D'Angelo, Cristina M. Pinotti
2018	J	`jnl`	Report on SEA 2018. Bull. EATCS Gianlorenzo D'Angelo, Mattia D'Emidio
2018	J	`jnl`	What can be verified locally? J. Comput. Syst. Sci. Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti
2017	C	`ed.`	17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2017, Vienna, Austria, September 7-8, 2017 ATMOS Gianlorenzo D'Angelo, Twan Dollevoet
2017	J	`jnl`	A unified approach for gathering and exclusive searching on rings under weak assumptions. Distributed Comput. Gianlorenzo D'Angelo, Alfredo Navarra, Nicolas Nisse
2017	A	`conf`	Algorithms for Hierarchical and Semi-Partitioned Parallel Scheduling. IPDPS Vincenzo Bonifaci, Gianlorenzo D'Angelo, Alberto Marchetti-Spaccamela
2017	J	`jnl`	Engineering graph-based models for dynamic timetable information systems. J. Discrete Algorithms Alessio Cionini, Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Kalliopi Giannakopoulou, Andreas Paraskevopoulos, Christos D. Zaroliagis
2017	J	`jnl`	Improving the betweenness centrality of a node by adding links. CoRR Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj
2017	J	`jnl`	Recommending links through influence maximization. CoRR Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
2017	B	`conf`	Selecting Nodes and Buying Links to Maximize the Information Diffusion in a Network. MFCS Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
2017	J	`jnl`	Selecting nodes and buying links to maximize the information diffusion in a network. CoRR Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
2017	A	`conf`	What Can Be Verified Locally?. STACS Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti
2016	J	`jnl`	Approximation bounds for centrality maximization problems. Bull. EATCS Gianlorenzo D'Angelo
2016	C	`conf`	Distance Queries in Large-Scale Fully Dynamic Complex Networks. IWOCA Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
2016	J	`jnl`	Gathering of robots on anonymous grids and trees without multiplicity detection. Theor. Comput. Sci. Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing, Alfredo Navarra
2016	J	`jnl`	Greedily Improving Our Own Closeness Centrality in a Network. ACM Trans. Knowl. Discov. Data Pierluigi Crescenzi, Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
2016	—	`conf`	Influence Maximization in the Independent Cascade Model. ICTCS Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
2016	J	`jnl`	Local Distributed Verification. CoRR Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti
2016	B	`conf`	Multiprocessor Real-Time Scheduling with Hierarchical Processor Affinities. ECRTS Vincenzo Bonifaci, Björn B. Brandenburg, Gianlorenzo D'Angelo, Alberto Marchetti-Spaccamela
2016	J	`jnl`	The Minimum k-Storage Problem: Complexity, Approximation, and Experimental Analysis. IEEE Trans. Mob. Comput. Gianlorenzo D'Angelo, Daniele Diodati, Alfredo Navarra, Cristina M. Pinotti
2015	J	`jnl`	Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks. Algorithmica Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan
2015	J	`jnl`	Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios. Theory Comput. Syst. Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Daniele Romano
2015	J	`jnl`	Finding disjoint paths in networks with star shared risk link groups. Theor. Comput. Sci. Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, Fatima Zahra Moataz
2015	B	`conf`	Greedily Improving Our Own Centrality in A Network. SEA Pierluigi Crescenzi, Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
2015	—	`conf`	On the Maximum Betweenness Improvement Problem. ICTCS Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
2015	J	`jnl`	Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems. J. ACM Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Suzanne van der Ster, Leen Stougie
2015	J	`jnl`	The minimum k-storage problem on directed graphs. Theor. Comput. Sci. Gianlorenzo D'Angelo, Daniele Diodati, Alfredo Navarra, Cristina M. Pinotti
2014	J	`jnl`	A loop-free shortest-path routing algorithm for dynamic networks. Theor. Comput. Sci. Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
2014	C	`conf`	Engineering Graph-Based Models for Dynamic Timetable Information Systems. ATMOS Alessio Cionini, Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Kalliopi Giannakopoulou, Andreas Paraskevopoulos, Christos D. Zaroliagis
2014	J	`jnl`	Flow Problems in Multi-Interface Networks. IEEE Trans. Computers Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2014	J	`jnl`	Fully dynamic update of arc-flags. Networks Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
2014	Misc	`conf`	Gathering and Exclusive Searching on Rings under Minimal Assumptions. ICDCN Gianlorenzo D'Angelo, Alfredo Navarra, Nicolas Nisse
2014	J	`jnl`	Gathering on rings under the Look-Compute-Move model. Distributed Comput. Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2014	J	`jnl`	Gathering six oblivious robots on anonymous symmetric rings. J. Discrete Algorithms Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2014	—	`conf`	Optimal placement of storage nodes in a wireless sensor network. ICTCS Gianlorenzo D'Angelo, Daniele Diodati, Alfredo Navarra, Maria Cristina Pinotti
2014	—	`conf`	Understanding the Power of Stigmergy of Anonymous Agents in Discrete Environments. CANDAR Gianlorenzo D'Angelo, Xavier Défago, Nicolas Nisse
2013	—	`conf`	A Unified Approach for Different Tasks on Rings in Robot-Based Computing Systems. IPDPS Workshops Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan
2013	C	`conf`	Approximation Bounds for the Minimum k-Storage Problem. ALGOSENSORS Gianlorenzo D'Angelo, Daniele Diodati, Alfredo Navarra, Cristina M. Pinotti
2013	J	`jnl`	Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks. Algorithmica Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Vinicio Maurizio
2013	J	`jnl`	Pruning the Computation of Distributed Shortest Paths in Power-law Networks. Informatica (Slovenia) Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
2013	—	`conf`	SRLG-diverse routing with the star property. DRCN Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, Fatima Zahra Moataz
2012	—	`conf`	Diverse routing in networks with star SRLGs. StudentWorkshop@CoNEXT Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, Fatima Zahra Moataz
2012	B	`conf`	Engineering a New Loop-Free Shortest Paths Routing Algorithm. SEA Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio
2012	—	`conf`	Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks. MedAlg Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Daniele Romano
2012	B	`conf`	Fully Dynamic Maintenance of Arc-Flags in Road Networks. SEA Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Camillo Vitale
2012	B	`conf`	Gathering of Robots on Anonymous Grids without Multiplicity Detection. SIROCCO Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing, Alfredo Navarra
2012	A	`conf`	How to Gather Asynchronous Oblivious Robots on Anonymous Rings. DISC Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2012	J	`jnl`	Minimize the Maximum Duty in Multi-interface Networks. Algorithmica Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2012	J	`jnl`	Scheduling Real-Time Mixed-Criticality Jobs. IEEE Trans. Computers Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie
2012	B	`conf`	The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems. ECRTS Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Suzanne van der Ster, Leen Stougie
2012	J	`jnl`	The Shortcut Problem - Complexity and Algorithms. J. Graph Algorithms Appl. Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Andrea Schumm, Dorothea Wagner
2011	—	`conf`	A Speed-Up Technique for Distributed Shortest Paths Computation. ICCSA (2) Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio
2011	B	`conf`	Bandwidth Constrained Multi-interface Networks. SOFSEM Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2011	B	`conf`	Dynamic Arc-Flags in Road Networks. SEA Gianlorenzo D'Angelo, Daniele Frigioni, Camillo Vitale
2011	B	`conf`	Gathering of Six Robots on Anonymous Symmetric Rings. SIROCCO Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2011	—	`conf`	Maximum flow and minimum-cost flow in multi-interface networks. ICUIMC Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2011	B	`conf`	Min-Max Coverage in Multi-interface Networks. SOFSEM Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2011	A	`conf`	Mixed-Criticality Scheduling of Sporadic Task Systems. ESA Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Alberto Marchetti-Spaccamela, Suzanne van der Ster, Leen Stougie
2011	J	`jnl`	Recoverable Robust Timetables: An Algorithmic Approach on Trees. IEEE Trans. Computers Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Maria Cristina Pinotti
2010	B	`conf`	A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation. SEA Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Vinicio Maurizio
2010	—	`conf`	Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks. COCOA (2) Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2010	J	`jnl`	Partially dynamic efficient algorithms for distributed shortest paths. Theor. Comput. Sci. Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni
2010	B	`conf`	Scheduling Real-Time Mixed-Criticality Jobs. MFCS Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie
2009	C	`conf`	Arc-Flags in Dynamic Graphs. ATMOS Emanuele Berrettini, Gianlorenzo D'Angelo, Daniel Delling
2009	C	`conf`	Evaluation of Recoverable-Robust Timetables on Tree Networks. IWOCA Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
2009	C	`conf`	Recoverable Robust Timetables on Trees. COCOA Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Maria Cristina Pinotti
2009	J	`jnl`	Recoverable Robustness for Train Shunting Problems. Algorithmic Oper. Res. Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
2009	—	`ch.`	Recoverable Robustness in Shunting and Timetabling. Robust and Online Large-Scale Optimization Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra, Michael Schachtebeck, Anita Schöbel
2009	J	`jnl`	Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases. J. Comb. Optim. Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
2009	B	`conf`	The Shortcut Problem - Complexity and Approximation. SOFSEM Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Dorothea Wagner
2008	C	`conf`	Delay Management Problem: Complexity Results and Robust Algorithms. COCOA Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
2008	J	`jnl`	Dynamic Multi-level Overlay Graphs for Shortest Paths. Math. Comput. Sci. Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni
2007	C	`conf`	Maintenance of Multi-level Overlay Graphs for Timetable Queries. ATMOS Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni
2007	J	`jnl`	Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation. J. Comput. Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alberto Petricola
2007	—	`conf`	Partially Dynamic Concurrent Update of Distributed Shortest Paths. ICCTA Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni
2007	C	`conf`	Robust Algorithms and Price of Robustness in Shunting Problems. ATMOS Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra