default search action
Gianlorenzo D'Angelo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j46]Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi:
Blackout-tolerant temporal spanners. J. Comput. Syst. Sci. 141: 103495 (2024) - [c70]Gianlorenzo D'Angelo, Mattia D'Emidio, Esmaeil Delfaraz, Gabriele Di Stefano:
Improved Algorithms for the Capacitated Team Orienteering Problem. ATMOS 2024: 7:1-7:17 - [c69]Gianlorenzo D'Angelo, Esmaeil Delfaraz:
Approximation Algorithms for Node-Weighted Directed Steiner Problems. IWOCA 2024: 273-286 - 2023
- [j45]Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci:
Better bounds on the adaptivity gap of influence maximization under full-adoption feedback. Artif. Intell. 318: 103895 (2023) - [c68]Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi:
On the Cost of Demographic Parity in Influence Maximization. AAAI 2023: 14110-14118 - [c67]Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi:
Improving Fairness in Information Exposure by Adding Links. AAAI 2023: 14119-14126 - [i24]Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi:
On the Cost of Demographic Parity in Influence Maximization. CoRR abs/2302.13110 (2023) - [i23]Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi:
Improving Fairness in Information Exposure by Adding Links. CoRR abs/2302.13112 (2023) - 2022
- [j44]Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo, Stefano Ponziani:
Exploiting social influence to control elections based on positional scoring rules. Inf. Comput. 289(Part): 104940 (2022) - [j43]Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi, Hugo Gilbert:
Fairness in Influence Maximization through Randomization. J. Artif. Intell. Res. 73: 1251-1283 (2022) - [j42]Mohammad Abouei Mehrizi, Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo:
Election control through social influence with voters' uncertainty. J. Comb. Optim. 44(1): 635-669 (2022) - [c66]Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi:
Blackout-Tolerant Temporal Spanners. ALGOSENSORS 2022: 31-44 - [c65]Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert:
Computation and Bribery of Voting Power in Delegative Simple Games. AAMAS 2022: 336-344 - [c64]Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi:
Sparse Temporal Spanners with Low Stretch. ESA 2022: 19:1-19:16 - [c63]Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert:
Budgeted Out-Tree Maximization with Submodular Prizes. ISAAC 2022: 9:1-9:19 - [c62]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: 12:1-12:21 - [i22]Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert:
Budgeted Out-tree Maximization with Submodular Prizes. CoRR abs/2204.12162 (2022) - [i21]Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi:
Sparse Temporal Spanners with Low Stretch. CoRR abs/2206.11113 (2022) - [i20]Gianlorenzo D'Angelo, Esmaeil Delfaraz:
Approximation algorithms for Node-weighted Steiner Problems: Digraphs with Additive Prizes and Graphs with Submodular Prizes. CoRR abs/2211.03653 (2022) - 2021
- [j41]Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj:
Generalized budgeted submodular set function maximization. Inf. Comput. 281: 104741 (2021) - [j40]Vincenzo Bonifaci, Gianlorenzo D'Angelo, Alberto Marchetti-Spaccamela:
Algorithms for hierarchical and semi-partitioned parallel scheduling. J. Comput. Syst. Sci. 120: 116-136 (2021) - [j39]Federico Coro, Gianlorenzo D'Angelo, Yllka Velaj:
Link Recommendation for Social Influence Maximization. ACM Trans. Knowl. Discov. Data 15(6): 94:1-94:23 (2021) - [c61]Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci:
Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback. AAAI 2021: 12069-12077 - [c60]Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi, Hugo Gilbert:
Fairness in Influence Maximization through Randomization. AAAI 2021: 14684-14692 - [c59]Ruben Becker, Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert:
Unveiling the Truth in Liquid Democracy with Misinformed Voters. ADT 2021: 132-146 - [c58]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: 154-168 - [c57]Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert:
Maximizing Influence-Based Group Shapley Centrality. AAMAS 2021: 1461-1463 - [c56]Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj:
The Multi-budget Maximum Weighted Coverage Problem. CIAC 2021: 173-186 - [c55]Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert:
Influence Maximization With Co-Existing Seeds. CIKM 2021: 100-109 - [c54]Gianlorenzo D'Angelo, Mohammad Abouei Mehrizi:
Mitigating Negative Influence Diffusion is Hard. CIKM 2021: 332-341 - [c53]Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci:
Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies. ICALP 2021: 59:1-59:19 - [e3]Gianlorenzo D'Angelo, Othon Michail:
Algorithmic Aspects of Cloud Computing - 6th International Symposium, ALGOCLOUD 2021, Lisbon, Portugal, September 6-7, 2021, Revised Selected Papers. Lecture Notes in Computer Science 13084, Springer 2021, ISBN 978-3-030-93042-4 [contents] - [i19]Ruben Becker, Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert:
When Can Liquid Democracy Unveil the Truth? CoRR abs/2104.01828 (2021) - [i18]Gianlorenzo D'Angelo, Esmaeil Delfaraz, Hugo Gilbert:
Computation and Bribery of Voting Power in Delegative Simple Games. CoRR abs/2104.03692 (2021) - [i17]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 abs/2106.12293 (2021) - 2020
- [j38]Gianlorenzo D'Angelo, Mattia D'Emidio, Shantanu Das, Alfredo Navarra, Giuseppe Prencipe:
Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction. IEEE Access 8: 207619-207634 (2020) - [j37]Federico Corò, Gianlorenzo D'Angelo, Cristina M. Pinotti:
Adding Edges for Maximizing Weighted Reachability. Algorithms 13(3): 68 (2020) - [j36]Mohammad Abouei Mehrizi, Gianlorenzo D'Angelo:
Multi-Winner Election Control via Social Influence: Hardness and Algorithms for Restricted Cases. Algorithms 13(10): 251 (2020) - [j35]Federico Corò, Gianlorenzo D'Angelo, Vahan Mkrtchyan:
On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem. Theory Comput. Syst. 64(6): 1094-1109 (2020) - [c52]Ruben Becker, Federico Corò, Gianlorenzo D'Angelo, Hugo Gilbert:
Balancing Spreads of Influence in a Social Network. AAAI 2020: 3-10 - [c51]Gianlorenzo D'Angelo, Mattia D'Emidio, Shantanu Das, Alfredo Navarra, Giuseppe Prencipe:
Leader Election and Compaction for Asynchronous Silent Programmable Matter. AAMAS 2020: 276-284 - [c50]Mohammad Abouei Mehrizi, Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo:
Election Control Through Social Influence with Unknown Preferences. COCOON 2020: 397-410 - [c49]Mohammad Abouei Mehrizi, Gianlorenzo D'Angelo:
Multi-winner Election Control via Social Influence. SIROCCO 2020: 331-348 - [i16]Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert:
Maximizing Influence-based Group Shapley Centrality. CoRR abs/2003.07966 (2020) - [i15]Mohammad Abouei Mehrizi, Gianlorenzo D'Angelo:
Multi-Winner Election Control via Social Influence. CoRR abs/2005.04037 (2020) - [i14]Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci:
Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback. CoRR abs/2006.15374 (2020) - [i13]Gianlorenzo D'Angelo, Debashmita Poddar, Cosimo Vinci:
Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies. CoRR abs/2007.09065 (2020) - [i12]Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi, Hugo Gilbert:
Fairness in Influence Maximization through Randomization. CoRR abs/2010.03438 (2020) - [i11]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 abs/2010.15435 (2020)
2010 – 2019
- 2019
- [j34]Federico Corò, Gianlorenzo D'Angelo, Yllka Velaj:
Recommending Links to Control Elections via Social Influence. Algorithms 12(10): 207 (2019) - [j33]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
Fully Dynamic 2-Hop Cover Labeling. ACM J. Exp. Algorithmics 24(1): 1.6:1-1.6:36 (2019) - [j32]Gianlorenzo D'Angelo:
Introduction to the Special Issue SEA 2018. ACM J. Exp. Algorithmics 24(1): 2.1e:1-2.1e:2 (2019) - [j31]Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
Recommending links through influence maximization. Theor. Comput. Sci. 764: 30-41 (2019) - [c48]Gianlorenzo D'Angelo, Martin Olsen, Lorenzo Severini:
Coverage Centrality Maximization in Undirected Networks. AAAI 2019: 501-508 - [c47]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: 1895-1897 - [c46]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: 7-12 - [c45]Mohammad Abouei Mehrizi, Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo, Stefano Ponziani:
Models and Algorithms for Election Control through Influence Maximization. ICTCS 2019: 97-103 - [c44]Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo, Stefano Ponziani:
Exploiting Social Influence to Control Elections Based on Scoring Rules. IJCAI 2019: 201-207 - [c43]Federico Corò, Gianlorenzo D'Angelo, Yllka Velaj:
Recommending Links to Maximize the Influence in Social Networks. IJCAI 2019: 2195-2201 - [i10]Federico Coro, Emilio Cruciani, Gianlorenzo D'Angelo, Stefano Ponziani:
Vote for Me! Election Control via Social Influence in Arbitrary Scoring Rule Voting Systems. CoRR abs/1902.07454 (2019) - [i9]Federico Corò, Gianlorenzo D'Angelo, Vahan Mkrtchyan:
On the fixed-parameter tractability of the maximum connectivity improvement problem. CoRR abs/1904.12000 (2019) - [i8]Mohammad Abouei Mehrizi, Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo:
Election Control with Voters' Uncertainty: Hardness and Approximation Results. CoRR abs/1905.04694 (2019) - [i7]Ruben Becker, Federico Corò, Gianlorenzo D'Angelo, Hugo Gilbert:
Balancing spreads of influence in a social network. CoRR abs/1906.00074 (2019) - 2018
- [j30]Gianlorenzo D'Angelo, Mattia D'Emidio:
Report on SEA 2018. Bull. EATCS 126 (2018) - [j29]Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti:
What can be verified locally? J. Comput. Syst. Sci. 97: 106-120 (2018) - [j28]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) - [c42]Federico Coro, Gianlorenzo D'Angelo, Cristina M. Pinotti:
On the Maximum Connectivity Improvement Problem. ALGOSENSORS 2018: 47-61 - [c41]Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj:
Generalized Budgeted Submodular Set Function Maximization. MFCS 2018: 31:1-31:14 - [p2]Gianlorenzo D'Angelo, Alfredo Navarra, Maria Cristina Pinotti:
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) 2018 - [e2]Gianlorenzo D'Angelo:
17th International Symposium on Experimental Algorithms, SEA 2018, June 27-29, 2018, L'Aquila, Italy. LIPIcs 103, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-070-5 [contents] - [i6]Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj:
Generalized budgeted submodular set function maximization. CoRR abs/1808.03085 (2018) - [i5]Gianlorenzo D'Angelo, Martin Olsen, Lorenzo Severini:
Coverage Centrality Maximization in Undirected Networks. CoRR abs/1811.04331 (2018) - 2017
- [j27]Gianlorenzo D'Angelo, Alfredo Navarra, Nicolas Nisse:
A unified approach for gathering and exclusive searching on rings under weak assumptions. Distributed Comput. 30(1): 17-48 (2017) - [j26]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 46-47: 40-58 (2017) - [c40]Vincenzo Bonifaci, Gianlorenzo D'Angelo, Alberto Marchetti-Spaccamela:
Algorithms for Hierarchical and Semi-Partitioned Parallel Scheduling. IPDPS 2017: 738-747 - [c39]Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
Selecting Nodes and Buying Links to Maximize the Information Diffusion in a Network. MFCS 2017: 75:1-75:14 - [c38]Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti:
What Can Be Verified Locally?. STACS 2017: 8:1-8:13 - [e1]Gianlorenzo D'Angelo, Twan Dollevoet:
17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2017, September 7-8, 2017, Vienna, Austria. OASIcs 59, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-042-2 [contents] - [i4]Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj:
Improving the betweenness centrality of a node by adding links. CoRR abs/1702.05284 (2017) - [i3]Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
Recommending links through influence maximization. CoRR abs/1706.04368 (2017) - [i2]Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
Selecting nodes and buying links to maximize the information diffusion in a network. CoRR abs/1706.06466 (2017) - 2016
- [j25]Gianlorenzo D'Angelo:
Approximation bounds for centrality maximization problems. Bull. EATCS 120 (2016) - [j24]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: 158-168 (2016) - [j23]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): 9:1-9:32 (2016) - [j22]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): 1797-1811 (2016) - [c37]Vincenzo Bonifaci, Björn B. Brandenburg, Gianlorenzo D'Angelo, Alberto Marchetti-Spaccamela:
Multiprocessor Real-Time Scheduling with Hierarchical Processor Affinities. ECRTS 2016: 237-247 - [c36]Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
Influence Maximization in the Independent Cascade Model. ICTCS 2016: 269-274 - [c35]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
Distance Queries in Large-Scale Fully Dynamic Complex Networks. IWOCA 2016: 109-121 - [i1]Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti:
Local Distributed Verification. CoRR abs/1605.03892 (2016) - 2015
- [j21]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): 1055-1096 (2015) - [j20]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): 14:1-14:33 (2015) - [j19]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): 444-477 (2015) - [j18]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: 74-87 (2015) - [j17]Gianlorenzo D'Angelo, Daniele Diodati, Alfredo Navarra, Cristina M. Pinotti:
The minimum k-storage problem on directed graphs. Theor. Comput. Sci. 596: 102-108 (2015) - [c34]Pierluigi Crescenzi, Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
Greedily Improving Our Own Centrality in A Network. SEA 2015: 43-55 - [c33]Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
On the Maximum Betweenness Improvement Problem. ICTCS 2015: 153-168 - 2014
- [j16]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra:
Gathering on rings under the Look-Compute-Move model. Distributed Comput. 27(4): 255-285 (2014) - [j15]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra:
Gathering six oblivious robots on anonymous symmetric rings. J. Discrete Algorithms 26: 16-27 (2014) - [j14]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
Fully dynamic update of arc-flags. Networks 63(3): 243-259 (2014) - [j13]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra:
Flow Problems in Multi-Interface Networks. IEEE Trans. Computers 63(2): 361-374 (2014) - [j12]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
A loop-free shortest-path routing algorithm for dynamic networks. Theor. Comput. Sci. 516: 1-19 (2014) - [c32]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: 46-61 - [c31]Gianlorenzo D'Angelo, Xavier Défago, Nicolas Nisse:
Understanding the Power of Stigmergy of Anonymous Agents in Discrete Environments. CANDAR 2014: 50-59 - [c30]Gianlorenzo D'Angelo, Alfredo Navarra, Nicolas Nisse:
Gathering and Exclusive Searching on Rings under Minimal Assumptions. ICDCN 2014: 149-164 - [c29]Gianlorenzo D'Angelo, Daniele Diodati, Alfredo Navarra, Maria Cristina Pinotti:
Optimal placement of storage nodes in a wireless sensor network. ICTCS 2014: 259-263 - 2013
- [j11]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Vinicio Maurizio:
Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks. Algorithmica 66(1): 51-86 (2013) - [j10]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
Pruning the Computation of Distributed Shortest Paths in Power-law Networks. Informatica (Slovenia) 37(3): 253-265 (2013) - [c28]Gianlorenzo D'Angelo, Daniele Diodati, Alfredo Navarra, Cristina M. Pinotti:
Approximation Bounds for the Minimum k-Storage Problem. ALGOSENSORS 2013: 123-138 - [c27]Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, Fatima Zahra Moataz:
SRLG-diverse routing with the star property. DRCN 2013: 163-170 - [c26]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan:
A Unified Approach for Different Tasks on Rings in Robot-Based Computing Systems. IPDPS Workshops 2013: 667-676 - 2012
- [j9]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra:
Minimize the Maximum Duty in Multi-interface Networks. Algorithmica 63(1-2): 274-295 (2012) - [j8]Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Andrea Schumm, Dorothea Wagner:
The Shortcut Problem - Complexity and Algorithms. J. Graph Algorithms Appl. 16(2): 447-481 (2012) - [j7]Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie:
Scheduling Real-Time Mixed-Criticality Jobs. IEEE Trans. Computers 61(8): 1140-1152 (2012) - [c25]Jean-Claude Bermond, David Coudert, Gianlorenzo D'Angelo, Fatima Zahra Moataz:
Diverse routing in networks with star SRLGs. StudentWorkshop@CoNEXT 2012: 23-24 - [c24]Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Suzanne van der Ster, Leen Stougie:
The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems. ECRTS 2012: 145-154 - [c23]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Daniele Romano:
Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks. MedAlg 2012: 148-158 - [c22]