Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarGianlorenzo D'Angelo
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[j29]Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti:
What can be verified locally? J. Comput. Syst. Sci. 97: 106-120 (2018)- [c40]Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj:
Generalized Budgeted Submodular Set Function Maximization. MFCS 2018: 31:1-31:14 - [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 fuer Informatik 2018, ISBN 978-3-95977-070-5 [contents] - [i5]Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj:
Generalized budgeted submodular set function maximization. CoRR abs/1808.03085 (2018) - 2017
- [j28]Gianlorenzo D'Angelo, Alfredo Navarra, Nicolas Nisse:
A unified approach for gathering and exclusive searching on rings under weak assumptions. Distributed Computing 30(1): 17-48 (2017) - [j27]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) - [c39]Vincenzo Bonifaci, Gianlorenzo D'Angelo, Alberto Marchetti-Spaccamela:
Algorithms for Hierarchical and Semi-Partitioned Parallel Scheduling. IPDPS 2017: 738-747 - [c38]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 - [c37]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 fuer 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
- [j26]Gianlorenzo D'Angelo:
Approximation bounds for centrality maximization problems. Bulletin of the EATCS 120 (2016) - [j25]Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
On the Maximum Betweenness Improvement Problem. Electr. Notes Theor. Comput. Sci. 322: 153-168 (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. TKDD 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) - [c36]Vincenzo Bonifaci, Björn B. Brandenburg, Gianlorenzo D'Angelo, Alberto Marchetti-Spaccamela:
Multiprocessor Real-Time Scheduling with Hierarchical Processor Affinities. ECRTS 2016: 237-247 - [c35]Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
Influence Maximization in the Independent Cascade Model. ICTCS 2016: 269-274 - [c34]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) - [c33]Pierluigi Crescenzi, Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj:
Greedily Improving Our Own Centrality in A Network. SEA 2015: 43-55 - 2014
- [j16]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra:
Gathering on rings under the Look-Compute-Move model. Distributed Computing 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]Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing, Alfredo Navarra:
Gathering of Robots on Anonymous Grids without Multiplicity Detection. SIROCCO 2012: 327-338 - [c21]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra:
How to Gather Asynchronous Oblivious Robots on Anonymous Rings. DISC 2012: 326-340 - [c20]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio:
Engineering a New Loop-Free Shortest Paths Routing Algorithm. SEA 2012: 123-134 - [c19]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Camillo Vitale:
Fully Dynamic Maintenance of Arc-Flags in Road Networks. SEA 2012: 135-147 - 2011
- [j6]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Maria Cristina Pinotti:
Recoverable Robust Timetables: An Algorithmic Approach on Trees. IEEE Trans. Computers 60(3): 433-446 (2011) - [c18]Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Alberto Marchetti-Spaccamela, Suzanne van der Ster, Leen Stougie:
Mixed-Criticality Scheduling of Sporadic Task Systems. ESA 2011: 555-566 - [c17]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio:
A Speed-Up Technique for Distributed Shortest Paths Computation. ICCSA (2) 2011: 578-593 - [c16]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra:
Maximum flow and minimum-cost flow in multi-interface networks. ICUIMC 2011: 19 - [c15]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra:
Gathering of Six Robots on Anonymous Symmetric Rings. SIROCCO 2011: 174-185 - [c14]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra:
Min-Max Coverage in Multi-interface Networks. SOFSEM 2011: 190-201 - [c13]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra:
Bandwidth Constrained Multi-interface Networks. SOFSEM 2011: 202-213 - [c12]Gianlorenzo D'Angelo, Daniele Frigioni, Camillo Vitale:
Dynamic Arc-Flags in Road Networks. SEA 2011: 88-99 - 2010
- [j5]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni:
Partially dynamic efficient algorithms for distributed shortest paths. Theor. Comput. Sci. 411(7-9): 1013-1037 (2010) - [c11]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra:
Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks. COCOA (2) 2010: 254-267 - [c10]Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie:
Scheduling Real-Time Mixed-Criticality Jobs. MFCS 2010: 90-101 - [c9]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Vinicio Maurizio:
A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation. SEA 2010: 59-70
2000 – 2009
- 2009
- [j4]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Recoverable Robustness for Train Shunting Problems. Algorithmic Operations Research 4(2): 102-116 (2009) - [j3]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases. J. Comb. Optim. 18(3): 229-257 (2009) - [c8]
- [c7]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Maria Cristina Pinotti:
Recoverable Robust Timetables on Trees. COCOA 2009: 451-462 - [c6]Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra:
Evaluation of Recoverable-Robust Timetables on Tree Networks. IWOCA 2009: 24-35 - [c5]Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Dorothea Wagner:
The Shortcut Problem - Complexity and Approximation. SOFSEM 2009: 105-116 - [p1]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra, Michael Schachtebeck, Anita Schöbel:
Recoverable Robustness in Shunting and Timetabling. Robust and Online Large-Scale Optimization 2009: 28-60 - 2008
- [j2]Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni:
Dynamic Multi-level Overlay Graphs for Shortest Paths. Mathematics in Computer Science 1(4): 709-736 (2008) - [c4]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Delay Management Problem: Complexity Results and Robust Algorithms. COCOA 2008: 458-468 - 2007
- [j1]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alberto Petricola:
Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation. JCP 2(9): 16-26 (2007) - [c3]Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni:
Maintenance of Multi-level Overlay Graphs for Timetable Queries. ATMOS 2007 - [c2]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Robust Algorithms and Price of Robustness in Shunting Problems. ATMOS 2007 - [c1]Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni:
Partially Dynamic Concurrent Update of Distributed Shortest Paths. ICCTA 2007: 32-38
Coauthor Index
maintained by 
at 
at 
last updated on 2018-11-21 00:34 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint