Gianlorenzo D'Angelo

ORCID

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 90

Top Venues

Publications

Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
Blackout-tolerant temporal spanners. J. Comput. Syst. Sci. 141 (2024)
Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci
Better bounds on the adaptivity gap of influence maximization under full-adoption feedback. Artif. Intell. 318 (2023)
Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi
On the Cost of Demographic Parity in Influence Maximization. CoRR (2023)
Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi
Improving Fairness in Information Exposure by Adding Links. CoRR (2023)
Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi
Improving Fairness in Information Exposure by Adding Links. AAAI (2023)
Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi
On the Cost of Demographic Parity in Influence Maximization. AAAI (2023)
Mohammad Abouei Mehrizi, Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo
Election control through social influence with voters' uncertainty. J. Comb. Optim. 44 (1) (2022)
Gianlorenzo D'Angelo, Esmaeil Delfaraz
Approximation algorithms for Node-weighted Steiner Problems: Digraphs with Additive Prizes and Graphs with Submodular Prizes. CoRR (2022)
Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert
Budgeted Out-Tree Maximization with Submodular Prizes. ISAAC (2022)
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
Sparse Temporal Spanners with Low Stretch. CoRR (2022)
Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert
Computation and Bribery of Voting Power in Delegative Simple Games. AAMAS (2022)
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
Sparse Temporal Spanners with Low Stretch. ESA (2022)
Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi, Hugo Gilbert
Fairness in Influence Maximization through Randomization. J. Artif. Intell. Res. 73 (2022)
Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert
Budgeted Out-tree Maximization with Submodular Prizes. CoRR (2022)
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. STACS (2022)
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi
Blackout-Tolerant Temporal Spanners. ALGOSENSORS (2022)
Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo, Stefano Ponziani
Exploiting social influence to control elections based on positional scoring rules. Inf. Comput. 289 (Part) (2022)
Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert
Computation and Bribery of Voting Power in Delegative Simple Games. CoRR (2021)
Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci
Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback. AAAI (2021)
Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert, Alexander van der Grinten, Henning Meyerhenke
Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. ALENEX (2021)
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
Finding single-source shortest p-disjoint paths: fast computation and sparse preservers. CoRR (2021)
Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj
Generalized budgeted submodular set function maximization. Inf. Comput. 281 (2021)
Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert
Influence Maximization With Co-Existing Seeds. CIKM (2021)
Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi, Hugo Gilbert
Fairness in Influence Maximization through Randomization. AAAI (2021)
Federico Coro, Gianlorenzo D'Angelo, Yllka Velaj
Link Recommendation for Social Influence Maximization. ACM Trans. Knowl. Discov. Data 15 (6) (2021)
Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci
Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies. ICALP (2021)
Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj
The Multi-budget Maximum Weighted Coverage Problem. CIAC (2021)
Ruben Becker, Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert
When Can Liquid Democracy Unveil the Truth? CoRR (2021)
Ruben Becker, Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert
Unveiling the Truth in Liquid Democracy with Misinformed Voters. ADT (2021)
Gianlorenzo D'Angelo, Mohammad Abouei Mehrizi
Mitigating Negative Influence Diffusion is Hard. CIKM (2021)
Vincenzo Bonifaci, Gianlorenzo D'Angelo, Alberto Marchetti-Spaccamela
Algorithms for hierarchical and semi-partitioned parallel scheduling. J. Comput. Syst. Sci. 120 (2021)
Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert
Maximizing Influence-Based Group Shapley Centrality. AAMAS (2021)
Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci
Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies. CoRR (2020)
Gianlorenzo D'Angelo, Mattia D'Emidio, Shantanu Das, Alfredo Navarra, Giuseppe Prencipe
Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction. IEEE Access 8 (2020)
Ruben Becker, Federico Corò, Gianlorenzo D'Angelo, Hugo Gilbert
Balancing Spreads of Influence in a Social Network. AAAI (2020)
Mohammad Abouei Mehrizi, Gianlorenzo D'Angelo
Multi-Winner Election Control via Social Influence. CoRR (2020)
Mohammad Abouei Mehrizi, Gianlorenzo D'Angelo
Multi-winner Election Control via Social Influence. SIROCCO (2020)
Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert, Alexander van der Grinten, Henning Meyerhenke
Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. CoRR (2020)
Gianlorenzo D'Angelo, Mattia D'Emidio, Shantanu Das, Alfredo Navarra, Giuseppe Prencipe
Leader Election and Compaction for Asynchronous Silent Programmable Matter. AAMAS (2020)
Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi, Hugo Gilbert
Fairness in Influence Maximization through Randomization. CoRR (2020)
Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert
Maximizing Influence-based Group Shapley Centrality. CoRR (2020)
Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci
Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback. CoRR (2020)
Mohammad Abouei Mehrizi, Gianlorenzo D'Angelo
Multi-Winner Election Control via Social Influence: Hardness and Algorithms for Restricted Cases. Algorithms 13 (10) (2020)
Federico Corò, Gianlorenzo D'Angelo, Vahan Mkrtchyan
On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem. Theory Comput. Syst. 64 (6) (2020)
Mohammad Abouei Mehrizi, Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo
Election Control Through Social Influence with Unknown Preferences. COCOON (2020)
Federico Corò, Gianlorenzo D'Angelo, Cristina M. Pinotti
Adding Edges for Maximizing Weighted Reachability. Algorithms 13 (3) (2020)
Federico Corò, Gianlorenzo D'Angelo, Vahan Mkrtchyan
On the fixed-parameter tractability of the maximum connectivity improvement problem. CoRR (2019)
Federico Corò, Gianlorenzo D'Angelo, Yllka Velaj
Recommending Links to Maximize the Influence in Social Networks. IJCAI (2019)
Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo, Stefano Ponziani
Exploiting Social Influence to Control Elections Based on Scoring Rules. IJCAI (2019)
Mohammad Abouei Mehrizi, Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo, Stefano Ponziani
Models and Algorithms for Election Control through Influence Maximization. ICTCS (2019)
Federico Corò, Gianlorenzo D'Angelo, Yllka Velaj
Recommending Links to Control Elections via Social Influence. Algorithms 12 (10) (2019)
Federico Coro, Emilio Cruciani, Gianlorenzo D'Angelo, Stefano Ponziani
Vote for Me! Election Control via Social Influence in Arbitrary Scoring Rule Voting Systems. CoRR (2019)
Mohammad Abouei Mehrizi, Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo
Election Control with Voters' Uncertainty: Hardness and Approximation Results. CoRR (2019)
Gianlorenzo D'Angelo, Martin Olsen, Lorenzo Severini
Coverage Centrality Maximization in Undirected Networks. AAAI (2019)
Ruben Becker, Federico Corò, Gianlorenzo D'Angelo, Hugo Gilbert
Balancing spreads of influence in a social network. CoRR (2019)
Gianlorenzo D'Angelo
Introduction to the Special Issue SEA 2018. ACM J. Exp. Algorithmics 24 (1) (2019)
Luca Aceto, Gianlorenzo D'Angelo, Michele Flammini, Omar Inverso, Ludovico Iovino, Catia Trubiani
Building International Doctoral Schools in Computer Science in Italy, De Nicola's Way. Models, Languages, and Tools for Concurrent and Distributed Programming (2019)
Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo, Stefano Ponziani
Vote For Me!: Election Control via Social Influence in Arbitrary Scoring Rule Voting Systems. AAMAS (2019)
Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
Recommending links through influence maximization. Theor. Comput. Sci. 764 (2019)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
Fully Dynamic 2-Hop Cover Labeling. ACM J. Exp. Algorithmics 24 (1) (2019)
Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti
What can be verified locally? J. Comput. Syst. Sci. 97 (2018)
Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj
Generalized Budgeted Submodular Set Function Maximization. MFCS (2018)
Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj
Generalized budgeted submodular set function maximization. CoRR (2018)
Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj
Improving the Betweenness Centrality of a Node by Adding Links. ACM J. Exp. Algorithmics 23 (2018)
Gianlorenzo D'Angelo, Martin Olsen, Lorenzo Severini
Coverage Centrality Maximization in Undirected Networks. CoRR (2018)
Federico Coro, Gianlorenzo D'Angelo, Cristina M. Pinotti
On the Maximum Connectivity Improvement Problem. ALGOSENSORS (2018)
Gianlorenzo D'Angelo, Mattia D'Emidio
Report on SEA 2018. Bull. EATCS 126 (2018)
Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj
Improving the betweenness centrality of a node by adding links. CoRR (2017)
Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
Recommending links through influence maximization. CoRR (2017)
Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
Selecting nodes and buying links to maximize the information diffusion in a network. CoRR (2017)
Alessio Cionini, Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Kalliopi Giannakopoulou, Andreas Paraskevopoulos, Christos D. Zaroliagis
Engineering graph-based models for dynamic timetable information systems. J. Discrete Algorithms (2017)
Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti
What Can Be Verified Locally?. STACS (2017)
Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
Selecting Nodes and Buying Links to Maximize the Information Diffusion in a Network. MFCS (2017)
Gianlorenzo D'Angelo, Alfredo Navarra, Nicolas Nisse
A unified approach for gathering and exclusive searching on rings under weak assumptions. Distributed Comput. 30 (1) (2017)
Vincenzo Bonifaci, Gianlorenzo D'Angelo, Alberto Marchetti-Spaccamela
Algorithms for Hierarchical and Semi-Partitioned Parallel Scheduling. IPDPS (2017)
Gianlorenzo D'Angelo
Approximation bounds for centrality maximization problems. Bull. EATCS 120 (2016)
Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
Influence Maximization in the Independent Cascade Model. ICTCS (2016)
Pierluigi Crescenzi, Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
Greedily Improving Our Own Closeness Centrality in a Network. ACM Trans. Knowl. Discov. Data 11 (1) (2016)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
Distance Queries in Large-Scale Fully Dynamic Complex Networks. IWOCA (2016)
Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
On the Maximum Betweenness Improvement Problem. Electron. Notes Theor. Comput. Sci. 322 (2016)
Gianlorenzo D'Angelo, Daniele Diodati, Alfredo Navarra, Cristina M. Pinotti
The Minimum k-Storage Problem: Complexity, Approximation, and Experimental Analysis. IEEE Trans. Mob. Comput. 15 (7) (2016)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing, Alfredo Navarra
Gathering of robots on anonymous grids and trees without multiplicity detection. Theor. Comput. Sci. 610 (2016)
Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti
Local Distributed Verification. CoRR (2016)
Vincenzo Bonifaci, Björn B. Brandenburg, Gianlorenzo D'Angelo, Alberto Marchetti-Spaccamela
Multiprocessor Real-Time Scheduling with Hierarchical Processor Affinities. ECRTS (2016)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Daniele Romano
Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios. Theory Comput. Syst. 57 (2) (2015)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan
Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks. Algorithmica 72 (4) (2015)
Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, Fatima Zahra Moataz
Finding disjoint paths in networks with star shared risk link groups. Theor. Comput. Sci. 579 (2015)
Gianlorenzo D'Angelo, Daniele Diodati, Alfredo Navarra, Cristina M. Pinotti
The minimum k-storage problem on directed graphs. Theor. Comput. Sci. 596 (2015)
Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Suzanne van der Ster, Leen Stougie
Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems. J. ACM 62 (2) (2015)
Pierluigi Crescenzi, Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj
Greedily Improving Our Own Centrality in A Network. SEA (2015)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
Fully dynamic update of arc-flags. Networks 63 (3) (2014)
Gianlorenzo D'Angelo, Xavier Défago, Nicolas Nisse
Understanding the Power of Stigmergy of Anonymous Agents in Discrete Environments. CANDAR (2014)
Gianlorenzo D'Angelo, Daniele Diodati, Alfredo Navarra, Maria Cristina Pinotti
Optimal placement of storage nodes in a wireless sensor network. ICTCS (2014)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
Flow Problems in Multi-Interface Networks. IEEE Trans. Computers 63 (2) (2014)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
Gathering six oblivious robots on anonymous symmetric rings. J. Discrete Algorithms 26 (2014)
Alessio Cionini, Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Kalliopi Giannakopoulou, Andreas Paraskevopoulos, Christos D. Zaroliagis
Engineering Graph-Based Models for Dynamic Timetable Information Systems. ATMOS (2014)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
A loop-free shortest-path routing algorithm for dynamic networks. Theor. Comput. Sci. 516 (2014)
Gianlorenzo D'Angelo, Alfredo Navarra, Nicolas Nisse
Gathering and Exclusive Searching on Rings under Minimal Assumptions. ICDCN (2014)
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
Gathering on rings under the Look-Compute-Move model. Distributed Comput. 27 (4) (2014)
Gianlorenzo D'Angelo, Daniele Diodati, Alfredo Navarra, Cristina M. Pinotti
Approximation Bounds for the Minimum k-Storage Problem. ALGOSENSORS (2013)

Gianlorenzo D'Angelo.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Gianlorenzo D'Angelo